English
Related papers

Related papers: Optimal Single-Shot Decoding of Quantum Codes

200 papers

Quantum data-syndrome (QDS) codes are a class of quantum error-correcting codes that protect against errors both on the data qubits and on the syndrome itself via redundant measurement of stabilizer group elements. One way to define a QDS…

Quantum Physics · Physics 2025-08-08 Eren Guttentag , Andrew Nemec , Kenneth R. Brown

A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code…

Quantum Physics · Physics 2015-04-16 Todd A. Brun , Yi-Cong Zheng , Kung-Chuan Hsu , Joshua Job , Ching-Yi Lai

A classical coding across a block of logical qubits is presented. We characterize subgroups of the product stabilizer group on a block of logical qubits corresponding to dual codes of classical error correcting codes. We prove conditions on…

Quantum Physics · Physics 2020-08-28 Dennis Lucarelli

We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial "check" measurements on the system. In general, this problem is NP-hard. However,…

Quantum Physics · Physics 2009-11-13 David Poulin

Fracton topological phases have a large number of materialized symmetries that enforce a rigid structure on their excitations. Remarkably, we find that the symmetries of a quantum error-correcting code based on a fracton phase enable us to…

Quantum Physics · Physics 2020-04-02 Benjamin J. Brown , Dominic J. Williamson

Quantum Tanner codes constitute a family of quantum low-density parity-check (LDPC) codes with good parameters, i.e., constant encoding rate and relative distance. In this article, we prove that quantum Tanner codes also facilitate…

Quantum Physics · Physics 2024-04-15 Shouzhen Gu , Eugene Tang , Libor Caha , Shin Ho Choe , Zhiyang He , Aleksander Kubica

Quantum low-density parity-check codes are promising candidates for low-overhead fault-tolerant quantum computing, but degeneracy is known to impair the convergence of belief-propagation (BP) decoding of these codes. In this work, we show…

Secure quantum networks are a bedrock requirement for developing a future quantum internet. However, quantum channels are susceptible to channel noise that introduce errors in the transmitted data. The traditional approach to providing…

Quantum Physics · Physics 2025-05-30 Nitin Jha , Abhishek Parakh , Mahadevan Subramaniam

Quantum hardware rarely suffers equal amounts of bit-flip ($X$) and phase-flip ($Z$) errors; one type is often much more common than the other. A code that is ``bias-tailored'' can exploit this imbalance, lowering the fault-tolerance…

Quantum Physics · Physics 2025-07-04 Shixin Wu , Todd A. Brun , Daniel A. Lidar

Quantum errors are primarily detected and corrected using the measurement of syndrome information which itself is an unreliable step in practical error correction implementations. Typically, such faulty or noisy syndrome measurements are…

Quantum Physics · Physics 2022-05-06 Nithin Raveendran , Narayanan Rengaswamy , Asit Kumar Pradhan , Bane Vasić

Fault tolerance in quantum protocols requires contributions from error-correcting codes and their suitable decoders. Quantum Low-Density Parity Check (QLDPC) codes are one of the most explored quantum codes that have good coding rate and…

Quantum Physics · Physics 2026-04-24 Mainak Bhattacharyya , Ankur Raina

Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. QECC, as its classical counterpart (ECC), enables the reduction of error rates, by distributing quantum logical information across…

Quantum Physics · Physics 2023-12-12 Yoni Choukroun , Lior Wolf

We construct and analyze a family of low-density parity check (LDPC) quantum codes with a linear encoding rate, polynomial scaling distance and efficient decoding schemes. The code family is based on tessellations of closed,…

Quantum Physics · Physics 2023-07-06 Nikolas P. Breuckmann , Vivien Londe

Can robustness against experimental imperfections and noise be embedded into a quantum simulation? In this paper, we report on a special case in which this is possible. A spin chain can be engineered such that, in the absence of…

Quantum Physics · Physics 2016-04-15 Alastair Kay

Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…

Quantum Physics · Physics 2013-05-29 Gregory M. Crosswhite , Dave Bacon

Topological quantum error-correcting codes are a promising candidate for building fault-tolerant quantum computers. Decoding topological codes optimally, however, is known to be a computationally hard problem. Various decoders have been…

Quantum Physics · Physics 2020-04-01 Milap Sheth , Sara Zafar Jafarzadeh , Vlad Gheorghiu

Decoders that provide an estimate of the probability of a logical failure conditioned on the error syndrome ("soft-output decoders") can reduce the overhead cost of fault-tolerant quantum memory and computation. In this work, we construct…

Quantum Physics · Physics 2024-06-04 Nadine Meister , Christopher A. Pattison , John Preskill

We discuss a method to construct quantum codes correcting amplitude damping errors via code concatenation. The inner codes are chosen as asymmetric Calderbank-Shor-Steane (CSS) codes. By concatenating with outer codes correcting symmetric…

Quantum Physics · Physics 2016-10-31 Tyler Jackson , Markus Grassl , Bei Zeng

Quantum repeater is the key technology enabler for long-distance quantum communication. To date, most of the existing quantum repeater protocols are designed based on specific quantum codes or graph states. In this paper, we propose a…

Quantum Physics · Physics 2022-10-20 Daoheng Niu , Yuxuan Zhang , Alireza Shabani , Hassan Shapourian

We study a one-shot joint source-channel coding setting where the source is encoded once and broadcast to $K$ decoders through independent channels. Success is predicated on at least one decoder recovering the source within a maximum…

Information Theory · Computer Science 2026-04-17 Joseph Rowan , Buu Phan , Ashish Khisti