Universal fault-tolerant quantum computing with stabilizer codes

  title={Universal fault-tolerant quantum computing with stabilizer codes},
  author={Paul Webster and Michael Vasmer and Thomas R. Scruby and Stephen D. Bartlett},
  journal={Physical Review Research},
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of no-go theorems constrain the ways in which a set of fault-tolerant logic gates can be universal. These theorems are very restrictive, and conventional wisdom holds that a universal fault-tolerant logic gate set cannot be implemented natively, requiring us to… 

Figures and Tables from this paper

Finding the disjointness of stabilizer codes is NP-complete

The results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.

Toward a Union-Find Decoder for Quantum LDPC Codes

A generalization of the Union-Find decoder as a decoder for quantum LDPC codes is proposed, and it is proved that this decoder corrects all errors with weight up to a notion of covering radius which measures the spread of an error from its syndrome.

Numerical Implementation of Just-In-Time Decoding in Novel Lattice Slices Through the Three-Dimensional Surface Code.

A fully detailed set of bounded-height lattice slices through the 3D codes which retain the code distance and measurement-error detecting properties of the full 3D code and admit a dimension-jumping process which expands from/collapses to 2D surface codes supported on the boundaries of each slice.

Partitioning qubits in hypergraph product codes to implement logical gates

It is demonstrated that transversal gates can be used as the basis for universal quantum computing on LDPC codes, when supplemented with state injection.

Anyonic Defect Branes and Conformal Blocks in Twisted Equivariant Differential (TED) K-theory

We demonstrate that twisted equivariant differential K-theory of transverse complex curves accommodates exotic charges of the form expected of codimension=2 defect branes, such as of D7-branes in



Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes

It is shown how the limits of non-transversality can be overcome by performing rounds of intermediate error-correction to create logical gates on stabilizer codes that use no ancillas other than those required for syndrome measurement.

Thresholds for Universal Concatenated Quantum Codes.

It is shown that while the level-1 pseudothreshold for the concatenated scheme is limited by the logical Hadamard gate, the error suppression of the logical cnot gates allows for the asymptotic threshold to increase by orders of magnitude at higher levels.

Universal fault-tolerant quantum computation with Bacon-Shor codes

A fault-tolerant universal gate set consisting of Hadamard and controlled-controlled-Z (CCZ) on Bacon-Shor subsystem codes is presented and pseudothresholds are calculated for the smallest Bacon- Shor code and magic-states are compared within the framework of a proposed ion trap architecture.

Fault-tolerant conversion between the Steane and Reed-Muller quantum codes.

This work combines the features of Steane's 7-qubit quantum error-correcting code and Reed-Muller code by demonstrating how to fault-tolerantly convert between these two codes, providing a new method to realize universal fault-Tolerant quantum computation.

Using concatenated quantum codes for universal fault-tolerant quantum gates.

This work gives the required properties of the error correcting codes to ensure universal fault tolerance, and believes that optimizing the codes used in such a scheme could provide a useful alternative to state distillation schemes that exhibit high overhead costs.

Fault-tolerant quantum gates with defects in topological stabilizer codes

This work presents an approach to implement the full Clifford group via braiding in any code possessing twist defects on which a fermion can condense, and shows how the no-go theorems can be circumvented to provide a universal scheme in three-dimensional surface codes without magic state distillation.

Universal fault-tolerant measurement-based quantum computation

A framework to map fault-tolerant procedures for quantum computation that have been natively designed for use with stabilizer codes onto a measurement-based protocol, allowing for a new model of universal quantum computation based on the braiding and fusion of foliated topological defects that are akin to Majorana modes.

Universal fault-tolerant quantum computation with only transversal gates and error correction.

This work shows that "triorthogonal" stabilizer codes, introduced for state distillation by Bravyi and Haah, admit transversal implementation of the controlled-controlled-Z gate, and constructs a universal set of fault-tolerant gates without statedistillation by using only transversAL controlled- controlled-Z, transversals Hadamard, and fault-Tolerant error correction.

Fault-tolerant logical gates in quantum error-correcting codes

It is proved that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier and the qubit erasure threshold for codes with a nontrivial transversal mth-level Clifford logical gate is upper bounded by 1/m.

Quantum computing with realistically noisy devices

  • E. Knill
  • Computer Science, Physics
  • 2005
This work reports a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent, and shows that non-trivial quantum computations at EPG’s of as low as one per cent could be implemented.