Fast protocols for local implementation of bipartite nonlocal unitaries

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.

Updated to published version

References in corpus (5)

• Simplified instantaneous non-local quantum computation with applications to position-based cryptography
• Quantum Tagging: Authenticating Location via Quantum Information and Relativistic Signalling Constraints
• Insecurity of position-based quantum cryptography protocols against entanglement attacks
• Communication Links for Distributed Quantum Computation
• On the efficiency of nonlocal gates generation

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