Abstract
AbstractRecent work has characterized rigorously what it means for one quantum system to simulate another and demonstrated the existence of universal Hamiltonians—simple spin lattice Hamiltonians that can replicate the entire physics of any other quantum many-body system. Previous universality results have required proofs involving complicated ‘chains’ of perturbative ‘gadgets.’ In this paper, we derive a significantly simpler and more powerful method of proving universality of Hamiltonians, directly leveraging the ability to encode quantum computation into ground states. This provides new insight into the origins of universal models and suggests a deep connection between universality and complexity. We apply this new approach to show that there are universal models even in translationally invariant spin chains in 1D. This gives as a corollary a new Hamiltonian complexity result that the local Hamiltonian problem for translationally invariant spin chains in one dimension with an exponentially small promise gap is PSPACE-complete. Finally, we use these new universal models to construct the first known toy model of 2D–1D holographic duality between local Hamiltonians.
Funder
Pembroke College, University of Cambridge
Engineering and Physical Sciences Research Council
Publisher
Springer Science and Business Media LLC
Subject
Mathematical Physics,Nuclear and High Energy Physics,Statistical and Nonlinear Physics
Reference42 articles.
1. Cubitt, T., Montanaro, A., Piddock, S.: Universal Quantum Hamiltonians. Proceedings of theNationalAcademy of Sciences 115(38), 9497–9502 (2018). https://doi.org/10.1073/pnas.1804949115
2. Piddock, S., Bausch, J.: Universal Translationally-Invariant Hamiltonians. (2020). arXiv:2001.08050 [quant-ph]
3. Kitaev, A., Shen, A., Vyalyi M.: Classical and quantum computing. In: Quantum Information, pp. 203–217. Springer, NewYork (2002). https://doi.org/10.1007/978-0-387-36944-0_13
4. Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 37(1), 166–194 (2007)
5. Aharonov, D., Zhou, L.: Hamiltonian sparsification and gapsimulations. (2018). arXiv:1804.11084 [quant-ph]
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献