Matching Generalized-Bicycle Codes to Neutral Atoms for Low-Overhead
Fault-Tolerance
- URL: http://arxiv.org/abs/2311.16980v2
- Date: Sun, 3 Mar 2024 16:21:35 GMT
- Title: Matching Generalized-Bicycle Codes to Neutral Atoms for Low-Overhead
Fault-Tolerance
- Authors: Joshua Viszlai, Willers Yang, Sophia Fuhui Lin, Junyu Liu, Natalia
Nottingham, Jonathan M. Baker, Frederic T. Chong
- Abstract summary: We present a protocol for implementing a restricted set of space-efficient quantum error correcting codes in atom arrays.
This protocol enables generalized-bicycle codes that require up to 10x fewer physical qubits than surface codes.
We also evaluate a proof-of-concept quantum memory hier- archy where generalized-bicycle codes are used in conjunction with surface codes for general computation.
- Score: 7.718509743812828
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Despite the necessity of fault-tolerant quantum sys- tems built on error
correcting codes, many popular codes, such as the surface code, have
prohibitively large qubit costs. In this work we present a protocol for
efficiently implementing a restricted set of space-efficient quantum error
correcting (QEC) codes in atom arrays. This protocol enables
generalized-bicycle codes that require up to 10x fewer physical qubits than
surface codes. Additionally, our protocol enables logical cycles that are 2-3x
faster than more general solutions for implementing space- efficient QEC codes
in atom arrays. We also evaluate a proof-of-concept quantum memory hier- archy
where generalized-bicycle codes are used in conjunction with surface codes for
general computation. Through a detailed compilation methodology, we estimate
the costs of key fault- tolerant benchmarks in a hierarchical architecture
versus a state-of-the-art surface code only architecture. Overall, we find the
spatial savings of generalized-bicycle codes outweigh the overhead of loading
and storing qubits, motivating the feasibility of a quantum memory hierarchy in
practice. Through sensitivity studies, we also identify key program-level and
hardware-level features for using a hierarchical architecture.
Related papers
- Architectures for Heterogeneous Quantum Error Correction Codes [13.488578754808676]
Heterogeneous architectures provide a clear path to universal logical computation.
We propose integrating the surface code and gross code using an ancilla bus for inter-code data movement.
We demonstrate physical qubit reductions of up to 6.42x when executing an algorithm to a specific logical error rate.
arXiv Detail & Related papers (2024-11-05T15:49:02Z) - Toward a 2D Local Implementation of Quantum LDPC Codes [1.1936126505067601]
Geometric locality is an important theoretical and practical factor for quantum low-density parity-check (qLDPC) codes.
We present an error correction protocol built on a bilayer architecture that aims to reduce operational overheads when restricted to 2D local gates.
arXiv Detail & Related papers (2024-04-26T19:48:07Z) - Small Quantum Codes from Algebraic Extensions of Generalized Bicycle
Codes [4.299840769087443]
Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance.
We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
arXiv Detail & Related papers (2024-01-15T10:38:13Z) - Long-range-enhanced surface codes [0.0]
The surface code is a quantum error-correcting code for one logical qubit, protected by spatially localized parity checks in two dimensions.
We show that storing more logical qubits requires either sacrificing the robustness of the surface code against errors or increasing the number of physical qubits.
Long-range-enhanced surface codes outperform conventional surface codes using hundreds of physical qubits, and represent a practical strategy to enhance the robustness of logical qubits to errors in near-term devices.
arXiv Detail & Related papers (2023-09-21T01:39:31Z) - Modular decoding: parallelizable real-time decoding for quantum
computers [55.41644538483948]
Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware.
We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
arXiv Detail & Related papers (2023-03-08T19:26:10Z) - Hierarchical memories: Simulating quantum LDPC codes with local gates [0.05156484100374058]
Constant-rate low-density parity-check (LDPC) codes are promising candidates for constructing efficient fault-tolerant quantum memories.
We construct a new family of hierarchical codes, that encode a number of logical qubits K = Omega(N/log(N)2.
Under conservative assumptions, we find that the hierarchical code outperforms the basic encoding where all logical qubits are encoded in the surface code.
arXiv Detail & Related papers (2023-03-08T18:48:12Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - 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) - 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) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z)
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.