Computational complexity of Berry phase estimation in topological phases of matter

summary

The gist

The paper presents new quantum algorithms and complexity-theoretical results for estimating the Berry phase in topological phases of matter…

In short

The paper develops new quantum algorithms and complexity results for estimating Berry phases in topological matter. It proves that estimating the phase with a known guiding state is BQP-complete, while estimation with an energy threshold is UQMA ∩ co-UQMA-complete. A novel algorithm allows full recovery of the Berry phase modulo 2π without time-reversal symmetry, establishing quantum advantages for these problems.

Key concepts

Berry Phase Estimation (BPE)
This is the problem of determining a geometric phase associated with an adiabatic evolution in a topological system. The paper studies three versions: one where the guiding state is known, one using an energy threshold, and one without extra inputs. It connects this estimation to various quantum complexity classes.
BQP-Completeness
This means that estimating the Berry phase with a known guiding state is as hard as solving problems in BQP, which are problems solvable efficiently by a quantum computer. This implies an exponential quantum speedup for this specific estimation task.
UQMA ∩ co-UQMA
This is a complexity class that characterizes the difficulty of estimating the Berry phase when an energy threshold is used. It represents problems where both verifying a positive instance and a negative instance require unique witnesses, linking it to problems solvable by quantum computers with specific verification constraints.
New Quantum Algorithm
A new method is introduced that compares two adiabatic evolutions at different energy scales. This technique successfully separates the dynamical and geometric parts of the phase, allowing the recovery of the Berry phase modulo 2π over its entire range without needing time-reversal symmetry.

Terminology used across episodes

This episode discusses

The paper

Computational complexity of Berry phase estimation in topological phases of matter · Read on arXiv

Ryu Hayakawa, Kazuki Sakamoto, Chusei Kiumi

Yukawa Institute for Theoretical Physics and The Hakubi Center, Kyoto University · Graduate School of Engineering Science, The University of Osaka

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-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 - -completeness when we have an a priori bound for the ground-state energy. Here, is the unique witness version of, and - precisely captures the complexity of BPE without the known guiding state. Remarkably, this problem is, to our knowledge, the first natural problem complete for -. 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.

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: We're looking at the paper: "Computational complexity of Berry phase estimation in topological phases of matter".

Mira: Here's the gist of the paper. The paper presents new quantum algorithms and complexity-theoretical results for estimating the Berry phase in topological phases of matter, establishing a quantum advantage and classifying related problems within unique QMA variants Problem Definitions and Complexity Classes The Berry phase estimation problem (BPE) is defined with three settings: BPE with known guiding state, BPE with energy threshold, and BPE without additional inputs.

Kai: The results show that the BPE with a known guiding state is BQP-complete, while the version with an energy threshold is UQMA ∩ co-UQMA-complete, and the version without additional inputs is P UQMA∩co−UQMA

log: -hard and contained in P PGQMA

log: .

Mira: New Quantum Algorithm for Berry Phase Estimation A new quantum algorithm is introduced that overcomes limitations of previous work by comparing two adiabatic evolutions with different energy scales to separate the dynamical and geometric phases, enabling the recovery of the Berry phase modulo 2π over the full interval

0, 2π) without relying on time-reversal symmetry. [Kai: This technique allows for estimation with inverse-polynomial precision in time complexity.

Paper summary: Kai: So, to recap what we just heard, this paper is tackling the computational complexity of estimating the Berry phase in topological phases. The main points are that they propose a new quantum algorithm and establish that there’s a quantum advantage for this problem >

Mira: Exactly. They focus on three specific settings: BPE with a known guiding state, BPE with an energy threshold, and BPE without additional inputs >

Lev: So what's the overall message they’re trying to get across about why this classification matters in condensed matter physics? Is it just confirming that quantum computers are better for this than classical ones >

Kai: It’s more than just a confirmation of speedup; it's about classifying these topological phases using quantum tools, which helps clarify the connection between the physical classification and computational complexity >

Mira: They show that BPE with a known guiding state is BQP complete, meaning we have an exponential quantum speedup there >

Lev: So that’s the strong result for one case. But what about the other two cases? Are they just weaker forms of quantum advantage?

Kai: The second case, where you have an energy threshold, shows UQMA intersect co-UQMA completeness, which is a different kind of complexity class entirely >

Mira: That means the nature of the advantage changes depending on how much physical information we can feed into the system >

Lev: And for the third case without additional inputs, they show P PGQMA log hardness and containment in P PGQMA log, which is a more constrained setting >

Kai: It shows that even in this more constrained scenario, there’s still significant complexity tied to unique witness verification >

Mira: So the paper isn't just giving one answer; it’s mapping out how quantum computation interacts with different physical constraints in topological systems >

Conclusion: Kai: Looking at the title, "Computational complexity of Berry phase estimation in topological phases of matter," it sounds very technical, but at its heart, they are asking a deep question about how hard it is to figure out fundamental properties of these materials >

Mira: They’re not just asking if quantum computers can solve this problem faster; they’re investigating *how* the structure of the classification maps onto computational complexity theory >

Lev: In simple terms, for someone who only listens to the show, this paper means that understanding topological phases isn't just a matter of finding a number; it’s about understanding the computational resources needed to classify them >

Kai: Right. It suggests that the classification itself is as much a computational problem as it is a physical one >

Mira: And they’re opening up possibilities for studying how quantum mechanics helps us understand classification from a quantum perspective, which opens up new avenues for study >

More episodes

← Home