Encoding universal quantum computation into quantized Berry phases: Hardness results and classical algorithms
quant-ph
Submitted: 2026-09-29
Updated: 2026-09-29
Terminology
Sources
- Adiabatic Error Cancellation in Berry Phase Estimation
- Computational complexity of Berry phase estimation in topological phases of matter
- Classical Algorithms for Constant Approximation of the Ground State Energy of Local Hamiltonians
- Locality in Quantum Systems
- A Simple Proof that Toffoli and Hadamard are Quantum Universal
- Quasi-adiabatic Continuation for Disordered Systems: Applications to Correlations, Lieb-Schultz-Mattis, and Hall Conductance
- Hardness of recognizing phases of matter
- On the Computational Complexity of Guided Berry Phase Estimation
- Classical Algorithms for Hamiltonian Dynamics Mean Value and Guided Local Hamiltonian Problem
- A Dequantized Algorithm for the Guided Local Hamiltonian Problem
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