Equivalence of maximal and generic reachability for non-universal Variational Quantum Circuits

arXiv:2609.27053 · quant-ph · Submitted 2026-09-22 · Read on arXiv

quant-ph

Submitted: 2026-09-22

Updated: 2026-09-22

Comments: 13 pages, 3 figures, 3 tables

License: http://creativecommons.org/licenses/by/4.0/

The gist: Employing problem-specific non-universal Variational Quantum Circuits aligned with a suitable state preparation has become a standard approach to counter the difficulty in training universal ansätze.

Terminology

Abstract

Employing problem-specific non-universal Variational Quantum Circuits aligned with a suitable state preparation has become a standard approach to counter the difficulty in training universal ansätze. However, due to their non-universality, diagnosing their reachability and trainability remains reference-state-specific. In this work, we establish the equivalence of maximal reachability and generic reachability over arbitrary reference states as a consequence of the principal orbit-type theorem. Thereafter, assuming that the global minimum of the cost function is achieved on a subset that can be described as the image of a smooth function, we derive necessary and sufficient conditions for non-zero probability of reachability under generically sampled reference states. Furthermore, when the solution set is assumed to be realised through a real analytic map that embeds a solution manifold, we show that local surjectivity is generically obtained on the entire solution manifold if it is attained at a single point. As a practical design rule, the need for local surjectivity automatically translates to a necessary dimensional criterion: reachability requires the target set's topological dimension to be at least as large as the co-dimension of the generic orbit. Numerical simulations show that finite-depth optimisation consistently fails when the dimensional obstruction applies, while unobstructed cases show improved convergence.

Sources

Related papers