The Signal
Paper outlines algorithms for preparing many-body ground states
A paper in Quantum describes polynomial-time classical algorithms that use local reduced density matrices to produce circuits for preparing many-body ground states. The framework covers short-range entangled states and long-range entangled ground states, and the authors say the resulting circuit depth is asymptotically optimal for both categories.

A paper in Quantum describes classical algorithms for constructing circuits to prepare many-body ground states. The journal page lists the paper, “Learning State Preparation Circuits for Quantum Phases of Matter,” by Hyun-Soo Kim, Isaac H. Kim and Daniel Ranard, as published on November 10, 2026.
Local information as input
Preparing many-body ground states is an important subroutine in simulating physical systems, the paper’s abstract says. The algorithms take reduced density matrices over balls of constant size as input and output a circuit intended to prepare the global state.
The authors describe the algorithms as polynomial-time and classical. The framework is presented for two categories of ground states: short-range entangled states and long-range entangled states. The abstract says both algorithms can provably find a circuit whose depth is asymptotically optimal.
Two categories of states
For short-range entangled states, the examples include states prepared by shallow quantum circuits in any number of dimensions. The abstract also places invertible states within this category.
The second category is long-range entangled ground states. The paper gives the toric code on a disk as an example. These examples indicate the kinds of states addressed by the framework.
Condition behind the approach
The method uses a variant of the quantum Markov chain condition. According to the abstract, this variant remains robust against constant-depth circuits. The authors say that robustness allows their method to apply to a large class of states while ensuring a classically tractable optimization landscape.
The journal lists the paper in volume 10 as article 2270 and gives its eprint as arXiv:2410.23544v3.
Source
Related stories
- Study Finds Coherent Errors Can Drive Honeycomb Surface Code Into a Critical Regime
- Perimeter Team Finds Multiple Peaks in Noisy Quantum Circuits
- Physical Review Applied publishes classical wavebit circuit emulator
- Researchers’ Hypergraph Matcher Cuts Qiskit Runtime by 606×
- Quantum Errors Pick the Late-Time Mixed-State Ensemble