Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910131291160576 |
|---|---|
| author | Oh, Yun-Tak Lee, Dongsoo Park, Jungyoul Jeong, Kyung Chul Kim, Panjin |
| author_facet | Oh, Yun-Tak Lee, Dongsoo Park, Jungyoul Jeong, Kyung Chul Kim, Panjin |
| contents | This work identifies a necessary condition for any variational quantum approach to reach the exact ground state. Briefly, the norms of the projections of the input and the ground state onto each group module must match, implying that module weights of the solution state have to be known in advance in order to reach the exact ground state. An exemplary case is provided by matchgate circuits applied to problems whose solutions are classical bit strings, since all computational basis states share the same module-wise weights. Combined with the known classical simulability of quantum circuits for which observables lie in a small linear subspace, this implies that certain problems admit a classical surrogate for exact solution with each step taking $O(n^5)$ time. The Maximum Cut problem serves as an illustrative example. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_13735 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module Oh, Yun-Tak Lee, Dongsoo Park, Jungyoul Jeong, Kyung Chul Kim, Panjin Quantum Physics Computational Complexity Emerging Technologies Machine Learning This work identifies a necessary condition for any variational quantum approach to reach the exact ground state. Briefly, the norms of the projections of the input and the ground state onto each group module must match, implying that module weights of the solution state have to be known in advance in order to reach the exact ground state. An exemplary case is provided by matchgate circuits applied to problems whose solutions are classical bit strings, since all computational basis states share the same module-wise weights. Combined with the known classical simulability of quantum circuits for which observables lie in a small linear subspace, this implies that certain problems admit a classical surrogate for exact solution with each step taking $O(n^5)$ time. The Maximum Cut problem serves as an illustrative example. |
| title | Reachability Constraints in Variational Quantum Circuits: Optimization within Polynomial Group Module |
| topic | Quantum Physics Computational Complexity Emerging Technologies Machine Learning |
| url | https://arxiv.org/abs/2604.13735 |