betaFeedback

WorksPhysics and Astronomy

Certified Discovery of Quantum Phase Diagrams

Abstract

Can a machine provably discover new quantum phases of matter? We show that the answer is yes under physically motivated assumptions. For any smooth family of geometrically local Hamiltonians, we construct an efficient quantum algorithm that outputs the phase diagram to prescribed accuracy and provides a verifiable certificate for every transition it reports. The algorithm takes as input only a classical description of the family together with unverified preparations of reference ground states; no order parameter, symmetry-breaking pattern, or training data are supplied. It succeeds provided that at least one preparation is correct in each gapped region of parameter space. The algorithm explores parameter space by quasi-adiabatically or adiabatically transporting each reference state, detecting the approach of a phase boundary by tapping the transported state with a frequency-filtered local probe: excitations created by the probe witness the closing of the energy gap. We prove that the gap closing for continuous phase transitions can always be detected using the frequency-filtered gradient of the Hamiltonian. The gap-detecting measurement is gentle, so when the ground state is unique a single reusable copy of each reference ground state supports the full exploration (for degenerate ground states, polynomially many copies suffice). The quantum algorithm runs in polynomial time at inverse-polynomial gap resolution. We also give a classical algorithm that runs in quasipolynomial time at constant gap resolution. Numerical experiments demonstrate how our algorithm accurately determines the phase structure of several model quantum systems.

Introduction

Quantum devices are beginning to prepare ground states and low-energy states of models that nobody can solve: frustrated magnets, doped Hubbard-like models, and engineered lattice gauge theories are already realized on programmable quantum simulators [1, 2, 3, 4, 5, 6], and within a few years this will become routine. For such states, there is no answer key: classical simulation cannot check them, and there is no textbook against which to compare them. That absence is the whole point of building the machines.

The output we want from such a device is usually not the state itself but instead the physical insight we can extract from it. In particular, one would like a machine that provably discovers phases of matter: given only a Hamiltonian family and a few unverified ground-state preparations, it outputs the phase diagram together with a certificate for every phase transition it reports. We call this task certified discovery of quantum phase diagrams. Until now, whether such a machine is possible has remained open, and in the worst case it is not. Estimating a spectral gap is hard [7, 8], as is locating a dynamical phase transition. [9] The gapped-versus-gapless question is undecidable in the thermodynamic limit [10, 11], and the phase diagram of a one-parameter family can be uncomputable [12]. Accordingly, quantum protocols for gap estimation [13, 14] come without worst-case guarantees.

What has existed instead are incomplete answers: heuristic machine-learning and optimization-based methods classify or detect phases without guarantees [15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], discovering without certifying, and provable algorithms apply only to special cases rather than generic geometrically local Hamiltonian families [32, 33, 34, 35]. Additional rigorous results concern supervised learning [36, 37, 38]: classical or quantum machine-learning algorithms provably classify phases after being trained on data in which phases are labeled. In that case, information about the phase structure is provided as an input; the algorithm does not discover new physics on its own.

In this work, we construct the missing machine: given a classical description of a local Hamiltonian family and unverified preparations of reference ground states, at least one of which succeeds in each gapped region, our efficient quantum algorithm provably outputs the phase diagram to prescribed accuracy, with no order parameter, symmetry pattern, or training labels supplied (Figure 1).

Figure 1. Overview of certified discovery of quantum phase diagrams. (a) The input is a classical description of a geometrically local Hamiltonian family H(x)=∑jhj(x)H(x) = \sum_j h_j(x) and reference state preparations at a few points of the parameter space. The algorithm is not told which preparations succeed, and no phase labels are supplied. (b) The output is the phase diagram to prescribed accuracy: points in the same tinted region are joined by chains of links whose endpoints are certified not to be in different phases, and each detected boundary is certified by a measured response and located to within the amber strip, where the gap is below the threshold γthresh\gamma_{\mathrm{thresh}}. The algorithm sweeps outward from every reference by quasi-adiabatic transport (one path is shown) and, where several transported states arrive at a point, selects among them by an energy test, so failed preparations do no harm: one successful preparation seeds discovery throughout its connected component of the resolved region. Gray stars mark the successful (filled) and failed (hollow) preparations, which the algorithm is not told. (c) Gap closings are detected by tapping the transported state with a frequency-filtered local probe, the Hamiltonian gradient ∂sH\partial_s H along the path: a filtered response witnesses a gap below the threshold γthresh\gamma_{\mathrm{thresh}}, and for continuous transitions this response provably cannot vanish – continuous transitions cannot be dark.

This algorithm formalizes ideas that are familiar to physicists. In each gapped phase, a ground state is provided at a single point in parameter space – perhaps an exact solution is available at that special point, or the ground state might be prepared accurately and efficiently by quantum simulation. Beginning at that point, the parameter space is explored systematically by quasi-adiabatically transporting the state, seeking points where the energy gap falls below a prescribed small value. The gap is detected by tapping the transported ground state with a local probe, filtered in frequency with cutoff Λ\Lambda. Excitations created by the probe certify that the gap is less than Λ\Lambda, hence approximately identifying the phase boundary where the energy gap vanishes in the thermodynamic limit. The gap-detecting measurement can be executed by an efficient quantum circuit; furthermore, it can be chosen to be very gentle, hardly perturbing the ground state at all, so that the same state can be used repeatedly by the algorithm. The runtime of the quantum algorithm is polynomial in the system size even if we choose to resolve the energy gap to inverse polynomial precision.

What happens if the closing of the energy gap is “dark” so that no local probe can detect the phase boundary? Fortunately, in the case of continuous transitions, this unfavorable situation can be excluded.1 If a continuous transition were dark, frequency-filtered quasi-adiabatic evolution across the phase boundary, which can be simulated by a constant-depth geometrically local quantum circuit, would preserve the ground state with high fidelity. The standard definition of quantum phases dictates that two quantum states connected by a constant-depth local unitary circuit are in the same phase [39]; therefore a genuine continuous phase transition cannot be dark. In fact, this argument guides our choice of local probe – the (frequency-filtered) gradient of the Hamiltonian H(x)H(x) with respect to the parameter xx, the generator of quasi-adiabatic evolution, is guaranteed to detect the gap closing.

In general, detecting a spectral gap is a very hard problem even for quantum computers [7, 8, 10, 11, 40], so our quantum algorithm is surely foiled by dark transitions for some Hamiltonian families. Intuitively, quantum phase transitions might go undetected if two qualitatively different candidate ground states cross one another in energy at a surface in the parameter space, where the energy gap becomes exponentially small in the system size.

A classical algorithm for phase learning, with the energy gap estimated to constant resolution, can be constructed following a similar strategy, in which quasi-adiabatic evolution and the response to a frequency-filtered probe are simulated in a finite-size patch of the system. Under a suitably strengthened assumption about the local visibility of the phase boundary, the runtime of this classical algorithm is quasipolynomial in the system size whenever the transport routes it follows have polylogarithmic length.

In § 2 we provide a high-level description of the quantum and classical algorithms and our main theorems, and § 3 describes numerical simulations illustrating applications of the algorithms. § 4 contains some concluding remarks. Many technical details are in the appendices.

Main results

Let H(x)=∑jhj(x)H(x) = \sum_j h_j(x) be a family of geometrically local Hamiltonians on nn qubits, where each term hjh_j acts on only a few neighboring qubits and varies smoothly as a function of the parameter x∈M=[−1,1]mx \in\mathcal{M} = [-1, 1]^m with m=O(1)m = O(1). Our algorithm tracks how the spectral gap γ(x)\gamma(x) depends on xx, seeking phase boundaries where γ\gamma sinks to a small value that vanishes in the limit n→∞n \to\infty. When the ground state is unique, we define γ(x)=E1(x)−E0(x)\gamma(x) = E_1(x) - E_0(x), where E0E_0 is the ground-state energy and E1E_1 is the energy of the first excited state. If several ground states are nearly degenerate, we call this low-lying cluster the ground-state manifold G(x)\mathcal{G}(x) and define γ(x)\gamma(x) as the energy difference separating it from the rest of the spectrum. We write r(x)r(x) for its dimension (the ground-state degeneracy), PG(x)P_{\mathcal{G}}(x) for its projector, and ρG(x)=PG(x)/r(x)\rho_{\mathcal{G}}(x) = P_{\mathcal{G}}(x)/r(x) for the maximally mixed state on it (the maximally mixed ground state). This caveat is relevant for broken-symmetry and topologically ordered phases, where splittings within the cluster are exponentially small in nn, which should not be interpreted as signaling a phase boundary.

To draw a phase diagram, one needs to decide whether and where the spectral gap closes along paths in the parameter space. Therefore the core of our phase-learning algorithm is the certified detection of gap closings. In the worst case, this task is extremely hard. Estimating the spectral gap of a local Hamiltonian is PUQMA[log⁡]\mathrm{P}^{\mathrm{UQMA}[\log]}-hard [7, 8], and in the thermodynamic limit the gapped-versus-gapless question is undecidable for translation-invariant lattice systems in two dimensions [10] or even in one dimension [11]. Locating a phase boundary to constant precision for a finite system is PQMAEXP\mathrm{P}^{\mathrm{QMA}_{\mathrm{EXP}}}-complete [40]. No efficient algorithm can succeed unconditionally. But in all hard instances, properties of ground states change abruptly at the phase boundary. We will prove that quantum algorithms that efficiently detect gap closings can be constructed when the phase transition is continuous.2

Experimental physicists use a variety of heuristic methods to map phase diagrams: for example measuring observables such as order parameters, structure factors, or local correlations that behave differently in distinct phases [1, 3, 4, 43, 44]. In general, though, it might not be easy to guess which operator signals a given transition. Our approach to detecting phase boundaries is inspired by physical experiments in which the investigator perturbs the ground state with a locally coupled low-frequency probe. Creation of low-energy excitations by a probe with frequency ω\omega certifies an energy gap no larger than ω\omega.

To formalize this idea, we define the band-restricted spectral weight of an operator OO with respect to the ground-state manifold,

W[γ,Λ)O(x)=1r(x)∑0≤j<r(x)≤kEk(x)−Ej(x)<Λ∣⟨ψk(x)∣O∣ψj(x)⟩∣2.(1)W^{O}_{[\gamma,\Lambda)}(x)=\frac{1}{r(x)}\sum_{\substack{0\leq j<r(x)\leq k\\ E_k(x)-E_j(x)<\Lambda}}\left|\langle\psi_k(x)|O|\psi_j(x)\rangle\right|^2. \tag*{(1)}

It measures how strongly OO couples the maximally mixed ground state ρG(x)\rho_{\mathcal{G}}(x) to states above the manifold with transition energy at least γ(x)\gamma(x) but less than Λ\Lambda; for a unique ground state it is the sum of squared transition matrix elements out of ∣ψ0(x)⟩|\psi_0(x)\rangle. We probe ρG(x)\rho_{\mathcal{G}}(x) rather than a particular ground state because a pure state can rotate within a degenerate manifold onto a state that a given probe does not see, while ρG(x)\rho_{\mathcal{G}}(x) is invariant under such rotations. These rotations are harmless for transport in any case; the only error that matters is leakage across the gap, and that is what WW measures.

This quantity controls the transition rate in Fermi’s golden rule and the absorptive Kubo response if the system is probed by modulating OO with a frequency spectrum uniformly distributed over a band from ω0\omega_0 to Λ\Lambda, where 0<ω0<γ(x)0<\omega_0<\gamma(x). Note, though, that our rigorous analysis of the system’s response to this probe does not require the use of weak-coupling perturbation theory.

Non-negligible inelastic response to this probe certifies that the system has an energy gap less than Λ\Lambda. But not detecting a response for a particular OO does not by itself ensure the gap to be greater than Λ\Lambda. A different local probe could yield a different result. A small gap could even be invisible to all local probes because the spectral weight is negligible for any local OO. Indeed, some discontinuous phase transitions are “dark” in this sense. Theorem 1 states that continuous phase transitions obeying an inverse-polynomial finite-size gap condition cannot be dark.

To understand why continuous quantum phase transitions cannot be dark, begin by recalling the definition of a quantum phase. We fix a class C\mathcal{C} of geometrically local unitary circuits of constant depth D=O(1)D=O(1) (for the definition of symmetry-protected phases we require the circuits to respect the symmetry), and we specify two functions of the system size

ηP(n)>ηB(n)≥1/poly⁡(n).(2)\eta_{\mathrm{P}}(n)>\eta_{\mathrm{B}}(n)\geq1/\operatorname{poly}(n). \tag*{(2)}

Two ground states ρG(xA)\rho_{\mathcal{G}}(x_A) and ρG(xB)\rho_{\mathcal{G}}(x_B) with r(xA)=r(xB)r(x_A)=r(x_B) are in the same phase if

Tr⁡[PG(xB)CρG(xA)C†]≥1−ηB(n)for some C∈C,(3)\operatorname{Tr}\left[P_{\mathcal{G}}(x_B)C\rho_{\mathcal{G}}(x_A)C^\dagger\right]\geq1-\eta_{\mathrm{B}}(n)\quad\text{for some }C\in\mathcal{C}, \tag*{(3)}

and are in different phases if

Tr⁡[PG(xB)CρG(xA)C†]≤1−ηP(n)for all C∈C.(4)\operatorname{Tr}\left[P_{\mathcal{G}}(x_B)C\rho_{\mathcal{G}}(x_A)C^\dagger\right]\leq1-\eta_{\mathrm{P}}(n)\quad\text{for all }C\in\mathcal{C}. \tag*{(4)}

Moreover, if rA≠rBr_A \ne r_B, then ρG(xA)\rho_{\mathcal{G}}(x_A) and ρG(xB)\rho_{\mathcal{G}}(x_B) are in different phases.

Another essential ingredient in our arguments is quasi-adiabatic evolution. Let H(s)H(s), s∈[0,1]s \in[0,1], be a smooth parametrized path in the space of Hamiltonians. Suppose the gap of H(s)H(s) stays open along the path, and let FΔ(t)F_{\Delta}(t) be a function of time whose Fourier transform has negligible support for Δ>0\Delta> 0 (a filter function with energy cutoff Δ\Delta). The quasi-adiabatic generator DΔ(s)D_{\Delta}(s) and propagator UΔ(s)U_{\Delta}(s) are [45, 46, 47]

DΔ(s):=i∫−∞∞FΔ(t)eitH(s)∂sH(s)e−itH(s) dt,UΔ(s):=Texp⁡(i∫0sDΔ(s′) ds′),(5)D_{\Delta}(s) := i \int_{-\infty}^{\infty} F_{\Delta}(t)e^{itH(s)}\partial_s H(s)e^{-itH(s)}\,\mathrm{d}t,\qquad U_{\Delta}(s) := \mathcal{T}\exp\left(i\int_0^s D_{\Delta}(s')\,\mathrm{d}s'\right), \tag*{(5)}

where T\mathcal{T} denotes time-ordering. The unitary UΔ:=UΔ(1)U_{\Delta} := U_{\Delta}(1) is quasi-local and transports the ground state along the path; on finite systems it is approximated by a constant-depth geometrically local circuit. An O(1)O(1)-length gapped path in parameter space therefore certifies that its endpoint ground states lie in the same phase. Conversely, if the endpoint ground states lie in different phases, then along any O(1)O(1)-length path between them, the quasi-adiabatic evolution UΔU_{\Delta} with constant cutoff Δ\Delta must incur at least inverse-polynomial error:

Tr⁡[PG(xB)UΔρG(xA)UΔ†]≤1−ηP(n).(6)\operatorname{Tr}\left[P_{\mathcal{G}}(x_B)U_{\Delta}\rho_{\mathcal{G}}(x_A)U_{\Delta}^{\dagger}\right] \le1-\eta_P(n). \tag*{(6)}

One’s naive expectation is that whether quasi-adiabatic continuation with energy cutoff Δ\Delta successfully preserves the ground state along a path in the parameter space hinges on whether Δ\Delta lies below the true energy gap everywhere along the path. We prove a refined version of this criterion: continuation is controlled by the spectral weight W∂sH[γ,Δ)W_{\partial_s H}^{[\gamma,\Delta)} defined in Eq. (1), where the operator OO is the path-gradient operator ∂sH(s)\partial_s H(s). Continuation succeeds when this spectral weight is sufficiently small everywhere, even if the cutoff lies above the gap. Stated contrapositively, if the gap is no smaller than 1/poly⁡(n)1/\operatorname{poly}(n) everywhere along the path, then failure to preserve the ground state as in Eq. (6) forces the spectral weight of ∂sH(s)\partial_s H(s) to be at least inverse-polynomially large.

References

  1. [1]Sepehr Ebadi, Tout T Wang, Harry Levine, Alexander Keesling, Giulia Semeghini, Ahmed Omran, Dolev Bluvstein, Rhine Samajdar, Hannes Pichler, Wen Wei Ho, et al. Quantum phases of matter on a 256-atom programmable quantum simulator. Nature, 595(7866):227–232, 2021.
  2. [2]Pascal Scholl, Michael Schuler, Hannah J. Williams, Alexander A. Eberharter, Daniel Barredo, Kai-Niklas Schymik, Vincent Lienhard, Louis-Paul Henry, Thomas C. Lang, Thierry Lahaye, and Andreas M. Läuchli, and Antoine Browaeys. Quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms. Nature, 595(7866):233–238, 2021.DOI
  3. [3]Giulia Semeghini, Harry Levine, Alexander Keesling, Sepehr Ebadi, Tout T Wang, Dolev Bluvstein, Ruben Verresen, Hannes Pichler, Marcin Kalinowski, Rhine Samajdar, et al. Probing topological spin liquids on a programmable quantum simulator. Science, 374(6572):1242–1247, 2021.
  4. [4]Hou-Ji Shao, Yu-Xuan Wang, De-Zhi Zhu, Yan-Song Zhu, Hao-Nan Sun, Si-Yuan Chen, Chi Zhang, Zhi-Jie Fan, Youjin Deng, Xing-Can Yao, Yu-Ao Chen, and Jian-Wei Pan. Antiferromagnetic phase transition in a 3D fermionic Hubbard model. Nature, 632(8024):267–272, 2024.DOI
  5. [5]Bing Yang, Hui Sun, Robert Ott, Han-Yi Wang, Torsten V. Zache, Jad C. Halimeh, Zhen-Sheng Yuan, Philipp Hauke, and Jian-Wei Pan. Observation of gauge invariance in a 71-site Bose–Hubbard quantum simulator. Nature, 587(7834):392–396, 2020.
  6. [6]Zhao-Yu Zhou, Guo-Xian Su, Jad C. Halimeh, Robert Ott, Hui Sun, Philipp Hauke, Bing Yang, Zhen-Sheng Yuan, Jürgen Berges, and Jian-Wei Pan. Thermalization dynamics of a gauge theory on a quantum simulator. Science, 377(6603):311–314, 2022.DOI
  7. [7]Andris Ambainis. On physical problems that are slightly more difficult than QMA. In 2014 IEEE 29th Conference on Computational Complexity (CCC), pages 32–43. IEEE, 2014.arxiv.org/abs/1312.4758
  8. [8]Seyav Gharibian and Justin Yirka. The complexity of simulating local measurements on quantum systems. Quantum, 3:189, 2019.
  9. [9]Jue Xu, Xiao Yuan, and Qi Zhao. Provable quantum advantage for dynamical phase transition, 2026. arXiv:2606.30396.arxiv.org/abs/2606.30396
  10. [10]Toby S. Cubitt, David Pérez-García, and Michael M. Wolf. Undecidability of the spectral gap. Nature, 528(7581):207–211, 2015.
  11. [11]Johannes Bausch, Toby S. Cubitt, Angelo Lucia, and David Pérez-García. Undecidability of the spectral gap in one dimension. Physical Review X, 10(3):031038, 2020.DOI
  12. [12]Johannes Bausch, Toby S. Cubitt, and James D. Watson. Uncomputability of phase diagrams. Nature Communications, 12:452, 2021.
  13. [13]Davide Cugini, Francesco Ghis​​oni, Angela Rosy Morgillo, and Francesco Scala. Spectral gap estimation via adiabatic preparation. Physica Scripta, 101(24):245109, 2026.
  14. [14]Hugo Pages, Chusei Kiumi, Yuto Morohoshi, Bálint Koczor, and Kosuke Mitarai. Low-resource quantum energy gap estimation via randomization. Physical Review Research, 2026. arXiv:2601.13881.arxiv.org/abs/2601.13881
  15. [15]Juan Carrasquilla and Roger G Melko. Machine learning phases of matter. Nat. Phys., 13(5):431–434, 2017.
  16. [16]Evert P. L. van Nieuwenburg, Ye-Hua Liu, and Sebastian D. Huber. Learning phase transitions by confusion. Nature Physics, 13(5):435–439, 2017.DOI
  17. [17]Lei Wang. Discovering phase transitions with unsupervised learning. Physical Review B, 94(19):195105, 2016.DOI
  18. [18]Sebastian J. Wetzel. Unsupervised learning of phase transitions: From principal component analysis to variational autoencoders. Physical Review E, 96(2):022140, 2017.DOI
  19. [19]Peter Broecker, Juan Carrasquilla, Roger G. Melko, and Simon Trebst. Machine learning quantum phases of matter beyond the fermion sign problem. Scientific Reports, 7(1):8823, 2017.
  20. [20]Kelvin Ch’ng, Juan Carrasquilla, Roger G. Melko, and Ehsan Khatami. Machine learning phases of strongly correlated fermions. Physical Review X, 7(3):031038, 2017.
  21. [21]Yi Zhang and Eun-Ah Kim. Quantum loop topography for machine learning. Phys. Rev. Lett., 118(21):216401, 2017.DOI
  22. [22]Joaquin F. Rodriguez-Nieva and Mathias S. Scheurer. Identifying topological order through unsupervised machine learning. Nature Physics, 15(8):790–795, 2019.
  23. [23]Jonas Greitemann, Ke Liu, and Lode Pollet. Probing hidden spin order with interpretable machine learning. Physical Review B, 99(6):060404, 2019.DOI
  24. [24]Giuseppe Carleo, Ignacio Cirac, Kyle Cranmer, Laurent Daudet, Maria Schuld, Naftali Tishby, Leslie Vogt-Maranto, and Lenka Zdeborová. Machine learning and the physical sciences. Reviews of Modern Physics, 91(4):045002, 2019.DOI
  25. [25]Yanming Che, Clemens Gneiting, Xiaoguang Wang, and Franco Nori. Quantum circuit complexity and unsupervised machine learning of topological order. Nature Communications, 17(1):5179, 2026.DOI
  26. [26]André Grossi Fonseca, Eric Wang, Sachin Vaidya, Patrick J. Ledwith, Ashvin Vishwanath, and Marin Soljačić. Gradient-based search of quantum phases: discovering unconventional fractional Chern insulators, 2025. arXiv:2509.10438.arxiv.org/abs/2509.10438
  27. [27]Mehran Khosrojerdi, Alessandro Cuccoli, Paola Verrucchi, and Leonardo Banchi. Unsupervised learning to recognize quantum phases of matter. AVS Quantum Science, 8(3):033801, 2026.arxiv.org/abs/2510.14742
  28. [28]Oleksii Malyshev, Simon M. Linsel, Fabian Grusdt, Annabelle Bohrdt, Eugene Demler, and Ivan Morera. Distance learning from projective measurements as an information-geometric probe of many-body physics, 2026. arXiv:2603.13485.arxiv.org/abs/2603.13485
  29. [29]Ching-Yu Huang and Min-Fong Yang. Detecting quantum phase transitions via shallow variational quantum circuits. Physical Review B, 2026. arXiv:2607.25345.DOI
  30. [30]Shiyu Zhou, Yuxuan Zhang, Sebastian Wetzel, Roger Melko, and Xiu-Zhe Luo. Autonomous phase discovery, 2026. arXiv:2609.33802.arxiv.org/abs/2609.33802
  31. [31]Jannes Nys, Andrew Jreissaty, and Juan Carrasquilla. QuantumMatterExplorer: An autonomous agent for the discovery of quantum many-body phases of matter, 2026. arXiv:2610.32001.arxiv.org/abs/2610.32001
  32. [32]Stefan Knabe. Energy gaps and elementary excitations for certain VBS-quantum antiferromagnets. Journal of Statistical Physics, 52(3):627–638, 1988.DOI
  33. [33]Kshiti Sneh Rai, Ilya Kull, Patrick Emonts, Jordi Tura, Norbert Schuch, and Flavio Baccari. A hierarchy of spectral gap certificates for frustration-free spin systems. Quantum, 10:2065, 2026.DOI
  34. [34]Ethan Lake, Shankar Balasubramanian, and Soonwon Choi. Exact quantum algorithms for quantum phase recognition: renormalization group and error correction. PRX Quantum, 6:010350, 2025.DOI
  35. [35]Alexandre Chaduteau, Hao Chen, Juraj Hasik, and Titus Neupert. Agnostic and efficient detection of Z₂ symmetry-protected topological phases in projected entangled-pair states, 2026. arXiv:2611.07030.arxiv.org/abs/2611.07030
  36. [36]Hsin-Yuan Huang, Richard Kueng, Giacomo Torlai, Victor V Albert, and John Preskill. Provably efficient machine learning for quantum many-body problems. Science, 377(6613):eabk3333, 2022.DOI
  37. [37]Yusen Wu, Bujiao Wu, Jingbo Wang, and Xiao Yuan. Quantum phase recognition via quantum kernel methods. Quantum, 7:981, 2023.DOI
  38. [38]Jonas Jäger, Paolo Braccia, Pablo Bermejo, Manuel G. Algaba, Diego García-Martín, and M. Cerezo. Provable and scalable quantum Gaussian processes for quantum learning, 2026. arXiv:2605.00099.arxiv.org/abs/2605.00099
  39. [39]Xie Chen, Zheng-Cheng Gu, and Xiao-Gang Wen. Local unitary transformation, long-range quantum entanglement, wave function renormalization, and topological order. Physical Review B, 82(15):155138, 2010.DOI
  40. [40]James D. Watson and Johannes Bausch. The complexity of approximating critical points of quantum phase transitions, 2021. arXiv:2105.13350.arxiv.org/abs/2105.13350
  41. [41]C. R. Laumann, R. Moessner, A. Scardicchio, and S. L. Sondhi. Quantum adiabatic algorithm and scaling of gaps at first-order quantum phase transitions. Physical Review Letters, 109:030502, 2012.pubmed.ncbi.nlm.nih.gov/22861831
  42. [42]Massimo Campostrini, Jacopo Nespolo, Andrea Pelissetto, and Ettore Vicari. Finite-size scaling at first-order quantum transitions. Physical Review Letters, 113:070402, 2014.DOI
  43. [43]Alexander Keesling, Ahmed Omran, Harry Levine, Hannes Bernien, Hannes Pichler, Soonwon Choi, Rhine Samajdar, Sylvain Schwartz, Pietro Silvi, Subir Sachdev, Peter Zoller, Manuel Endres, Markus Greiner, Vladan Vuletić, and Mikhail D. Lukin. Quantum Kibble–Zurek mechanism and critical dynamics on a programmable Rydberg simulator. Nature, 568(7751):207–211, 2019.DOI
  44. [44]Anton Mazurenko, Christie S. Chiu, Geoffrey Ji, Maxwell F. Parsons, Márton Kanász-Nagy, Richard Schmidt, Fabian Grusdt, Eugene Demler, Daniel Greif, and Markus Greiner. A cold-atom Fermi–Hubbard antiferromagnet. Nature, 545(7655):462–466, 2017.DOI
  45. [45]Matthew B Hastings and Xiao-Gang Wen. Quasiadiabatic continuation of quantum states: The stability of topological ground-state degeneracy and emergent gauge invariance. Phys. Rev. B, 72(4):045141, 2005.DOI
  46. [46]Matthew B Hastings. Locality in quantum systems. In Quantum Theory from Small to Large Scales, pages 171–212. Oxford University Press, 2012.arxiv.org/abs/1008.5137
  47. [47]Sven Bachmann, Spyridon Michalakis, Bruno Nachtergaele, and Robert Sims. Automorphic equivalence within gapped phases of quantum lattice systems. Communications in Mathematical Physics, 309(3):835–871, 2012.DOI
  48. [48]Nick G. Jones, Paul Fendley, Nathanan Tantivasadakarn, and Ruben Verresen. Quasi-phases of quantum matter, 2026. arXiv:2610.40526.arxiv.org/abs/2610.40526
  49. [49]Philipp Uhrich, Salvatore Castrignano, Hermann Uys, and Michael Kastner. Noninvasive measurement of dynamic correlation functions. Physical Review A, 96:022127, 2017.DOI
  50. [50]Chi-Fang Chen and Robbie King. Catalytic tomography of ground states, 2025. arXiv:2512.10247.arxiv.org/abs/2512.10247
  51. [51]Chi-Fang Chen and András Gilyén. Efficiently estimating quantum thermal properties from exponentially fewer samples, 2026. arXiv:2603.16845.arxiv.org/abs/2603.16845
  52. [52]Kangle Li and Liujun Zou. Stability of energy gap of macroscopic quantum matter, 2026. arXiv:2611.06528.arxiv.org/abs/2611.06528
  53. [53]Hannes Bernien, Sylvain Schwartz, Alexander Keesling, Harry Levine, Ahmed Omran, Hannes Pichler, Soonwon Choi, Alexander S Zibrov, Manuel Endres, Markus Greiner, et al. Probing many-body dynamics on a 51-atom quantum simulator. Nature, 551(7682):579–584, 2017.
  54. [54]Jeongwan Haah. An invariant of topologically ordered states under local unitary transformations. Communications in Mathematical Physics, 342(3):771–801, 2016.DOI
  55. [55]Sergey Bravyi, Matthew B Hastings, and Frank Verstraete. Lieb-Robinson bounds and the generation of correlations and topological quantum order. Physical Review Letters, 97(5):050401, 2006.pubmed.ncbi.nlm.nih.gov/17026080
  56. [56]Xie Chen, Arpit Dua, Michael Hermele, David T. Stephen, Nathanan Tantivasadakarn, Robijn Van hove, and Jing-Yu Zhao. Sequential quantum circuits as maps between gapped phases. Physical Review B, 109(7):075116, February 2024.DOI
  57. [57]Emilie Fulton Huffman and Shailesh Chandrasekharan. Solution to sign problems in half-filled spin-polarized electronic systems. Phys. Rev. B, 89:111101, 2014.DOI
  58. [58]Zi-Xiang Li, Yi-Fan Jiang, and Hong Yao. Solving the fermion sign problem in quantum Monte Carlo simulations by Majorana representation. Phys. Rev. B, 91:241117, 2015.DOI
  59. [59]Alexei Kitaev. Anyons in an exactly solved model and beyond. Annals of Physics, 321(1):2–111, 2006.DOI
  60. [60]I. S. Tupitsyn, A. Kitaev, N. V. Prokof’ev, and P. C. E. Stamp. Topological multicritical point in the phase diagram of the toric code model and three-dimensional lattice gauge Higgs model. Physical Review B, 82(8):085114, August 2010.DOI
  61. [61]Fengcheng Wu, Youjin Deng, and Nikolay Prokof’ev. Phase diagram of the toric code model in a parallel magnetic field. Physical Review B, 85:195104, 2012.DOI
  62. [62]Lin Lin and Yu Tong. Near-optimal ground state preparation. Quantum, 4:372, 2020.
  63. [63]Zhiyan Ding, Chi-Fang Chen, and Lin Lin. Single-ancilla ground state preparation via Lindbladians. Physical Review Research, 6:033147, 2024.DOI
  64. [64]Hao-En Li, Yilun Yang, and Lin Lin. Dissipative phase decision without ground-state preparation, 2026. arXiv:2606.28750.arxiv.org/abs/2606.28750
  65. [65]Thomas Schuster, Dominik Kufel, Norman Y. Yao, and Hsin-Yuan Huang. Hardness of recognizing phases of matter, 2025. arXiv:2510.08503.arxiv.org/abs/2510.08503
  66. [66]Andrea Coser and David Pérez-García. Classification of phases for mixed states via fast dissipative evolution. Quantum, 3:174, 2019.DOI
  67. [75]Rajendra Bhatia. Matrix analysis, volume 169 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1997.
  68. [76]Bruno Nachtergaele, Robert Sims, and Amanda Young. Quasi-locality bounds for quantum lattice systems. i. Lieb-Robinson bounds, quasi-local maps, and spectral flow automorphisms. J. Math. Phys., 60(6):061101, 2019.DOI
  69. [77]Michael A. Nielsen and Isaac L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 10th anniversary edition, 2010.
  70. [78]Andrew M. Essin and Michael Hermele. Classifying fractionalization: Symmetry classification of gapped Z₂ spin liquids in two dimensions. Physical Review B, 87(10):104406, 2013.DOI
  71. [79]Meng Cheng, Michael Zaletel, Maissam Barkeshli, Ashvin Vishwanath, and Parsa Bonderson. Translational symmetry and microscopic constraints on symmetry-enriched topological phases: A view from the surface. Physical Review X, 6(4):041068, 2016.DOI
  72. [80]Maissam Barkeshli, Parsa Bonderson, Meng Cheng, and Zhenghan Wang. Symmetry fractionalization, defects, and gauging of topological phases. Physical Review B, 100(11):115147, 2019.DOI
  73. [81]Tosio Kato. On the adiabatic theorem of quantum mechanics. Journal of the Physical Society of Japan, 5(6):435–439, 1950.DOI
  74. [82]Sabine Jansen, Mary-Beth Ruskai, and Ruedi Seiler. Bounds for the adiabatic approximation with applications to quantum computation. Journal of Mathematical Physics, 48(10):102111, 2007.
  75. [83]J. S. Pedernales, R. Di Candia, I. L. Egusquiza, J. Casanova, and E. Solano. Efficient quantum algorithm for computing n-time correlation functions. Physical Review Letters, 113(2):020505, 2014.DOI
  76. [84]Andrew M Childs, Yuan Su, Minh C Tran, Nathan Wiebe, and Shuchen Zhu. Theory of Trotter error with commutator scaling. Physical Review X, 11(1):011020, 2021.DOI
  77. [85]Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma. Simulating Hamiltonian dynamics with a truncated Taylor series. Physical Review Letters, 114(9):090502, 2015.pubmed.ncbi.nlm.nih.gov/25793789
  78. [86]Dominic W. Berry, Andrew M. Childs, Yuan Su, Xin Wang, and Nathan Wiebe. Time-dependent Hamiltonian simulation with L¹-norm scaling. Quantum, 4:254, 2020. arXiv:1906.07115.DOI
  79. [87]John Watrous. The Theory of Quantum Information. Cambridge University Press, 2018.DOI
  80. [88]Roman Vershynin. High-dimensional probability, volume 47 of Cambridge Series in Statistical and Probabilistic Mathematics. Cambridge University Press, Cambridge, 2018. An introduction with applications in data science, With a foreword by Sara van de Geer.DOI
  81. [89]Yimin Ge, András Molnár, and J. Ignacio Cirac. Rapid adiabatic preparation of injective projected entangled pair states and Gibbs states. Physical Review Letters, 116(8):080503, 2016.DOI
  82. [90]Tosio Kato. Perturbation Theory for Linear Operators. Classics in Mathematics. Springer, Berlin, 1995.
  83. [91]Jeongwan Haah, Matthew B Hastings, Robin Kothari, and Guang Hao Low. Quantum algorithm for simulating real time evolution of lattice Hamiltonians. SIAM Journal on Computing, 52(6):FOCS18–250, 2023.
  84. [92]Chandler Davis and W. M. Kahan. The rotation of eigenvectors by a perturbation. III. SIAM Journal on Numerical Analysis, 7(1):1–46, 1970.DOI
  85. [93]J. E. Gubernatis, D. J. Scalapino, R. L. Sugar, and W. D. Toussaint. Two-dimensional spin-polarized fermion lattice gases. Phys. Rev. B, 32:103, 1985.pubmed.ncbi.nlm.nih.gov/9936645
  86. [94]Kou-Han Ma and Ning-Hua Tong. Interacting spinless fermions on the square lattice: Charge order, phase separation, and superconductivity. Phys. Rev. B, 104:155116, 2021.DOI

Paper details

vlnc:W_qrfs295a
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

GPT (multiple versions), Claude, our own fine-tuned LLM, structured verification system

View statement
Looking for related papers…
Contents