×

Homological product codes. (English) Zbl 1315.94143

Proceedings of the 46th annual ACM symposium on theory of computing, STOC ’14, New York, NY, USA, May 31 – June 3, 2014. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2710-7). 273-282 (2014).

MSC:

94B60 Other types of codes
81P68 Quantum computation
81P70 Quantum coding (general)

Software:

SuLQ

References:

[1] S. A. Aly. A class of quantum LDPC codes constructed from finite geometries. In Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE, pages 1-5. IEEE, 2008.
[2] A. Ashikhmin, S. Litsyn, and M. Tsfasman. Asymptotically good quantum codes. arXiv preprint quant-ph/0006061, 13, 2000.
[3] B. Audoux. An application of Khovanov homology to quantum codes. arXiv preprint arXiv:1307.4677, 2013.
[4] D. Bacon, S. T. Flammia, A. W. Harrow, and J. Shi. unpublished preprint.
[5] H. Bombin and M. Martin-Delgado. Homological error correction: classical and quantum codes. J. Math. Phys., 48:052105, 2007. · Zbl 1144.81317
[6] S. Bravyi. Subsystem codes with spatially local generators. Phys. Rev. A, 83(1):012320, 2011.
[7] S. Bravyi and M. B. Hastings. Homological product codes. arXiv preprint arXiv:1311.0885, 2013.
[8] S. Bravyi, D. Poulin, and B. Terhal. Tradeoffs for reliable quantum information storage in 2D systems. Phys. Rev. Lett., 104(5):050503, 2010.
[9] S. Bravyi and B. Terhal. A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes. New J. of Phys., 11(4):043029, 2009.
[10] R. Calderbank and P. W. Shor. Good quantum error-correcting codes exist. Phys. Rev. A, 54(2):1098, 1996.
[11] T. Camara, H. Ollivier, and J.-P. Tillich. Constructions and performance of classes of quantum LDPC codes. arXiv preprint quant-ph/0502086, 2005.
[12] N. Delfosse. Tradeoffs for reliable quantum information storage in surface codes and color codes. arXiv preprint arXiv:1301.6588, 2013.
[13] E. Dennis, A. Kitaev, A. Landahl, and J. Preskill. Topological quantum memory. J. of Math. Phys., 43:4452, 2002. · Zbl 1060.94045
[14] A. Fowler, A. Stephens, and P. Groszkowski. High-threshold universal quantum computation on the surface code. Phys. Rev. A, 80(5):052312, 2009.
[15] M. Freedman and M. Hastings. Quantum systems on non-k-hyperfinite complexes: A generalization of classical statistical mechanics on expander graphs. arXiv preprint arXiv:1301.1363, 2013.
[16] M. Freedman and D. Meyer. Projective plane and planar quantum codes. Foundations of Computational Mathematics, 1(3):325-332, 2001. · Zbl 0995.94037
[17] M. Freedman, D. Meyer, and F. Luo. Z2-systolic freedom and quantum codes. Mathematics of quantum computation, Chapman & Hall/CRC, pages 287-320, 2002. · Zbl 1075.81508
[18] R. Gallager. Low-density parity-check codes. IRE Trans. on Inf. Theory, 8(1):21-28, 1962. · Zbl 0107.11802
[19] D. Gottesman. What is the overhead required for fault-tolerant quantum computation? arXiv preprint arXiv:1310.2984, 2013.
[20] J. Haah. Local stabilizer codes in three dimensions without string logical operators. Phys. Rev. A, 83(4):042330, 2011.
[21] J. Haah and J. Preskill. Logical-operator tradeoff for local quantum codes. Phys. Rev. A, 86(3):032308, 2012.
[22] A. Hatcher. Algebraic topology. Cambridge UP, Cambridge, 2002. · Zbl 1044.55001
[23] A. Kitaev. Fault-tolerant quantum computation by anyons. Ann. of Phys., 303(1):2-30, 2003. · Zbl 1012.81006
[24] A. A. Kovalev and L. P. Pryadko. Improved quantum hypergraph-product LDPC codes.
[25] D. MacKay. Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory, 45(2):399-431, 1999. 10.1109/18.748992 · Zbl 0946.94030
[26] D. MacKay, G. Mitchison, and P. McFadden. Sparse-graph codes for quantum error correction. IEEE Trans. on Inf. Theory, 50(10):2315-2330, 2004. 10.1109/TIT.2004.834737 · Zbl 1315.94145
[27] M. Postol. A proposed quantum low density parity check code. arXiv preprint quant-ph/0108131, 2001.
[28] R. Raussendorf and J. Harrington. Fault-tolerant quantum computation with high threshold in two dimensions. Phys. Rev. Lett., 98:190504, 2007.
[29] P. Sarvepalli and K. R. Brown. Topological subsystem codes from graphs and hypergraphs. Phys. Rev. A, 86(4):042336, 2012.
[30] J.-P. Tillich and G. Zémor. Quantum LDPC codes with positive rate and minimum distance proportional to n^1/2. IEEE International Symposium on Inf. Theory, pages 799-803, 2009.
[31] G. Zémor. On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction. In Coding and Cryptology, pages 259-273. Springer, 2009. 10.1007/978-3-642-01877-0_21 · Zbl 1248.94128
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.