Optimal local implementation of nonlocal quantum gates
Top Cited Papers
- 19 October 2000
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 62 (5) , 052317
- https://doi.org/10.1103/physreva.62.052317
Abstract
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.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Distributed quantum computation over noisy channelsPhysical Review A, 1999
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Review, 1999
- Quantum computingReports on Progress in Physics, 1998
- Basics of quantum computationProgress in Quantum Electronics, 1998
- Decoherence limits to quantum computation using trapped ionsProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1997
- Decoherence Bounds on Quantum Computation with Trapped IonsPhysical Review Letters, 1996
- Quantum physics and computersContemporary Physics, 1996
- Quantum computation and Shor's factoring algorithmReviews of Modern Physics, 1996
- Realistic lower bounds for the factorization time of large numbers on a quantum computerPhysical Review A, 1996
- Quantum ComputationScience, 1995