Metraipolis › archive › dc_115567783db3
When Expressivity Is Not Enough: Discrete Routing Geometry in Variational Quantum Circuits — arXiv:2610.07697
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07697
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T15:28:52.223Z
- SHA-256 of the archived text
5327c5e492f24d2a36eb2d6414813cf8e7ab054ed88c503548470bd8836667e5- Stable URL of this page
https://metraipolis.com/documento/dc_115567783db3
How to cite
When Expressivity Is Not Enough: Discrete Routing Geometry in Variational Quantum Circuits — arXiv:2610.07697 — arXiv (en), https://arxiv.org/abs/2610.07697 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_115567783db3 (Metraipolis archive dc_115567783db3, sha256 5327c5e492f24d2a36eb2d6414813cf8e7ab054ed88c503548470bd8836667e5)
BibTeX
@misc{dc115567783db3,
title = {When Expressivity Is Not Enough: Discrete Routing Geometry in Variational Quantum Circuits — arXiv:2610.07697},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07697},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_115567783db3; sha256 5327c5e492f24d2a36eb2d6414813cf8e7ab054ed88c503548470bd8836667e5},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07697. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Finding useful variational quantum circuits requires more than representational capacity: training must also have access to directions that improve the objective. We study how discrete CNOT routing shapes both capacity and local accessibility. For circuits built from CNOT and arbitrary one-qubit gates, we separate binary routing matrices from continuous rotations to relate global capacity to local tangent accessibility. An exact finite-field formula for the operator Schmidt rank of a CNOT block and cumulative multiblock bounds yield capacity constraints and a Bell-pair fidelity obstruction. Locally, routing propagates generators into a routing-dependent tangent space, so all parameter gradients can vanish even when the ambient objective gradient is nonzero; frame bounds distinguish loss of gradient coverage from poor conditioning. A routing-conditioned identity insertion preserves the current unitary, state, loss, and existing gradients while adding new tangent directions. Candidate-only and incremental projection scores provide local criteria for ranking insertions. Exact-statevector tests show strong short-horizon score-descent correlations on controlled Bell tasks and effective equal-cost selection on connected Heisenberg chains up to twelve qubits, with complementary TFIM selector controls. A broader TFIM routing ensemble exhibits routing-dependent near-stagnation. Together, these results connect representational capacity, local accessibility, and same-point repair through a common discrete routing description. An architecture need not remain fixed during training: task-dependent geometric information can guide the opening of new descent directions while preserving the learned circuit at insertion. This provides a concrete local approach to a broader problem: how useful quantum circuits can be discovered from the information a task supplies. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2610.07697 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T15:00:59.396Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).