Computational complexity of Berry phase estimation in topological phases of matter
Abstract
The Berry phase is a fundamental quantity in the classification of topological phases of matter. In this paper, we present a new quantum algorithm and several complexity-theoretical results for the Berry phase estimation (BPE) problems. Our new quantum algorithm achieves BPE in a more general setting than previously known quantum algorithms, with a theoretical guarantee. For the complexity-theoretic results, we consider two main cases. First, we prove B Q P -completeness when we are given a guiding state that has a large overlap with the ground state. This result establishes an exponential quantum speedup for estimating the Berry phase. Second, we prove U Q M A ∩ c o - U Q M A -completeness when we have an a priori bound for the ground-state energy. Here, U Q M A is the unique witness version of Q M A , and U Q M A ∩ c o - U Q M A precisely captures the complexity of BPE without the known guiding state. Remarkably, this problem is, to our knowledge, the first natural problem complete for U Q M A ∩ c o - U Q M A . These results advance the role of quantum computing in the study of topological phases of matter and provide a pathway for clarifying the connection between topological phases of matter and computational complexity.
// Source
Authors: Kazuki Sakamoto, Chusei Kiumi
Institutions: The University of Osaka, Instituto de Física Teórica, Center for Quantum Information and Quantum Biology, The University of Osaka