Training quantum neural networks one job at a time

When a quantum processor is reached through a cloud queue, a variational algorithm pays for every round trip, and a single round trip can carry many circuits. The classical optimizer therefore decides how much is learned per job, not only per shot. We study this for a quantum neural network classifier. We compare optimizers that are given the same number of jobs and the same shots per job, and that differ only in how they fill each job. This comparison treats hybrid quantum-classical training as an execution-efficiency problem: how to obtain useful optimization progress from each costly interaction with a quantum processor. The resulting perspective connects optimizer design to overhead amortization and efficient use of accelerator resources. A direct port of a batched pattern search that worked for the quantum approximate optimization algorithm stalls once the model has a few dozen parameters. What does transfer is the principle behind it: fill each job with a batch of parameter vectors that is fixed before the job is sent. For circuits built from Pauli rotations the natural batch is the parameter-shift stencil. We show that its gradient error falls as the inverse of the shots per job, while the error of simultaneous-perturbation methods (SPSA) has a floor that no number of shots removes. In simulation, batched parameter-shift training needs between a fifth and a half of the jobs SPSA needs, for 24 to 48 parameters, and the ordering holds at two noise levels. A new structure-aware stencil search reads the same kind of rows as sinusoids and also beats SPSA. On IBM's ibm_fez processor, in three interleaved runs at six and eight qubits, the batched optimizer reached SPSA's final training loss within 4 to 20 of its 50 jobs. Its test accuracy was clearly higher at eight qubits; at six qubits the difference was not significant. All hardware numbers can be re-derived from the raw shots.

Authors

Publication Details

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

Training quantum neural networks one job at a time

Rabab Alomairy, Muhammad Faryad
arXiv (Cornell University)
Quantum Computing Algorithms and Architecture
preprint

Training quantum neural networks one job at a time

Rabab Alomairy, Muhammad Faryad
preprint en

Abstract

When a quantum processor is reached through a cloud queue, a variational algorithm pays for every round trip, and a single round trip can carry many circuits. The classical optimizer therefore decides how much is learned per job, not only per shot. We study this for a quantum neural network classifier. We compare optimizers that are given the same number of jobs and the same shots per job, and that differ only in how they fill each job. This comparison treats hybrid quantum-classical training as an execution-efficiency problem: how to obtain useful optimization progress from each costly interaction with a quantum processor. The resulting perspective connects optimizer design to overhead amortization and efficient use of accelerator resources. A direct port of a batched pattern search that worked for the quantum approximate optimization algorithm stalls once the model has a few dozen parameters. What does transfer is the principle behind it: fill each job with a batch of parameter vectors that is fixed before the job is sent. For circuits built from Pauli rotations the natural batch is the parameter-shift stencil. We show that its gradient error falls as the inverse of the shots per job, while the error of simultaneous-perturbation methods (SPSA) has a floor that no number of shots removes. In simulation, batched parameter-shift training needs between a fifth and a half of the jobs SPSA needs, for 24 to 48 parameters, and the ordering holds at two noise levels. A new structure-aware stencil search reads the same kind of rows as sinusoids and also beats SPSA. On IBM's ibm_fez processor, in three interleaved runs at six and eight qubits, the batched optimizer reached SPSA's final training loss within 4 to 20 of its 50 jobs. Its test accuracy was clearly higher at eight qubits; at six qubits the difference was not significant. All hardware numbers can be re-derived from the raw shots.

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