Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1407.5464 · Annals of Physics

On the Schmidt-rank-three bipartite and multipartite unitary operator

Lin Chen, Li Zhi Yu

Published Oct 9, 2014• 18 citations
arXivHTMLPDF
DOI
10.1016/j.aop.2014.09.026

Related papers

Operator Schmidt ranks of bipartite unitary matrices

Alexander Müller‐Hermes, Ion Nechita

arXiv:1612.07616•Linear Algebra and its Applications•Jul 23, 2018•10 citations

Schmidt number of bipartite and multipartite states under local projections

Lin Chen, Yang Yu, Wai-Shing Tang

arXiv:1609.05100•Quantum Information Processing•Feb 2, 2017•20 citations

Nonlocal and controlled unitary operators of Schmidt rank three

Lin Chen, Li Zhi Yu

Implementing nonlocal unitary operators is an important and hard question in quantum computing and cryptography. We show that any bipartite nonlocal unitary operator of Schmidt rank three on the $({d}_{A}\ifmmode\times\else\texttimes\fi{}{d}_{B})$-dimensional system is locally equivalent to a controlled unitary when ${d}_{A}$ is at most three. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank $r=\mathrm{min}{{d}_{A}^{2},{d}_{B}}$. We further show that stochastic-equivalent nonlocal unitary operators are indeed locally equivalent, and propose a sufficient condition on which nonlocal and controlled unitary operators are locally equivalent. We also provide the solution to a special case of a conjecture on the ranks of multipartite quantum states.

arXiv:1403.5720•Physical Review A•Jun 23, 2014•25 citations

Classification of Schmidt-rank-two multipartite unitary gates by singular number

Yi Shen, Lin Chen, Li Zhi Yu

Abstract The multipartite unitary gates are called genuine if they are not product unitary operators across any bipartition. We mainly investigate the classification of genuine multipartite unitary gates of Schmidt rank two (SR-2), by focusing on the multiqubit scenario. For genuine multipartite (excluding bipartite) unitary gates of SR-2, there is an essential fact that their Schmidt decompositions are unique. Based on this fact, we propose a key notion named as singular number (SN) to classify the unitary gates concerned. The SN is defined as the number of local singular operators in the Schmidt decomposition. We then determine the accurate range of SN. For each SN, we formulate the parametric Schmidt decompositions of genuine multiqubit unitary gates under local equivalence. Finally, we extend the study to three-qubit diagonal unitary gates due to the close relation between diagonal unitary gates and SR-2 unitaries. We start with discussing two typical examples of SR-2, one of which is a fundamental three-qubit unitary gate, i.e. the CCZ gate. Then we characterize the diagonal unitary gates of SR greater than two. We show that a three-qubit diagonal unitary gate has SR at most three, and present a necessary and sufficient condition for such a unitary gate of SR-3. This completes the characterization of all genuine three-qubit diagonal unitary gates.

arXiv:2208.09604•Journal of Physics A Mathematical and Theoretical•Nov 16, 2022•5 citations

On the Unitary Group and Associated Operators

Atri Mukhopadhyay

Lecture notes in chemistry•Jan 1, 1989•0 citations

Entanglement cost and entangling power of bipartite unitary operators of Schmidt rank three

Lin Chen, Li Zhi Yu

It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two ebits. We give two protocols for implementing bipartite permutation unitaries of any Schmidt rank $r$, and showed that one of the protocol uses $O(r)$ ebits of entanglement and $O(r)$ bits of classical communication, while these two types of costs for the other protocol scale as $O(r\log r)$ but the actual values are smaller for all $r<1100$. Based on this we obtain upper bounds of the number of nonlocal CNOT gates needed to implement bipartite classical reversible maps using classical circuits under two different conditions. We also quantify the entangling power of bipartite permutation unitaries of Schmidt rank two and three. We show that they are respectively $1$ ebit and some value between $\log_2 9 - 16/9$ and $\log_2 3$ ebits.

•Jul 19, 2015•1 citation
Implementing nonlocal unitary operators is an important and hard question in quantum computing and cryptography. We show that any bipartite nonlocal unitary operator of Schmidt rank three on the $({d}_{A}\ifmmode\times\else\texttimes\fi{}{d}_{B})$-dimensional system is locally equivalent to a controlled unitary when dA{d}_{A}dA​ is at most three. This operator can be locally implemented assisted by a maximally entangled state of Schmidt rank r=mindA2,dBr=\mathrm{min}{{d}_{A}^{2},{d}_{B}}r=mindA2​,dB​. We further show that stochastic-equivalent nonlocal unitary operators are indeed locally equivalent, and propose a sufficient condition on which nonlocal and controlled unitary operators are locally equivalent. We also provide the solution to a special case of a conjecture on the ranks of multipartite quantum states.
Abstract The multipartite unitary gates are called genuine if they are not product unitary operators across any bipartition. We mainly investigate the classification of genuine multipartite unitary gates of Schmidt rank two (SR-2), by focusing on the multiqubit scenario. For genuine multipartite (excluding bipartite) unitary gates of SR-2, there is an essential fact that their Schmidt decompositions are unique. Based on this fact, we propose a key notion named as singular number (SN) to classify the unitary gates concerned. The SN is defined as the number of local singular operators in the Schmidt decomposition. We then determine the accurate range of SN. For each SN, we formulate the parametric Schmidt decompositions of genuine multiqubit unitary gates under local equivalence. Finally, we extend the study to three-qubit diagonal unitary gates due to the close relation between diagonal unitary gates and SR-2 unitaries. We start with discussing two typical examples of SR-2, one of which is a fundamental three-qubit unitary gate, i.e. the CCZ gate. Then we characterize the diagonal unitary gates of SR greater than two. We show that a three-qubit diagonal unitary gate has SR at most three, and present a necessary and sufficient condition for such a unitary gate of SR-3. This completes the characterization of all genuine three-qubit diagonal unitary gates.
It is known that any bipartite unitary operator of Schmidt rank three is equivalent to a controlled unitary under local unitaries. We propose a standard form of such operators. Using the form we improve the upper bound for the entanglement cost to implement such operators under local operations and classical communications (LOCC), and provide a corresponding protocol. A part of our protocol is based on a recursive-control protocol which is helpful for implementing other unitary operators. We show that any bipartite permutation unitary of Schmidt rank three can be implemented using LOCC and two ebits. We give two protocols for implementing bipartite permutation unitaries of any Schmidt rank rrr, and showed that one of the protocol uses O(r)O(r)O(r) ebits of entanglement and O(r)O(r)O(r) bits of classical communication, while these two types of costs for the other protocol scale as O(rlog⁡r)O(r\log r)O(rlogr) but the actual values are smaller for all r<1100r<1100r<1100. Based on this we obtain upper bounds of the number of nonlocal CNOT gates needed to implement bipartite classical reversible maps using classical circuits under two different conditions. We also quantify the entangling power of bipartite permutation unitaries of Schmidt rank two and three. We show that they are respectively 111 ebit and some value between log⁡29−16/9\log_2 9 - 16/9log2​9−16/9 and log⁡23\log_2 3log2​3 ebits.