Bit Threads and Holographic Monogamy
- 76 Downloads
Bit threads provide an alternative description of holographic entanglement, replacing the Ryu–Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information property of holographic entanglement entropies. This is accomplished using the concept of a so-called multicommodity flow, adapted from the network setting, and tools from the theory of convex optimization. Based on the bit thread picture, we conjecture a general ansatz for a holographic state, involving only bipartite and perfect-tensor type entanglement, for any decomposition of the boundary into four regions. We also give new proofs of analogous theorems on networks.
We would like to thank David Avis, Ning Bao, Veronika Hubeny, and Don Marolf for useful conversations. S.X.C. acknowledges the support from the Simons Foundation. P.H. and M.H. were supported by the Simons Foundation through the “It from Qubit” Simons Collaboration as well as, respectively, the Investigator and Fellowship programs. P.H. acknowledges additional support from CIFAR. P.H. and M.W. acknowledge support by AFOSR through Grant FA9550-16-1-0082. T.H. was supported in part by DOE Grant DE-FG02-91ER40654, and would like to thank Andy Strominger for his continued support and guidance. T.H. and B.S. would like to thank the Okinawa Institute for Science and Technology for their hospitality, where part of this work was completed. M.H. was also supported by the NSF under Career Award No. PHY-1053842 and by the U.S. Department of Energy under Grant DE-SC0009987. M.H. and B.S. would like to thank the MIT Center for Theoretical Physics for hospitality while this research was undertaken. M.H. and M.W. would also like to thank the Kavli Institute for Theoretical Physics, where this research was undertaken during the program “Quantum Physics of Information”; KITP is supported in part by the National Science Foundation under Grant No. NSF PHY-1748958. The work of B.S. was supported in part by the Simons Foundation, and by the U.S. Department of Energy under Grant DE-SC-0009987. M.W. also acknowledges financial support by the NWO through Veni Grant No. 680-47-459. M.W. would also like to thank JILA for hospitality while this research was undertaken.
- 8.Chandrasekaran, R.: Multicommodity Maximum Flow Problems. https://www.utdallas.edu/~chandra/documents/networks/net7.pdf. Accessed 21 Feb 2018
- 9.Cherkassky, B.V.: A solution of a problem on multicommodity flows in a network. Ekonomika i matematicheski motody 13, 143–151 (1977)Google Scholar
- 11.Du, D.H., Chen, C.B., Shu, F.W.: Bit threads and holographic entanglement of purification (2019)Google Scholar
- 13.Federer, H.: Real flat chains, cochains and variational problems. Indiana Univ. Math. J. 24, 351–407 (1974/1975)Google Scholar
- 21.Headrick, M., Hubeny, V.E.: Covariant bit threads. (to appear) Google Scholar
- 23.Hernández Cuenca, S.: The Holographic Entropy Cone for Five Regions (2019)Google Scholar
- 25.Karzanov, A., Lomonosov, M.V.: Systems of flows in undirected networks. In: Larichev, O.I. (ed.) Matematicheskoe Programmirovanie i dr. (Engl.: Mathematical Programming, and etc.), Issue 1, pp. 59–66. Inst. for System Studies (VNIISI) Press, Moscow (1978). (in Russian) Google Scholar
- 26.Kudler-Flam, J., Ryu, S.: Entanglement negativity and minimal entanglement wedge cross sections in holographic theories (2018)Google Scholar
- 30.Naves, G.: Notes on the Multicommodity Flow Problem. http://assert-false.net/callcc/Guyslain/Works/multiflows. Accessed 3 Oct 2017
- 31.Nezami, S., Walter, M.: Multipartite Entanglement in Stabilizer Tensor Networks (2016)Google Scholar
- 39.Sullivan, J.M.: A crystalline approximation theorem for hypersurfaces. ProQuest LLC, Ann Arbor, MI. Thesis (Ph.D.), Princeton University. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:9110403 (1990)