Search arXiv⌕ Search

arXiv · 2610.33386

Decision-aware validation of zero-noise extrapolation in QAOA optimization landscapes

Abstract

Zero-noise extrapolation (ZNE) is usually validated by the accuracy of mitigated observables, yet variational quantum optimization uses those observables to select parameters. We ask whether, and by how much, an accuracy gain from ZNE coincides with a worse decision. In depth-one simulations of the quantum approximate optimization algorithm (QAOA) for MaxCut on four to six qubits, each sampled $120\times120$ landscape yields both its mean-squared error (MSE) and the ideal regret of its selected grid minimum, comparing Richardson orders one to three with unmitigated estimation at the same total shot budget per grid point. In an exploratory screen of 675 conditions, whose per-point random seeds collide, a familywise (Holm) analysis retains only four of 540 replication conditions as showing both directional MSE improvement and regret increase. A frozen confirmation with 100 fresh paired repetitions per condition reproduces all four: median MSE improvements of 7.65-73.09% accompany median normalized regret increases of only 0.0031-0.0073. We distinguish a bias route, in which residual bias reorders the mean landscape, from a variance route, in which Richardson weights amplify finite-shot noise. Exact first and second moments on a bounded control grid find no bias-route reversal: mitigated mean landscapes preserve the ideal minima, and ZNE can more than halve expected MSE, yet finite-shot selections incur higher mean regret. Decision losses that survive strict testing are few and small in this benchmark, but reproducible and not revealed by aggregate MSE. We present a paired benchmark and recommend reporting decision regret alongside estimation error when mitigation is assessed for optimization. Results concern simulated exhaustive grids, not hardware or optimizer loops.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Vicenzo Scavino Alfaro. 2026-10-24. Decision-aware validation of zero-noise extrapolation in QAOA optimization landscapes. https://arxiv.org/abs/2610.33386

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↗

Hamiltonian Chaos

Through semiclassical methods the subject of quantum chaos motivates and depends on Hamiltonian chaos research. Presented here is a selection of some of the most important Hamiltonian chaos topics that in this way get directly related to any of a variety of quantum chaos research problems. The overall emphasis is on intuitive explanations and illustrations of various ideas with the references containing more mathematically rigorous expositions. The chapter begins with a description of various useful theoretical and computational tools of chaos research, e.g.~surfaces of section, paradigms of chaos, stability analysis, and symbolic dynamics... This is followed by discussions regarding the geometry of chaos, how chaotic systems respond to perturbations, and the complexification of Hamiltonian dynamics. Most of the contents concern topics that are long established and well known by now. The exceptions involve complications that arise from the complexification of phase space variables and time. There are relatively recent results summarized regarding the appropriate branches of determinant phases and how to distinguish complex trajectories that are associated with classically allowed processes versus those associated with non-allowed ones.

quant-ph↗

Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions

The linear combination of unitaries (LCU) is a fundamental quantum computing primitive used to embed non-unitary operators into larger systems via ancilla post-selection. In standard LCU implementations, only the zero-state ancilla outcome is retained, while all other measurement branches are discarded as unusable overhead. We study these discarded parts. Every computational-basis outcome of the ancilla projects the system onto a different linear combination of the target unitaries; collecting these outcome states in a matrix gives a factorization $Φ=CX$, where $C$ is determined by the ancilla preparation and the rows of $X$ are the states $U_t|ψ\rangle$, so that $rank(Φ)\le K$. Although this holds for any LCU circuit; to make the analysis easier, we use a simplified model circuit with Hadamard gates on the index register and a single rotation qubit in place of the coefficient preparation unitary, in which $C$ is explicit. The structure suggests two complementary applications: (i) in an explicit amplitude-access model, classical low-rank matrix completion can reconstruct the full output (including the target) from a subset of its amplitude entries, while computational basis counts provide intensities and generally require additional phase information for full complex recovery; (ii) treating $C$ as a secret key suggests a candidate quantum trapdoor function, whose security remains informal and depends on the difficulty of structured phase retrieval. The scheme thus turns the "junk" ancilla outcomes into a structured resource, possibly opening paths for further applications.

quant-ph↗