Entanglement requirements for implementing bipartite unitary operations

Abstract

We prove, using a new method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical communication) as a particular case. It is known that the Schmidt rank of an entangled pure state resource cannot be less than the Schmidt rank of the unitary. We prove that if these ranks are equal the resource must be uniformly (maximally) entangled: equal nonzero Schmidt coefficients. Higher rank resources can have less entanglement: we have found numerical examples of Schmidt rank 2 unitaries which can be deterministically implemented, by either SEP or LOCC, using an entangled resource of two qutrits with less than one ebit of entanglement.

7 pages Revtex

References in corpus (2)

• Separable Operations on Pure States
• Local implementation of nonlocal operations of block forms

Cited by in corpus (24)

• Resource Theory of Coherence - Beyond States
• Using and reusing coherence to realize quantum processes
• Quantum source-channel coding and non-commutative graph theory
• Entanglement-efficient bipartite-distributed quantum computing
• Complete set of operational measures for the characterization of 3-qubit entanglement
• Nonlocal and controlled unitary operators of Schmidt rank three
• Entanglement cost and entangling power of bipartite unitary and permutation operators
• All unitaries having operator Schmidt rank 2 are controlled unitaries
• On the Schmidt-rank-three bipartite and multipartite unitary operator
• A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
• Optimal joint cutting of two-qubit rotation gates
• Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
• Bounds on Instantaneous Nonlocal Quantum Computation
• General approach to quantum channel impossibility by local operations and classical communication
• Rooted-tree network for optimal non-local gate implementation
• Local implementations of non-local quantum gates in linear entangled channel
• Local quantum protocols for separable measurements with many parties
• Distributed Encoding and Decoding of Quantum Information over Networks
• Bipartite discrimination of independently prepared quantum states as a counterexample to a parallel repetition conjecture
• Composability of partially entanglement breaking channels via entanglement assisted local operations and classical communication
• Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation
• Extended necessary condition for local operations and classical communication: Tight bound for all measurements
• Asynchronous Telegate and Teledata Protocols for Distributed Quantum Computing
• A Quaternionic Map Causing Bipartite Entanglement