Universal purification dynamics of monitored Clifford circuits
- URL: http://arxiv.org/abs/2607.06683v1
- Date: Tue, 07 Jul 2026 18:02:16 GMT
- Title: Universal purification dynamics of monitored Clifford circuits
- Abstract summary: Quantum circuits purify under sufficiently weak monitoring on a timescale $T_P$ exponentially long in the system size.<n>We show that monitored Clifford circuits on $L$ qudits of prime dimension $q$ bypass this construction entirely.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum circuits under sufficiently weak monitoring purify on a timescale $T_P$ exponentially long in the system size. This slowness underlies a universal purification dynamics, whose quantitative description has so far required the replica trick, with a delicate analytic continuation. We show that monitored Clifford circuits on $L$ qudits of prime dimension $q$ bypass this construction entirely: in the scaling limit at fixed $x = t/T_P(L)$, purification reduces to the Markovian decay of the density-matrix rank, an exactly solvable death process descending from infinity. We compute the full scaling functions in compact form: all Rényi entropies collapse onto a universal curve $\langle S(x) \rangle$. Exact stabilizer simulations at $q=2,3,5$ confirm the predictions, with no fitting parameter for the global model and $T_P$ as the only fitted scale for local brick-wall circuits. Also, the replica problem amounts to a tilted version of the same Markov process, in agreement with exact computations from the Clifford commutant. Finally, the quantization of the rank leaves two hallmarks that distinguish Clifford dynamics from generic monitored circuits: the entropy fluctuations saturate at short scaled times $x\to0$ to an $O(1)$ variance, instead of vanishing, and observables develop a temporal modulation periodic in $\log_q x$, which cannot be captured by the replica approach.
Related papers
- Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails [47.36630149538994]
For isotropic sub-Gaussian measurements, the benchmark sample size is $1+w(A)2$, where $w(A)$ is the Gaussian width of the normalized descent cone.<n>We give an explicit and systematic negative answer to the general question as formulated there: the proposed law fails in its full dimension-free, arbitrary-set form.<n>Under isotropy, a distribution-free fallback governed by affine dimension times squared enclosing radius is sharp on this family.
arXiv Detail & Related papers (2026-09-03T08:05:05Z) - Typical Output States of Monitored Random Clifford Circuits: A Graph-Theoretic Approach [9.397862194793996]
This Article develops a graph-state based framework that grants direct access to the typical output states of monitored random Clifford circuits.<n>We first show that, in the large-$N$ limit, the graph representations of random stabilizer states converge to the Erds--Rényi random graph ensemble $G(N,1/2)$.<n>For monitored one dimensional (1D) circuits in the volume-law phase, we uncover an emergent dense subgraph of the form $G(N_mathrmsub,1/2)$ in the output-state graphs.
arXiv Detail & Related papers (2026-08-04T04:19:07Z) - Quantum Speedups for Stochastic Optimization with Heavy-Tailed Noise [49.730496294398726]
We develop a novel quantum mean estimator for heavy-tailed random variables.<n>We derive stronger lower bounds for tail index>4/3$, showing that a nontrivial dependence on a dimension is unavoidable.<n>For a convex objective function, we propose a quantum projected gradient descent method.
arXiv Detail & Related papers (2026-07-28T09:29:37Z) - Spectral Anatomy of Quantum Gaussian Process Kernels [38.264196157340216]
We prove a Cauchy-Schwarz tail bound on Nystrm approximation error, a finite-sample variance-contraction identity, and a characterization of the emphtarget-dependent optimal entropy.<n>The diagnostic is kernel-agnostic: hardware-efficient, matchgate, IQP emphand RBF/Matérn/RFF/deep- kernel families all collapse onto identical $S/log n$ curves.
arXiv Detail & Related papers (2026-05-29T07:41:14Z) - Wavelet Variance Equipartition as a Threshold for World-Model Quality and Quantum Kernel TN-Simulability [0.0]
We identify the wavelet scaling exponent $$ as a critical diagnostic.<n>We establish $= 1/2$ as a sharp transition boundary for the classical simulability of amplitude-encoded quantum kernels.<n>We prove this variance scales strictly as $Var[X] = (d-2)$.
arXiv Detail & Related papers (2026-05-12T05:41:12Z) - Liouvillian Gap in Dissipative Haar-Doped Clifford Circuits [0.0]
We study the dynamics under the Floquet two-qubit Clifford circuit interleaved with a finite density of Haar-random single-site gates.<n>We find two distinct regimes for the Liouvillian gap in the thermodynamic limit, exemplified by the undoped and fully doped extreme cases.
arXiv Detail & Related papers (2026-02-03T08:11:31Z) - Theta-term in Russian Doll Model: phase structure, quantum metric and BPS multifractality [45.88028371034407]
We investigate the phase structure of the deterministic and disordered versions of the Russian Doll Model (RDM)<n>We find the pattern of phase transitions in the global charge $Q(theta,gamma)$, which arises from the BA equation.<n>We conjecture that the Hamiltonian of the RDM model describes the mixing in particular 2d-4d BPS sector of the Hilbert space.
arXiv Detail & Related papers (2025-10-23T17:25:01Z) - Quantum Complexity and Chaos in Many-Qudit Doped Clifford Circuits [0.0]
We investigate the emergence of quantum complexity and chaos in doped Clifford circuits acting on qudits of odd prime dimension $d$.<n>Using doped Clifford Weingarten calculus and a replica tensor network formalism, we derive exact results and perform large-scale simulations.
arXiv Detail & Related papers (2025-06-02T18:01:01Z) - Spectral Properties Versus Magic Generation in $T$-doped Random Clifford Circuits [1.1517315048749441]
We study the emergence of complexity in deep random $N$--qubit $T$gate doped Clifford circuits.<n>For pure (undoped) Clifford circuits, a unique periodic orbit structure in the space of Pauli strings implies peculiar spectral correlations and level statistics with large degeneracies.
arXiv Detail & Related papers (2024-12-20T14:04:51Z) - Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency [47.8739414267201]
We consider gradient descent (GD) with a constant stepsize applied to logistic regression with linearly separable data.
We show that GD exits this initial oscillatory phase rapidly -- in $mathcalO(eta)$ steps -- and subsequently achieves an $tildemathcalO (1 / (eta t) )$ convergence rate.
Our results imply that, given a budget of $T$ steps, GD can achieve an accelerated loss of $tildemathcalO (1/T2)$ with an aggressive stepsize
arXiv Detail & Related papers (2024-02-24T23:10:28Z) - Random quantum circuits transform local noise into global white noise [118.18170052022323]
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime.
For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially.
If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
arXiv Detail & Related papers (2021-11-29T19:26:28Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.