arXiv:1403.5720 · Physical Review A

Nonlocal and controlled unitary operators of Schmidt rank three

Lin Chen, Li Zhi Yu

Published Jun 23, 2014• 25 citations

Abstract

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.

DOI: 10.1103/physreva.89.062326

Related papers

All unitaries having operator Schmidt rank 2 are controlled unitaries

Scott M. Cohen, Li Zhi Yu

arXiv:1211.5201Physical Review AFeb 20, 201318 citations

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

Lin Chen, Li Zhi Yu

Jul 19, 20150 citations

Entanglement cost and entangling power of bipartite unitary and permutation operators

Lin Chen, Li Zhi Yu

arXiv:1507.05260Physical Review AApr 19, 201619 citations

Entangling and assisted entangling power of bipartite unitary operations

Lin Chen, Li Zhi Yu

arXiv:1604.05788Physical Review AAug 8, 201616 citations

Quantum states with the same entanglement and local unitary equivalence

Julio I. de Vicente

quant-pharXiv:2609.21558Sep 21, 20260 citations

Local cloning of entangled states

Vlad Gheorghiu, Li Zhi Yu, Scott M. Cohen

arXiv:1004.5126Physical Review AAug 11, 201011 citations

arXiv:1403.5720 · Physical Review A

Nonlocal and controlled unitary operators of Schmidt rank three

Lin Chen, Li Zhi Yu

Published Jun 23, 2014• 25 citations

arXiv HTML PDF

Abstract

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.

DOI: 10.1103/physreva.89.062326

Related papers

All unitaries having operator Schmidt rank 2 are controlled unitaries

Scott M. Cohen, Li Zhi Yu

We prove that every unitary acting on any multipartite system and having operator Schmidt rank equal to 2 can be diagonalized by local unitaries. This then implies that every such multipartite unitary is locally equivalent to a controlled unitary with every party but one controlling a set of unitaries on the last party. We also prove that any bipartite unitary of Schmidt rank 2 is locally equivalent to a controlled unitary where either party can be chosen as the control, and at least one party can control with two terms, which implies that each such unitary can be implemented using local operations and classical communication (LOCC) and a maximally entangled state on two qubits. These results hold regardless of the dimensions of the systems on which the unitary acts.We prove that every unitary acting on any multipartite system and having operator Schmidt rank equal to 2 can be diagonalized by local unitaries. This then implies that every such multipartite unitary is locally equivalent to a controlled unitary with every party but one controlling a set of unitaries on the last party. We also prove that any bipartite unitary of Schmidt rank 2 is locally equivalent to a controlled unitary where either party can be chosen as the control, and at least one party can control with two terms, which implies that each such unitary can be implemented using local operations and classical communication (LOCC) and a maximally entangled state on two qubits. These results hold regardless of the dimensions of the systems on which the unitary acts.

arXiv:1211.5201Physical Review AFeb 20, 201318 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.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, 20150 citations

Entanglement cost and entangling power of bipartite unitary and permutation operators

Lin Chen, Li Zhi Yu

It is known that any bipartite unitary operator of Schmidt rank 3 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 3 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(rlogr)$ but the actual values are smaller for all $r<1100$ . Based on this we obtain upper bounds of the number of nonlocal controlled-not 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 ranks 2 and 3. We show that they are respectively 1 ebit and some value between ${log}_{2}9--16/9$ and ${log}_{2}3$ ebits.It is known that any bipartite unitary operator of Schmidt rank 3 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 3 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(rlogr)$ but the actual values are smaller for all $r<1100$. Based on this we obtain upper bounds of the number of nonlocal controlled-not 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 ranks 2 and 3. We show that they are respectively 1 ebit and some value between ${log}_{2}9--16/9$ and ${log}_{2}3$ ebits.

arXiv:1507.05260Physical Review AApr 19, 201619 citations

Entangling and assisted entangling power of bipartite unitary operations

Lin Chen, Li Zhi Yu

Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the input states are, respectively, product and arbitrary pure states. We analytically derive them for Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries. In particular, the entangling power of permutation unitary of Schmidt rank three can take only one of two values: ${log}_{2}9\ensuremath{-}16/9$ or ${log}_{2}3$ ebits. The entangling power, assisted entangling power, and disentangling power of $2\ifmmode\times\else\texttimes\fi{}{d}_{B}$ permutation unitaries of Schmidt rank four are all 2 ebits. These quantities are also derived for generalized Clifford operators. We further show that any bipartite permutation unitary of Schmidt rank greater than two has entangling power greater than 1.223 ebits. We construct the generalized controlled-not (cnot) gates whose assisted entangling power reaches the maximum. We quantitatively compare the entangling power and assisted entangling power for general bipartite unitaries and their connection to the disentangling power by proposing a probabilistic protocol for implementing bipartite unitaries.Nonlocal unitary operations can create quantum entanglement between distributed particles, and the quantification of created entanglement is a hard problem. It corresponds to the concepts of entangling and assisted entangling power when the input states are, respectively, product and arbitrary pure states. We analytically derive them for Schmidt-rank-two bipartite unitary and some complex bipartite permutation unitaries. In particular, the entangling power of permutation unitary of Schmidt rank three can take only one of two values: ${log}_{2}9\ensuremath{-}16/9$ or ${log}_{2}3$ ebits. The entangling power, assisted entangling power, and disentangling power of $2\ifmmode\times\else\texttimes\fi{}{d}_{B}$ permutation unitaries of Schmidt rank four are all 2 ebits. These quantities are also derived for generalized Clifford operators. We further show that any bipartite permutation unitary of Schmidt rank greater than two has entangling power greater than 1.223 ebits. We construct the generalized controlled-not (cnot) gates whose assisted entangling power reaches the maximum. We quantitatively compare the entangling power and assisted entangling power for general bipartite unitaries and their connection to the disentangling power by proposing a probabilistic protocol for implementing bipartite unitaries.

arXiv:1604.05788Physical Review AAug 8, 201616 citations

Quantum states with the same entanglement and local unitary equivalence

Julio I. de Vicente

Local operations assisted by classical communication (LOCC) play a fundamental role in the resource-theoretic formulation of entanglement theory inducing an operationally meaningful ordering in the set of entangled states. The particular class within LOCC of local unitary (LU) transformations is obviously closed under inversion. Thus, LU-equivalent states are interconvertible by LOCC and have therefore the same entanglement. For this reason LU-equivalence has been thoroughly studied in the context of entanglement theory. However, as I note here with a simple example, the converse is not true: there exist entangled states that are interconvertible by LOCC but which are not LU-equivalent. This motivates studying under which conditions LOCC interconvertibility is characterized by LU-equivalence. I provide a sufficient condition for this to hold. When one considers multipartite states with full entanglement dimensionality (as quantified by the Schmidt number vector) LOCC interconvertibility can only hold under LU-equivalence.Local operations assisted by classical communication (LOCC) play a fundamental role in the resource-theoretic formulation of entanglement theory inducing an operationally meaningful ordering in the set of entangled states. The particular class within LOCC of local unitary (LU) transformations is obviously closed under inversion. Thus, LU-equivalent states are interconvertible by LOCC and have therefore the same entanglement. For this reason LU-equivalence has been thoroughly studied in the context of entanglement theory. However, as I note here with a simple example, the converse is not true: there exist entangled states that are interconvertible by LOCC but which are not LU-equivalent. This motivates studying under which conditions LOCC interconvertibility is characterized by LU-equivalence. I provide a sufficient condition for this to hold. When one considers multipartite states with full entanglement dimensionality (as quantified by the Schmidt number vector) LOCC interconvertibility can only hold under LU-equivalence.

quant-pharXiv:2609.21558Sep 21, 20260 citations

Local cloning of entangled states

Vlad Gheorghiu, Li Zhi Yu, Scott M. Cohen

We investigate the conditions under which a set $\mathcal{S}$ of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in $\mathcal{S}$ must be full Schmidt rank and equally entangled under the $G$ -concurrence measure, and (ii) the set $\mathcal{S}$ can be extended to a larger clonable set generated by a finite group $G$ of order $|G|=N$ , the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides $D$ exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all $D$ ; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in $D=3$ we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in $\mathcal{S}$ . All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.We investigate the conditions under which a set $\mathcal{S}$ of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in $\mathcal{S}$ must be full Schmidt rank and equally entangled under the $G$-concurrence measure, and (ii) the set $\mathcal{S}$ can be extended to a larger clonable set generated by a finite group $G$ of order $|G|=N$, the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides $D$ exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all $D$; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in $D=3$ we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in $\mathcal{S}$. All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.

arXiv:1004.5126Physical Review AAug 11, 201011 citations

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}}

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.

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(rlogr)

but the actual values are smaller for all

r<1100

. Based on this we obtain upper bounds of the number of nonlocal controlled-not 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 ranks 2 and 3. We show that they are respectively 1 ebit and some value between

{log}_{2}9--16/9

and

{log}_{2}3

ebits.

{log}_{2}3

ebits. The entangling power, assisted entangling power, and disentangling power of $2\ifmmode\times\else\texttimes\fi{}{d}_{B}$ permutation unitaries of Schmidt rank four are all 2 ebits. These quantities are also derived for generalized Clifford operators. We further show that any bipartite permutation unitary of Schmidt rank greater than two has entangling power greater than 1.223 ebits. We construct the generalized controlled-not (cnot) gates whose assisted entangling power reaches the maximum. We quantitatively compare the entangling power and assisted entangling power for general bipartite unitaries and their connection to the disentangling power by proposing a probabilistic protocol for implementing bipartite unitaries.

We investigate the conditions under which a set

\mathcal{S}

of pure bipartite quantum states on a $D\ifmmode\times\else\texttimes\fi{}D$ system can be locally cloned deterministically by separable operations, when at least one of the states is full Schmidt rank. We allow for the possibility of cloning using a resource state that is less than maximally entangled. Our results include that: (i) all states in

\mathcal{S}

must be full Schmidt rank and equally entangled under the

G

-concurrence measure, and (ii) the set

\mathcal{S}

can be extended to a larger clonable set generated by a finite group

G

of order

|G|=N

, the number of states in the larger set. It is then shown that any local cloning apparatus is capable of cloning a number of states that divides

D

exactly. We provide a complete solution for two central problems in local cloning, giving necessary and sufficient conditions for (i) when a set of maximally entangled states can be locally cloned, valid for all

D

; and (ii) local cloning of entangled qubit states with nonvanishing entanglement. In both of these cases, we show that a maximally entangled resource is necessary and sufficient, and the states must be related to each other by local unitary ``shift'' operations. These shifts are determined by the group structure, so need not be simple cyclic permutations. Assuming this shifted form and partially entangled states, then in

D=3

we show that a maximally entangled resource is again necessary and sufficient, while for higher-dimensional systems, we find that the resource state must be strictly more entangled than the states in

\mathcal{S}

. All of our necessary conditions for separable operations are also necessary conditions for local operations and classical communication (LOCC), since the latter is a proper subset of the former. In fact, all our results hold for LOCC, as our sufficient conditions are demonstrated for LOCC, directly.