Related papers: A Note on Clifford Stabilizer Codes for Ising Anyo…
New stabilizer codes with parameters better than the ones available in the literature are provided in this work, in particular quantum codes with parameters $[[127,63, \geq 12]]_2$ and $[[63,45, \geq 6]]_4$ that are records. These codes are…
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…
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…
Engineering complex non-Abelian anyon models with simple physical systems is crucial for topological quantum computation. Unfortunately, the simplest systems are typically restricted to Majorana zero modes (Ising anyons). Here we go beyond…
The non-local interactions in several quantum device architectures allow for the realization of more compact quantum encodings while retaining the same degree of protection against noise. Anticipating that short to medium-length codes will…
We give a general construction relating Narain rational conformal field theories (RCFTs) and associated 3d Chern-Simons (CS) theories to quantum stabilizer codes. Starting from an abelian CS theory with a fusion group consisting of $n$…
Fifty years ago the standard model offered an elegant new step towards understanding elementary fermion and boson fields, making several assumptions, suggested by experiments. The assumptions are still waiting for an explanation. There are…
In this paper, we give a constructive proof to show that if there exist a classical linear code C is a subset of F_q^n of dimension k and a classical linear code D is a subset of F_q^k^m of dimension s, where q is a power of a prime number…
Quasiparticle poisoning, expected to arise during the measurement of Majorana zero mode state, poses a fundamental problem towards the realization of Majorana-based quantum computation. Parafermions, a natural generalization of Majorana…
In quantum coding theory, stabilizer codes are probably the most important class of quantum codes. They are regarded as the quantum analogue of the classical linear codes and the properties of stabilizer codes have been carefully studied in…
The standard stabilizer formalism provides a setting to show that quantum computation restricted to operations within the Clifford group are classically efficiently simulable: this is the content of the well-known Gottesman-Knill theorem.…
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous polynomials degree by degree and construct…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
We propose a scheme for detecting and correcting faults in any Clifford circuit. The scheme is based on the observation that the set of all possible outcome bit-strings of a Clifford circuit is a linear code, which we call the outcome code.…
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…
Detection and manipulation of excitations with non-Abelian statistics, such as Majorana fermions, are essential for creating topological quantum computers. To this end, we show the connection between the existence of such localized…
In this article we construct a cochain complex of a complex Clifford algebra with coefficients in itself in a combinatorial fashion and we call the corresponding cohomology by {\it Clifford cohomology.} We show that {\it Clifford…
Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to…
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…
Storing quantum information in a quantum error correction code can protect it from errors, but the ability to transform the stored quantum information in a fault tolerant way is equally important. Logical Pauli group operators can be…