Quantum variational learning for quantum error-correcting codes
- URL: http://arxiv.org/abs/2204.03560v3
- Date: Mon, 3 Oct 2022 17:25:03 GMT
- Title: Quantum variational learning for quantum error-correcting codes
- Authors: Chenfeng Cao, Chao Zhang, Zipeng Wu, Markus Grassl, Bei Zeng
- Abstract summary: 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.
- Score: 5.627733119443356
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum error correction is believed to be a necessity for large-scale
fault-tolerant quantum computation. In the past two decades, various
constructions of quantum error-correcting codes (QECCs) have been developed,
leading to many good code families. However, the majority of these codes are
not suitable for near-term quantum devices. Here we present VarQEC, a
noise-resilient variational quantum algorithm to search for quantum codes with
a hardware-efficient encoding circuit. The cost functions are inspired by the
most general and fundamental requirements of a QECC, the Knill-Laflamme
conditions. Given the target noise channel (or the target code parameters) and
the hardware connectivity graph, we optimize a shallow variational quantum
circuit to prepare the basis states of an eligible code. In principle, VarQEC
can find quantum codes for any error model, whether additive or non-additive,
degenerate or non-degenerate, pure or impure. We have verified its
effectiveness by (re)discovering some symmetric and asymmetric codes, e.g.,
$((n,2^{n-6},3))_2$ for $n$ from 7 to 14. We also found new $((6,2,3))_2$ and
$((7,2,3))_2$ codes that are not equivalent to any stabilizer code, and
extensive numerical evidence with VarQEC suggests that a $((7,3,3))_2$ code
does not exist. Furthermore, we found many new channel-adaptive codes for error
models involving nearest-neighbor correlated errors. Our work sheds new light
on the understanding of QECC in general, which may also help to enhance
near-term device performance with channel-adaptive error-correcting codes.
Related papers
- Engineering Quantum Error Correction Codes Using Evolutionary Algorithms [0.0]
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.
arXiv Detail & Related papers (2024-09-19T18:00:02Z) - Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
We implement a decoder that finds the recovery operation with the highest success probability.
We study the decoder performance on a 4.8.8 color code lattice under different noise models.
arXiv Detail & Related papers (2024-05-06T18:17:42Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Pauli Manipulation Detection codes and Applications to Quantum Communication over Adversarial Channels [0.08702432681310403]
We introduce and explicitly construct a quantum code we coin a "Pauli Manipulation Detection" code (or PMD), which detects every Pauli error with high probability.
We apply them to construct the first near-optimal codes for two tasks in quantum communication over adversarial channels.
arXiv Detail & Related papers (2023-04-13T05:05:35Z) - 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 Error Correction via Noise Guessing Decoding [0.0]
Quantum error correction codes (QECCs) play a central role in both quantum communications and quantum computation.
This paper shows that it is possible to both construct and decode QECCs that can attain the maximum performance of the finite blocklength regime.
arXiv Detail & Related papers (2022-08-04T16:18:20Z) - Realizing Repeated Quantum Error Correction in a Distance-Three Surface
Code [42.394110572265376]
We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors.
In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
arXiv Detail & Related papers (2021-12-07T13:58:44Z) - Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor
Codes [5.352699766206807]
We study a next step - fault-tolerantly implementing quantum circuits.
We compute pseudo-thresholds for the Pauli error rate $p$ in a depolarizing noise model.
We see that multiple rounds of stabilizer measurements give an improvement over performing a single round at the end.
arXiv Detail & Related papers (2021-08-04T14:24:14Z) - Theory of quasi-exact fault-tolerant quantum computing and
valence-bond-solid codes [3.6192409729339223]
We develop the theory of quasi-exact fault-tolerant quantum computation, which uses qubits encoded into quasi-exact quantum error-correction codes ("quasi codes")
The model of QEQ lies in between the two well-known ones: the usual noisy quantum universality without error correction and the usual fault-tolerant quantum computation, but closer to the later.
arXiv Detail & Related papers (2021-05-31T08:17:30Z) - Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes.
We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code.
We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
arXiv Detail & Related papers (2020-12-07T23:22:40Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z)
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.