Optimizing local protocols implementing nonlocal quantum gates
arXiv:1002.0499 · doi:10.1103/PhysRevA.81.062316
Abstract
We present a method of optimizing recently designed protocols for implementing an arbitrary nonlocal unitary gate acting on a bipartite system. These protocols use only local operations and classical communication with the assistance of entanglement, and are deterministic while also being "one-shot", in that they use only one copy of an entangled resource state. The optimization is in the sense of minimizing the amount of entanglement used, and it is often the case that less entanglement is needed than with an alternative protocol using two-way teleportation.
11 pages, 1 figure. This is a companion paper to arXiv:1001.5465
References in corpus (4)
- Understanding entanglement as resource: locally distinguishing unextendible product bases
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Entanglement Cost of Nonlocal Measurements
- Implementation of multipartite unitary operations with limited resources
Cited by in corpus (12)
- A framework for bounding nonlocality of state discrimination
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Entanglement requirements for implementing bipartite unitary operations
- Nonlocal and controlled unitary operators of Schmidt rank three
- Entanglement cost and entangling power of bipartite unitary and permutation operators
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- Complexity of causal order structure in distributed quantum information processing and its trade-off with entanglement
- 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
- Distributed Encoding and Decoding of Quantum Information over Networks
- Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation