English
Related papers

Related papers: Quantum stabilizer codes, lattices, and CFTs

200 papers

A short introduction to quantum error correction is given, and it is shown that zero-dimensional quantum codes can be represented as self-dual additive codes over GF(4) and also as graphs. We show that graphs representing several such codes…

Quantum Physics · Physics 2008-01-09 Lars Eirik Danielsen

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

Quantum Physics · Physics 2026-05-21 Ryohei Kobayashi , Guanyu Zhu , Po-Shen Hsin

This is a note from a series of lectures at Encuentro Colombiano de Computacion Cuantica, Universidad de los Andes, Bogota, Colombia, 2015. The purpose is to introduce additive quantum error correcting codes, with emphasis on the use of…

Quantum Physics · Physics 2019-04-01 Jeongwan Haah

Quantum Error-Correcting Codes (QECCs) play a crucial role in enhancing the robustness of quantum computing and communication systems against errors. Within the realm of QECCs, stabilizer codes, and specifically graph codes, stand out for…

Quantum Physics · Physics 2024-03-29 Zipeng Wu , Song Cheng , Bei Zeng

Operator quantum error correction is a recently developed theory that provides a generalized framework for active error correction and passive error avoiding schemes. In this paper, we describe these codes in the stabilizer formalism of…

Quantum Physics · Physics 2009-11-11 David Poulin

We develop a framework for the classification of invertible translation-invariant stabilizer codes modulo condensation and stabilization with simple codes. We introduce generalizations of the Pauli groups of local unitaries for quantum…

Mathematical Physics · Physics 2025-12-03 Roman Geiko , Georgii Shuklin

In this paper, we discuss the simple current orbifold of a rational Narain CFT (Narain RCFT). This is a method of constructing other rational CFTs from a given rational CFT, by ``orbifolding'' the global symmetry formed by a particular…

High Energy Physics - Theory · Physics 2024-02-09 Yuma Furuta

Two observations are given on the fidelity of schemes for quantum information processing. In the first one, we show that the fidelity of a symplectic (stabilizer) code, if properly defined, exactly equals the `probability' of the…

Quantum Physics · Physics 2007-05-23 Mitsuru Hamada

We present a set of efficiently implementable logical multi-qubit gates in concatenated quantum error correction codes using parity qubits. In particular, we show how fault-tolerant high-weight rotation gates of arbitrary angle can be…

Quantum Physics · Physics 2025-12-16 Anette Messinger , Christophe Goeller , Wolfgang Lechner

The general form of a 2D conformal field theory (CFT) correlator on a Euclidean Riemann surface, Lorentzian plane or Lorentzian cylinder is well-known. This paper describes the general form of 2- and 3-point CFT correlators on the…

High Energy Physics - Theory · Physics 2023-10-24 Walker Melton , Atul Sharma , Andrew Strominger

We extend the TFT construction of CFT correlators of [arXiv:hep-th/0204148] to so-called finite logarithmic CFTs for which the algebraic input data is no longer semisimple but still finite. More specifically, starting from the data of a…

Quantum Algebra · Mathematics 2025-12-03 Aaron Hofer , Ingo Runkel

A powerful method for analyzing quantum error-correcting codes is to map them onto classical statistical mechanics models. Such mappings have thus far mostly focused on static codes, possibly subject to repeated syndrome measurements.…

Quantum Physics · Physics 2026-02-19 Cory T. Aitchison , Benjamin Béri

In order to build a scalable quantum computer error correction will be required to reduce the impact of errors. Implementing error correction in the framework of measurement based computation manifests itself as the construction of fault…

Quantum Physics · Physics 2018-10-24 Naomi Nickerson , Héctor Bombín

An important measure of utility for a quantum code is the identification of which logical operations can be implemented fault-tolerantly on its codespace. We introduce a framework which leverages the automorphism groups of associated…

Quantum Physics · Physics 2026-04-03 Aisling Mac Aree , Mark Howard

We study the performance of common quantum stabilizer codes in the presence of asymmetric and correlated errors. Specifically, we consider the depolarizing noisy quantum memory channel and perform quantum error correction via the five and…

Quantum Physics · Physics 2015-05-19 Carlo Cafaro , Stefano Mancini

We prove that the natural isomorphism between GF(2^h) and GF(2)^h induces a bijection between stabiliser codes on n quqits with local dimension q=2^h and binary stabiliser codes on hn qubits. This allows us to describe these codes…

Combinatorics · Mathematics 2024-09-10 Simeon Ball , Edgar Moreno , Robin Simoens

Rational CFT's are classified by an integer $\ell$, the number of zeroes of the Wronskian of their characters in moduli space. For $\ell=0$ they satisfy non-singular modular-invariant differential equations, while for $\ell>0$ the…

High Energy Physics - Theory · Physics 2016-01-27 Harsha R. Hampapura , Sunil Mukhi

We discuss two-dimensional conformal field theories (CFTs) which are invariant under gauging a non-invertible global symmetry. At every point on the orbifold branch of $c=1$ CFTs, it is known that the theory is self-dual under gauging a…

High Energy Physics - Theory · Physics 2023-12-04 Yichul Choi , Da-Chuan Lu , Zhengdi Sun

We continue to investigate properties of the worldsheet conformal field theories (CFTs) which are conjectured to be dual to free large N gauge theories, using the mapping of Feynman diagrams to the worldsheet suggested in hep-th/0504229.…

High Energy Physics - Theory · Physics 2008-11-26 Ofer Aharony , Justin R. David , Rajesh Gopakumar , Zohar Komargodski , Shlomo S. Razamat

The large-scale execution of quantum algorithms requires basic quantum operations to be implemented fault-tolerantly. The most popular technique for accomplishing this, using the devices that can be realised in the near term, uses…