On the efficiency of nonlocal gates generation

Abstract

We propose and study a method for using non-maximally entangled states to implement probabilistically non-local gates. Unlike distillation-based protocols, this method does not generate a maximally entangled state at intermediate stages of the process. As a consequences, the method becomes more efficient at a certain range of parameters. Gates of the form $\exp [i\xi {\sigma }_{n_A}{\sigma }_{n_B}]$ with $\xi \ll 1$, can be implemented with nearly unit probability and with vanishingly small entanglement, while for the distillation-based method the gate is produced with a vanishing success probability. We also derive an upper bound to the optimal success probability and show that in the small entanglement limit, the bound is tight.

6 pages, 3 figures

References in corpus (14)

• Concentrating Partial Entanglement by Local Operations
• Conditions for a class of entanglement transformations
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• Entanglement of pure states for a single copy
• Optimal local implementation of non-local quantum gates
• Quantum remote control: Teleportation of unitary operations
• Entangling operations and their implementation using a small amount of entanglement
• Remote control of restricted sets of operations: Teleportation of Angles
• Entanglement capabilities of non-local Hamiltonians
• The non-local content of quantum operations
• Optimal conversion of non--local unitary operations
• Remote operations and interactions for systems of arbitrary dimensional Hilbert space: a state-operator approach
• Non-local Operations: Purification, storage, compression, tomography, and probabilistic implementation
• Equivalence classes of non-local unitary operations

Cited by in corpus (14)

• Efficient implementation of bipartite nonlocal unitary gates using prior entanglement and classical communication
• Entanglement Cost of Nonlocal Measurements
• Remote Implementation of Quantum Operations
• Implementation of multipartite unitary operations with limited resources
• Efficient Implementation of Controlled-Rotations by Using Entanglement
• 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
• Investigating the implementation of restricted sets of multiqubit operations on distant qubits: a communication complexity perspective
• Fast protocols for local implementation of bipartite nonlocal unitaries
• Half a state, half an operator: a general formulation of stators
• Rooted-tree network for optimal non-local gate implementation
• Local implementations of non-local quantum gates in linear entangled channel
• Asymptotic Compressibility of Entanglement and Classical Communication in Distributed Quantum Computation