Engineering Quantum Error Correction Codes Using Evolutionary Algorithms
- URL: http://arxiv.org/abs/2409.13017v1
- Date: Thu, 19 Sep 2024 18:00:02 GMT
- Title: Engineering Quantum Error Correction Codes Using Evolutionary Algorithms
- Authors: Mark Webster, Dan Browne,
- Abstract summary: Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing.
We present a novel evolutionary algorithm which searches for an optimal stabiliser code for a given error model.
As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum error correction and the use of quantum error correction codes is likely to be essential for the realisation of practical quantum computing. Because the error models of quantum devices vary widely, quantum codes which are tailored for a particular error model may have much better performance. In this work, we present a novel evolutionary algorithm which searches for an optimal stabiliser code for a given error model, number of physical qubits and number of encoded qubits. We demonstrate an efficient representation of stabiliser codes as binary strings -- this allows for random generation of valid stabiliser codes, as well as mutation and crossing of codes. Our algorithm finds stabiliser codes whose distance closely matches the best-known-distance codes of codetables.de for n <= 20 physical qubits. We perform a search for optimal distance CSS codes, and compare their distance to the best-known-codes. Finally, we show that the algorithm can be used to optimise stabiliser codes for biased error models, demonstrating a significant improvement in the undetectable error rate for [[12, 1]] codes versus the best-known-distance code with the same parameters. As part of this work, we also introduce an evolutionary algorithm QDistEvol for finding the distance of quantum error correction codes.
Related papers
- Breadth-first graph traversal union-find decoder [0.0]
We develop variants of the union-find decoder that simplify its implementation and provide potential decoding speed advantages.
We show how these methods can be adapted to decode non-topological quantum low-density-parity-check codes.
arXiv Detail & Related papers (2024-07-22T18:54:45Z) - Testing the Accuracy of Surface Code Decoders [55.616364225463066]
Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC)
This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
arXiv Detail & Related papers (2023-11-21T10:22:08Z) - Quantum Lego Expansion Pack: Enumerators from Tensor Networks [1.489619600985197]
We provide the first tensor network method for computing quantum weight enumerators in the most general form.
For non-(Pauli)-stabilizer codes, this constitutes the current best algorithm for computing the code distance.
We show that these enumerators can be used to compute logical error rates exactly and thus construct decoders for any i.i.d. single qubit or qudit error channels.
arXiv Detail & Related papers (2023-08-09T18:00:02Z) - 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) - 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 variational learning for quantum error-correcting codes [5.627733119443356]
VarQEC is a noise-resilient variational quantum algorithm to search for quantum codes with a hardware-efficient encoding circuit.
In principle, VarQEC can find quantum codes for any error model, whether additive or non-additive, or non-degenerate, pure or impure.
arXiv Detail & Related papers (2022-04-07T16:38:27Z) - A Practical and Scalable Decoder for Topological Quantum Error
Correction with Digital Annealer [0.5658123802733283]
We propose an efficient and scalable decoder for quantum error correction using Fujitsu Digital Annealer (DA)
In particular, we implement the proposed DA decoder for the surface code and perform detailed numerical experiments for various code to see its performance and scalability.
It is also shown that the DA decoder has advantages over the Union-Find (UF) decoder from a variety of perspectives including hardware implementation.
arXiv Detail & Related papers (2022-03-29T07:48:51Z) - 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) - Graph-Theoretic Approach to Quantum Error Correction [0.0]
We investigate a novel class of quantum error correcting codes to correct errors on both qubits and higher-state quantum systems represented as qudits.
These codes arise from an original graph-theoretic representation of sets of quantum errors.
We present two instances of optimal encodings: an optimal encoding for fully correlated noise which achieves a higher encoding rate than previously known, and a minimal encoding for single qudits.
arXiv Detail & Related papers (2021-10-16T00:04:24Z) - Performance of teleportation-based error correction circuits for bosonic
codes with noisy measurements [58.720142291102135]
We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.
We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
arXiv Detail & Related papers (2021-08-02T16:12:13Z) - 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.