Ideal random quantum circuits pass the LXEB test

• URL: http://arxiv.org/abs/2602.22692v1
• Date: Thu, 26 Feb 2026 07:10:38 GMT
• Title: Ideal random quantum circuits pass the LXEB test
• Abstract summary: Noiseless random quantum circuits pass the linear cross-entropy benchmark test with high probability.<n>We establish that the tails of the distribution of random circuit output probabilities start to resemble Porter-Thomas at near-quadratic depths.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We show that noiseless random quantum circuits pass the linear cross-entropy benchmark (LXEB) test with high probability. If the circuits are linear depth, and thus form unitary 4-designs, the LXEB test is passed with probability $1-O(1/\sqrt{k})$, where $k$ is the number of independently drawn samples from the output distribution of the random circuit. If the circuits are of depth $\tilde O(n^2)$, and thus form unitary $n$-designs, the LXEB test is passed with probability $1-O(e^{-k \log(n)/n})$. In proving our results, we show strong concentration of the random circuit collision probability at linear depth and establish that the tails of the distribution of random circuit output probabilities start to resemble Porter-Thomas at near-quadratic depths. Our analysis employs higher moments and high-degree approximate designs.

Related papers

• 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 and circuit complexity in finite-depth random linear optical networks [3.387906561638234]
  We study the growth of entanglement and circuit complexity in random passive linear optical networks as a function of the circuit depth.<n>For random brickwall circuits, we show that entanglement, as measured by the Rényi-2 entropy, grows at most diffusively as a function of the depth.
  arXiv  Detail & Related papers  (2026-04-15T18:00:00Z)
• Complexity and hardness of random peaked circuits [6.472219867780061]
  We study an explicit construction for random peaked circuits.<n>We demonstrate that the circuits generated by this method are non-trivial.<n>We also study using peaked circuits as a practical attempt for a verifiable quantum advantage protocol.
  arXiv  Detail & Related papers  (2025-09-30T18:10:43Z)
• On verifiable quantum advantage with peaked circuit sampling [9.551919087634522]
  We show that getting $1/textpoly(n)$ peakedness from such circuits requires $tau_p = Omega(tau_r/n)0.19)$ with overwhelming probability. We also give numerical evidence that nontrivial peakedness is possible in this model.
  arXiv  Detail & Related papers  (2024-04-22T18:00:06Z)
• Deterministic identification over channels with finite output: a dimensional perspective on superlinear rates [49.126395046088014]
  We consider the problem in its generality for memoryless channels with finite output, but arbitrary input alphabets.<n>Our main findings are that the maximum length of messages thus identifiable scales superlinearly as $R,nlog n$ with the block length $n$.<n>We show that it is sufficient to ensure pairwise reliable distinguishability of the output distributions to construct a DI code.
  arXiv  Detail & Related papers  (2024-02-14T11:59:30Z)
• 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)
• Simulation of IBM's kicked Ising experiment with Projected Entangled Pair Operator [71.10376783074766]
  We perform classical simulations of the 127-qubit kicked Ising model, which was recently emulated using a quantum circuit with error mitigation. Our approach is based on the projected entangled pair operator (PEPO) in the Heisenberg picture. We develop a Clifford expansion theory to compute exact expectation values and use them to evaluate algorithms.
  arXiv  Detail & Related papers  (2023-08-06T10:24:23Z)
• 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)
• A single $T$-gate makes distribution learning hard [56.045224655472865]
  This work provides an extensive characterization of the learnability of the output distributions of local quantum circuits. We show that for a wide variety of the most practically relevant learning algorithms -- including hybrid-quantum classical algorithms -- even the generative modelling problem associated with depth $d=omega(log(n))$ Clifford circuits is hard.
  arXiv  Detail & Related papers  (2022-07-07T08:04:15Z)
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(nt^{5+o(1)}\right)$ [0.0]
  We show that random quantum circuits generate approximate unitary $t$-designs in depth $O(nt5+o(1))$. Our techniques involve Gao's quantum union bound and the unreasonable effectiveness of the Clifford group.
  arXiv  Detail & Related papers  (2022-03-30T18:02:08Z)
• 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 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)
• 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)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• Spoofing Linear Cross-Entropy Benchmarking in Shallow Quantum Circuits [8.401078947103475]
  Google's noisy quantum simulation of a 53 qubit circuit $C$ achieved a fidelity value of $(2.24pm0.21)times10-3$. Our results can be considered as an evidence that fooling the linear XEB test might be easier than achieving a full simulation of quantum circuit.
  arXiv  Detail & Related papers  (2020-05-05T18:01:48Z)

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.