Methodology for quantum logic gate construction

By Xinlan Zhou, Debbie W. Leung, Isaac L. Chuang Stanford University, I. A. R. Center. 2000

330 citations recorded by the source corpus.

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 operations that cannot be directly performed.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/6c425a937441733f4daa33c9b87a7b3a25f68b67

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Atomic and Molecular Physics, and Optics

Citations in the corpus

Photonic quantum technologies (2009, background): “Generalized quantum teleportation The concept of quantum teleportation has been extended to generalized quantum teleportatio”
Fault-tolerant architecture for quantum computation using electrically controlled semiconductor spins (2005, methodology): “Finally, for scalable architectures, teleportation-based gates may be use”
A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits (2012, background): “plement exactly within the Cliord and Tgate set, and in particular phase rotations of e2ˇi=2m, commonly seen in the quantum Fourier transform, are not implementable using Cliord and T gates for m4 [27]. As a result, a quantum compiler will need ecient approximation sequences for many of the logical ”
Quantum accuracy threshold for concatenated distance-3 codes (2005, methodology): “nstruct a universal set of transversal 1-Ga’s. Fortunately, though, there is a general scheme for using the Cliﬀord 1-Ga’s and a 0-Ga in C 3 to build a fault-tolerant 1-Ga that simulates the C 3 gate [1, 22, 34]. This scheme involves the oﬀ-line preparation and veriﬁcation of quantum software that i”
Quantum error correction for quantum memories (2013, neutral): “A somewhat weaker version of this theorem, namely, that qubit stabilizer codes do not allow for a universal set of gates to be realized via transversal unitary gates, was proved by Zeng, Cross, and Chuang (2011).”
Encoding a qubit in an oscillator (2000, neutral): “which completes the universal gate set [33,34].”
Quantum computing with realistically noisy devices (2004, methodology): “An alternative is to inj ect and purify states needed for onequbit teleportation of the desired gates using the techniqu es given in [19].”
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation (2009, background): “For certain gates, even simpler constructions are available that take advantage of special properties of the gate [ 9, 44, 55 ].”
Polynomial-Time T-Depth Optimization of Clifford+T Circuits Via Matroid Partitioning (2013, methodology): “, the popular Steane code, as well as the promising surface codes, the Clifford group can be implemented as logical gates with little cost [14, 33].”
Large-scale modular quantum-computer architecture with atomic memory and photonic interconnects (2012, background): “and “teleport” the gate into this state [70].”