Quantum
Certified Discovery of Quantum Phase Diagrams
Publication: quant-ph updates on arXiv.org
Author: Yuanxi Liu, John Preskill, Hsin-Yuan Huang
Source published: 20/11/2026, 05:00:00 UTC
Briefing created: 20/11/2026, 05:24:13 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 20/11/2026, 05:13:25 UTC.
Briefings
A new quantum algorithm was developed to provably discover quantum phase diagrams for smooth families of local Hamiltonians. The method uses adiabatic transport of reference ground states, detecting phase boundaries via frequency-filtered local probes that measure gap closing. It succeeds if at least one reference state is correct in each gapped region, running in polynomial time at inverse-polynomial gap resolution. A classical quasipolynomial algorithm also exists for constant gap resolution. Numerical experiments confirm accuracy on model systems.
Key points
- The algorithm outputs the phase diagram to prescribed accuracy for smooth families of geometrically local Hamiltonians.
- It provides a verifiable certificate for every transition it reports using frequency-filtered local probes.
Context
This research addresses whether machines can provably discover new quantum phases of matter under physically motivated assumptions, as proposed in the arXiv preprint arXiv:2611.25064v1.
Limitations
The algorithm requires at least one correct reference ground state in each gapped region of parameter space. It relies on unverified preparations of reference states rather than training data or order parameters. Numerical experiments are limited to model systems, and the algorithm's performance at inverse-polynomial gap resolution remains untested beyond these examples.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 20/11/2026, 05:24:13 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeihphrsczqvcnhvhoho7ueeyzdrt45tyq4ju74cb4k4w3ofvzjhhzu