×

Sparse quantum codes from quantum circuits. (English) Zbl 1321.81018

Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 327-334 (2015).

MSC:

81P70 Quantum coding (general)

Software:

Graphs

References:

[1] P. Aliferis and A. W. Cross. Subsystem fault tolerance with the Bacon-Shor code. Phys. Rev. Lett., 98:220502, 2007, http://arxiv.org/abs/quant-ph/0610063family arXiv:quant-ph/0610063.
[2] A. Ashikhmin, S. Litsyn, and M. A. Tsfasman. Asymptotically good quantum codes. Phys. Rev. A, 63(3):032311, Feb 2001, http://arxiv.org/abs/quant-ph/0006061family arXiv:quant-ph/0006061.
[3] A. E. Ashikhmin, A. M. Barg, E. Knill, and S. N. Litsyn. Quantum error detection II: Bounds. IEEE Trans. Info. Theory, 46(3):789-800, 2000, http://arxiv.org/abs/quant-ph/9906131family arXiv:quant-ph/9906131. 10.1109/18.841163 · Zbl 1001.94048
[4] D. Bacon. Operator quantum error-correcting subsystems for self-correcting quantum memories. Phys. Rev. A, 73(1):012340, 2006, http://arxiv.org/abs/quant-ph/0506023family arXiv:quant-ph/0506023.
[5] H. Bombin. Topological subsystem codes. Phys. Rev. A, 81(3):032301, Mar 2010, http://arxiv.org/abs/0908.4246family arXiv:0908.4246.
[6] H. Bombin. Gauge Color Codes. 2013, http://arxiv.org/abs/1311.0879family arXiv:1311.0879.
[7] S. Bravyi. Subsystem codes with spatially local generators. Phys. Rev. A, 83:012320, Jan 2011, http://arxiv.org/abs/1008.1029family arXiv:1008.1029.
[8] S. Bravyi, G. Duclos-Cianci, D. Poulin, and M. Suchara. Subsystem surface codes with three-qubit check operators. Quant. Inf. Comp., 13(11& 12):0963-0985, 07 2013, http://arxiv.org/abs/1207.1443family arXiv:1207.1443.
[9] S. Bravyi and M. B. Hastings. Homological product codes, 2013, http://arxiv.org/abs/1311.0885family arXiv:1311.0885. 10.1145/2591796.2591870
[10] S. Bravyi, D. Poulin, and B. Terhal. Tradeoffs for reliable quantum information storage in 2d systems. Phys. Rev. Lett., 104:050503, Feb 2010, http://arxiv.org/abs/0909.5200family arXiv:0909.5200.
[11] S. Bravyi and B. Terhal. A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes. New J. Phys., 11(4):043029, 2009, http://arxiv.org/abs/0810.1983family arXiv:0810.1983.
[12] C. G. Brell, S. D. Bartlett, and A. C. Doherty. Perturbative 2-body Parent Hamiltonians for Projected Entangled Pair States. 2014, http://arxiv.org/abs/1407.4829family arXiv:1407.4829.
[13] C. G. Brell, S. T. Flammia, S. D. Bartlett, and A. C. Doherty. Toric codes and quantum doubles from two-body Hamiltonians. New J. Phys., 13(5):053039, 2011, http://arxiv.org/abs/1011.1942family arXiv:1011.1942. · Zbl 1448.81224
[14] W. Brown and O. Fawzi. Short random circuits define good quantum error correcting codes. IEEE International Symposium on Inf. Theory, pages 346-350, 2013, http://arxiv.org/abs/1312.7646family arXiv:1312.7646.
[15] A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane. Quantum error correction via codes over \(GF(4)\). IEEE Trans. Info. Theory, 44:1369-1387, 1998, http://arxiv.org/abs/quant-ph/9608006family arXiv:quant-ph/9608006. 10.1109/18.681315 · Zbl 0982.94029
[16] A. R. Calderbank and P. W. Shor. Good quantum error-correcting codes exist. Phys. Rev. A, 54(2):1098-1105, Aug 1996, http://arxiv.org/abs/quant-ph/9512032family arXiv:quant-ph/9512032.
[17] H. Chen. Some good quantum error-correcting codes from algebraic-geometric codes. IEEE Trans. Info. Theory, 47(5):2059-2061, Jul 2001, http://arxiv.org/abs/quant-ph/0107102family arXiv:quant-ph/0107102. 10.1109/18.930942 · Zbl 1017.94028
[18] H. Chen, S. Ling, and C. Xing. Asymptotically good quantum codes exceeding the Ashikhmin-Litsyn-Tsfasman bound. IEEE Trans. Info. Theory, 47:2055, 2001. 10.1109/18.930941 · Zbl 1017.94029
[19] G. M. Crosswhite and D. Bacon. Automated searching for quantum subsystem codes. Phys. Rev. A, 83:022307, Feb 2011, http://arxiv.org/abs/1009.2203family arXiv:1009.2203.
[20] D. P. DiVincenzo and P. W. Shor. Fault-tolerant error correction with efficient quantum codes. Phys. Rev. Lett., 77:3260-3263, Oct 1996, http://arxiv.org/abs/quant-ph/9605031family arXiv:quant-ph/9605031.
[21] J. Dorier, F. Becca, and F. Mila. Quantum compass model on the square lattice. Phys. Rev. B, 72(2):024448, Jul 2005, http://arxiv.org/abs/cond-mat/0501708family arXiv:cond-mat/0501708.
[22] E. Fetaya. Bounding the distance of quantum surface codes. J. Math. Phys., 53(6):062202, 2012. · Zbl 1276.81036
[23] M. Freedman, D. Meyer, and F. Luo. Z_2-systolic freedom and quantum codes. In R. K. Brylinski and G. Chen, editors, Math. of Quantum Computation, pages 287-320. Chapman & Hall/CRC, 2002. · Zbl 1075.81508
[24] D. Gottesman. Fault-tolerant quantum computation with constant overhead, 2013, http://arxiv.org/abs/1310.2984family arXiv:1310.2984.
[25] L. Guth and A. Lubotzky. Quantum error-correcting codes and 4-dimensional arithmetic hyperbolic manifolds, 2013, http://arxiv.org/abs/1310.5555family arXiv:1310.5555.
[26] I. H. Kim. Quantum codes on Hurwitz surfaces. Master’s thesis, Massachusetts Institute of Technology, 2007.
[27] A. Y. Kitaev. Unpaired majorana fermions in quantum wires. Phys.-Usp., 44(10S):131-136, oct 2001, http://arxiv.org/abs/cond-mat/0010440family arXiv:cond-mat/0010440.
[28] A. Y. Kitaev. Fault-tolerant quantum computation by anyons. Ann. Phys., 303(1):2-30, 2003, http://arxiv.org/abs/quant-ph/9707021family arXiv:quant-ph/9707021. · Zbl 1012.81006
[29] A. A. Kovalev and L. P. Pryadko. Fault tolerance of quantum low-density parity check codes with sublinear distance scaling. Phys. Rev. A, 87:020304, 2013, http://arxiv.org/abs/1208.2317family arXiv:1208.2317.
[30] D. W. Kribs, R. Laflamme, D. Poulin, and M. Lesosky. Operator quantum error correction. Quant. Inf. Comp., 6:383-399, 2006, http://arxiv.org/abs/quant-ph/0504189family arXiv:quant-ph/0504189. · Zbl 1152.81760
[31] Z. Li, L. Xing, and X. Wang. A family of asymptotically good quantum codes based on code concatenation. IEEE Trans. Info. Theory, 55(8):3821, Aug 2009, http://arxiv.org/abs/0901.0042family arXiv:0901.0042. 10.1109/TIT.2009.2023715 · Zbl 1367.81042
[32] E. Lieb, T. Schultz, and D. Mattis. Two soluble models of an antiferromagnetic chain. Ann. Phys., 16(3):407-466, 1961. · Zbl 0129.46401
[33] D. J. C. MacKay. Information Theory, Inference, and Learning Algorithms. Cambridge University Press, 2003. · Zbl 1055.94001
[34] R. Matsumoto. Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes. IEEE Trans. Info. Theory, 48(7):2122-2124, Jul 2002. 10.1109/TIT.2002.1013156 · Zbl 1061.94082
[35] M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, Cambridge, 2000. · Zbl 1049.81015
[36] F. Pastawski, A. Kay, N. Schuch, and I. Cirac. Limitations of passive protection of quantum information. Quant. Info. Comp., 10(7 & 8):0580-0618, 2009, http://arxiv.org/abs/0911.3843family arXiv:0911.3843. · Zbl 1234.81066
[37] D. Poulin. Stabilizer formalism for operator quantum error correction. Phys. Rev. Lett., 95(23):230504, Dec 2005, http://arxiv.org/abs/quant-ph/0508131family arXiv:quant-ph/0508131.
[38] R. Raussendorf and J. Harrington. Fault-tolerant quantum computation with high threshold in two dimensions. Phys. Rev. Lett., 98:190504, 2007, http://arxiv.org/abs/quant-ph/0610082family arXiv:quant-ph/0610082.
[39] P. Sarvepalli and K. R. Brown. Topological subsystem codes from graphs and hypergraphs. Phys. Rev. A, 86:042336, Oct 2012, http://arxiv.org/abs/1207.0479family arXiv:1207.0479.
[40] P. W. Shor. Fault-tolerant quantum computation. In FOCS, pages 56-65, Oct 1996, http://arxiv.org/abs/quant-ph/9605011family arXiv:quant-ph/9605011.
[41] D. A. Spielman. Linear-time encodable and decodable error-correcting codes. IEEE Trans. Info. Theory, 42(6):1723-1731, 1996. 10.1109/18.556668 · Zbl 0943.94544
[42] M. Suchara, S. Bravyi, and B. Terhal. Constructions and noise threshold of topological subsystem codes. J. Phys. A: Math. Theor., 44(15):155301, 2011, http://arxiv.org/abs/1012.0425family arXiv:1012.0425. · Zbl 1213.81111
[43] B. M. Terhal. Quantum error correction for quantum memories. 02 2014, http://arxiv.org/abs/1302.3428family arXiv:1302.3428.
[44] C. D. Thompson and H. T. Kung. Sorting on a mesh-connected parallel computer. Commun. ACM, 20(4):263-271, 1977. 10.1145/359461.359481 · Zbl 0349.68020
[45] J.-P. Tillich and G. Zémor. Quantum LDPC codes with positive rate and minimum distance proportional to n1/2. In Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2, ISIT’09, pages 799-803, 2009, http://arxiv.org/abs/0903.0566family arXiv:0903.0566.
[46] G. Zémor. On Cayley graphs, surface codes, and the limits of homological coding for quantum error correction. In Y. Chee, C. Li, S. Ling, H. Wang, and C. Xing, editors, Coding and Cryptology, volume 5557 of Lecture Notes in Computer Science, pages 259-273. Springer Berlin Heidelberg, 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.