Fault-tolerant hyperbolic Floquet quantum error correcting codes
- URL: http://arxiv.org/abs/2309.10033v3
- Date: Thu, 20 Jun 2024 19:29:39 GMT
- Title: Fault-tolerant hyperbolic Floquet quantum error correcting codes
- Authors: Ali Fahimniya, Hossein Dehghani, Kishor Bharti, Sheryl Mathew, Alicia J. Kollár, Alexey V. Gorshkov, Michael J. Gullans,
- Abstract summary: We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes"
One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code.
At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A central goal in quantum error correction is to reduce the overhead of fault-tolerant quantum computing by increasing noise thresholds and reducing the number of physical qubits required to sustain a logical qubit. We introduce a potential path towards this goal based on a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes.'' These codes are defined by a specific sequence of non-commuting two-body measurements arranged periodically in time that stabilize a topological code on a hyperbolic manifold with negative curvature. We focus on a family of lattices for $n$ qubits that, according to our prescription that defines the code, provably achieve a finite encoding rate $(1/8+2/n)$ and have a depth-3 syndrome extraction circuit. Similar to hyperbolic surface codes, the distance of the code at each time-step scales at most logarithmically in $n$. The family of lattices we choose indicates that this scaling is achievable in practice. We develop and benchmark an efficient matching-based decoder that provides evidence of a threshold near 0.1% in a phenomenological noise model and 0.25% in an entangling measurements noise model. Utilizing weight-two check operators and a qubit connectivity of 3, one of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
Related papers
- High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
We present a new family of quantum low-density parity-check codes, which we call radial codes.
In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance.
Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
arXiv Detail & Related papers (2024-06-20T16:08:06Z) - Creating entangled logical qubits in the heavy-hex lattice with topological codes [0.0]
In this work we show how this bug can be turned into a feature.
We demonstrate entanglement between logical qubits with code distance up to $d = 4$.
We verify the violation of Bell's inequality for both the $d=2$ case with post selection featuring a fidelity of $94%$.
arXiv Detail & Related papers (2024-04-24T17:02:35Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - High-threshold and low-overhead fault-tolerant quantum memory [4.91491092996493]
We present an end-to-end quantum error correction protocol based on a family of LDPC codes with a high encoding rate.
We show that 12 logical qubits can be preserved for nearly one million syndrome cycles using 288 physical qubits.
arXiv Detail & Related papers (2023-08-15T17:55:12Z) - Constructions and performance of hyperbolic and semi-hyperbolic Floquet
codes [5.33024001730262]
We construct families of Floquet codes derived from colour code tilings of closed hyperbolic surfaces.
We also construct semi-hyperbolic Floquet codes, which have improved distance scaling.
arXiv Detail & Related papers (2023-08-07T17:54:45Z) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds.
We engineer an error bias at the lowest level of encoding using the surface code.
We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
arXiv Detail & Related papers (2022-12-03T06:16:07Z) - A local pre-decoder to reduce the bandwidth and latency of quantum error
correction [3.222802562733787]
A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware.
We propose a local pre-decoder', which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder.
We find substantial improvements in the runtime of the global decoder and the communication bandwidth by using the pre-decoder.
arXiv Detail & Related papers (2022-08-09T11:01:56Z) - Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
We report the measurement of logical qubit performance scaling across multiple code sizes.
Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number.
Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
arXiv Detail & Related papers (2022-07-13T18:00:02Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - Exponential suppression of bit or phase flip errors with repetitive
error correction [56.362599585843085]
State-of-the-art quantum platforms typically have physical error rates near $10-3$.
Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits.
We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
arXiv Detail & Related papers (2021-02-11T17:11:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.