English
Related papers

Related papers: Decoding general error correcting codes and the ro…

200 papers

We discuss single-shot decoding of quantum Calderbank-Shor-Steane codes with faulty syndrome measurements. We state the problem as a joint source-channel coding problem. By adding redundant rows to the code's parity-check matrix we obtain…

Quantum Physics · Physics 2024-03-20 Aldo Cumitini , Stefano Tinelli , Balázs Matuz , Francisco Lázaro , Luca Barletta

We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances…

Quantum Physics · Physics 2009-11-10 H. Ollivier , J. -P. Tillich

We introduce a high-level graphical framework for designing and analysing quantum error correcting codes, centred on what we term the coherent parity check (CPC). The graphical formulation is based on the diagrammatic tools of the…

Quantum Physics · Physics 2023-08-21 Nicholas Chancellor , Aleks Kissinger , Joschka Roffe , Stefan Zohren , Dominic Horsman

We describe the popular BB84 protocol and critically examine its security proof as presented by Shor and Preskill. The proof requires the use of quantum error correcting codes called the Calderbank-Shor-Steanne (CSS) quantum codes. These…

Quantum Physics · Physics 2014-09-05 Ramesh Bhandari

In this paper we investigate the encoding of operator quantum error correcting codes i.e. subsystem codes. We show that encoding of subsystem codes can be reduced to encoding of a related stabilizer code making it possible to use all the…

Quantum Physics · Physics 2008-07-01 Pradeep Kiran Sarvepalli , Andreas Klappenecker

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…

Quantum Physics · Physics 2007-05-23 Daniel Gottesman

Quantum secret-sharing and quantum error-correction schemes rely on multipartite decoding protocols, yet the non-local operations involved are challenging and sometimes infeasible. Here we construct a quantum secret-sharing protocol with a…

Quantum Physics · Physics 2013-09-02 Vlad Gheorghiu , Barry C. Sanders

Quantum error correction is an essential ingredient for universal quantum computing. Despite tremendous experimental efforts in the study of quantum error correction, to date, there has been no demonstration in the realisation of universal…

Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the…

Quantum Physics · Physics 2009-10-31 H. F. Chau

In this paper, we propose a novel message-passing decoding approach that leverages the degeneracy of quantum low-density parity-check codes to enhance decoding performance, eliminating the need for serial scheduling or post-processing. Our…

Quantum Physics · Physics 2025-01-10 Dimitris Chytas , Nithin Raveendran , Bane Vasic

Scaling quantum computing to practical applications necessitates reliable quantum error correction. Although numerous correction codes have been proposed, the overall correction efficiency critically limited by the decode algorithms. We…

Quantum Physics · Physics 2025-06-04 Gengyuan Hu , Wanli Ouyang , Chao-Yang Lu , Chen Lin , Han-Sen Zhong

Implementing robust quantum error correction (QEC) is imperative for harnessing the promise of quantum technologies. We introduce a framework that takes {\it any} classical code and explicitly constructs the corresponding QEC code. Our…

Quantum Physics · Physics 2024-11-27 Ramis Movassagh , Yingkai Ouyang

To improve the efficiency of the encoding and the decoding is the important problem in the quantum error correction. In a preceding work, a general algorithm for decoding the stabilizer code is shown. This paper will show an decoding which…

Quantum Physics · Physics 2007-05-23 Kenichiro Furuta

Recent years have seen rapid development in the subject of quantum coding theory, with breakthroughs on many exciting classes of codes, including quantum LDPC codes, quantum locally testable codes, and quantum codes with interesting…

Quantum Physics · Physics 2026-03-06 Adam Wills , Ting-Chun Lin , Rachel Yun Zhang , Min-Hsiu Hsieh

Quantum error correction (QEC) is required for large-scale computation, but incurs a significant resource overhead. Recent advances have shown that by jointly decoding logical qubits in algorithms composed of transversal gates, the number…

A promising strategy to protect quantum information from noise-induced errors is to encode it into the low-energy states of a topological quantum memory device. However, readout errors from such memory under realistic settings is less…

Quantum Physics · Physics 2024-01-15 Weishun Zhong , Oles Shtanko , Ramis Movassagh

The goal of this paper is to review the theoretical basis for achieving a faithful quantum information transmission and processing in the presence of noise. Initially encoding and decoding, implementing gates and quantum error correction…

Quantum Physics · Physics 2007-05-23 P. J. Salas

Quantum error correction (QEC) is essential for scalable quantum computing. However, it requires classical decoders that are fast and accurate enough to keep pace with quantum hardware. While quantum low-density parity-check codes have…

Quantum Physics · Physics 2026-04-10 Andi Gu , J. Pablo Bonilla Ataides , Mikhail D. Lukin , Susanne F. Yelin

Collective coherent noise poses challenges for fault-tolerant quantum error correction (FTQEC), as it falls outside the usual stochastic noise models. While constant excitation (CE) codes can naturally avoid coherent noise, a complete…

Quantum Physics · Physics 2025-07-15 Ching-Yi Lai , Pei-Hao Liou , Yingkai Ouyang

Random classical linear codes are widely believed to be hard to decode. While slightly sub-exponential time algorithms exist when the coding rate vanishes sufficiently rapidly, all known algorithms at constant rate require exponential time.…