Gradient Blindness in Adaptive Architecture Search for IQP Born Machines

Instantaneous quantum polynomial (IQP) Born machines learn a probability distribution from data with a circuit of commuting gates that a classical computer trains at hundreds of qubits. Adaptive algorithms grow a sparse circuit from a small seed by adding in every round the candidate gates with the largest loss gradient. Such algorithms never add a candidate whose gradient vanishes, so the choice of seed decides which circuits they can reach. Here we show that a candidate gate has a nonzero gradient for some angles of the circuit exactly when its generator is the sum of an odd number of linearly independent generators already in the circuit. The common seed of one-qubit gates therefore never adds a gate on an even number of qubits, which exact gradients on 12 qubits confirm. A seed of one-qubit gates plus the edges of the Chow-Liu tree sees every candidate, and its circuits match the full circuits on 12 and 16 qubits with 10 to 13 percent of their parameters. At 484 qubits, a heredity pool keeps the search over higher-order gates feasible, and the circuits grown from this seed reach a lower test loss than the dense two-body circuit with 6 percent of its parameters, although the higher-order gates add no gain.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24174
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Gradient Blindness in Adaptive Architecture Search for IQP Born Machines

Jonas Stein, Claudia Linnhoff‐Popien, Gerhard Stenzel, Sebastian Wölckert et al.
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Gradient Blindness in Adaptive Architecture Search for IQP Born Machines

Jonas Stein, Claudia Linnhoff‐Popien, Gerhard Stenzel, Sebastian Wölckert, Michael Poppel
preprint en

Abstract

Instantaneous quantum polynomial (IQP) Born machines learn a probability distribution from data with a circuit of commuting gates that a classical computer trains at hundreds of qubits. Adaptive algorithms grow a sparse circuit from a small seed by adding in every round the candidate gates with the largest loss gradient. Such algorithms never add a candidate whose gradient vanishes, so the choice of seed decides which circuits they can reach. Here we show that a candidate gate has a nonzero gradient for some angles of the circuit exactly when its generator is the sum of an odd number of linearly independent generators already in the circuit. The common seed of one-qubit gates therefore never adds a gate on an even number of qubits, which exact gradients on 12 qubits confirm. A seed of one-qubit gates plus the edges of the Chow-Liu tree sees every candidate, and its circuits match the full circuits on 12 and 16 qubits with 10 to 13 percent of their parameters. At 484 qubits, a heredity pool keeps the search over higher-order gates feasible, and the circuits grown from this seed reach a lower test loss than the dense two-body circuit with 6 percent of its parameters, although the higher-order gates add no gain.

arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon