Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2107.10279

Entanglement and charge-sharpening transitions in U(1) symmetric monitored quantum circuits

Utkarsh Agrawal·Aidan Zabalo·Kun Chen·Justin H. Wilson·Andrew C. Potter·J. H. Pixley·Sarang Gopalakrishnan·Romain Vasseur
View original source ↗Read source document ↗Export metadata ↓

Abstract

Monitored quantum circuits can exhibit an entanglement transition as a function of the rate of measurements, stemming from the competition between scrambling unitary dynamics and disentangling projective measurements. We study how entanglement dynamics in non-unitary quantum circuits can be enriched in the presence of charge conservation, using a combination of exact numerics and a mapping onto a statistical mechanics model of constrained hard-core random walkers. We uncover a charge-sharpening transition that separates different scrambling phases with volume-law scaling of entanglement, distinguished by whether measurements can efficiently reveal the total charge of the system. We find that while Rényi entropies grow sub-ballistically as $\sqrt{t}$ in the absence of measurement, for even an infinitesimal rate of measurements, all average Rényi entropies grow ballistically with time $\sim t$. We study numerically the critical behavior of the charge-sharpening and entanglement transitions in U(1) circuits, and show that they exhibit emergent Lorentz invariance and can also be diagnosed using scalable local ancilla probes. Our statistical mechanical mapping technique readily generalizes to arbitrary Abelian groups, and offers a general framework for studying dissipatively-stabilized symmetry-breaking and topological orders.

Explore related subjects

cond-mat.dis-nncond-mat.stat-mechquant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Utkarsh Agrawal, Aidan Zabalo, Kun Chen, Justin H. Wilson, Andrew C. Potter, J. H. Pixley, Sarang Gopalakrishnan, Romain Vasseur. 2022-10-04. Entanglement and charge-sharpening transitions in U(1) symmetric monitored quantum circuits. https://doi.org/10.1103/physrevx.12.041002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The critical slowing down in training diffusion models

Computational sampling has been central to the sciences since the mid-20th century. While machine-learning-based approaches have recently enabled major advances, their behavior remains poorly understood, with limited theoretical control over when and why they succeed. Here we provide such insight for diffusion models---a class of generative schemes highly effective in practice---by analyzing their application to the $O(n)$ model of statistical field theory in the Gaussian limit $n \to \infty$. In this analytically tractable setting, we show that training a score model with a one-layer network architecture matching the exact solution exhibits a form of critical slowing down in parameter learning. This slowing down also impacts the generation process, indicating that the well-known difficulties of sampling near criticality persist even for learned generative models. To overcome this bottleneck, we consider the power of architectural depth. We find that using a two-layer architecture drastically reduces the critical slowing down, with the training time scaling logarithmically rather than quadratically with system size. Using a Fourier implementation of the architecture, we further show that this acceleration in training time can be achieved without drastically increasing operational complexity. Taken together, these results demonstrate that diffusion models can overcome the critical slowing down through appropriate architectural design, and establish a controlled framework for understanding and improving learned sampling methods in statistical physics and beyond.

cond-mat.dis-nn↗
arXiv2026

Switching diffusivity selects Pareto tail exponent in random growth with redistribution

Random multiplicative growth with redistribution generates stationary Pareto wealth tails in the Bouchaud-Mézard model, but assumes a fixed multiplicative noise intensity. This is restrictive for physical and financial growth processes, where volatility (diffusivity) is often fluctuating. We replace the constant noise intensity by a switching diffusivity and ask how these fluctuations select the Pareto stationary tail. For a geometric Brownian motion with switching diffusivity, the long-time Gaussian limit holds when the redraw law has finite mean and variance. The asymptotic variance retains a contribution from diffusivity persistence. With redistribution and a general redraw law, the stationary large-wealth problem is characterized by a spectral condition for admissible algebraic modes. For a two-state diffusivity, an exact tail analysis gives a Pareto exponent interpolating between the high-diffusivity slow-refresh limit and the mean-diffusivity fast-refresh Bouchaud-Mézard limit.

cond-mat.dis-nn↗
arXiv2026

Extreme-Scale Ising Machines with Cluster Mean-Field Theory

Scaling analog and digital Ising machines to larger problems requires overcoming finite device capacity and the cost of communication between devices. We present cluster mean-field theory (CMFT), a framework that partitions a large interaction graph into clusters sized to fit available hardware. Each cluster performs local updates independently, while interactions across cluster boundaries enter through periodically updated effective biases computed from boundary-spin averages. To reduce the error introduced by fixed cluster boundaries, we introduce dynamic partitioning, which cycles through multiple partitions so that interactions approximated by mean fields at one stage can act through instantaneous spins at another. On three-dimensional spin glasses and planted Pegasus instances, dynamic CMFT exhibits power-law decay of residual energy over sweep budgets. This shows that solution quality continues to improve with computational effort despite the mean-field approximation. An automated graph partitioner combined with a weighted recovery ratio provides a practical heuristic for selecting partition combinations on graphs without natural cut directions. We demonstrate CMFT on four GPUs with approximately four million p-bits, reaching comparable energy densities up to 15 times faster than a single-GPU implementation of the full graph. By coupling locally evolving clusters through programmable effective biases, CMFT provides a route to extreme-scale Ising machines on both analog and digital hardware.

cond-mat.dis-nn↗