Optimal Quantum Circuits for Nearest-Neighbor Architectures

Author David J. Rosenbaum

Thumbnail PDF


  • Filesize: 0.51 MB
  • 14 pages

Document Identifiers

Author Details

David J. Rosenbaum

Cite AsGet BibTex

David J. Rosenbaum. Optimal Quantum Circuits for Nearest-Neighbor Architectures. In 8th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 22, pp. 294-307, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)


We show that the depth of quantum circuits in the realistic architecture where a classical controller determines which local interactions to apply on the kD grid Z^k where k >= 2 is the same (up to a constant factor) as in the standard model where arbitrary interactions are allowed. This allows minimum-depth circuits (up to a constant factor) for the nearest-neighbor architecture to be obtained from minimum-depth circuits in the standard abstract model. Our work therefore justifies the standard assumption that interactions can be performed between arbitrary pairs of qubits. In particular, our results imply that Shor's algorithm, controlled operations and fanouts can be implemented in constant depth, polynomial size and polynomial width in this architecture. We also present optimal non-adaptive quantum circuits for controlled operations and fanouts on a kD grid. These circuits have depth Theta(sqrt[k](n)), size Theta(n) and width Theta(n). Our lower bound also applies to a more general class of operations.
  • 2D
  • Nearest Neighbor
  • Quantum Architecture
  • Quantum Complexity
  • Quantum Computation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads