OpenResearchAlpha

Quantum · 18 Nov 2026

Computational complexity of Berry phase estimation in topological phases of matter

Ryu Hayakawa, Kazuki Sakamoto, Chusei Kiumi

0
Citations
no database records one yet
0
Citations in 2026
so far
–
Leading author's h-index
no author has a profile yet
35
References
works it cites, from open citation data

Citations by database

Each database indexes a different set of journals, preprints and books, so they are shown side by side rather than blended.

  • OpenCitations0
  • Crossref0

Citations per year

The current year is still counting.

  • 2026 so far0

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.

What the data shows

  • No database records a citation yet, as is usual for a paper this new.

Graph

This paper in the middle, its authors and their most-cited papers below, the papers it cites to the left and the papers citing it to the right. The timeline lays every paper out by year.

Citing paper shares an authorAuthor without a profileSize shows citations, or h-index for authors

Select a node for its details. Drag to pan, scroll to zoom, drag a node to move it.

Start with

Authors (3)

Each author's standing in QAI's scholar index: the works their ORCID iD is attached to, and for anyone whose ORCID record names a lab OpenResearch follows, their arXiv preprints matched by name and a shared co-author. Names are as printed on the paper.

ProfileMost-cited paper

Cited by 0 papers

Who cites this paper, from open citation data, with Crossref's record of each; the 100 newest when there are more.

0 shown
No citing papers for this filter.

References (35)

What it cites, from open citation data, with Crossref's record of each.

Sign in to see 15 more references

A free account opens the rest of the citing papers and references on every paper’s page.

Computational complexity of Berry phase estimation in topological phases of matter - QAI OpenResearch