General approach to quantum channel impossibility by local operations and classical communication
arXiv:1606.00029 · doi:10.1103/PhysRevLett.118.020501
Abstract
We describe a general approach to proving the impossibility of implementing a quantum channel by local operations and classical communication (LOCC), even with an infinite number of rounds, and find that this can often be demonstrated by solving a set of linear equations. The method also allows one to design an LOCC protocol to implement the channel whenever such a protocol exists in any finite number of rounds. Perhaps surprisingly, the computational expense for analyzing LOCC channels is not much greater than that for LOCC measurements. We apply the method to several examples, two of which provide numerical evidence that the set of quantum channels that are not LOCC is not closed and that there exist channels that can be implemented by LOCC either in one round or in three rounds that are on the boundary of the set of all LOCC channels. Although every LOCC protocol must implement a separable quantum channel, it is a very difficult task to determine whether or not a given channel is separable. Fortunately, prior knowledge that the channel is separable is not required for application of our method.
arXiv commentTo appear in Physical Review Letters. Version 2 is very close to what will be published, except no matlab code included here (arXiv didn't like mcode package). Note: semidefinite programming is no longer used in this version
References in corpus (32)
- Quantum entanglement
- Mixed State Entanglement and Quantum Error Correction
- Quantum cryptography: Public key distribution and coin tossing
- Quantum secret sharing
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Quantifying Coherence
- Quantum Nonlocality without Entanglement
- The capacity of the noisy quantum channel
- Distributed Quantum Computation over Noisy Channels
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Capacities of Quantum Erasure Channels
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
- Multipartite Nonlocality without Entanglement in Many Dimensions
- Quantifying Superposition
- A framework for bounding nonlocality of state discrimination
- Local distinguishability with preservation of entanglement
- A Return to the Optimal Detection of Quantum Information
- Random bipartite entanglement from W and W-like states
- Local Transformations Requiring Infinite Rounds of Classical Communication
- When do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Asymptotically perfect discrimination in the LOCC paradigm
- Entanglement requirements for implementing bipartite unitary operations
- Accessing quantum secrets via local operations and classical communication
- Asymptotic State Discrimination and a Strict Hierarchy in Distinguishability Norms
- Optimizing local protocols implementing nonlocal quantum gates
- When a quantum measurement can be implemented locally ... and when it cannot
- Local cloning of entangled states
- Local quantum protocols for separable measurements with many parties
- When asymptotic LOCC offers no advantage over finite LOCC
- Devising local protocols for multipartite quantum measurements
- Extended necessary condition for local operations and classical communication: Tight bound for all measurements
Cited by in corpus (8)
- Transformations among Pure Multipartite Entangled States via Local Operations Are Almost Never Possible
- Entanglement manipulation of multipartite pure states with finite rounds of classical communication
- LOCC protocols with bounded width per round optimize convex functions
- The Round Complexity of Local Operations and Classical Communication (LOCC) in Random-Party Entanglement Distillation
- Vector Representations of Graphs and Distinguishing Quantum Product States with One-way LOCC
- Transformations in quantum networks via local operations assisted by finitely many rounds of classical communication
- Strong bounds on required resources for quantum channels by local operations and classical communication
- Global versus Local Discrimination of Locally Implementable Multipartite Unitaries