Related papers: Counting stabiliser codes for arbitrary dimension
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit…
For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…
Quantum error-correcting codes with good parameters can be constructed by evaluating polynomials at the roots of the polynomial trace. In this paper, we propose to evaluate polynomials at the roots of trace-depending polynomials (given by a…
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…
We establish the connection between a recent new construction technique for quantum error correcting codes, based on graphs, and the so-called stabilizer codes: Each stabilizer code can be realized as a graph code and vice versa.
Quantum Fourier analysis is an important topic in mathematical physics. We introduce a systematic protocol for testing and measuring ``magic'' in quantum states and gates, using a quantum Fourier approach. Magic, as a quantum resource, is…
The Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. Recently, this result has been generalized to cover inputs that are close to a coherent…
We study subsystem codes whose gauge group has local generators in the 2D geometry. It is shown that there exists a family of such codes defined on lattices of size LxL with the number of logical qubits k and the minimum distance d both…
The ubiquity of stabilizer circuits in the design and operation of quantum computers makes techniques to verify their correctness essential. The simulation of stabilizer circuits, which aims to replicate their behavior using a classical…
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.…
Stabilizer states are fundamental families of quantum states with crucial applications such as error correction, quantum computation, and simulation of quantum circuits. In this paper, we study the problem of testing how close or far a…
Stabilizer states and graph states find application in quantum error correction, measurement-based quantum computation and various other concepts in quantum information theory. In this work, we study party-local Clifford (PLC)…
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…
Codeword stabilized (CWS) codes are, in general, non-additive quantum codes that can correct errors by an exhaustive search of different error patterns, similar to the way that we decode classical non-linear codes. For an n-qubit quantum…
Quantum state discrimination plays a central role in defining the possible and impossible operations through a restricted class of quantum operations. A seminal result by Bennett et al. [Phys. Rev. A 59, 1070 (1999)] demonstrates the…
We propose a general method for preparing stabilizer states with reduced two-qubit gate count and depth compared to the state of the art. The method starts from a graph state representation of the stabilizer state and iteratively reduces…
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…
A new class of quantum states is introduced by demanding that the computational measurement statistics approach the Boltzmann distribution of higher-order strongly coupled Ising models. The states, referred to as $n$-coupled states, are…
Distinct Clifford orbits of magic states can exhibit different stabilizer ranks at small tensor powers. We establish this for qutrits, where the single-qutrit Clifford group has four inequivalent orbits of magic states: Strange, Norrell,…
Coherent errors, which arise from collective couplings, are a dominant form of noise in many realistic quantum systems, and are more damaging than oft considered stochastic errors. Here, we propose integrating stabilizer codes with…