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:cs/0610159 · IEEE Transactions on Information Theory

Boolean Functions, Projection Operators, and Quantum Error Correcting Codes

Vaneet Aggarwal, A.R. Calderbank

Published Mar 27, 2008• 24 citations
arXivHTMLPDF

Abstract

This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and nonadditive quantum error correcting codes. The new framework leads to the construction of a variety of codes including an infinite class of codes that extend the original ((5, 6, 2)) code found by Rains It also extends to operator quantum error correcting codes.

DOI
10.1109/tit.2008.917720

Related papers

Boolean Functions, Projection Operators and Quantum Error Correcting Codes

Vaneet Aggarwal, A. Robert Calderbank

This paper describes a common mathematical framework for the design of additive and non-additive Quantum Error Correcting Codes. It is based on a correspondence between boolean functions and projection operators. The new framework extends to operator quantum error correcting codes.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•7 citations

On the Structure of Additive Quantum Codes and the Existence of Nonadditive Codes

Vwani Roychowdhury, Farrokh Vatan

We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes. Then we present several examples of nonadditive codes. We show that there exist infinitely many non-trivial nonadditive codes with different minimum distances, and high rates. In fact, we show that nonadditive codes that correct t errors can reach the asymptotic rate R=1-2H(2t/n), where H(x) is the binary entropy function. Finally, we introduce the notion of strongly nonadditive codes (i.e., quantum codes with the following property: the trivial code consisting of the entire Hilbert space is the only additive code that is equivalent to any code containing the given code), and provide a construction for an ((11,2,3)) strongly nonadditive code.

arXiv:quant-ph/9710031•Oct 9, 1997•4 citations

Codeword Stabilized Quantum Codes

Andrew W. Cross, Graeme Smith, John A. Smolin +1 more

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10,18,3)) and ((10,20,3)) codes. We also show how to construct encoding circuits for all codes within our framework.

arXiv:0708.1021•IEEE Transactions on Information Theory•Jan 1, 2009•117 citations

Codeword stabilized quantum codes

Andrew W. Cross, Graeme Smith, John A. Smolin +1 more

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with superior parameters to any previously known. In particular, we find ((10, 18, 3)) and ((10, 20, 3)) codes. We also show how to construct encoding circuits for all codes within our framework.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•21 citations

A new construction of quantum error-correcting codes

Keqin Feng, Chaoping Xing

In this paper, we present a characterization of (binary and non-binary) quantum error-correcting codes. Based on this characterization, we introduce a method to construct p p -ary quantum codes using Boolean functions satisfying a system of certain quadratic relations. As a consequence of the construction, we are able to construct quantum codes of minimum distance 2 2 . In particular, we produce a class of binary quantum ( ( n , 2 n − 2 − 1 2 ( n − 1 ( n − 1 ) / 2 ) , 2 ) ) ((n,2^{n-2}-\frac 12{n-1\choose (n-1)/2},2)) -codes for odd length n ≥ 5 n\ge 5 . For n ≥ 11 n\ge 11 , this improves the result by Rains in Quantum codes of minimal distance two , 1999, showing the existence of binary quantum ( ( n , 3 ⋅ 2 n − 4 , 2 ) ) ((n,3\cdot 2^{n-4},2)) -codes for odd n ≥ 5 n\ge 5 . Moreover, our binary quantum

Transactions of the American Mathematical Society•Oct 23, 2007•22 citations

Quantum stabilizer codes and beyond

Sarvepalli, Pradeep Kiran

The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes. Firstly, it extends the framework of an important class of quantum codes -- nonbinary stabilizer codes. It clarifies the connections of stabilizer codes to classical codes over quadratic extension fields, provides many new constructions of quantum codes, and develops further the theory of optimal quantum codes and punctured quantum codes. Secondly, it contributes to the theory of operator quantum error correcting codes also called as subsystem codes. These codes are expected to have efficient error recovery schemes than stabilizer codes. This dissertation develops a framework for study and analysis of subsystem codes using character theoretic methods. In particular, this work establishes a close link between subsystem codes and classical codes showing that the subsystem codes can be constructed from arbitrary classical codes. Thirdly, it seeks to exploit the knowledge of noise to design efficient quantum codes and considers more realistic channels than the commonly studied depolarizing channel. It gives systematic constructions of asymmetric quantum stabilizer codes that exploit the asymmetry of errors in certain quantum channels.

arXiv:0810.2574•Oct 14, 2008•8 citations
This paper describes a fundamental correspondence between Boolean functions and projection operators in Hilbert space. The correspondence is widely applicable, and it is used in this paper to provide a common mathematical framework for the design of both additive and nonadditive quantum error correcting codes. The new framework leads to the construction of a variety of codes including an infinite class of codes that extend the original ((5, 6, 2)) code found by Rains It also extends to operator quantum error correcting codes.
We first present a useful characterization of additive (stabilizer) quantum error-correcting codes. Then we present several examples of We first present a useful characterization of additive (stabilizer) quantum error--correcting codes. Then we present several examples of nonadditive codes. We show that there exist infinitely many non-trivial nonadditive codes with different minimum distances, and high rates. In fact, we show that nonadditive codes that correct t errors can reach the asymptotic rate R=1-2H(2t/n), where H(x) is the binary entropy function. Finally, we introduce the notion of strongly nonadditive codes (i.e., quantum codes with the following property: the trivial code consisting of the entire Hilbert space is the only additive code that is equivalent to any code containing the given code), and provide a construction for an ((11,2,3)) strongly nonadditive code.
In this paper, we present a characterization of (binary and non-binary) quantum error-correcting codes. Based on this characterization, we introduce a method to construct p p -ary quantum codes using Boolean functions satisfying a system of certain quadratic relations. As a consequence of the construction, we are able to construct quantum codes of minimum distance 2 2 . In particular, we produce a class of binary quantum ( ( n , 2 n − 2 − 1 2 ( n − 1 ( n − 1 ) / 2 ) , 2 ) ) ((n,2^{n-2}-\frac 12{n-1\choose (n-1)/2},2)) -codes for odd length n ≥ 5 n\ge 5 . For n ≥ 11 n\ge 11 , this improves the result by Rains in Quantum codes of minimal distance two , 1999, showing the existence of binary quantum ( ( n , 3 ⋅ 2 n − 4 , 2 ) ) ((n,3\cdot 2^{n-4},2)) -codes for odd n ≥ 5 n\ge 5 . Moreover, our binary quantum
The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes. Firstly, it extends the framework of an important class of quantum codes -- nonbinary stabilizer codes. It clarifies the connections of stabilizer codes to classical codes over quadratic extension fields, provides many new constructions of quantum codes, and develops further the theory of optimal quantum codes and punctured quantum codes. Secondly, it contributes to the theory of operator quantum error correcting codes also called as subsystem codes. These codes are expected to have efficient error recovery schemes than stabilizer codes. This dissertation develops a framework for study and analysis of subsystem codes using character theoretic methods. In particular, this work establishes a close link between subsystem codes and classical codes showing that the subsystem codes can be constructed from arbitrary classical codes. Thirdly, it seeks to exploit the knowledge of noise to design efficient quantum codes and considers more realistic channels than the commonly studied depolarizing channel. It gives systematic constructions of asymmetric quantum stabilizer codes that exploit the asymmetry of errors in certain quantum channels.