Related papers: Quantum Codes, CFTs, and Defects
A conformal field theory (CFT) is a quantum field theory which is invariant under conformal transformations; a group action that preserve angles but not necessarily lengths. There are two traditional approaches to the construction of CFTs:…
Instead of a quantum computer where the fundamental units are 2-dimensional qubits, we can consider a quantum computer made up of d-dimensional systems. There is a straightforward generalization of the class of stabilizer codes to…
We study a class of newly-introduced CFTs associated with even quadratic forms of general signature, which we call generalized Narain theories. We first summarize the properties of these theories. We then consider orbifolds of these…
Codeword stabilized (CWS) codes are a general class of quantum codes that includes stabilizer codes and many families of non-additive codes with good parameters. For such a non-additive code correcting all t-qubit errors, we propose an…
We propose a formula for the transformation law of anyons in topologically ordered phases or topological quantum field theories (TQFTs) through a gapped or symmetry-preserving domain wall. Our formalism is based on the ring homomorphism…
Error operator bases for systems of any dimension are defined and natural generalizations of the bit/sign flip error basis for qubits are given. These bases allow generalizing the construction of quantum codes based on eigenspaces of…
The presence of nearby conformal field theories (CFTs) hidden in the complex plane of the tuning parameter was recently proposed as an elegant explanation for the ubiquity of "weakly first-order" transitions in condensed matter and…
An m-uniform quantum state on n qubits is an entangled state in which every m-qubit subsystem is maximally mixed. Starting with an m-uniform state realized as the graph state associated with an m-regular graph, and a classical [n,k,d \ge…
In this paper we estimate the fidelity of stabilizer and CSS codes. First, we derive a lower bound on the fidelity of a stabilizer code via its quantum enumerator. Next, we find the average quantum enumerators of the ensembles of finite…
We describe in detail how to perform universal fault-tolerant quantum computation on a 2-D color code, making use of only nearest neighbor interactions. Three defects (holes) in the code are used to represent logical qubits. Triple defect…
We present a general framework of quantum error-correcting codes (QECCs) as a subspace of a complex Hilbert space and the corresponding error models. Then we illustrate how QECCs can be constructed using techniques from algebraic coding…
Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically…
Manipulating the state of a logical quantum bit usually comes at the expense of exposing it to decoherence. Fault-tolerant quantum computing tackles this problem by manipulating quantum information within a stable manifold of a larger…
We describe several results concerning global quantum quenches from states with short-range correlations to quantum critical points whose low-energy properties are described by a 1+1-dimensional conformal field theory (CFT), extending the…
The theory of stabilizer quantum error correction allows us to actively stabilize quantum states and simulate ideal quantum operations in a noisy environment. It is critical is to correctly diagnose noise from its syndrome and nullify it…
We consider two-dimensional chiral, first-order conformal field theories governing maps from the Riemann sphere to the projective light cone inside Minkowski space -- the natural setting for describing conformal field theories in two fewer…
Molecular Nanomagnets may enable the implementation of qudit-based quantum error-correction codes which exploit the many spin levels naturally embedded in a single molecule, a promising step towards scalable quantum processors. To fully…
Neutral-atom quantum computing (NAQC) offers distinct advantages such as dynamic qubit reconfigurability, long coherence times, and high gate fidelities, making it a promising platform for scalable quantum computing. Despite these…
We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new…
We suggest that in the proper definition, Quantum Field Theories are quantum mechanical system which 'live' on the space of causal structures ${\cal C}$ of spacetime. That is, for any QFT a Hilbert space ${\cal H}$ on which local operators…