Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence
- 4.4k Downloads
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 .
KeywordsAdS-CFT Correspondence Lattice Integrable Models
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.
- G. Vidal, Efficient classical simulation of slightly entangled quantum computations, Phys. Rev. Lett. 91 (2003) 147902 [quant-ph/0301063].
- 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).Google Scholar
- 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, 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.W. Hawking, Particle creation by black holes, Commun. Math. Phys. 43 (1975) 199 [Erratum ibid. 46 (1976) 206] [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.Google Scholar
- M.B. ¸ahinoğlu et al., Characterizing topological order with matrix product operators, arXiv:1409.2150.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0), which permits use, duplication, adaptation, distribution, and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.