English
Related papers

Related papers: Clifford-deformed Surface Codes

200 papers

In addition to their applications in data storage, communications systems, and consumer electronics, LCD codes -- a class of linear codes -- have been employed in cryptography recently. LCD cyclic codes were referred to as reversible cyclic…

Information Theory · Computer Science 2017-01-03 Chengju Li , Cunsheng Ding , Shuxing Li

The surface code is a prominent topological error-correcting code exhibiting high fault-tolerance accuracy thresholds. Conventional schemes for error correction with the surface code place qubits on a planar grid and assume native CNOT…

Quantum Physics · Physics 2020-10-28 Rui Chao , Michael E. Beverland , Nicolas Delfosse , Jeongwan Haah

We propose several optimizations of the CliNR partial error correction scheme which implements Clifford circuits by consuming a resource state. Errors are corrected by measuring a sequence of Pauli operators that we refer to as the…

Quantum Physics · Physics 2025-08-27 Edwin Tham , Nicolas Delfosse

Quantum Error Correction (QEC) is regarded as the most promising path to quantum advantage. The success of QEC relies on achieving quantum gate fidelities below the error threshold of the QEC code, while accurately decoding errors through…

Quantum Physics · Physics 2026-02-13 Yaniv Kurman , Lior Ella , Nir Halay , Oded Wertheim , Yonatan Cohen

Recent discoveries in asymptotically good quantum codes have intensified research on their application in quantum computation and fault-tolerant operations. This study focuses on the addressability problem within CSS codes: what circuits…

Quantum Physics · Physics 2025-02-26 Jérôme Guyot , Samuel Jaques

Random linear codes are a workhorse in coding theory, and are used to show the existence of codes with the best known or even near-optimal trade-offs in many noise models. However, they have little structure besides linearity, and are not…

Computational Complexity · Computer Science 2024-07-11 Venkatesan Guruswami , Jonathan Mosheiff

Recently, a purely quantum version of polar codes has been proposed in [1] based on a quantum channel combining and splitting procedure, where a randomly chosen two-qubit Clifford unitary acts as channel combining operation. Here, we…

Quantum Physics · Physics 2025-03-12 Ashutosh Goswami , Mehdi Mhalla , Valentin Savin

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

Three-dimensional (3D) color codes have advantages for fault-tolerant quantum computing, such as protected quantum gates with relatively low overhead and robustness against imperfect measurement of error syndromes. Here we investigate the…

We introduce and analyze a new type of decoding algorithm called General Color Clustering (GCC), based on renormalization group methods, to be used in qudit color codes. The performance of this decoder is analyzed under code capacity…

Quantum Physics · Physics 2017-11-20 Jacob Marks , Tomas Jochym-O'Connor , Vlad Gheorghiu

Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant…

Message-passing iterative decoders for low-density parity-check (LDPC) block codes are known to be subject to decoding failures due to so-called pseudo-codewords. These failures can cause the large signal-to-noise ratio performance of…

Information Theory · Computer Science 2007-07-13 Roxana Smarandache , Ali E. Pusane , Pascal O. Vontobel , Daniel J. Costello

Leveraging noise bias, where phase-flip errors dominate over bit-flips, can drastically reduce the hardware overhead of fault-tolerant quantum computation, but existing approaches require bias-preserving CNOT gates whose implementation…

Quantum Physics · Physics 2026-05-26 Christophe Vuillot , Diego Ruiz , Jérémie Guillaud , Mazyar Mirrahimi

Quantum error correction and fault-tolerance have provided the possibility for large scale quantum computations without a detrimental loss of quantum information. A very natural class of gates for fault-tolerant quantum computation is the…

Quantum Physics · Physics 2013-03-12 Tomas Jochym-O'Connor , Yafei Yu , Bassam Helou , Raymond Laflamme

Quantum information science strives to leverage the quantum-mechanical nature of our universe in order to achieve large improvements in certain information processing tasks. In deep-space optical communications, current receivers for the…

Quantum Physics · Physics 2020-04-16 Narayanan Rengaswamy

A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…

Information Theory · Computer Science 2016-02-16 F. Shirani , M. Heidari , S. S. Pradhan

A variety of past research on superconducting qubits shows that these devices exhibit considerable variation and thus cannot be accurately depicted by a uniform noise model. To combat this often unrealistic picture of homogeneous noise in…

Quantum Physics · Physics 2026-03-04 Jacob S. Palmer , Kaitlin N. Smith

We evaluate the usefulness of holographic stabilizer codes for practical purposes by studying their allowed sets of fault-tolerantly implementable gates. We treat them as subsystem codes and show that the set of transversally implementable…

Quantum Physics · Physics 2021-09-08 Sam Cree , Kfir Dolev , Vladimir Calvera , Dominic J. Williamson

Quantum error correction is instrumental in protecting quantum systems from noise in quantum computing and communication settings. Pauli channels can be efficiently simulated and threshold values for Pauli error rates under a variety of…

Quantum Physics · Physics 2017-04-25 Christopher Chamberland , Joel J. Wallman , Stefanie Beale , Raymond Laflamme

We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are…