On Universal and Fault-Tolerant Quantum Computing

Abstract

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and ${{\sigma }_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $\pi$) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by Shor and by Kitaev.

10 pages, Latex. Emails addresses {boykin, talmo, pulver, vwani, vatan}@ee.ucla.edu

References in corpus (8)

• Elementary gates for quantum computation
• Good Quantum Error-Correcting Codes Exist
• Measurement of conditional phase shifts for quantum logic
• Reliable Quantum Computers
• A Theory of Fault-Tolerant Quantum Computation
• Electron Spin Resonance Transistors for Quantum Computing in Silicon-Germanium Heterostructures
• A Universal Two--Bit Gate for Quantum Computation
• Threshold Accuracy for Quantum Computation

Cited by in corpus (40)

• Quantum Teleportation is a Universal Computational Primitive
• Universal computation by quantum walk
• Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
• Quantum algorithms for algebraic problems
• A Lambda Calculus for Quantum Computation
• The Born Supremacy: Quantum Advantage and Training of an Ising Born Machine
• Unified derivations of measurement-based schemes for quantum computation
• A Simple Proof that Toffoli and Hadamard are Quantum Universal
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Majorana nanowires for topological quantum computation
• Quantum one-time programs
• Decoherence-Free Subspaces for Multiple-Qubit Errors: (I) Characterization
• An Introduction to Quantum Complexity Theory
• Decoherence-Free Subspaces for Multiple-Qubit Errors: (II) Universal, Fault-Tolerant Quantum Computation
• How to Verify a Quantum Computation
• Two-qubit Projective Measurements are Universal for Quantum Computation
• Lineal: A linear-algebraic Lambda-calculus
• Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
• Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
• A Geometric Algebra Perspective On Quantum Computational Gates And Universality In Quantum Computing
• Universal quantum walks and adiabatic algorithms by 1D Hamiltonians
• A Schematic Definition of Quantum Polynomial Time Computability
• A Blueprint for a Topologically Fault-tolerant Quantum Computer
• Universal quantum computation with two- and three-qubit projective measurements
• Universal quantum gates for Quantum Computation on magnetic systems ruled by Heisenberg-Ising interactions
• Computational Distinguishability of Quantum Channels
• Characterization of universal two-qubit Hamiltonians
• Linear-algebraic lambda-calculus
• A minimum control ancilla driven quantum computation scheme with repeat-until-success style gate generation
• Ancilla Driven Quantum Computation with arbitrary entangling strength
• Embezzlement States are Universal for Non-Local Strategies
• Topics in quantum information and the theory of open quantum systems
• Self-Correcting Quantum Computers
• Classical Coding Approaches to Quantum Applications
• Computing a Turing-Incomputable Problem from Quantum Computing
• Classical simulations of Abelian-group normalizer circuits with intermediate measurements
• Products of finite order rotations and quantum gates universality
• High Fidelity Single-Qubit Gates Using Non-adiabatic Rapid Passage
• High fidelity universal set of quantum gates using non-adiabatic rapid passage
• Quantum Computation: A Computer Science Perspective