On the Computational Complexity of Guided Berry Phase Estimation
quant-ph, cs.CC
Submitted: 2026-09-22
Updated: 2026-09-22
Terminology
Sources
- Topological Insulators
- Tutorial: From Topology to Hall Effects -- Implications of Berry Phase Physics
- Berry Phase Effects on Electronic Properties
- Inequivalent Berry phases for the bulk polarization
- Holonomic Quantum Computation
- Geometric quantum computation with NMR
- Fault-tolerant quantum computation by anyons
- A modular functor which is universal for quantum computation
- The Complexity of the Local Hamiltonian Problem
- The complexity of quantum spin systems on a two-dimensional square lattice
- Universal Quantum Hamiltonians
- Schrieffer-Wolff transformation for quantum many-body systems
- On complexity of the quantum Ising model
- The complexity of antiferromagnetic interactions and 2D lattices
- Computational complexity of Berry phase estimation in topological phases of matter
- Physically-Motivated Guiding States for Local Hamiltonians
- Computational Complexity of interacting electrons and fundamental limitations of Density Functional Theory
- Bounds for the adiabatic approximation with applications to quantum computation
- An Elementary Proof of the Quantum Adiabatic Theorem
- Adiabatic Quantum State Generation and Statistical Zero Knowledge
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity