Training the variational angles of the Quantum Approximate Optimization Algorithm once on a small instance and reusing them on larger ones, known as parameter transfer, is the standard route past the exact-simulation wall. Existing literature explains its success almost entirely through structural similarity. We identify a new, independent axis that governs transfer whenever constraints are encoded as penalties: the trained angles memorize the penalty weight $\lambda$ of their training instance. For any scalarized cost function with an integer-valued violation count, we prove that at arbitrary fixed QAOA angles $(\beta,\gamma)$ of depth $p$, the probability mass $F(\lambda)$ on the feasible subspace is a finite real trigonometric polynomial in $\lambda$ whose angular frequencies lie on an integer lattice generated by the trained $\gamma$'s. Three consequences follow immediately: transfer feasibility is a resonance peaked where the deployment penalty matches the training penalty; the resonance width scales as $1/(v_{max}\sum_k|\gamma_k|)$, so low-$|\gamma|$ angle sets are systematically more transferable; and the curve exhibits revival peaks at spacings $2\pi/\gamma_k$. We confirm all three predictions by exact statevector experiments on a 20-qubit multi-user resource-allocation QUBO. The theorem is independent of how the angles were obtained and applies to any integer-penalty QUBO, recasting a widely reported failure mode of penalty-based QAOA as deterministic, predictable phase interference rather than an energetic tuning problem.
This work defines the universal margin as the smallest correlator magnitude that can be guaranteed with prescribed signs for every target sign assignment, and shows that it is exactly $\Delta_{\rm Maj}(n)=\tan\!\left(\frac{\pi}{4n}\right)=\Theta(1/n)$, whereas uniformly random sign assignments retain $\Theta(1/\sqrt n)...
It is explained that the efficiently preparable states, device-generated distributions, variationally learned loading, and amortized preparation are required to get advantage from quantum machine learning and close with a checklist for evaluating input-dependent advantage claims.
Learning compact, interpretable descriptions of quantum many-body states is an important task in quantum science. We study the task of learning the Slater determinant with maximum fidelity to an arbitrary fermionic many-body state, with motivation from both Hartree-Fock methods and agnostic tomography. Given an $n$-fer...
Nisarga Paul, Hai-Meng Zhao, David D. Dai· 0 citations
Reporting the Fisher geometry of a trained variational quantum model is routine; quoting the shot budget that would establish it is not. Certifying an empirical Fisher matrix to relative Frobenius error $\varepsilon$ under coordinate-wise parameter shift costs $\Theta(B p^{2} V/(\varepsilon^{2} G))$ circuit executions,...
Training variational quantum models requires choosing between parameter-shift gradients, which are exact but cost $O(P)$ forward evaluations, and simultaneous perturbation stochastic approximation (SPSA), which uses only two samples but produces high-variance estimates that can degrade optimisation on small supervised...
Nayan D'Souza, Christopher J. Agostino· 0 citations
We study online search for an unknown affine hyperplane in $\mathbb{R}^D$, for arbitrary fixed finite dimension. Building on a companion self-similar cell reduction and support-function formulation, we ask how the mechanism changes as the normal space grows from $\mathbb{S}^0$ to $\mathbb{S}^{D-1}$. In $D=1$, alternati...
Florentin Koch· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.