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(rlogr) 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
log29−16/9 and
log23 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
log29−−16/9 and
log23 ebits.
We investigate the minimum entanglement cost of the deterministic implementation of two-qubit controlled-unitary operations using local operations and classical communication (LOCC). We show that any such operation can be implemented by a three-turn LOCC protocol, which requires at least 1 ebit of entanglement when the resource is given by a bipartite entangled state with Schmidt number 2. Our result implies that there is a gap between the minimum entanglement cost and the entangling power of controlled-unitary operations. This gap arises due to the requirement of implementing the operations while oblivious to the identity of the inputs.
We investigate the conditions under which a set
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
S must be full Schmidt rank and equally entangled under the
G-concurrence measure, and (ii) the set
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
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 study conditions for the deterministic transformation $\ensuremath{\mid}\ensuremath{\psi}⟩\ensuremath{\rightarrow}\ensuremath{\mid}\ensuremath{\phi}⟩$ of a bipartite entangled state by a separable operation. If the separable operation is a local operation with classical communication (LOCC), Nielsen's majorization theorem provides necessary and sufficient conditions. For the general case, we derive a necessary condition in terms of products of Schmidt coefficients, which is equivalent to the Nielsen condition when either of the two factor spaces is of dimension 2, but is otherwise weaker. One implication is that no separable operation can reverse a deterministic map produced by another separable operation, if one excludes the case where the Schmidt coefficients of $\ensuremath{\mid}\ensuremath{\psi}⟩$ are the same as those of $\ensuremath{\mid}\ensuremath{\phi}⟩$. The question of sufficient conditions in the general separable case remains open. When the Schmidt coefficients of $\ensuremath{\mid}\ensuremath{\psi}⟩$ are the same as those of $\ensuremath{\mid}\ensuremath{\phi}⟩$, we show that the Kraus operators of the separable transformation restricted to the supports of $\ensuremath{\mid}\ensuremath{\psi}⟩$ on the factor spaces are proportional to unitaries. When that proportionality holds and the factor spaces have equal dimension, we find conditions for the deterministic transformation of a collection of several full Schmidt rank pure states $\ensuremath{\mid}{\ensuremath{\psi}}_{j}⟩$ to pure states $\ensuremath{\mid}{\ensuremath{\phi}}_{j}⟩$.
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.