Fault-tolerant gates via homological product codes
arXiv:1807.09783 · doi:10.22331/q-2019-02-04-120
Abstract
A method for the implementation of a universal set of fault-tolerant logical gates is presented using homological product codes. In particular, it is shown that one can fault-tolerantly map between different encoded representations of a given logical state, enabling the application of different classes of transversal gates belonging to the underlying quantum codes. This allows for the circumvention of no-go results pertaining to universal sets of transversal gates and provides a general scheme for fault-tolerant computation while keeping the stabilizer generators of the code sparse.
arXiv comment11 pages, 3 figures. v2 (published version): quantumarticle documentclass, expanded discussion on the conditions for a fault tolerance threshold
References in corpus (38)
- Fault-tolerant quantum computation by anyons
- Anyons in an exactly solved model and beyond
- Elementary gates for quantum computation
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Multiple Particle Interference and Quantum Error Correction
- State preservation by repetitive error detection in a superconducting quantum circuit
- Topological Quantum Distillation
- Restrictions on Transversal Encoded Quantum Gate Sets
- Experimental Quantum Computations on a Topologically Encoded Qubit
- Sparse Graph Codes for Quantum Error-Correction
- Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
- Implementing a strand of a scalable fault-tolerant quantum computing fabric
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Demonstration of weight-four parity measurements in the surface code architecture
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Single-shot fault-tolerant quantum error correction
- Classification of topologically protected gates for local stabilizer codes
- Unfolding the color code
- Universal transversal gates with color codes - a simplified approach
- Fault-Tolerance of "Bad" Quantum Low-Density Parity Check Codes
- Fault-tolerant logical gates in quantum error-correcting codes
- Majorana Fermion Codes
- Using concatenated quantum codes for universal fault-tolerant quantum gates
- A theory of single-shot error correction for adversarial noise
- Quantum Expander Codes
- Universal fault-tolerant gates on concatenated stabilizer codes
- Overhead analysis of universal concatenated quantum codes
- Thresholds for universal concatenated quantum codes
- The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
- Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
- Improved quantum hypergraph-product LDPC codes
- Gauge color codes in two dimensions
- Generating topological order from a 2D cluster state using a duality mapping
- Generalized Coherent States, Reproducing Kernels, and Quantum Support Vector Machines
- Error suppression via complementary gauge choices in Reed-Muller codes
Cited by in corpus (11)
- Quantum Low-Density Parity-Check Codes
- Constant-overhead quantum error correction with thin planar connectivity
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Fault-tolerant gates on hypergraph product codes
- Partitioning qubits in hypergraph product codes to implement logical gates
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- LDPC-cat codes for low-overhead quantum computing in 2D
- Generating Fault-Tolerant Cluster States from Crystal Structures
- Code conversion with the quantum Golay code for a universal transversal gate set
- Lift-Connected Surface Codes
- Transversal Clifford and T-gate codes of short length and high distance