Generating Fault-Tolerant Cluster States from Crystal Structures

Abstract

Measurement-based quantum computing (MBQC) is a promising alternative to traditional circuit-based quantum computing predicated on the construction and measurement of cluster states. Recent work has demonstrated that MBQC provides a more general framework for fault-tolerance that extends beyond foliated quantum error-correcting codes. We systematically expand on that paradigm, and use combinatorial tiling theory to study and construct new examples of fault-tolerant cluster states derived from crystal structures. Included among these is a robust self-dual cluster state requiring only degree-3 connectivity. We benchmark several of these cluster states in the presence of circuit-level noise, and find a variety of promising candidates whose performance depends on the specifics of the noise model. By eschewing the distinction between data and ancilla, this malleable framework lays a foundation for the development of creative and competitive fault-tolerance schemes beyond conventional error-correcting codes.

arXiv comment37 pages, edits and expanded descriptions

References in corpus (49)

• Fault-tolerant quantum computation by anyons
• Good Quantum Error-Correcting Codes Exist
• Topological quantum memory
• Measurement-based quantum computation with cluster states
• Quantum Computing with Very Noisy Devices
• Measurement-based quantum computation
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• High threshold universal quantum computation on the surface code
• A fault-tolerant one-way quantum computer
• Quantum computing with nearest neighbor interactions and error rates over 1%
• Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory
• Active stabilisation, quantum computation and quantum state synthesis
• Ultrahigh Error Threshold for Surface Codes with Biased Noise
• Fault-tolerant quantum computation against biased noise
• Towards practical classical processing for the surface code
• Long-range quantum entanglement in noisy cluster states
• Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
• Topological and subsystem codes on low-degree graphs with flag qubits
• Fault tolerant quantum computation with very high threshold for loss errors
• Single-shot fault-tolerant quantum error correction
• Thresholds for topological codes in the presence of loss
• Strong Resilience of Topological Codes to Depolarization
• Tailoring surface codes for highly biased noise
• Constructions and Noise Threshold of Hyperbolic Surface Codes
• Fault-tolerant thresholds for the surface code in excess of 5% under biased noise
• Foliated Quantum Codes
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• A theory of single-shot error correction for adversarial noise
• Homological Error Correction: Classical and Quantum Codes
• Error Correction and Degeneracy in Surface Codes Suffering Loss
• Triangular color codes on trivalent graphs with flag qubits
• Hyperbolic and Semi-Hyperbolic Surface Codes for Quantum Storage
• Phase Structure of the Random-Plaquette Z_2 Gauge Model: Accuracy Threshold for a Toric Quantum Memory
• Simulating the performance of a distance-3 surface code in a linear ion trap
• Cellular-automaton decoders with provable thresholds for topological codes
• Three-dimensional color code thresholds via statistical-mechanical mapping
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• 2-D Compass Codes
• Reducing the overhead for quantum computation when noise is biased
• Computational universality of symmetry-protected topologically ordered cluster phases on 2D Archimedean lattices
• High-threshold topological quantum error correction against biased noise
• Handling Leakage with Subsystem Codes
• Loss Tolerant Linear Optical Quantum Memory By Measurement Based Quantum Computing
• Renormalization group decoder for a four-dimensional toric code
• The Small Stellated Dodecahedron Code and Friends
• Fault-tolerant gates via homological product codes
• A high threshold code for modular hardware with asymmetric noise
• Decoding Schemes for Foliated Sparse Quantum Error Correcting Codes

Cited by in corpus (17)

• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Logical blocks for fault-tolerant topological quantum computation
• High-threshold quantum computing by fusing one-dimensional cluster states
• Unifying flavors of fault tolerance with the ZX calculus
• Optimization of the surface code design for Majorana-based qubits
• High photon-loss threshold quantum computing using GHZ-state measurements
• Tailored cluster states with high threshold under biased noise
• 3-Fermion topological quantum computation
• Loss-tolerant architecture for quantum computing with quantum emitters
• Modular architectures to deterministically generate graph states
• Concatenation Schemes for Topological Fault-tolerant Quantum Error Correction
• LUCI in the Surface Code with Dropouts
• Fault-tolerant structures for measurement-based quantum computation on a network
• Single-shot and measurement-based quantum error correction via fault complexes
• Low-density parity-check representation of fault-tolerant quantum circuits
• Generation of hypercubic cluster states in 1-4 dimensions in a simple optical system