Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates
- URL: http://arxiv.org/abs/2409.14765v2
- Date: Fri, 11 Oct 2024 06:26:07 GMT
- Title: Compare the Pair: Rotated vs. Unrotated Surface Codes at Equal Logical Error Rates
- Authors: Anthony Ryan O'Rourke, Simon Devitt,
- Abstract summary: Quantum computers will require resource-efficient error-correcting codes.
Instead of distance, a more useful qubit-saving metric would be based on logical error rates.
We find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Practical quantum computers will require resource-efficient error-correcting codes. The rotated surface code uses approximately half the number of qubits as the unrotated surface code to create a logical qubit with the same error-correcting distance. However, instead of distance, a more useful qubit-saving metric would be based on logical error rates. In this work we find the well-below-threshold scaling of logical to physical error rates under circuit-level noise for both codes at high odd and even distances, then compare the number of qubits used by each code to achieve equal logical error rates. We perform Monte Carlo sampling of memory experiment circuits with all valid CNOT orders, using the stabiliser simulator Stim and the uncorrelated minimum-weight perfect-matching decoder PyMatching 2. We find that the rotated code uses $74 - 75\%$ the number of qubits used by the unrotated code, depending on the noise model, to achieve a logical error rate of $p_L = 10^{-12}$ at the operational physical error rate of $p=10^{-3}$. The ratio remains $\approx75\%$ for physical error rates within a factor of two of $p=10^{-3}$ for all useful logical error rates. Our work finds the low-$p_L$ scaling of the surface code and clarifies the qubit savings provided by the rotated surface code, providing numerical justification for its use in future implementations of the surface code.
Related papers
- Hardware-efficient quantum error correction using concatenated bosonic qubits [41.6475446744259]
Quantum computers will need to incorporate quantum error correction, where a logical qubit is redundantly encoded in many noisy physical qubits.
Here, using a microfabricated superconducting quantum circuit, we realize a logical qubit memory formed from the concatenation of encoded bosonic cat qubits.
We study the performance and scaling of the logical qubit memory, finding that the phase-flip correcting repetition code operates below threshold.
arXiv Detail & Related papers (2024-09-19T18:00:53Z) - Quantum error correction below the surface code threshold [107.92016014248976]
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit.
We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder.
Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
arXiv Detail & Related papers (2024-08-24T23:08:50Z) - Reducing the error rate of a superconducting logical qubit using analog readout information [2.5466328776335936]
Traditional error decoding approaches ignore valuable information embedded in the analog (soft') readout signal.
We present experimental results showcasing the advantages of incorporating soft information into the decoding process.
Our results show a reduction of up to $6.8%$ in the extracted logical error rate with the use of soft information.
arXiv Detail & Related papers (2024-03-01T17:48:23Z) - Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.0]
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.
arXiv Detail & Related papers (2023-09-18T18:00:02Z) - Scalable Quantum Error Correction for Surface Codes using FPGA [67.74017895815125]
A fault-tolerant quantum computer must decode and correct errors faster than they appear.
We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup.
The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure.
arXiv Detail & Related papers (2023-01-20T04:23:00Z) - 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.