Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0301078 · IEEE Transactions on Information Theory

On the Monomiality of Nice Error Bases

Andreas Klappenecker, Martin Rötteler

Published Feb 28, 2005• 30 citations
arXivHTMLPDF

Abstract

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 that yields nice error bases, and a combinatorial construction by Werner that yields shift-and-multiply bases. An open problem posed by Schlingemann and Werner relates these two constructions and asks whether each nice error basis is equivalent to a shift-and-multiply basis. We solve this problem and show that the answer is negative. However, we find that nice error bases have more structure than one can anticipate from their definition. In particular, we show that nice error bases can be written in a form in which at least half of the matrix entries are 0.

DOI
10.1109/tit.2004.842573

Related papers

Beyond stabilizer codes .I. Nice error bases

Andreas Klappenecker, Martin Rötteler

Nice error bases have been introduced by Knill (1996) as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with Abelian index groups. We show that, in general, an index group of a nice error basis is necessarily solvable.

arXiv:quant-ph/0010082•IEEE Transactions on Information Theory•Aug 1, 2002•90 citations

Nice nearrings

Andreas Klappenecker

Nice error bases are a fundamental primitive of quantum information processing. For example, they govern the discretization of errors in quantum error-correcting codes. It is show that the generalized Pauli basis, the most widely used example of nice error bases, has some remarkable structural properties. However, the generalized Pauli basis is limited to dimensions that are a power of a prime, since it is constructed with the help of a finite field. A wider class of nice error bases is introduced that shares many features of the generalized Pauli basis, yet allows one to remove the restriction to prime power dimensions. The nice error bases are indexed by nearrings. Nearrings that support the construction of nice error bases are called nice. It is shown that all finite nearfields are nice. It is shown that a finite ring is nice if and only if it finite Frobenius ring. Several fundamental properties of nice nearrings are established.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•6 citations

Exploring quantum teleportation through unitary error bases

Benjamin Musto

Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial construction builds a unitary error basis from a family of Hadamard matrices and a Latin square. In this dissertation, I give a new categorical axiomatisation of Latin squares, and use this to give a fully graphical presentation and proof of the correctness of Werner's construction. The categorical approach makes clear that some of the Latin square axioms are unnecessary for the construction to go through, and I propose a generalised construction scheme with the potential to create new classes of unitary error bases.

arXiv:1608.04608•Aug 16, 2016•2 citations

Quantum Latin squares and unitary error bases

Benjamin Musto, Jamie Vicary

In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main results are on applications to unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as teleportation, dense coding and error correction. We present a new method for constructing a UEB from a quantum Latin square equipped with extra data. Developing construction techniques for UEBs has been a major activity in quantum computation, with three primary methods proposed: shift-and-multiply, Hadamard, and grouptheoretic. We show that our new approach simultaneously generalizes the shift-andmultiply and Hadamard methods. Furthermore, we explicitly construct a UEB using our technique which we prove cannot be obtained from any of these existing methods.

arXiv:1504.02715•Quantum Information and Computation•Nov 1, 2016•57 citations

Nice Error Basis and Quantum Channel

B. V. Rajarama Bhat, Purbayan Chakraborty, Uwe Franz

The Weyl operators give a convenient basis of [Formula: see text] 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 introduced by E. Knill [3]. We can use an NEB of [Formula: see text] to construct an NEB for [Formula: see text], the space of linear maps on [Formula: see text]. Any linear map will then correspond to a [Formula: see text] coefficient matrix in the basis decomposition with respect to such an NEB of [Formula: see text]. Positivity, complete (co)positivity or other properties of a linear map can be characterised in terms of such a coefficient matrix.

Open Systems & Information Dynamics•Mar 1, 2024•2 citations

Nice Error Bases and Sylow Subgroups

Russell John Higgs

Nice error bases have various applications in quantum computing such as in the teleportation of quantum states and in the theory of noiseless systems. Associated in a natural way to any nice error basis there is a so-called index group and also a group of central type. In this paper, we will extend the number of known index groups for nice error bases by exploiting the connections between groups of central type and their Sylow subgroups. Our methods will allow us find all index groups of degree up to 44 with two exceptions.

IEEE Transactions on Information Theory•Aug 27, 2008•3 citations
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 that yields nice error bases, and a combinatorial construction by Werner that yields shift-and-multiply bases. An open problem posed by Schlingemann and Werner relates these two constructions and asks whether each nice error basis is equivalent to a shift-and-multiply basis. We solve this problem and show that the answer is negative. However, we find that nice error bases have more structure than one can anticipate from their definition. In particular, we show that nice error bases can be written in a form in which at least half of the matrix entries are 0.
Nice error bases are a fundamental primitive of quantum information processing. For example, they govern the discretization of errors in quantum error-correcting codes. It is show that the generalized Pauli basis, the most widely used example of nice error bases, has some remarkable structural properties. However, the generalized Pauli basis is limited to dimensions that are a power of a prime, since it is constructed with the help of a finite field. A wider class of nice error bases is introduced that shares many features of the generalized Pauli basis, yet allows one to remove the restriction to prime power dimensions. The nice error bases are indexed by nearrings. Nearrings that support the construction of nice error bases are called nice. It is shown that all finite nearfields are nice. It is shown that a finite ring is nice if and only if it finite Frobenius ring. Several fundamental properties of nice nearrings are established.
Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial construction builds a unitary error basis from a family of Hadamard matrices and a Latin square. In this dissertation, I give a new categorical axiomatisation of Latin squares, and use this to give a fully graphical presentation and proof of the correctness of Werner's construction. The categorical approach makes clear that some of the Latin square axioms are unnecessary for the construction to go through, and I propose a generalised construction scheme with the potential to create new classes of unitary error bases.
In this paper we introduce quantum Latin squares, combinatorial quantum objects which generalize classical Latin squares, and investigate their applications in quantum computer science. Our main results are on applications to unitary error bases (UEBs), basic structures in quantum information which lie at the heart of procedures such as teleportation, dense coding and error correction. We present a new method for constructing a UEB from a quantum Latin square equipped with extra data. Developing construction techniques for UEBs has been a major activity in quantum computation, with three primary methods proposed: shift-and-multiply, Hadamard, and grouptheoretic. We show that our new approach simultaneously generalizes the shift-andmultiply and Hadamard methods. Furthermore, we explicitly construct a UEB using our technique which we prove cannot be obtained from any of these existing methods.
The Weyl operators give a convenient basis of [Formula: see text] 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 introduced by E. Knill [3]. We can use an NEB of [Formula: see text] to construct an NEB for [Formula: see text], the space of linear maps on [Formula: see text]. Any linear map will then correspond to a [Formula: see text] coefficient matrix in the basis decomposition with respect to such an NEB of [Formula: see text]. Positivity, complete (co)positivity or other properties of a linear map can be characterised in terms of such a coefficient matrix.
Nice error bases have various applications in quantum computing such as in the teleportation of quantum states and in the theory of noiseless systems. Associated in a natural way to any nice error basis there is a so-called index group and also a group of central type. In this paper, we will extend the number of known index groups for nice error bases by exploiting the connections between groups of central type and their Sylow subgroups. Our methods will allow us find all index groups of degree up to 44 with two exceptions.