English
Related papers

Related papers: Abelian multi-cycle codes for single-shot error co…

200 papers

We consider an approach to fault tolerant quantum computing based on a simple error detecting code operating as the substrate for a conventional surface code. We develop a customised decoder to process the information about the likely…

Quantum Physics · Physics 2019-12-11 Xiaosi Xu , Qi Zhao , Xiao Yuan , Simon C. Benjamin

Generalized bicycle (GB) codes have emerged as a promising class of quantum error-correcting codes with practical decoding capabilities. While numerous asymptotically good quantum codes and quantum low-density parity-check code…

Quantum Physics · Physics 2025-05-12 Olai Å. Mostad , Hsuan-Yin Lin , Eirik Rosnes , De-Shih Lee , Ching-Yi Lai

We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…

Information Theory · Computer Science 2019-02-15 Carlos Galindo , Fernando Hernando , Ryutaroh Matsumoto

In this paper, we propose a sufficient condition for a family of 2-generator self-orthogonal quasi-cyclic codes with respect to Hermitian inner product. Supported in the Hermitian construction, we show algebraic constructions of good…

Information Theory · Computer Science 2025-11-25 Liangdong Lu , Gaochi Zhang , Ganyu Feng , Wenzheng Ma

Generalized low-density parity-check (GLDPC) codes, where single parity-check constraints on the code bits are replaced with generalized constraints (an arbitrary linear code), are a promising class of codes for low-latency communication.…

Information Theory · Computer Science 2025-08-12 Roxana Smarandache , David G. M. Mitchell , Anthony Gómez-Fonseca

We study the problem of transmission of information over classical and classical-quantum channels in the one-shot regime where the underlying codes are constrained to be group codes. In the achievability part, we introduce a new input…

Information Theory · Computer Science 2024-06-21 James Chin-Jen Pang , Sandeep Pradhan , Hessam Mahdavifar

Post-selection strategies that discard low-confidence computational results can significantly improve the effective fidelity of quantum error correction at the cost of reduced acceptance rates, which can be particularly useful for offline…

Quantum Physics · Physics 2026-01-27 Seok-Hyung Lee , Lucas H. English , Stephen D. Bartlett

Quantum low-density parity check (QLDPC) codes can significantly reduce the overhead of quantum computing, provided the methods for performing logical operations do not require substantial space and time resources. A popular method for…

Quantum Physics · Physics 2025-11-21 Paul Webster , Samuel C. Smith , Lawrence Z. Cohen

The discovery of the family of balanced product codes was pivotal in the subsequent development of 'good' low density quantum error correcting codes that have optimal scaling of the key parameters of distance and storage density. We review…

Quantum Physics · Physics 2025-06-12 Heather Leitch , Alastair Kay

Discovering low-overhead quantum error-correcting codes is of significant interest for fault-tolerant quantum computation. For hardware capable of long-range connectivity, the bivariate bicycle codes offer significant overhead reduction…

Quantum Physics · Physics 2026-01-15 Jinkang Guo , Yifan Hong , Adam Kaufman , Andrew Lucas

Autonomous quantum error correction (AQEC) protects logical qubits by engineered dissipation and thus circumvents the necessity of frequent, error-prone measurement-feedback loops. Bosonic code spaces, where single-photon loss represents…

Quantum Physics · Physics 2023-11-28 Yexiong Zeng , Zheng-Yang Zhou , Enrico Rinaldi , Clemens Gneiting , Franco Nori

Quantum error-correcting codes with asymptotically lower overheads than the surface code require nonlocal connectivity. Leveraging multilayer routing and long-range coupling capabilities in superconducting qubit hardware, we develop…

Quantum low-density parity-check codes are a promising candidate for fault-tolerant quantum computing with considerably reduced overhead compared to the surface code. However, the lack of a practical decoding algorithm remains a barrier to…

Orthogonal geometric constructions are the basis of many many quantum error-correcting codes (QEC), but strict orthogonality constraints limit design flexibility and resource efficiency. We introduce a quasi-orthogonal geometric framework…

To produce an operable quantum computer that is made with imperfect hardware, we must design and test scalable quantum error correcting codes that are suited for the devices we can build and, in unison, develop decoding strategies that…

We introduce a new class of qubit codes that we call Evenbly codes, building on a previous proposal of hyperinvariant tensor networks. Its tensor network description consists of local, non-perfect tensors describing CSS codes interspersed…

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, a new method for construct quantum…

Quantum Physics · Physics 2022-03-21 Tao Wang , Tongjiang Yan , Shiwen Sun

Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…

Information Theory · Computer Science 2014-08-19 Yixuan Xie , Jinhong Yuan , Yuichiro Fujiwara

Single-shot quantum error correction has the potential to speed up quantum computations by removing the need for multiple rounds of syndrome extraction in order to be fault-tolerant. Using Quantinuum's H2 trapped-ion quantum computer, we…

Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes…

Information Theory · Computer Science 2018-05-03 Asit Kumar Pradhan , Andrew Thangaraj