Quantum Low-Density Parity-Check Codes
- URL: http://arxiv.org/abs/2103.06309v2
- Date: Mon, 25 Oct 2021 17:59:22 GMT
- Title: Quantum Low-Density Parity-Check Codes
- Authors: Nikolas P. Breuckmann and Jens Niklas Eberhardt
- Abstract summary: We discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes.
We introduce the zoo of LDPC quantum codes and discuss their potential for making quantum computers robust against noise.
- Score: 9.13755431537592
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum error correction is an indispensable ingredient for scalable quantum
computing. In this Perspective we discuss a particular class of quantum codes
called low-density parity-check (LDPC) quantum codes. The codes we discuss are
alternatives to the surface code, which is the currently leading candidate to
implement quantum fault-tolerance. We introduce the zoo of LDPC quantum codes
and discuss their potential for making quantum computers robust against noise.
In particular, we explain recent advances in the theory of LDPC quantum codes
related to certain product constructions and discuss open problems in the
field.
Related papers
- Quantum Information Processing with Molecular Nanomagnets: an introduction [49.89725935672549]
We provide an introduction to Quantum Information Processing, focusing on a promising setup for its implementation.
We introduce the basic tools to understand and design quantum algorithms, always referring to their actual realization on a molecular spin architecture.
We present some examples of quantum algorithms proposed and implemented on a molecular spin qudit hardware.
arXiv Detail & Related papers (2024-05-31T16:43:20Z) - 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) - Shaping photons: quantum computation with bosonic cQED [41.94295877935867]
We discuss the progress, challenges, and future directions in building a bosonic cQED quantum computer.
We conclude with our views of the key challenges that lie on the horizon, as well as scientific and cultural strategies for overcoming them.
arXiv Detail & Related papers (2023-11-07T09:59:57Z) - Single-shot decoding of good quantum LDPC codes [38.12919328528587]
We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise.
We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
arXiv Detail & Related papers (2023-06-21T18:00:01Z) - Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources.
The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
arXiv Detail & Related papers (2022-09-16T02:37:32Z) - Quantum Error Correction: Noise-adapted Techniques and Applications [2.122752621320654]
Theory of quantum error correction provides a scheme by which the effects of such noise on quantum states can be mitigated.
We focus on recent theoretical advances in the domain of noise-adapted QEC, and highlight some key open questions.
We conclude with a review of the theory of quantum fault tolerance which gives a quantitative estimate of the physical noise threshold below which error-resilient quantum computation is possible.
arXiv Detail & Related papers (2022-07-31T05:23:50Z) - Error Correction for Reliable Quantum Computing [0.0]
We study a phenomenon exclusive to the quantum paradigm, known as degeneracy, and its effects on the performance of sparse quantum codes.
We present methods to improve the performance of a specific family of sparse quantum codes in various different scenarios.
arXiv Detail & Related papers (2022-02-17T11:26:52Z) - 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) - Changing the Local-Dimension of an Entanglement-Assisted Stabilizer Code
Removes Entanglement Need [0.0]
We show that codes for qudit quantum computers can be derived from already known codes.
This could prove to be useful for fault-tolerant qudit, and even qubit, quantum computers.
arXiv Detail & Related papers (2020-12-24T18:52:52Z) - Bosonic quantum error correction codes in superconducting quantum
circuits [0.0]
We review the recent progress of the bosonic codes, including the Gottesman-Kitaev-Preskill codes, cat codes, and binomial codes.
We discuss the opportunities of bosonic codes in various quantum applications, ranging from fault-tolerant quantum computation to quantum metrology.
arXiv Detail & Related papers (2020-10-17T02:58:37Z) - Quantum error-correcting codes and their geometries [0.6445605125467572]
This article aims to introduce the reader to the underlying mathematics and geometry of quantum error correction.
We go on to construct quantum codes: firstly qubit stabilizer codes, then qubit non-stabilizer codes, and finally codes with a higher local dimension.
This allows one to deduce the parameters of the code efficiently, deduce the inequivalence between codes that have the same parameters, and presents a useful tool in deducing the feasibility of certain parameters.
arXiv Detail & Related papers (2020-07-12T13:57:39Z)
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.