arXiv — Machine Learning · · 4 min read

Demons on a Budget: Adaptive Measurement Placement at the Entanglement Phase Transition

Mirrored from arXiv — Machine Learning for archival readability. Support the source by reading on the original site.

Quantum Physics

arXiv:2608.19248 (quant-ph)
[Submitted on 16 Aug 2026]

Title:Demons on a Budget: Adaptive Measurement Placement at the Entanglement Phase Transition

Authors:Rohan Pandey
View a PDF of the paper titled Demons on a Budget: Adaptive Measurement Placement at the Entanglement Phase Transition, by Rohan Pandey
View PDF HTML (experimental)
Abstract:Monitored quantum circuits exhibit a measurement-induced phase transition between volume-law and area-law entanglement as a function of the measurement rate $p$. Prior work places measurements at random locations and treats the rate as the control parameter. We instead fix the measurement budget and vary the placement process, comparing random placement against hand-designed and learned policies in brickwork random Clifford circuits at matched budget. First, placement geometry matters more than placement information. A deterministic contiguous sweep cuts the half-cut entropy by a factor of 3.4 relative to random placement, while equal-coverage unstructured placement and a greedy policy with full state access do far worse. The effect is carried by spatial order alone: measuring the $k$ least recently measured sites gives $4.14 \pm 0.06$ bits with random tie-breaking and $1.29 \pm 0.04$ bits with position-ordered tie-breaking. Second, the sweep eliminates the transition rather than shifting it. Tripartite mutual information crossings recede as $p^* \propto 1/L$, the steady-state entropy saturates at an $L$-independent ceiling near $0.46/p$, and data for $64 \le L \le 512$ collapse onto the form $S = p^{-1} f(pL)$ predicted by a ballistic regrowth argument. Third, in stabilizer dynamics every outcome is deterministic or a fair coin flip, so the record's Shannon entropy is exactly countable; the sweep dominates the entropy-versus-record-cost frontier while paying the same roughly one bit per measurement as random placement. Policies trained by cross-entropy and proximal policy optimization do not find the sweep: score-based policies parameterize which sites to measure, not the order in which degenerate scores are resolved, and the effect lives in that order. The phase diagram of monitored dynamics is a property of the placement process, not only of the measurement rate.
Comments: 10 pages
Subjects: Quantum Physics (quant-ph); Machine Learning (cs.LG)
Cite as: arXiv:2608.19248 [quant-ph]
  (or arXiv:2608.19248v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2608.19248
arXiv-issued DOI via DataCite

Submission history

From: Rohan Pandey [view email]
[v1] Sun, 16 Aug 2026 04:08:30 UTC (939 KB)
Full-text links:

Access Paper:

Current browse context:

quant-ph
< prev   |   next >
Change to browse by:
Loading...

BibTeX formatted citation

loading...
Data provided by:

Bookmark

BibSonomy Reddit
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from arXiv — Machine Learning