Fast protocols for local implementation of bipartite nonlocal unitaries
arXiv:1109.5013 · doi:10.1103/PhysRevA.85.012304
Abstract
In certain cases the communication time required to deterministically implement a nonlocal bipartite unitary using prior entanglement and LOCC (local operations and classical communication) can be reduced by a factor of two. We introduce two such "fast" protocols and illustrate them with various examples. For some simple unitaries, the entanglement resource is used quite efficiently. The problem of exactly which unitaries can be implemented by these two protocols remains unsolved, though there is some evidence that the set of implementable unitaries may expand at the cost of using more entanglement.
arXiv commentUpdated to published version
References in corpus (18)
- Distributed Quantum Computation over Noisy Channels
- Optimal Creation of Entanglement Using a Two--Qubit Gate
- Optimal local implementation of non-local quantum gates
- Simplified instantaneous non-local quantum computation with applications to position-based cryptography
- Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
- Distributed quantum computing: A distributed Shor algorithm
- Characterization of non-local gates
- Instantaneous measurement of non-local variables
- Interaction cost of non-local gates
- Insecurity of position-based quantum cryptography protocols against entanglement attacks
- Minimum construction of two-qubit quantum operations
- Remote operations and interactions for systems of arbitrary dimensional Hilbert space: a state-operator approach
- Communication Links for Distributed Quantum Computation
- Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
- Operator-Schmidt decompositions and the Fourier transform, with applications to the operator-Schmidt numbers of unitaries
- On the efficiency of nonlocal gates generation
- Measurements of semi-local and non-maximally entangled states
- Entanglement consumption of instantaneous nonlocal quantum measurements
Cited by in corpus (7)
- Asymptotic performance of port-based teleportation
- Measurements of nonlocal variables and demonstration of the failure of the product rule for a pre- and postselected pair of photons
- Nonlocal quantum gate on quantum continuous variables with minimum resources
- Bounds on Instantaneous Nonlocal Quantum Computation
- Rooted-tree network for optimal non-local gate implementation
- Implementation of bipartite or remote unitary gates with repeater nodes
- The Birkhoff theorem for unitary matrices of prime dimension