Conditional dependence and Scrooge ensembles in shallow random quantum circuits

• URL: http://arxiv.org/abs/2608.12255v1
• Date: Wed, 12 Aug 2026 16:56:54 GMT
• Title: Conditional dependence and Scrooge ensembles in shallow random quantum circuits
• Abstract summary: The output state of a 2D geometrically local shallow random quantum circuit does not have long range correlations due to its lightcone structure.<n>Long-range entanglement can be induced by the measurement process, leading to conditional correlations between distant qubits.<n>A consequence is that $n$-qubit shallow random quantum circuits in two dimensions are classically efficiently simulable in the presence of a tiny depolarizing noise rate.
• Score: 0.08997016647455751
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The output state of a 2D geometrically local shallow random quantum circuit does not have long range correlations due to its lightcone structure. But this changes if one measures a subset of the qubits: long-range entanglement can be induced by the measurement process, leading to conditional correlations between distant qubits. In this paper we investigate the structure of conditional dependence in these circuits and its consequences for quantum advantage. For a tripartition $ABC$ of the qubits, we consider the ensemble of post-measurement states on $A$ that is conditioned on a specific measurement outcome on $B$ and ranges over all possible measurement outcomes on $C$. For circuit depths exceeding a constant critical value $d^*$, we conjecture that this ensemble is well approximated by a certain generalization of the Haar ensemble, called the Scrooge ensemble~[Jozsa \textit{et al.}, \href{https://doi.org/10.1103/PhysRevA.49.668}{Phys. Rev. A \textbf{49}, 668 (1994)}]; we also provide supporting numerical and analytical evidence. Our conjecture describes a precise sense in which the state retains its lightcone structure on the remaining unmeasured qubits, but also develops some globally random features arising from the measurement. A consequence is that $n$-qubit shallow random quantum circuits in two dimensions are classically efficiently simulable in the presence of a tiny depolarizing noise rate $Ω(\log(n)/n)$.

Related papers

• Ultra-Precise Quantum Projective Designs in Constant Depth [8.23817891945353]
  We introduce an explicit sparse commuting circuit ensemble on $n$ qubits that reproduces low-order Haar moments in the stringent relative-error sense.<n>Our results show that precise Haar-like statistics can emerge from sparse commuting dynamics with remarkably low quantum resources.
  arXiv  Detail & Related papers  (2026-09-03T14:38:21Z)
• Circuit complexity lower bounds for quantum spin glasses [1.2604738912025477]
  We study the circuit complexity of states arising from standard many-body models.<n>We show that entanglement needed to close the product-state gap cannot be generated at shallow depth.<n>Our results give an obstruction in the spirit of the No Low-Energy Trivial States problem of Freedman and Hastings (arXiv:1301.1363)
  arXiv  Detail & Related papers  (2026-07-15T21:56:01Z)
• Pseudoentanglement in constant depth: How trivial states can have non-trivial entanglement structure [52.51019642214249]
  We construct a family of 2D-local constant-depth quantum circuits whose entanglement entropy across a cut cannot be estimated in quantum time.<n>As constant-depth quantum circuits can be learned from specifiedly many quantum samples, our resulting pseudoentangled states are implicitly public-key and not pseudorandom.
  arXiv  Detail & Related papers  (2026-05-29T15:43:00Z)
• Entanglement Distance of Two- and Multi-Qubit Variational States and Its Quantification with Quantum Computing [0.0]
  We study the entanglement distance of variational quantum states for two-qubit and multi-qubit systems.<n>For the two-qubit case, we analytically derive recurrence relations for expectation values of Pauli observables using.<n>The analysis were extended to a closed one-dimensional chain of $N$ qubits.
  arXiv  Detail & Related papers  (2026-04-30T21:53:39Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Limitations of Noisy Geometrically Local Quantum Circuits [0.2039123720459736]
  We show that noisy quantum circuits with interspersed noise converge to the uniform distribution at $omega(log n)$ depth, where $n$ is the number of qubits.<n>We conjecture that our bound is still loose and that a $Theta(1)$-depth threshold suffices for simulability due to a percolation effect.
  arXiv  Detail & Related papers  (2025-10-07T18:08:23Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
  We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$. We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
  arXiv  Detail & Related papers  (2024-01-17T18:59:38Z)
• Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
  Kitaev's quantum double model based on a finite group $G$. We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
  arXiv  Detail & Related papers  (2022-05-04T08:10:36Z)
• 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)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Approximate unitary $t$-designs by short random quantum circuits using nearest-neighbor and long-range gates [0.0]
  We prove that $poly(t)cdot n1/D$-depth local random quantum circuits with two qudit nearest-neighbor gates are approximate $t$-designs in various measures. We also prove that anti-concentration is possible in depth O(log(n) loglog(n) using a different model.
  arXiv  Detail & Related papers  (2018-09-18T22:28:15Z)

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.