Fetching the paper…
Reading the bibliography…
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.
R. Feynman, “Simulating physics with computers,” Internation Journal of Theoretical Physics , vol. 21, pp. 467–488, 1982
1982
Earlier work this paper cites.
——, “Quantum mechanical computers,” Foundations of Physics , vol. 16, no. 6, pp. 507–531, 1986
1986
Earlier work this paper cites.
P. Shor, “Algorithms for quantum computation: discrete logarithms and factoring,” Foundations of Computer Science , pp. 124–134, 1994
1994
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators,” Science , no. 273, p. 1073, 1996
1996
Earlier work this paper cites.
C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Wootters, “Mixed state entanglement and quantum error correction,” Phys.Rev. A. , vol. 54, pp. 3824–3851, 1996, arXiv:quant-ph/9604024
1996
Earlier work this paper cites.
D. Aharonov and M. Ben-Or, “Fault-tolerant quantum computation with constant error,” Proceedings of the twenty-ninth annual ACM symposium on Theory of computing , pp. 176–188, 1997
1997
Earlier work this paper cites.
E. M. Rains, R. H. Hardin, P. W. Shor, and N. J. A. Sloane, “A nonadditive quantum code,” Phys. Rev. Lett. , vol. 79, pp. 953–954, 1997, arXiv:quant-ph/9703002
1997
Cited alongside, same era.
E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Phys. Rev. A , vol. 55, no. 2, pp. 900–911, 1997
1997
Cited alongside, same era.
A. R. Calderbank, E. M. Rains, P. W. Shor, and N. Sloane, “Quantum error correction via codes over gf(4),” IEEE Trans. Inf. Theory , vol. 44, pp. 1369,1387, 1998, arXiv:quant-ph/9608006
1998
Cited alongside, same era.
E. Rains, “Quantum shadow enumerators,” IEEE Trans. Inf. Theory , vol. 45, no. 7, pp. 2361–2366, 1999, arXiv:quant-ph/9611001
1999
Cited alongside, same era.
——, “Quantum codes of minimum distance two,” IEEE Trans. Inf. Theory , vol. 45, no. 1, pp. 266–271, 1999, arXiv:quant-ph/9704043
1999
D. Schlingermann, “Stabilizer codes can be realized as graph codes,” Quantum Information & Computation , vol. 2, no. 4, pp. 307–323, 2002, arXiv:quant-ph/0111080
2002
Later among the works it cites.
M. Grassl, A. Klappenecker, and M. Rötteler, “Graphs, quadratic form, and quantum codes,” 2002 IEEE International Symposium on Information Theory (ISIT) , p. 45, 2002
2002
Later among the works it cites.
R. Raussendorf, D.E. Browne, H.J. Briegel, “Measurement-based quantum computation with cluster states,” Phys. Rev. A. 68
2003
Later among the works it cites.
M. Van den Nest, J. Dehaene, and B. DE Moor, “Graphical description of the action of local clifford transformations on graph states,” Phys. Rev. A. , vol. 69, no. 022316, 2004
2004
Later among the works it cites.
H. Pollatsek and M.B. Ruskai, “Permutationally Invariant Codes for Quantum Error Correction,” Lin. Alg. Appl. 392, pp. 255-258 (2004), arXiv:quant-ph/0304153
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
D. Gottesman, “Stabilizer codes and quantum error correction,” Caltech Ph.D. Thesis
Cited in the paper.
J. A. Smolin, G. Smith, and S. Wehner, “A simple family of nonadditive quantum codes,” arXiv:quant-ph/0701065
Cited in the paper.
S. Yu, Q. Chen, C. H. Lai, and C. H. Oh, “Nonadditive quantum error-correcting code,” arXiv:quant-ph/0704.2122
Cited in the paper.
V. Aggarwal and A. R. Calderbank, “Boolean functions, projections operators and quantum error correcting codes,” arXiv:cs/0610159
Cited in the paper.
V. Arvind, P. Kurur, and K. Parthasarathy, “Nonstabilizer quantum codes from abelian subgroups of the error group,” arXiv:quant-ph/0210097
Cited in the paper.
M. Grassl and T. Beth,“A note on non-additive quantum codes,” arXiv:quant-ph/9703016
Cited in the paper.
S. Yu, Q. Chen and C.H. Oh, “Graphical Quantum Error-Correcting Codes,” arXiv:0709.1780
Cited in the paper.
2004
Later among the works it cites.