Novel constructions for the fault-tolerant Toffoli gate

Abstract

We present two new constructions for the Toffoli gate which substantially reduce resource costs in fault-tolerant quantum computing. The first contribution is a Toffoli gate requiring Clifford operations plus only four $T=\exp (i\pi {\sigma }^z/8)$ gates, whereas conventional circuits require seven $T$ gates. An extension of this result is that adding $n$ control inputs to a controlled gate requires $4n$ $T$ gates, whereas the best prior result was $8n$. The second contribution is a quantum circuit for the Toffoli gate which can detect a single ${\sigma }^z$ error occurring with probability $p$ in any one of eight $T$ gates required to produce the Toffoli. By post-selecting circuits that did not detect an error, the posterior error probability is suppressed to lowest order from $4p$ (or $7p$, without the first contribution) to $28p^2$ for this enhanced construction. In fault-tolerant quantum computing, this construction can reduce the overhead for producing logical Toffoli gates by an order of magnitude.

5 pages, 4 figures

References in corpus (10)

• Surface codes: Towards practical large-scale quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Magic state distillation with low overhead
• Quantum circuits of T-depth one
• Fast Quantum Modular Exponentiation
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Multilevel distillation of magic states for quantum computing
• A bridge to lower overhead quantum computation
• Resource Requirements for Fault-Tolerant Quantum Simulation: The Transverse Ising Model Ground State
• Distilling one-qubit magic states into Toffoli states

Cited by in corpus (11)

• Application of a resource theory for magic states to fault-tolerant quantum computing
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Efficient synthesis of universal Repeat-Until-Success circuits
• Distilling one-qubit magic states into Toffoli states
• Quantum Computation with Topological Codes: from qubit to topological fault-tolerance
• Error rates and resource overheads of encoded three-qubit gates
• Logic Synthesis for Quantum Computing
• Synthesis of Arbitrary Quantum Circuits to Topological Assembly: Systematic, Online and Compact
• Flexible layout of surface code computations using AutoCCZ states
• Resource optimization for fault-tolerant quantum computing
• Time versus Hardware: Reducing Qubit Counts with a (Surface Code) Data Bus