Metraipolis › archive › dc_2ff9516b798c
Hidden selection rules and amplitude ceilings in quantum Fourier models — arXiv:2611.01314
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01314
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:40:26.219Z
- SHA-256 of the archived text
499cd3f913e17d0e155e86e14506456826d90d6cb88ffddcafca11da36fa6f65- Stable URL of this page
https://metraipolis.com/documento/dc_2ff9516b798c
How to cite
Hidden selection rules and amplitude ceilings in quantum Fourier models — arXiv:2611.01314 — arXiv (en), https://arxiv.org/abs/2611.01314 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2ff9516b798c (Metraipolis archive dc_2ff9516b798c, sha256 499cd3f913e17d0e155e86e14506456826d90d6cb88ffddcafca11da36fa6f65)
BibTeX
@misc{dc2ff9516b798c,
title = {Hidden selection rules and amplitude ceilings in quantum Fourier models — arXiv:2611.01314},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01314},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2ff9516b798c; sha256 499cd3f913e17d0e155e86e14506456826d90d6cb88ffddcafca11da36fa6f65},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01314. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Quantum models with Pauli data encodings compute trigonometric polynomials whatever channels, ancillas and outcome-averaged measurements follow, so their expressivity depends on the Fourier coefficients a circuit can reach. We identify two kinds of structure that settle this before training. An antiunitary time-reversal rule and a unitary reflection rule remove frequencies. For gate-level circuits, deciding whether such a rule exists reduces to a linear system over GF(2), solvable in polynomial time, and the time-reversal rule holds in 17.6% of 6,120 configurations of standard templates. Single-upload encodings cap the top coefficient at $2^{-m}$ for every channel, and we compute the tight ceiling for every frequency and a depth-independent re-uploading bound. Frozen before training, these bounds were never violated on a non-linearity benchmark, and they predicted trained performance on real data. On IBM processors the rule held on a 65-qubit chain, and we switched rule-breaking relaxation noise on and off by design.
Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.01314 — 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-11-03T18:12:54.726Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).