Proper Learning of Shallow All-to-All Quantum Circuits

Abstract: This work considers a variation on the problem of learning shallow quantum circuits. Given query access to the circuit, as well as knowledge of its gate layout, we consider the task of learning the specific gates used in the circuit, producing an operationally-equivalent circuit matching this structure. Building on recent work for learning Haar random brickwork circuits, we identify a meta-algorithmic framework for learning broad classes of circuits based on iterative local gate inversions at the front and back of the circuit. We apply these techniques to study random, all-to-all, two-local circuits, and provide analytical and numerical evidence that this ensemble undergoes a sharp learnability transition at depth $d^* \sim \log_2 n + \log_2\log_2 n$ in the large size limit, based on an analysis of lightcone growth. These results have implications for recently proposed quantum cryptographic schemes based on the difficulty of circuit learning, though there are important distinctions with respect to our setting that suggest avenues for future study.

• The paper develops a local-inversion framework that properly learns interaction-local circuits using known layouts, pivot gates, signal propagation, and handleable factorizations, with query complexity O(|𝒢|nD/[L(D)²ε⁴]) for discretized gate sets.
• Random all-to-all two-local circuits remain learnable until lightcones cover most qubits, producing a predicted threshold depth of log₂ n + log₂ log₂ n plus lower-order terms.
• Simulations support the predicted threshold and 1/√n lightcone concentration, while rigorous guarantees remain conditional on unresolved concentration and lightcone-independence assumptions.‌

Problem setting and motivation

The paper studies the proper learning of shallow quantum circuits: given black-box query access to a unitary circuit $U_C$, knowledge of its gate layout (circuit graph), and the gate family $\mathcal{G}$, the learner must output a circuit $C'$ with $U_{C'} \approx U_C$ whose graph matches that of $C$ and whose gates come from $\mathcal{G}$. This is stricter than prior shallow-circuit learning results, which are improper in the sense of producing deeper circuits or requiring ancillas. Properness matters for recently proposed cryptographic schemes that use circuit descriptions as private keys, since improperly learned representations could be detected and filtered by a verifier.

The work builds on Fefferman et al.'s anti-concentration results for Haar random brickwork circuits [fefferman2024anti], which established the first proper learning algorithm via "local inversions" for 1D brickwork circuits to depth $O(\log n)$. The present paper generalizes this to arbitrary interaction-local circuits without geometric locality and applies it to random all-to-all two-local circuits.

Causal structure: lightcones and pivot gates

The central structural notion is the qubit lightcone. For a wire $q(\ell)$ at layer $\ell$, the forward (backward) lightcone is the set of qubits reachable from (to) $q$ within distance $\mathcal{G}$0 in the directed circuit graph. The causal boundary $\mathcal{G}$1 is the set difference of adjacent-layer lightcones; a nonempty boundary means the outer gate $\mathcal{G}$2 strictly grows the lightcone.

A key lemma establishes an exact graph-theoretic characterization: $\mathcal{G}$3 if and only if $\mathcal{G}$4 and $\mathcal{G}$5 are path-connected but removing the front gate $\mathcal{G}$6 disconnects them. An outer gate with a nonempty causal boundary is called a pivot gate — such gates are critical connectors between qubit pairs, and their removal effect is detectable by tomography. The authors also prove that any pair of qubits at maximum distance $\mathcal{G}$7 guarantees both front and back pivot gates exist, and show via explicit examples that iterative forward–backward learning is strictly more powerful than single-directional learning: there exist circuits with no front pivots that acquire front pivots only after removing a back pivot.

Meta-algorithm and conditions for success

The proposed protocol, FactorizeFrontGate, iterates over trial gates $\mathcal{G}$8 prepended to $\mathcal{G}$9, testing whether $C'$0 factorizes as $C'$1 by toggling the input state of one qubit and performing single-qubit tomography on its causal partner's output. Iterating this (ForwardLearn) peels gates off the front until the circuit is trivialized. Consecutive gates on the same wires are handled by compression into composite gates, since distinguishing different factorizations of a composite is information-theoretically impossible within the query model.

Three criteria govern success:

• Good lightcone structure: an ordering of gates exists such that each is a pivot when earlier ones are removed.
• Good signal propagation: the induced single-qubit channels are $C'$2-invertible with $C'$3 for finite distances, so input changes remain detectable at output.
• Handleable factorizations: successful factorizations can be converted into effective gate removals.

For discretized gate sets that are $C'$4-spaced under the product pseudometric $C'$5, the main theorem gives a rigorous guarantee: a 2-local depth-$C'$6 circuit with good forward lightcones and signal propagation $C'$7 can be properly learned with

$C'$8

queries to $C'$9. The proof combines the contrapositive of Fefferman et al.'s Lemma 6.5 — a gap promise $U_{C'} \approx U_C$0 forces a detectable output change of at least $U_{C'} \approx U_C$1 under suitable Pauli preparations — with propagation through the remaining circuit via $U_{C'} \approx U_C$2-invertibility. Notably, backward learning lacks a fully symmetric guarantee because the query model permits precise preparation of inputs but not outputs; the authors conjecture that the quasi-polynomial overhead incurred by continuous gate sets (from controlling near-identity errors) is a technical rather than fundamental barrier.

Lightcone growth in random all-to-all circuits

The ensemble considered consists of layered circuits where each layer is a uniformly random perfect matching of $U_{C'} \approx U_C$3 qubits (2-local gates). Lightcone growth is modeled as a Markov chain on the lightcone size $U_{C'} \approx U_C$4: each layer adds the number of matching edges crossing the boundary of the current patch. The paper derives the exact distribution of these crossings, their mean $U_{C'} \approx U_C$5, and variance, showing concentration with standard deviation $U_{C'} \approx U_C$6 independent of $U_{C'} \approx U_C$7.

Replacing crossings by their mean yields a deterministic recurrence whose large-$U_{C'} \approx U_C$8 limit admits the closed-form solution $U_{C'} \approx U_C$9, giving the full-coverage hitting time

$C$0

The leading $C$1 reflects the maximal doubling of lightcone size per layer; the $C$2 correction captures the inefficiency of uncoordinated random matchings relative to causality-limited optimal scrambling. Under the assumption that the stochastic deviation satisfies $C$3 almost surely — supported by a linearized error analysis and numerics but not fully proven rigorously — the main theorem states that the true hitting time satisfies $C$4 asymptotically almost surely.

A further corollary connects coverage to learnability: unless the lightcone has saturated ($C$5), the probability that a given outer layer produces zero crossings is at most $C$6, so pivots remain available. Under an independence approximation between paired lightcones, every outer gate is a pivot with probability approaching 1 whenever $C$7, implying learnability persists exactly up to the coverage threshold. A technical wrinkle specific to 2-local ensembles is that consecutive layers share a gate block with limiting probability $C$8 (proved exactly via inclusion–exclusion), necessitating the compression step; for $C$9 this probability vanishes, though the general-$\mathcal{G}$0 lightcone analysis is left open due to combinatorial complications.

Numerical validation

Simulations corroborate the analytical picture on three fronts. First, the max-of-max deviation between stochastic lightcone trajectories and the mean-evolved sequence decays approximately as $\mathcal{G}$1 across qubit counts in powers of two, supporting the concentration assumption underlying the main theorem. Second, direct simulations of the full iterative local-inversion protocol on sampled circuits (1000 layouts per $\mathcal{G}$2 point, with compression applied) exhibit a sharp drop in learnability fraction whose transition location shifts linearly in $\mathcal{G}$3. Third, the empirically measured 50%-learnability transition depth tracks the predicted $\mathcal{G}$4 within one unit across accessible scales, with the full forward–backward method showing only a constant-depth advantage over forward-only learning — consistent with the theoretical claim that below full coverage, pivots exist almost surely regardless of direction.

Limitations and open questions

Several caveats qualify the results. The main lightcone theorem is conditional on the $\mathcal{G}$5 concentration claim, which is established only heuristically (a central-limit approximation valid in an intermediate regime) and via Chebyshev bounds too weak to control fluctuations across all qubits simultaneously; rigorous variance-dependent sub-Gaussian tails are conjectured but not proven, with Azuma-based bounds lacking the needed variance dependence. The pivot-prevalence argument relies on pairwise independence approximations between distinct qubits' lightcones, which the authors believe can be made rigorous but have not been. The analysis is restricted to $\mathcal{G}$6; generalization to $\mathcal{G}$7 encounters polynomial-order growth in the expected crossings and is left unresolved. Finally, the entire framework presupposes query access to $\mathcal{G}$8 plus known layout — whether analogous structured learning succeeds from weaker access, such as copies of output states or classical shadows, remains open, and bears directly on the security of the cryptographic proposals motivating this line of work.

Conclusion

This paper consolidates local-inversion techniques into a general meta-algorithmic framework for proper learning of interaction-local unitary circuits, identifying good lightcone structure, signal propagation, and handleable factorizations as the operative criteria. Applied to random all-to-all two-local circuits, it establishes — through a combination of rigorous Markov-chain analysis, heuristic concentration arguments, and simulation — a sharp learnability threshold at depth $\mathcal{G}$9, set by lightcone saturation rather than mixing bounds. The result delineates precisely where proper learning of highly nonlocal shallow circuits is feasible and clarifies which assumptions must be strengthened to obtain fully unconditional guarantees.