Postselection-free experimental observation of the measurement-induced phase transition in circuits with universal gates
Bibliographic record
Abstract
Monitored many-body systems can exhibit a phase transition between entangling and disentangling dynamical phases by tuning the strength of measurements made on the system as it evolves. This phenomenon is called the measurement-induced phase transition (MIPT). Understanding the properties of the MIPT is a prominent challenge for both theory and experiment at the intersection of many-body physics and quantum information. Realizing the MIPT experimentally is particularly challenging due to the postselection problem, which demands a number of experimental realizations that grows exponentially with the number of measurements made during the dynamics. Proposed approaches that circumvent the postselection problem typically rely on a classical decoding process that infers the final state based on the measurement record. But the complexity of this classical process generally also grows exponentially with the system size unless the dynamics is restricted to a fine-tuned set of unitary operators. In this work we overcome these difficulties. We construct a tree-shaped quantum circuit whose nodes are Haar-random unitary operators followed by weak measurements of tunable strength. For these circuits, we show that the MIPT can be detected without postselection using only a simple classical decoding process whose complexity grows linearly with the number of qubits. Our protocol exploits the recursive structure of tree circuits, which also enables a complete theoretical description of the MIPT, including an exact solution for its critical point and scaling behavior. We experimentally realize the MIPT on Quantinuum's H1-1 trapped-ion quantum computer and show that the experimental results are precisely described by theory. Our results close the gap between analytical theory and postselection-free experimental observation of the MIPT.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".