相关论文: Beyond Stabilizer Codes I: Nice Error Bases
Knill introduced a generalization of stabilizer codes, in this note called Clifford codes. It remained unclear whether or not Clifford codes can be superior to stabilizer codes. We show that Clifford codes are stabilizer codes provided that…
Unitary error bases generalize the Pauli matrices to higher dimensional systems. Two basic constructions of unitary error bases are known: An algebraic construction by Knill, which yields nice error bases, and a combinatorial construction…
This report continues the discussion of unitary error bases and quantum codes begun in "Non-binary Unitary Error Bases and Quantum Codes". Nice error bases are characterized in terms of the existence of certain characters in a group. A…
The concept of a nice basis for a Lie algebra was introduced to study the Ricci curvature on nilpotent Lie groups equipped with a left-invariant metric. Despite the many applications in differential geometry, for example in the construction…
Typical stabilizer codes aim to solve the general problem of fault-tolerance without regard for the structure of a specific system. By incorporating a broader representation-theoretic perspective, we provide a generalized framework that…
Mutually unbiased bases of a Hilbert space can be constructed by partitioning a unitary error basis. We consider this construction when the unitary error basis is a nice error basis. We show that the number of resulting mutually unbiased…
By defining projective error models we study the mathematical structure of Clifford codes and stabilizer codes using tools from projective representation theory. Furthermore, we introduce a new class of codes which we have called weak…
The Weyl operators give a convenient basis of $M_n(\mathbb{C})$ which is also orthonormal with respect to the Hilbert-Schmidt inner product. The properties of such a basis can be generalised to the notion of a nice error basis(NEB), as…
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…
First, a canonical form for stabilizer parity check matrices of arbitrary size and rank is derived. Next, it is shown that the closely related canonical form of the Clifford group can be computed in time $O(n^3)$ for $n$ qubits, which…
Clifford codes are a class of quantum error control codes that form a natural generalization of stabilizer codes. These codes were introduced in 1996 by Knill, but only a single Clifford code was known, which is not already a stabilizer…
One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…
Let $\be$ be a Borel subalgebra of a complex simple Lie algebra $\g$. An ideal of $\be$ is called ad-nilpotent, if it is contained in $[\be,\be]$. We give several descriptions of the normalizer of an ad-nilpotent ideal: using the weight of…
We illustrate an algorithm to classify nice nilpotent Lie algebras of dimension $n$ up to a suitable notion of equivalence; applying the algorithm, we obtain complete listings for $n\leq9$. On every nilpotent Lie algebra of dimension $\leq…
Let $X$ be a set of points whose coordinates are known with limited accuracy; our aim is to give a characterization of the vanishing ideal $I(X)$ independent of the data uncertainty. We present a method to compute a polynomial basis $B$ of…
We give a new proof of the NIP arithmetic regularity lemma for finite groups (due to the authors and Pillay), which describes the approximate structure of "NIP sets" in finite groups, i.e., subsets whose collection of left translates has…
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…
Integral bases, a minimal set of solutions to $Ax\leq b, x\in\Z^n$ that generate any other solution to $Ax\leq b, x\in\Z^n$, as a nonnegative integer linear combination, are always finite and are at the core of the Integral Basis Method…
The Pauli stabilizer formalism is perhaps the most thoroughly studied means of procuring quantum error-correcting codes, whereby the code is obtained through commutative Pauli operators and ``stabilized'' by them. In this work we will show…
Stabiliser states play a central role in the theory of quantum computation. For example, they are used to encode computational basis states in the most common quantum error correction schemes. Arbitrary quantum states admit many stabiliser…