Optimal local implementation of nonlocal quantum gates
By J. Eisert, Kurt Jacobs, P. Papadopoulos, Martin Bodo Plenio. 2000
348 citations recorded by the source corpus.
We investigate the minimal resources that are required in the local implementation of nonlocal quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We present general statements on the minimal resource requirements and present optimal procedures for a number of important gates, including controlled-NOT ~CNOT! and Toffoli gates. We show that one bit of classical communication in each direction is both necessary and sufficient for the nonlocal implementation of the quantum CNOT, while in general two bits in each direction is required for the implementation of a general two-bit quantum gate. In particular, the state swapper requires this maximum classical communication overhead. Extensions of these ideas to multiparty gates are presented.
Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics
View Paper: https://www.semanticscholar.org/paper/adaa2e3cd53f9d05d7a7022a22e534a65f8256c5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
In Atomic and Molecular Physics, and Optics
Citations in the corpus
- Demonstration of the trapped-ion quantum CCD computer architecture (2020, background): “Quantum gate teleportation is a protocol for applying a gate between a pair of remote qubits [39] requiring entangling operations, midcircuit measurements, and classically-conditioned quantum gates - all of which are necessary for quantum error”