---
title: Random Peaked Circuits Overview
url: https://www.emergentmind.com/topics/random-peaked-circuits
type: topic
---

# Random Peaked Circuits Overview

Random peaked circuits are quantum circuits whose output distribution over computational-basis bitstrings contains an anomalously large probability mass on one or a few designated outcomes while the rest of the circuit retains random or pseudo-random structure. In the most common contemporary usage, a circuit with unitary $U$ acting on $|0^n\rangle$ is peaked when there exists a hidden bitstring $s^\*$ such that $P(s^\*) \gg P(x)$ for most $x \neq s^\*$, where $P(x)=|\langle x|U|0^n\rangle|^2$; closely related literature also studies random low-depth circuits whose sorted output probabilities exhibit a high-and-narrow peak with a long Porter–Thomas tail, a distinct but historically important notion of “peakedness” [2404.14493] [2510.25838] [1901.05003].

## 1. Definitions and statistical characterizations

For engineered peaked circuits, the central quantity is the maximum output probability
$$
p_{\mathrm{peak}} = \max_x P(x)=P(s^\*).
$$
A circuit is often called $\delta$-peaked when
$$
\max_{s\in\{0,1\}^N} |\langle s|C|0^N\rangle|^2 \ge \delta,
$$
and, in the shallow-circuit literature, “peaked” can also mean
$$
\max_{x\in\{0,1\}^n} |\langle x|U|0^n\rangle|^2 \ge n^{-a}.
$$
These formulations all encode the same basic property: one basis state is polynomially or macroscopically heavier than the generic $2^{-n}$ scale [2510.25838] [2309.08405].

A second usage arises from random circuit sampling. For an $n$-qubit random circuit, output probabilities $p(i)$ are modeled by the Porter–Thomas law
$$
\Pr(p)=e^{-2^n p},
$$
and, when sorted in ascending order,
$$
p(i)=-\ln\!\left(1-\frac{i}{2^n}\right)\frac{1}{2^n},\qquad i=0,\dots,2^n-1.
$$
This sorted population exhibits a high, narrow peak at small $i$ and a long tail. In that setting, “peaked” refers not to a single planted bitstring but to the shape of the ensemble statistics [1901.05003].

Several auxiliary diagnostics recur across the literature. HQAP work uses peak weight, peak-to-average ratio $\mathrm{PAR}=2^nP_{\max}$, and min-entropy $H_\infty=-\log P_{\max}$ [2510.25838]. Other work emphasizes collision probability
$$
\pi_C=\sum_s p_C[s]^2,
$$
support-overlap scores such as
$$
S_A(|\Psi\rangle)=\sum_{z:a_z\neq 0} |\langle z|\Psi\rangle|^2,
$$
or biased expectation ratios
$$
E_A(|\Psi\rangle)=\frac{\sum_z a_z p(z)}{\sum_z |a_z| p(z)},
$$
when the purpose of peaking is to enhance a target observable rather than merely identify a hidden string [2404.14493] [2504.11240].

## 2. Construction paradigms

One explicit model augments $\tau_r$ layers of uniformly random two-qubit gates by $\tau_p$ optimized “peaking” layers in a 1D brick-wall or all-to-all architecture. The optimization target is
$$
\max_{\boldsymbol{\theta}} \left|\langle 0^n|C(\boldsymbol{\theta})|0^n\rangle\right|^2.
$$
This model isolates the basic tradeoff between randomness and peak formation: if $\tau_p \ge \tau_r$, one can trivially invert the random layers and achieve $\delta=1$, whereas the interesting regime is $\tau_p<\tau_r$ [2404.14493].

The HQAP construction adds a more elaborate obfuscation layer. It first trains a shallow circuit to amplify a designated bitstring, then inserts a large mirrored identity block $U \triangleright U^\dagger$, and finally applies tensor patch optimization, angle sweeping, masking, and swap transformations to frustrate direct cancellation. In the notation used there, the final unitary has the structure
$$
T[R] \triangleright T[U] \triangleright U^\dagger \triangleright P.
$$
The largest reported instance used 56 qubits, all-to-all connectivity, and 2044 two-qubit gates, with peak weight $\delta_s \approx 0.1$ [2510.25838].

A distinct quasi-random construction uses a random brick-wall first half
$$
Q=\prod_{i=1}^N B_i,
$$
followed by an approximate inverse. Hidden $X$ gates are inserted according to a target string and commuted through the circuit using identities such as
$$
XU_3(\theta,\phi,\lambda)=U_3(\theta,\pi-\phi,\pi-\lambda)Xe^{i(\phi+\lambda)},
$$
and
$$
X^{(2)}CZ^{(1,2)}=CZ^{(1,2)}Z^{(1)}X^{(2)}.
$$
The mirror half is then modified so that each block remains close in matrix action while differing significantly in parameters. Peakedness is controlled by an average deviation parameter $\delta$, with the ideal case $\delta=0$ giving $p_s=1$, and the paper adopts the criterion
$$
p_s/p_{\mathrm{second}} \ge 10
$$
to classify a circuit as peaked [2508.07491].

Multi-peaked generalizations also appear. By inserting a small entangling block, for example an $H\otimes H$ followed by $CZ$, one can construct two-peak or multi-peak output distributions rather than a single designated maximum [2508.07491].

## 3. Classical simulation methods

The classical simulation landscape is heterogeneous because different peaked-circuit families expose different exploitable structures. For constant-depth peaked circuits, a central result is that an $n$-qubit peaked shallow circuit can be approximately sampled in quasipolynomial time $n^{O(\log n)}$, while nearest-neighbor circuits on a 2D grid admit polynomial-time sampling $n^{O(1)}$ and fixed $D>2$ grids admit $n^{O(\log\log n)}$ algorithms. The key mechanism is Hamming-ball concentration implied by bounded light cones and a polynomially heavy output [2309.08405].

Low-depth random circuits with Porter–Thomas-peaked sorted distributions admit a different route. The teleportation-inspired algorithm rewires the circuit into a logical circuit whose number of qubits scales with depth rather than physical width. For a 1D chain, an $N$-qubit, $L$-depth circuit maps to an $L$-qubit, $N$-depth circuit; for an $M\times N$ grid with depth $8L$, the logical-qubit count is $NL$; for Bristlecone it is $(2N-1)L$. Memory then scales as $O(2^L)$ rather than $O(2^{N_{\mathrm{phys}}})$. Demonstrated examples include a 1000-qubit depth-42 chain mapped to 42 logical qubits, a $125\times 8$ depth-42 grid mapped to 40 logical qubits, and a 72-qubit depth-32 Bristlecone circuit mapped to 44 logical qubits. The same work combines this with threshold-rejection sampling; at
$$
p_{\mathrm{th}}=2.4\times 2^{-n},
$$
the reported sample fidelity is approximately $0.9$ and efficiency approximately $0.38$ [1901.05003].

The HQAP family later received a near-exact classical attack based on full tensor-network contraction with a mirrored MPO and “unswapping.” The contraction exploits the approximate $UU^\dagger$ core, factors hidden permutations as
$$
M=P_L\cdot \tilde M \cdot P_R,
$$
and greedily reduces MPO bond dimension by testing left, right, or bilateral SWAP insertions. On the largest studied instance—56 qubits and 1,917 two-qubit RZZ gates—the method fully contracted the circuit on a single Nvidia A100 GPU in 4,059 seconds and recovered the peak with frequency $\approx 11\%$, consistent with the designed $\approx 10\%$ [2604.21908].

A complementary approximate strategy is sparse truncated state-vector simulation. Here the state vector is stored as pairs $(x,\alpha_x)$, truncated either by top-$k$ magnitude or by retained probability mass, and updated blockwise using grouped contributions and segmented sums. On the 44-qubit “sharp peak” ring circuit with 580 instructions, the correct $s^\*$ was recovered using fewer than $2^5$ retained amplitudes; the same study reports roughly one order-of-magnitude GPU speedup at larger $K$, but also observes that $p=99.9\%$ mass retention can already force more than $2^{28}$ terms in an intermediate step [2607.07816].

## 4. Hardness results and structural complexity

The theoretical picture is intentionally mixed: some peaked families are classically tractable because their peak is generated by shallow locality or mirror structure, whereas other formulations are designed to retain average-case hardness. In the explicit random-plus-peaking model, well-spread ensembles obey
$$
\mathbb{E}_C[\pi_C]\le \frac{\gamma}{2^n},
$$
which implies
$$
P_\delta=O\!\left(\frac{\gamma}{\delta^2 2^n}\right)
$$
for the probability that a random instance is $\delta$-peaked. The same work proves that obtaining $1/\mathrm{poly}(n)$ peakedness from a random circuit of depth $\tau_r$ requires
$$
\tau_p=\Omega\!\Big(\big(\tfrac{\tau_r}{n}\big)^{0.19}\Big)
$$
optimized peaking layers with overwhelming probability [2404.14493].

A later formalization of random peaked circuits via postselection on row overlap takes a random circuit $C$ from a $k$-design, samples a second circuit $C'$ from the same architecture, and accepts $P=C'^\dagger C$ when a designated output becomes heavy. Conditioned on exact alignment, the orthogonal block is distributed as
$$
P \overset{d}{=} \mathrm{diag}(1,V),
$$
with $V$ Haar-random on $U(d-1)$ in the exact Haar case, and moment-wise equivalent to a $k$-design in the design case. This yields non-compressibility and circuit-complexity lower bounds of $\tilde{\Omega}(nk)$ with high probability, and it underpins an average-case $\#P$-hardness statement for estimating the peak to $2^{-\mathrm{poly}(n)}$ additive error [2510.00132].

At inverse-polynomial additive accuracy, the worst-case decision version changes complexity class. The same work notes that the corresponding worst-case problem is PromiseBQP-complete, while the HQAP paper proves QCMA-completeness for the promise problem PCBS, which asks whether there exists a basis state $y$ such that $|\langle y|U|y\rangle|$ exceeds a threshold when neither the peaked input nor the output is known [2510.00132] [2510.25838].

This separation between planted structure and average-case randomness is central. A plausible implication is that “random peaked circuits” do not denote a single hardness class but a design space in which simulability depends sensitively on whether the heavy output is produced by shallow geometry, mirrored identities, approximate inverses, or postselected design structure.

## 5. Verification, benchmarking, and applications

The practical appeal of peaked circuits is that verification can be reduced to detecting one designated outcome rather than reconstructing a full output distribution. In HQAP, verification is “peak match”: one samples the circuit and checks equality with the publicly known peak. The shot complexity to see the peak at least once is $O(1/\delta_s)$, and the largest 56-qubit instance was reported to produce the target peaked bitstring in under 2 hours on Quantinuum H2 [2510.25838].

This verification simplicity motivated system-level benchmarking. Peaked Random Circuits were run as a matrix over
$$
n\in[2,20],\qquad d\in[2,50],
$$
and the benchmark defined
$$
F(n,d)=\frac{p_{\mathrm{peak}}^{\mathrm{exp}}(n,d)}{p_{\mathrm{peak}}^{\mathrm{ideal}}(n,d)}.
$$
Across multiple instances,
$$
F_{\mathrm{system}}(n,d)=\frac{1}{M}\sum_{i=1}^M \frac{p_{\mathrm{peak},i}^{\mathrm{exp}}(n,d)}{p_{\mathrm{peak},i}^{\mathrm{ideal}}(n,d)}.
$$
This protocol was applied to IQM superconducting and AQT trapped-ion systems, and was presented as comparable to Quantum Volume while exhibiting greater sensitivity to interference effects [2605.25983].

Peaked-state preparation has also been used as a measurement primitive rather than a hardness primitive. For infinite-temperature correlation functions, engineered peaked states prepared by Grover-style amplitude amplification or shallow structured circuits increase support on operator-relevant subspaces. On 12 qubits with 8192 shots, the reported metrics were: Haar $S_A=0.4871$, $C_{AB}\approx 0.0002$, $E_A\approx 0.0005$; Grover with $T=3$, $S_A=0.5709$, $C_{AB}\approx 0.3920$, $E_A\approx 0.6867$; shallow circuits, $S_A=0.9835$, $C_{AB}\approx 0.5658$, $E_A\approx 0.5753$ [2504.11240].

These applications sharpen an important distinction from standard random circuit sampling. RCS emphasizes anti-concentration and verification by XEB or related global metrics; peaked circuits trade that for a single heavy-string witness, often at the cost of introducing exploitable structure [1909.06210] [2404.14493].

## 6. Limitations, controversies, and open problems

The main controversy concerns whether peaked circuits can simultaneously satisfy near-term feasibility, strong classical hardness, and efficient verification. HQAP was introduced precisely as a candidate satisfying all three, with extrapolations suggesting years of classical runtime for the largest instances [2510.25838]. That claim was then directly challenged by a near-exact classical simulation based on mirrored MPO contraction and unswapping, which extracted the peak of the largest tested circuit in about one hour on a single GPU and argued that mirror-driven peaked circuits are generically vulnerable when obfuscation is permutation-dominated [2604.21908].

Simulation limitations are family-dependent. The teleportation-inspired logical-qubit method is effective only for low-depth circuits because the logical-qubit count grows with depth; the sparse-truncated simulator has no formal guarantee of preserving $s^\*$ and can approach dense $2^n$ behavior when tail mass is broadly dispersed; and MPS methods, while effective for shallow quasi-random peaked circuits, can require bond dimension $\chi \approx 2^{n/2}$ in deeper instances, eliminating practical advantage [1901.05003] [2607.07816] [2508.07491].

Several open problems recur across the literature. One is efficient generation: current constructions often rely on gradient-based peaking or expensive postselection, and the existence of a polynomial-time method that produces strongly peaked yet classically hard circuits remains unresolved [2404.14493] [2510.00132]. Another is classical distinguishability: it is not known in general whether postselected or engineered peaked circuits can be distinguished from fully random circuits in classical polynomial time [2404.14493]. Additional unresolved issues include analytical control of $p_s(\delta,n,n_l)$ in approximate-inverse constructions, quantitative noise robustness, tighter hardness results at inverse-polynomial additive error, and peaking mechanisms based on problem-theoretic hardness rather than structural mirror identities [2508.07491] [2604.21908].

In that sense, random peaked circuits form a research program rather than a settled model. They sit at the intersection of random circuit sampling, variational state engineering, tensor-network simulability, and complexity theory, and the central technical question remains whether one can plant a verifiable heavy output without simultaneously planting a classical shortcut.

Source: https://www.emergentmind.com/topics/random-peaked-circuits