English
Related papers

Related papers: Mitigating Coherent Noise by Balancing Weight-2 $Z…

200 papers

We investigate stabilizer codes with carrier qudits of equal dimension $D$, an arbitrary integer greater than 1. We prove that there is a direct relation between the dimension of a qudit stabilizer code and the size of its corresponding…

Quantum Physics · Physics 2015-03-17 Vlad Gheorghiu

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

Magic state distillation and the Shor factoring algorithm make essential use of logical diagonal gates. We introduce a method of synthesizing CSS codes that realize a target logical diagonal gate at some level $l$ in the Clifford hierarchy.…

Quantum Physics · Physics 2021-10-28 Jingzhen Hu , Qingzhong Liang , Robert Calderbank

Quantum computers require error correction to achieve universal quantum computing. However, current decoding of quantum error-correcting codes relies on classical computation, which is slower than quantum operations in superconducting…

Quantum Physics · Physics 2025-06-11 Pan Zhang

Quantum error mitigation techniques mimic noiseless quantum circuits by running several related noisy circuits and combining their outputs in particular ways. How well such techniques work is thought to depend strongly on how noisy the…

Quantum Physics · Physics 2026-02-12 David Layden , Bradley Mitchell , Karthik Siva

To successfully execute large-scale algorithms, a quantum computer will need to perform its elementary operations near perfectly. This is a fundamental challenge since all physical qubits suffer a considerable level of noise. Moreover, real…

Quantum Physics · Physics 2023-06-29 Armands Strikis , Simon C. Benjamin , Benjamin J. Brown

Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could…

Information Theory · Computer Science 2021-08-20 Narayanan Rengaswamy , Robert Calderbank , Michael Newman , Henry D. Pfister

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited…

Quantum Physics · Physics 2026-04-03 Julio C. Magdalena de la Fuente , Noa Feldman , Jens Eisert , Andreas Bauer

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…

Compared to the more widely studied Pauli errors, coherent errors present several new challenges in quantum computing and quantum error correction (QEC). For example, coherent errors may interfere constructively over a long circuit and…

Quantum Physics · Physics 2025-08-08 Kathleen Chang , Qile Su , Shruti Puri

Quantum error correcting (QEC) codes protect quantum information against environmental noise. Computational errors caused by the environment change the quantum state within the qubit subspace, whereas quantum erasures correspond to the loss…

Quantum Physics · Physics 2025-11-26 Luis Colmenarez , Seyong Kim , Markus Müller

We study the implementation of fault-tolerant logical Clifford gates on stabilizer quantum error correcting codes based on their symmetries. Our approach is to map the stabilizer code to a binary linear code, compute its automorphism group,…

Quantum Physics · Physics 2025-05-12 Hasan Sayginel , Stergios Koutsioumpas , Mark Webster , Abhishek Rajput , Dan E Browne

We study properties of stabilizer codes that permit a local description on a regular D-dimensional lattice. Specifically, we assume that the stabilizer group of a code (the gauge group for subsystem codes) can be generated by local Pauli…

Quantum Physics · Physics 2009-11-13 Sergey Bravyi , Barbara Terhal

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

Recently, Bravyi and K\"onig have shown that there is a tradeoff between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a…

Quantum Physics · Physics 2015-01-14 Fernando Pastawski , Beni Yoshida

We introduce a methodology for generating random multi-qubit stabilizer codes based on solving a constraint satisfaction problem (CSP) on random bipartite graphs. This framework allows us to enforce stabilizer commutation, $X/Z$ balancing,…

Quantum Physics · Physics 2023-04-26 Maxime Tremblay , Guillaume Duclos-Cianci , Stefanos Kourtis

We present an entirely 2D transversal realization of phase gates at any level of the Clifford hierarchy, and beyond, using non-Abelian surface codes. Our construction encodes a logical qubit in the quantum double $D(G)$ of a non-Abelian…

Quantum Physics · Physics 2026-01-19 Alison Warman , Sakura Schafer-Nameki

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

Although qubit coherence times and gate fidelities are continuously improving, logical encoding is essential to achieve fault tolerance in quantum computing. In most encoding schemes, correcting or tracking errors throughout the computation…

We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a…

‹ Prev 1 4 5 6 7 8 10 Next ›