Searcharxiv⌕ Search

arXiv · 2611.16365

Training quantum neural networks one job at a time

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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Muhammad Faryad, Rabab Alomairy. 2026-11-12. Training quantum neural networks one job at a time. https://searcharxiv.com/abs/2611.16365

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

A Diamond Quantum Oscilloscope

Quantum-enhanced metrology has achieved remarkable precision in parameter estimation, but extending these advantages to continuous time-dependent fields (waveform sensing) remains a formidable challenge due to the infinite-dimensional nature of the signal. Here, we report the first experimental realization of a room-temperature solid-state quantum oscilloscope based on a sequential quantum difference amplification strategy. Within a zero-order-hold reconstruction framework, our method completely bypasses the need for massive entanglement. Crucially, we demonstrate that the overall waveform reconstruction error unequivocally follows the theoretically predicted Heisenberg scaling of \(O(N^{-1/2})\), decisively surpassing the classical \(O(N^{-1/3})\) limit. This transformative precision requires approximately 30-fold fewer quantum resources than conventional methods to achieve the same waveform error. Furthermore, we demonstrate the reconstruction of a multicomponent waveform and distinctly resolve weak high-frequency components that are entirely drowned in the shot noise of classical sampling. These results transition quantum metrology from parameter estimation into a practical instrument, establishing a genuine quantum advantage in continuous waveform reconstruction and paving the way for critical applications such as nanoscale nuclear magnetic resonance imaging, where detecting extremely weak signals is crucial for resolving molecular structures.

quant-ph↗

Entanglement preservation and Clauser-Horne nonlocality in electromagnetically induced transparency quantum memories

Understanding how decoherence-induced loss affects entanglement and nonlocal correlations in quantum memories is important for quantum information science. Here we develop a quantitative description of photonic quantum states retrieved from electromagnetically induced transparency (EIT) memories in a ground-state-decoherence-limited regime. Using the dark-state-polariton formalism, we derive the attenuation factor of the retrieved probe mode from the EIT dynamics. This attenuation depends on the coupling field and ground-state coherence decay and is not introduced as an independent phenomenological loss parameter. Within a specified quantum-limited pure-loss model, we use this attenuation to obtain the reduced photonic density operator. We show that, in the symmetric case, the complete retrieved state of an initially path-entangled single photon remains entangled for any nonzero storage efficiency, despite acquiring a vacuum component. In contrast, violation of the unconditional Clauser-Horne inequality under displaced on/off detection without post-selection requires an intrinsic efficiency above 89.7%. We further derive the retrieved N-qubit photonic density operator for multiple independently operating EIT memories. These results establish a quantitative connection between EIT memory dynamics, retrieved quantum states, and operational nonlocality benchmarks under explicit channel assumptions.

quant-ph↗

Geometric encoding of turbulence for end-to-end quantum simulation

Simulating multiscale turbulence in engineering remains challenging. Any quantum advantage for such simulations requires efficient initial-state preparation. Yet exact loading of an arbitrary classical snapshot requires exponential quantum resources. We introduce "turbuloscope", a physics-informed geometric method that generates statistically representative turbulent initial states in a gate-based register from a parameterized Pauli-spinor multiscale distribution. Scale invariance renders conditional rotations approximately affine in Gray-code space, enabling linear-depth, ancilla-free preparation. The generalized Madelung transform and Hopf fibration map the encoded Pauli spinor to fluid observables and vortex tubes. The qubit count scales logarithmically with the Reynolds number, yielding an exponential reduction in preparation overhead relative to full-grid classical spectral synthesis. We classically emulate a 30-qubit preparation circuit and generate a turbulent field over one billion grid points at a scale-inferred Reynolds number of 35,000, exhibiting Kolmogorov's five-thirds energy spectrum, tangled vortex tubes, and intermittency. This method provides scalable initial states for quantum simulation of turbulence and multiscale systems.

quant-ph↗