Searcharxiv⌕ Search

arXiv · 2610.36167

Analog Quantum Experiments Meet Automatic Differentiation - from Programs to Atoms

Abstract

Gradient-based optimization of analog quantum hardware poses a concrete programming problem: given an executable experiment P(θ) that returns only measurement samples, what executable experiment should the system run to obtain (d/dθ_ell)P(θ)? Conventional automatic differentiation cannot propagate through the inaccessible quantum state, while finite differences require a noise-sensitive step size and analytic gradient identities cover only parts of an experiment. We present DiffSimuQ, which shows that a broad class of open-loop analog quantum experiments is closed under automatic differentiation. A compositional transformation maps P(θ) to a derivative program D_ell[P(θ)] in the same language whose expected outcome is exactly the derivative. Only continuous evolution requires a strategy-specific rule, and we give two realizations. Our Nyquist shift rule (NSR) applies to general time-dependent evolution: we prove that the observable response to shifting the Hamiltonian along its tangent is band-limited even for non-commuting controls, enabling exact reconstruction from shifted executions. For involutory generators, a parameter-shift realization (PSR) inserts a parameter-independent operation at a sampled time. Because derivative programs remain ordinary programs, source and derivative experiments share one compiler, which reuses the source realization, lowers branches to device-ready neutral-atom controls, and selects between NSR and PSR based on estimated cost. Under device noise, the exact derivative programs differentiate the objective realized by the device, with hardware realization errors treated separately. In machine-level noisy emulation, NSR and PSR avoid the finite-difference error floor and improve closed-loop optimization; they win in complementary cost regimes, while each derivative branch at 1000 qubits add at most 0.3% to source compilation time.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yue Shi, Pengyu Liu, Yuxiang Peng. 2026-10-26. Analog Quantum Experiments Meet Automatic Differentiation - from Programs to Atoms. https://arxiv.org/abs/2610.36167

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Robust Preparation of Bell States by Time Boundary Effect

Quantum entanglement is essential for modern quantum information processing. Entanglement gates convert initially non-entangled states into entangled ones by applying time-dependent parametric pulses. While Bell state preparation has been experimentally validated in various platforms, its stability and fidelity are constrained by environmental decoherence and parametric fluctuations. Here, we propose a dynamically robust method for preparing Bell states by leveraging the time boundary effect and momentum-space projective measurements within Su-Schrieffer-Heeger systems. Employing the Lindblad master equation, we theoretically demonstrate that the prepared Bell states exhibit remarkable robustness against both environmental decoherence and parametric time fluctuations, achieving nearly perfect quantum fidelity, with the momentum conservation law governing this robust behavior. This framework based on the time boundary effect is applicable to both fermionic and bosonic excitations, offering a unified paradigm for generating Bell states in quantum computation and communication.

quant-ph↗

Emergent Quantum Synchronization Without Symmetry Breaking

Parametric amplification of a shared cavity mode turns the light--matter coupling phase of a two-ensemble Dicke model into a control parameter. We prove analytically that a cavity-set gain band opens a window of this phase with no static superradiant instability, leaving only a Hopf bifurcation, for arbitrary couplings, spin frequencies, damping rates and ensemble sizes. A $\mathbb{Z}_2$ parity keeps the quantum steady state unique and time independent: every order parameter vanishes and the oscillation lives in a slow parity-odd Liouvillian mode. Truncated-Wigner simulations, validated against exact ones, show that above threshold its quality factor grows linearly with system size and the ensembles phase lock; below threshold, both saturate. Quantum synchronization emerges without symmetry breaking and without requiring entanglement.

quant-ph↗

Advantage of Sample Complexity in Quantum PAC Learning Requires Inverse Access to State-Preparation Unitaries

Whether quantum computation can reduce the amount of data required for conventional machine learning is a central problem in quantum machine learning. In probably approximately correct (PAC) learning, a learner receives training examples sampled from an unknown probability distribution. Quantum PAC learning extends this framework by allowing access to quantum examples, which are quantum states that coherently encode this distribution, or to unitaries that prepare quantum examples, with or without inverse access. When only copies of quantum examples are available, the optimal worst-case sample complexity asymptotically matches that of classical learning. In contrast, access to both a preparation unitary and its inverse can improve the accuracy dependence of query complexity. However, it has remained open whether access to the preparation unitary alone suffices for this improvement. In this work, we resolve this question by determining the optimal query complexity with forward-only access, taking the worst case over compatible preparation unitaries and their dimensions. In both realizable and agnostic PAC learning, this complexity matches, up to constant factors, the optimal sample complexity achievable with classical examples or copies of quantum examples. To prove these results, we construct, for any algorithm with forward-only access, a simulator that approximates the algorithm's Haar-averaged output state using as many copies of the prepared state as the algorithm makes queries. These results show that inverse access is essential for the known improvement in accuracy dependence in this worst-case setting. Beyond PAC learning, our reduction provides a general tool for transferring lower bounds for state copies to query lower bounds for forward-only access to the corresponding preparation unitaries.

quant-ph↗