Scalable quantum error correction code on a ring topology of qubits
- URL: http://arxiv.org/abs/2211.03094v1
- Date: Sun, 6 Nov 2022 12:22:23 GMT
- Title: Scalable quantum error correction code on a ring topology of qubits
- Authors: Ilya. A. Simakov and Ilya. S. Besedin
- Abstract summary: We propose a linear scalable code of the permutative stabilizers for small distances on the ring architecture.
We present the way to construct the quantum circuit of the code and provide numerical simulation that demonstrate the exponential logical error rate suppression.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum error correction is an important ingredient for scalable quantum
computing. Stabilizer codes are one of the most promising and straightforward
ways to correct quantum errors, since they do not require excessive complexity
of physical qubits, are convenient for logical operations, and improve
performance with increasing the involved qubits number. Here, we propose a
linear scalable code of the permutative stabilizers for small distances on the
ring architecture, which takes into account the topological features of the
superconducting platform. We present the way to construct the quantum circuit
of the code and provide numerical simulation that demonstrate the exponential
logical error rate suppression.
Related papers
- Transversal CNOT gate with multi-cycle error correction [1.7359033750147501]
A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that computers cannot accomplish within a reasonable time frame, achieving quantum advantage.
The vulnerability of the current generation of quantum processors to errors poses a significant challenge towards executing complex and deep quantum circuits required for practical problems.
Our work establishes the feasibility of employing logical CNOT gates alongside error detection on a superconductor-based processor using current generation quantum hardware.
arXiv Detail & Related papers (2024-06-18T04:50:15Z) - Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians.
We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes.
We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
arXiv Detail & Related papers (2024-01-11T23:56:29Z) - Near-Term Distributed Quantum Computation using Mean-Field Corrections
and Auxiliary Qubits [77.04894470683776]
We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production.
We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
arXiv Detail & Related papers (2023-09-11T18:00:00Z) - Hardness of braided quantum circuit optimization in the surface code [0.1759008116536278]
Large-scale quantum information processing requires the use of quantum error codes to mitigate the effects of noise in quantum devices.
Topological error-correcting codes, such as surface codes, are promising candidates as they can be implemented using only local interactions in a two-dimensional array of physical qubits.
However, error correction also introduces a significant overhead in time, the number of physical qubits, and the number of physical gates.
arXiv Detail & Related papers (2023-02-01T06:35:50Z) - 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 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) - 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) - Erasure conversion for fault-tolerant quantum computing in alkaline
earth Rydberg atom arrays [3.575043595126111]
We propose a qubit encoding and gate protocol for $171$Yb neutral atom qubits that converts the dominant physical errors into erasures.
We estimate that 98% of errors can be converted into erasures.
arXiv Detail & Related papers (2022-01-10T18:56:31Z) - Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal
Resource [4.354697470999286]
We propose a new fast and robust geometric scheme, with the decoherence-free-subspace encoding, and present its physical implementation on superconducting quantum circuits.
Our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.
arXiv Detail & Related papers (2021-12-16T12:10:41Z) - 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) - Deterministic correction of qubit loss [48.43720700248091]
Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors.
We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
arXiv Detail & Related papers (2020-02-21T19:48:53Z)
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.