English
Related papers

Related papers: Hard decoding algorithm for optimizing thresholds …

200 papers

Many quantum information tasks rely on entanglement, which is used as a resource, for example, to enable efficient and secure communication. Typically, noise, accompanied by loss of entanglement, reduces the efficiency of quantum protocols.…

The presence of noise is currently one of the main obstacles to achieving large-scale quantum computation. Strategies to characterise and understand noise processes in quantum hardware are a critical part of mitigating it, especially as the…

Quantum Physics · Physics 2023-12-06 Emilio Onorati , Tamara Kohler , Toby S. Cubitt

A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the…

Quantum Physics · Physics 2007-05-23 Ben W. Reichardt

Tailored topological stabilizer codes in two dimensions have been shown to exhibit high storage threshold error rates and improved subthreshold performance under biased Pauli noise. Three-dimensional (3D) topological codes can allow for…

Quantum Physics · Physics 2023-09-22 Eric Huang , Arthur Pesah , Christopher T. Chubb , Michael Vasmer , Arpit Dua

The constituent parts of a quantum computer are inherently vulnerable to errors. To this end we have developed quantum error-correcting codes to protect quantum information from noise. However, discovering codes that are capable of a…

Quantum Physics · Physics 2016-08-24 Benjamin J. Brown , Naomi H. Nickerson , Dan E. Browne

Decoherence severely limits the performance of quantum processors, posing challenges to reliable quantum computation. Probabilistic error cancellation, a quantum error mitigation method, counteracts noise by quasiprobabilistically…

Quantum Physics · Physics 2025-07-17 Tian-Ren Jin , Kai Xu , Yu-Ran Zhang , Heng Fan

The main ideas of quantum error correction are introduced. These are encoding, extraction of syndromes, error operators, and code construction. It is shown that general noise and relaxation of a set of 2-state quantum systems can always be…

Quantum Physics · Physics 2007-05-23 A. M. Steane

A common approach to studying the performance of quantum error correcting codes is to assume independent and identically distributed single-qubit errors. However, the available experimental data shows that realistic errors in modern…

Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and relaxation, which is irreversible. Current studies focus on…

Quantum Physics · Physics 2026-04-30 Yunos El Kaderi , Andreas Honecker , Iryna Andriyanova

Error-mitigation techniques such as probabilistic error cancellation and zero-noise extrapolation benefit from accurate noise models. The sparse Pauli-Lindblad noise model is one of the most successful models for those applications. In…

Quantum Physics · Physics 2024-12-11 Ewout van den Berg , Pawel Wocjan

Departing from traditional communication theory where decoding algorithms are assumed to perform without error, a system where noise perturbs both computational devices and communication channels is considered here. This paper studies…

Information Theory · Computer Science 2010-05-31 Lav R. Varshney

We discuss a method to adapt the codeword stabilized (CWS) quantum code framework to the problem of finding asymmetric quantum codes. We focus on the corresponding Pauli error models for amplitude damping noise and phase damping noise. In…

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

Motivated by the recent advancement of quantum processors, we investigate quantum approximate optimization algorithm (QAOA) to employ quasi-maximum-likelihood (ML) decoding of classical channel codes. QAOA is a hybrid quantum-classical…

Information Theory · Computer Science 2019-03-07 Toshiki Matsumine , Toshiaki Koike-Akino , Ye Wang

Decoding algorithms based on approximate tensor network contraction have proven tremendously successful in decoding 2D local quantum codes such as surface/toric codes and color codes, effectively achieving optimal decoding accuracy. In this…

Quantum Physics · Physics 2024-10-10 Christophe Piveteau , Christopher T. Chubb , Joseph M. Renes

We study the performance of distance-three surface code layouts under realistic multi-parameter noise models. We first calculate their thresholds under depolarizing noise. We then compare a Pauli-twirl approximation of amplitude and phase…

Quantum Physics · Physics 2014-12-12 Yu Tomita , Krysta M. Svore

Quantum error mitigation (QEM) is a promising technique of protecting hybrid quantum-classical computation from decoherence, but it suffers from sampling overhead which erodes the computational speed. In this treatise, we provide a…

Quantum Physics · Physics 2022-05-17 Yifeng Xiong , Daryus Chandra , Soon Xin Ng , Lajos Hanzo

Quantum error-correcting codes protect fragile quantum information by encoding it redundantly, but identifying codes that perform well in practice with minimal overhead remains difficult due to the combinatorial search space and the high…

Quantum Physics · Physics 2026-01-27 Yihua Chengyu , Richard Meister , Conor Carty , Sheng-Ku Lin , Roberto Bondesan

Noise is both ubiquitous and generally deleterious in settings where precision is required. This is especially true in the quantum technology sector where system utility typically decays rapidly under its influence. Understanding the noise…

Error mitigation (EM) methods are crucial for obtaining reliable results in the realm of noisy intermediate-scale quantum (NISQ) computers, where noise significantly impacts output accuracy. Some EM protocols are particularly efficient for…

Quantum Physics · Physics 2026-03-03 Thibault Scoquart , Hugo Perrin , Kyrylo Snizhko

The quantum hashing bound guarantees that rates up to $1-H(p_I, p_X, p_Y, p_Z)$ are achievable for memoryless Pauli channels, but it is not generally tight. A known way to improve achievable rates for certain asymmetric Pauli channels is to…

Information Theory · Computer Science 2026-05-14 Tyler Kann , Matthieu R. Bloch , Shrinivas Kudekar , Ruediger Urbanke