Related papers: Remarks on Clifford codes
Quantum error-correcting codes (QECC's) are needed to combat the inherent noise affecting quantum processes. Using ZX calculus, we represent QECC's in a form called a ZX diagram, consisting of a tensor network. In this paper, we present…
Quantum error correction is an important ingredient for scalable quantum computing. Stabilizer codes are one of the most promising and straightforward ways to correct quantum errors, are convenient for logical operations, and improve…
Isoclinic subspaces have been studied for over a century. Quantum error correcting codes were recently shown to define a subclass of families of isoclinic subspaces. The Knill-Laflamme Theorem is a seminal result in the theory of quantum…
We describe the structure of the $n$-qubit Clifford group $C_n$ via Cayley graphs, whose vertices represent group elements and edges represent generators. In order to obtain the action of Clifford gates on a given quantum state, we…
Using the Weyl commutation relations over a finite field we introduce a family of error-correcting quantum stabilizer codes based on a class of symmetric matrices over the finite field satisfying certain natural conditions. When the field…
We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized…
The surface code is currently the leading proposal to achieve fault-tolerant quantum computation. Among its strengths are the plethora of known ways in which fault-tolerant Clifford operations can be performed, namely, by deforming the…
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code…
Up to now every good quantum error-correcting code discovered has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices; such codes are known as stabilizer or additive codes. In this letter we…
Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford…
Clifford noise reduction (CliNR) is a partial error correction scheme that reduces the logical error rate of Clifford circuits at the cost of a modest qubit and gate overhead. The CliNR implementation of an $n$-qubit Clifford circuit of…
The Clifford operators are an important and well-studied subset of quantum operations, in both the qubit and higher-dimensional qudit cases. While there are many ways to characterize this set, this paper aims to provide an ideal…
Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes…
For smooth projective curves the Clifford index is an important invariant which provides a bound for the dimension of the space of sections of a line bundle. This is the first step in distinguishing curves of the same genus. In this paper…
We describe generalizations of the Pauli group, the Clifford group and stabilizer states for qudits in a Hilbert space of arbitrary dimension d. We examine a link with modular arithmetic, which yields an efficient way of representing the…
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. This paper contributes to constructing two classes…
We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer code uses CSS-type quantum Reed-Solomon code and the inner code uses a set of special quantum codes. In the field of…
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…
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…
In this work, we introduce a technique for reducing the length of a quantum stabilizer code, and we call this deflation of the code. Deflation can be seen as a generalization of the well-known puncturing and shortening techniques in cases…