Training Variational Quantum Algorithms Is NP-Hard, Even Locally

quant-ph, cs.CC, math.OC

Submitted: 2026-10-04

Updated: 2026-10-04

Comments: 7 pages, 2 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Sources

• A Review of Variational Quantum Algorithms: Insights into Fault-Tolerant Quantum Computing
• A Quantum Approximate Optimization Algorithm
• Global Optimization for Parametrized Quantum Circuits
• A Convergence Theory for Over-parameterized Variational Quantum Eigensolvers

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians