Optimal local implementation of nonlocal quantum gates

Jens Eisert, Kurt Jacobs, Panayiotis Papadopoulos, Martin B. Plenio

Physical Review A · 2000 · 409 citations · 17 references

DOIFull text

Open access

Concepts

TL;DR

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.

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.

References

17