Methodology for quantum logic gate construction

  title={Methodology for quantum logic gate construction},
  author={Xinlan Zhou and Debbie W. Leung and Isaac L. Chuang Stanford University and Ibm Almaden Research Center},
  journal={Physical Review A},
We present a general method to construct fault-tolerant quantum logic gates with a simple primitive, which is an analog of quantum teleportation. The technique extends previous results based on traditional quantum teleportation @Gottesman and Chuang, Nature ~London! 402, 390 ~1999!# and leads to straightforward and systematic construction of many fault-tolerant encoded operations, including the p/8 and Toffoli gates. The technique can also be applied to the construction of remote quantum… 

Equivalent Quantum Circuits

A list of equivalence rules which can help in the analysis and design of quantum circuits is given and an intuitive picture of a basic gate teleportation circuit is given.

A Fully Fault-Tolerant Representation of Quantum Circuits

The transformation of a circuit into the ICM representation provides a canonical form for an exact fault-tolerant, error corrected circuit needed for optimisation prior to the final implementation in a realistic hardware model.

Logic Synthesis for Fault-Tolerant Quantum Computers

Efficient constructions for quantum logic are essential since quantum computation is experimentally challenging. This thesis develops quantum logic synthesis as a paradigm for reducing the resource

Quantum computation by measurements

We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than

Two-qubit Projective Measurements are Universal for Quantum Computation

Nielsen [quant-ph/0108020] showed that universal quantum computation is possible given quantum memory and the ability to perform projective measurements on up to 4-qubits. We describe an improved

Cost-optimal single-qubit gate synthesis in the Clifford hierarchy

The gate synthesis algorithm introduced in this work, based on Dijkstra's algorithm, generates cost-optimal sequences for single-qubit target gates and supports arbitrary universal sets of single- qubit base gates with individually assigned cost values.

Quantifying the magic of quantum channels

A resource theory for magic quantum channels is developed to characterize and quantify the quantum ‘magic’ or non-stabilizerness of noisy quantum circuits, and two efficiently computable magic measures for quantum channels are introduced.

Transversality Versus Universality for Additive Quantum Codes

It is proved that no universal set of transversal logic gates exists for GF(4)-additive quantum codes, and this result strongly supports the idea that additional quantum techniques are necessary to achieve universal fault-tolerant quantum computation on additive codes.


This work provides general circuits that can be used to implement general circuits relevant to quantum error correction, measurement-based quantum computation and Bell state discrimination across a quantum network involving multiple parties.

Fault-tolerant circuit synthesis for universal fault-tolerant quantum computing

A quantum circuit synthesis algorithm for implementing universal fault-tolerant quantum computing based on concatenated codes and needs to recall faultTolerant protocols such as syndrome measure and encoder implicitly include classical control processing conditioned on the measurement outcomes.



Computer Architecture: A Quantitative Approach

This best-selling title, considered for over a decade to be essential reading for every serious student and practitioner of computer design, has been updated throughout to address the most important

Nature 402

  • 390
  • 1999

Group 22: Proc

  • XXII International Colloquium on Group Theoretical Methods in Physics, eds. S. P. Corney, R. Delbourgo, and P. D. Jarvis, 32-43
  • 1999

LANL E-print quant-ph/9807006


    • Roy. Soc. Lond. A 452, 2551
    • 1996

    We write U EU † instead of (U ⊗I ⊗n )E(U † ⊗I ⊗n ) for simplicity

      Note that the n operators U DiU † to be performed conditioned on the measurement outcomes are precisely the n stabilizers of the ancilla state U A(|0 ⊗n )

        LANL E-print quant-ph/9908010


          • Rev. A 54, 1098
          • 1996

          Nature 399

          • 124
          • 1999