Optimal number of controlled-NOT gates to generate a three-qubit state

2007/11/26 by Marko Znidaric, Marko Žnidarič, Olivier Giraud +1 · 1 citation
Computer Science · Physics and Astronomy · #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #quant-ph

paper · pdf · doi:10.1103/physreva.77.032320

published as Phys. Rev. A 77, 032320 (2008) · 4 pages, no figure

arxiv created 2007/11/26 · openalex publication_date 2008/03/13 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

The number of two-qubit gates required to deterministically transform a three-qubit pure quantum state into another is discussed. We show that any state can be prepared from a product state using at most three CNOT gates and that starting from the Greenberger-Horne-Zeilinger state, only two suffice. As a consequence, any three-qubit state can be transformed into any other using at most four CNOT gates. Generalizations to other two-qubit gates are also discussed.

Citations

• Demonstration of conditional gate operation using superconducting charge qubits
• Three qubits can be entangled in two inequivalent ways
• Codes for the quantum erasure channel
• Elementary gates for quantum computation
• Synthesis of Quantum Logic Circuits
• Coupling superconducting qubits via a cavity bus

Cited by

• Quantum circuit for three-qubit random states