Data-Driven Learnability Transition of Measurement-Induced Entanglement
Measurement-induced entanglement (MIE) captures how local measurements generate long-range quantum correlations and drive dynamical phase transitions in many-body systems. Yet estimating MIE experimentally remains challenging: direct evaluation requires extensive post-selection over measurement outcomes, raising the question of whether MIE is accessible with only polynomial resources. We address this challenge by reframing MIE detection as a data-driven learning problem that assumes no prior knowledge of state preparation. Using measurement records alone, we train a neural network in a self-supervised manner to predict the uncertainty metric for MIE--the gap between upper and lower bounds of the average post-measurement bipartite entanglement. Applied to random circuits with one-dimensional all-to-all connectivity, our method reveals a learnability transition with increasing circuit depth: below a threshold the MIE can be effectively learned with resources that grow only polynomially with system size, whereas above it the required resources grow exponentially. This computational phase transition coincides with the breakdown of efficient classical simulation of the underlying quantum state. We further observe signatures of this transition on current noisy quantum devices. These results highlight the power of data-driven approaches for learning MIE and delineate the practical limits of its classical learnability.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Consciousness via MIPT?
The measurement-induced phase transition (MIPT) is a recently formulated phenomenon in out-of-equilibrium systems. The competition between unitary evolutions and measurement-induced non-unitaries leads to the transition …
Attention to Order: Transformers Discover Phase Transitions via Learnability
Phase transitions mark qualitative reorganizations of collective behavior, yet identifying their boundaries remains challenging whenever analytic solutions are absent and conventional simulations fail. Here we introduce …
Self-Supervised LearningOn statistical learning of graphs
We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds to learning a graph's labeling, knowing …
Switching off: the phenotypic transition to the uninduced state of the lactose uptake pathway
The lactose uptake-pathway of E. coli is a paradigmatic example of multistability in gene-regulatory circuits. In the induced state of the lac-pathway, the genes comprising the lac-operon are transcribed, leading to the …
TRACED: Transition-aware Regret Approximation with Co-learnability for Environment Design
Generalizing deep reinforcement learning agents to unseen environments remains a significant challenge. One promising solution is Unsupervised Environment Design (UED), a co-evolutionary framework in which a teacher adap…
Deep Reinforcement LearningZero-shot Generalization