Apparent Universal Behavior in Second Moments of Random Quantum Circuits

• URL: http://arxiv.org/abs/2510.23726v1
• Date: Mon, 27 Oct 2025 18:01:55 GMT
• Title: Apparent Universal Behavior in Second Moments of Random Quantum Circuits
• Authors: Daniel Belkin, James Allen, Bryan K. Clark,
• Abstract summary: We tell you everything you always wanted to know about second moments of random quantum circuits, but were too afraid to compute.<n>Our answers generally take the form of numerical results for up to 50 qubits.
• Score: 0.34757790689654594
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Just how fast does the brickwork circuit form an approximate 2-design? Is there any difference between anticoncentration and being a 2-design? Does geometry matter? How deep a circuit will I need in practice? We tell you everything you always wanted to know about second moments of random quantum circuits, but were too afraid to compute. Our answers generally take the form of numerical results for up to 50 qubits. Our first contribution is a strategy to determine explicitly the optimal experiment which distinguishes any given ensemble from the Haar measure. With this formula and some computational tricks, we are able to compute $t = 2$ multiplicative errors exactly out to modest system sizes. As expected, we see that most families of circuits form $\epsilon$-approximate $2$-designs in depth proportional to $\log n$. For the 1D brickwork, we work out the leading-order constants explicitly. For graphs, we find some exceptions which are much slower, proving that they require at least $\Omega(n^2)$ gates. This answers a question asked by ref. 1 in the negative. We explain these exceptional architectures in terms of connectedness. Based on this intuition we conjecture universal upper and lower bounds for graph-sampled circuit ensembles. For many architectures, the optimal experiment which determines the multiplicative error corresponds exactly to the collision probability (i.e. anticoncentration). However, we find that the star graph anticoncentrates much faster than it forms an $\epsilon$-approximate $2$-design. Finally, we show that one needs only ten to twenty layers to construct an approximate $2$-design for realistic parameter ranges. This is a large constant-factor improvement over previous constructions. The parallel complete-graph architecture is not quite the fastest scrambler, partially resolving a question raised by ref. 2.

Related papers

• A Grover-compatible manifold optimization algorithm for quantum search [17.013842168748127]
  Grover's algorithm is a fundamental quantum algorithm that offers a quadratic speedup for the unstructured search problem.<n>We show that Grover's algorithm matches the speedup of $O(qrstN)$ achieved by Grover's algorithm.
  arXiv  Detail & Related papers  (2025-12-09T10:01:55Z)
• INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers [61.84396402100827]
  We propose the Indirect Neural Corrector ($mathrmINC$), which integrates learned corrections into the governing equations.<n>$mathrmINC$ reduces the error amplification on the order of $t-1 + L$, where $t$ is the timestep and $L$ the Lipschitz constant.<n>We test $mathrmINC$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence.
  arXiv  Detail & Related papers  (2025-11-16T20:14:28Z)
• Unitary designs in nearly optimal depth [40.28216388589026]
  We construct unitary designs on qubits in circuit depth $O(log k log log n k / varepsilon)$.<n>The depth is exponentially improved over all known results in all three parameters $n$, $k$, $varepsilon$.<n>We also develop a new analytical framework for bounding errors in quantum experiments involving many queries to random unitaries.
  arXiv  Detail & Related papers  (2025-07-08T17:48:33Z)
• Fundamental solutions of heat equation on unitary groups establish an improved relation between $ε$-nets and approximate unitary $t$-designs [2.676349883103404]
  The concepts of $epsilon$-nets and unitary $delta$-approximate $t$-designs are important and ubiquitous across quantum computation and information.<n>We improve the bound on the $delta$ required for a $epsilon$-net from $delta simeq left(epsilon3/2/dright)d2$ to form an $epsilon$-net from $delta simeq left(epsilon/d1/2right)d2$
  arXiv  Detail & Related papers  (2025-03-11T16:10:45Z)
• The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem [53.446980306786095]
  Smooth boosters generate distributions that do not place too much weight on any given example. Originally introduced for their noise-tolerant properties, such boosters have also found applications in differential privacy, mildly, and quantum learning theory.
  arXiv  Detail & Related papers  (2024-09-17T23:09:25Z)
• Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits [12.786353781073242]
  We prove a Carbery-Wright style anti-concentration inequality for the unitary Haar measure. We show that the scrambling speed of a random quantum circuit is lower bounded.
  arXiv  Detail & Related papers  (2024-07-28T19:10:46Z)
• On the average-case complexity of learning output distributions of quantum circuits [33.76498647184212]
  We show that learning the output distributions of brickwork random quantum circuits is average-case hard in the statistical query model.<n>This learning model is widely used as an abstract computational model for most generic learning algorithms.
  arXiv  Detail & Related papers  (2023-05-09T20:53:27Z)
• Online Learning with Adversaries: A Differential-Inclusion Analysis [52.43460995467893]
  We introduce an observation-matrix-based framework for fully asynchronous online Federated Learning with adversaries. Our main result is that the proposed algorithm almost surely converges to the desired mean $mu.$ We derive this convergence using a novel differential-inclusion-based two-timescale analysis.
  arXiv  Detail & Related papers  (2023-04-04T04:32:29Z)
• Pseudonorm Approachability and Applications to Regret Minimization [73.54127663296906]
  We convert high-dimensional $ell_infty$-approachability problems to low-dimensional pseudonorm approachability problems. We develop an algorithmic theory of pseudonorm approachability, analogous to previous work on approachability for $ell$ and other norms.
  arXiv  Detail & Related papers  (2023-02-03T03:19:14Z)
• PDE-Based Optimal Strategy for Unconstrained Online Learning [40.61498562988079]
  We present a framework that generates time-varying potential functions by solving a Partial Differential Equation (PDE) Our framework recovers some classical potentials, and more importantly provides a systematic approach to design new ones. This is the first parameter-free algorithm with optimal leading constant.
  arXiv  Detail & Related papers  (2022-01-19T22:21:21Z)
• Quantum double aspects of surface code models [77.34726150561087]
  We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry. We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
  arXiv  Detail & Related papers  (2021-06-25T17:03:38Z)
• Quantum supremacy and hardness of estimating output probabilities of quantum circuits [0.0]
  We prove under the theoretical complexity of the non-concentration hierarchy that approximating the output probabilities to within $2-Omega(nlogn)$ is hard. We show that the hardness results extend to any open neighborhood of an arbitrary (fixed) circuit including trivial circuit with identity gates.
  arXiv  Detail & Related papers  (2021-02-03T09:20:32Z)
• Epsilon-nets, unitary designs and random quantum circuits [0.11719282046304676]
  Epsilon-nets and approximate unitary $t$-designs are notions of unitary operations relevant for numerous applications in quantum information and quantum computing. We prove that for a fixed $d$ of the space, unitaries constituting $delta$-approx $t$-expanders form $epsilon$-nets for $tsimeqfracd5/2epsilon$ and $delta=left(fracepsilon3/2dright)d2$. We show that approximate tdesigns can be generated
  arXiv  Detail & Related papers  (2020-07-21T15:16:28Z)

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.