We propose a family of exactly solvable toy models for the AdS/CFT correspondence based on a novel construction of quantum error-correcting codes with a tensor network structure. Our building block is a special type of tensor with maximal entanglement along any bipartition, which gives rise to an isometry from the bulk Hilbert space to the boundary Hilbert space. The entire tensor network is an encoder for a quantum error-correcting code, where the bulk and boundary degrees of freedom may be identified as logical and physical degrees of freedom respectively. These models capture key features of entanglement in the AdS/CFT correspondence; in particular, the Ryu-Takayanagi formula and the negativity of tripartite information are obeyed exactly in many cases. That bulk logical operators can be represented on multiple boundary regions mimics the Rindlerwedge reconstruction of boundary operators from bulk operators, realizing explicitly the quantum error-correcting features of AdS/CFT recently proposed in .
G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91 (2003) 147902 [quant-ph/0301063].
F. Verstraete, J. Cirac and V. Murg, Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems, Adv. Phys. 57 (2008) 143 [arXiv:0907.2796].
G. Vidal, Class of quantum many-body states that can be efficiently simulated, Phys. Rev. Lett. 101 (2008) 110501 [INSPIRE].
G. Evenbly and G. Vidal, Algorithms for entanglement renormalization, Phys. Rev. B 79 (2009) 144108 [arXiv:0707.1454].
G. Evenbly and G. Vidal, Frustrated antiferromagnets with entanglement renormalization: ground state of the spin-1/2 Heisenberg model on a Kagome lattice, Phys. Rev. Lett. 104 (2010) 187203 [arXiv:0904.3383] [INSPIRE].
A.J. Ferris and D. Poulin, Tensor networks and quantum error correction, Phys. Rev. Lett. 113 (2014) 030501 [arXiv:1312.4578].
D. Bacon, S.T. Flammia, A.W. Harrow and J. Shi, Sparse quantum codes from quantum circuits, arXiv:1411.3334.
W. Helwig, Absolutely maximally entangled qudit graph states, arXiv:1306.2879.
J. Weeks, KaleidoTile. A computer program for creating spherical, Euclidean and hyperbolic tilings, http://www.geometrygames.org/KaleidoTile.
C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization: algorithms and complexity, Courier Corporation, (1998).
D. Kribs, R. Laflamme and D. Poulin, Unified and generalized approach to quantum error correction, Phys. Rev. Lett. 94 (2005) 180501 [quant-ph/0412076].
D.W. Kribs, R. Laflamme, D. Poulin and M. Lesosky, Operator quantum error correction, Quant. Inf. Comp. 6 (2006) 383 [quant-ph/0504189].
C. Bény, A. Kempf and D. Kribs, Quantum error correction of observables, Phys. Rev. A 76 (2007) 042303 [arXiv:0705.1574].
C. Bény, A. Kempf and D. Kribs, Generalization of quantum error correction via the Heisenberg picture, Phys. Rev. Lett. 98 (2007) 100502 [quant-ph/0608071].
D. Gottesman, An introduction to quantum error correction and fault-tolerant quantum computation, arXiv:0904.2557.
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 (2009) 043029 [arXiv:0810.1983].
F. Pastawski and B. Yoshida, Fault-tolerant logical gates in quantum error-correcting codes, Phys. Rev. A 91 (2015) 012305 [arXiv:1408.1720].
J.D. Bekenstein, Black holes and entropy, Phys. Rev. D 7 (1973) 2333 [INSPIRE].
S.W. Hawking, Particle creation by black holes, Commun. Math. Phys. 43 (1975) 199 [Erratum ibid. 46 (1976) 206] [INSPIRE].
D. Aharonov and M. Ben-Or, Fault-tolerant quantum computation with constant error, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, (1997), pg. 176 [quant-ph/9906129] [INSPIRE].
M. Grassl, T. Beth and M. Roetteler, On optimal quantum codes, Int. J. Quant. Inf. 2 (2004) 55 [quant-ph/0312164].
S. Goldstein, J.L. Lebowitz, R. Tumulka and N. Zanghì, Canonical typicality, Phys. Rev. Lett. 96 (2006) 050403 [cond-mat/0511091].
J. Adler, Bootstrap percolation, Phys. A 171 (1991) 453.
D.A. Levin, Y. Peres and E.L. Wilmer, Markov chains and mixing times, American Mathematical Society, U.S.A. (2008).
M.A. Nielsen and I.L. Chuang, Quantum computation and quantum information, Cambridge University Press, Cambridge U.K. (2000).
N. Schuch, I. Cirac and D. Perez-Garcia, PEPS as ground states: degeneracy and topology, Ann. Phys. 325 (2010) 2153 [arXiv:1001.3807].
M.B. ¸ahinoğlu et al., Characterizing topological order with matrix product operators, arXiv:1409.2150.
O. Buerschaper, Twisted injectivity in projected entangled pair states and the classification of quantum phases, Annals Phys. 351 (2014) 447 [INSPIRE].
B. Yoshida and I.L. Chuang, Framework for classifying logical operators in stabilizer codes, Phys. Rev. A 81 (2010) 052302 [arXiv:1002.0085].
J. Haah and J. Preskill, Logical-operator tradeoff for local quantum codes, Phys. Rev. A 86 (2012) 032308 [arXiv:1011.3529].
This article is distributed under the terms of the Creative Commons Attribution License (CC-BY 4.0), which permits any use, distribution and reproduction in any medium, provided the original author(s) and source are credited.
ArXiv ePrint: 1503.06237
These authors contributed equally to this work (Fernando Pastawski and Beni Yoshida).
About this article
Cite this article
Pastawski, F., Yoshida, B., Harlow, D. et al. Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence. J. High Energ. Phys. 2015, 149 (2015). https://doi.org/10.1007/JHEP06(2015)149
- AdS-CFT Correspondence
- Lattice Integrable Models