Weight Reduced Stabilizer Codes with Lower Overhead
- URL: http://arxiv.org/abs/2402.05228v1
- Date: Wed, 7 Feb 2024 20:08:38 GMT
- Title: Weight Reduced Stabilizer Codes with Lower Overhead
- Authors: Eric Sabo, Lane G. Gunderman, Benjamin Ide, Michael Vasmer, Guillaume
Dauphinais
- Abstract summary: A stabilizer code is defined by a set of parity-check operators, which are measured in order to infer information about errors that may have occurred.
Hastings proposed a method for reducing the parity checks of a stabilizer code, though it has previously only been studied in the regime.
Here, we focus on the regime of small-to-medium size codes suitable for quantum computing hardware.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Stabilizer codes are the most widely studied class of quantum
error-correcting codes and form the basis of most proposals for a
fault-tolerant quantum computer. A stabilizer code is defined by a set of
parity-check operators, which are measured in order to infer information about
errors that may have occurred. In typical settings, measuring these operators
is itself a noisy process and the noise strength scales with the number of
qubits involved in a given parity check, or its weight. Hastings proposed a
method for reducing the weights of the parity checks of a stabilizer code,
though it has previously only been studied in the asymptotic regime. Here, we
instead focus on the regime of small-to-medium size codes suitable for quantum
computing hardware. We provide both a fully explicit description of Hastings's
method and propose a substantially simplified weight reduction method that is
applicable to the class of quantum product codes. Our simplified method allows
us to reduce the check weights of hypergraph and lifted product codes to at
most six, while preserving the number of logical qubits and at least retaining
(in fact often increasing) the code distance. The price we pay is an increase
in the number of physical qubits by a constant factor, but we find that our
method is much more efficient than Hastings's method in this regard. We
benchmark the performance of our codes in a photonic quantum computing
architecture based on GKP qubits and passive linear optics, finding that our
weight reduction method substantially improves code performance.
Related papers
- Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning [0.5524804393257919]
We introduce a versatile and computationally efficient approach to stabilizer code weight reduction based on reinforcement learning (RL)
Our approach demonstrates savings in physical qubit overhead compared to existing results by 1 to 2 orders of magnitude for weight 6 codes.
arXiv Detail & Related papers (2025-02-20T09:05:34Z) - Quantum subspace verification for error correction codes [13.856955493134908]
We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets.
For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced.
By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
arXiv Detail & Related papers (2024-10-16T13:28:33Z) - 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) - Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - 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) - 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) - 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) - Neural Belief Propagation Decoding of Quantum LDPC Codes Using
Overcomplete Check Matrices [60.02503434201552]
We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix.
This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
arXiv Detail & Related papers (2022-12-20T13:41:27Z) - Quantum Worst-Case to Average-Case Reductions for All Linear Problems [66.65497337069792]
We study the problem of designing worst-case to average-case reductions for quantum algorithms.
We provide an explicit and efficient transformation of quantum algorithms that are only correct on a small fraction of their inputs into ones that are correct on all inputs.
arXiv Detail & Related papers (2022-12-06T22:01:49Z) - Low-overhead quantum error correction codes with a cyclic topology [0.0]
We propose a resource-efficient scaling of a five-qubit perfect code with cyclic stabilizers for small distances on the ring architecture.
We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.
arXiv Detail & Related papers (2022-11-06T12:22:23Z) - Efficient and robust certification of genuine multipartite entanglement
in noisy quantum error correction circuits [58.720142291102135]
We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME)
We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME.
We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
arXiv Detail & Related papers (2020-10-06T18:00:07Z) - Efficiently computing logical noise in quantum error correcting codes [0.0]
We show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise.
We derive general methods for reducing the computational complexity of the exact effective logical noise by many orders of magnitude.
arXiv Detail & Related papers (2020-03-23T19:40:56Z)
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.