Physical Review A · 2000 · 409 citations · 17 references
ComputingCommunicationComputer ScienceDistributed SystemsQuantum ComputingQuantum MechanicsQuantum BitsQuantum CircuitsQuantum CommunicationQuantum ComputationQuantum GatesCommunication Overhead ReductionDistributed Quantum Computing ArchitecturesQuantum Circuit OptimizationQuantum Gate OptimizationResource Overhead AnalysisToffoli Gate
We investigate the minimal resources required for locally implementing nonlocal quantum gates in distributed quantum computers, including extensions to multiparty gates. We analyze classical communication and entanglement consumption, deriving optimal procedures for gates such as CNOT and Toffoli. We find that one bit of classical communication per direction suffices for nonlocal CNOT, while general two‑bit gates require two bits per direction, with the state swapper attaining this maximum.
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.
17
Elementary gates for quantum computation
Adriano Barenco, Charles H. Bennett, Richard Cleve et al. · Physical Review A · 1995 · 4.4K citations · Full text
David P. DiVincenzo · Science · 1995 · 1.6K citations