Metraipolis › archive › dc_273052abffa2

Data informed Ansatz Selection for Variational Quantum Circuits — arXiv:2611.05079

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.05079
License (as archived)
CC0-1.0
Archived
2026-11-04T12:42:49.631Z
SHA-256 of the archived text
29810fdcefbc1eb040bd6ffb0b27daca7e860aa0096c5c5247a18551ce25beb9
Stable URL of this page
https://metraipolis.com/documento/dc_273052abffa2

How to cite

Data informed Ansatz Selection for Variational Quantum Circuits — arXiv:2611.05079 — arXiv (en), https://arxiv.org/abs/2611.05079 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_273052abffa2 (Metraipolis archive dc_273052abffa2, sha256 29810fdcefbc1eb040bd6ffb0b27daca7e860aa0096c5c5247a18551ce25beb9)
BibTeX
@misc{dc273052abffa2,
  title = {Data informed Ansatz Selection for Variational Quantum Circuits — arXiv:2611.05079},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.05079},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_273052abffa2; sha256 29810fdcefbc1eb040bd6ffb0b27daca7e860aa0096c5c5247a18551ce25beb9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05079. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Choosing a variational quantum circuit (VQC) usually means searching over ansatze and depths, and training each candidate. We give three rules that fix these choices from the data and the gate set alone, before any training. First, a circuit without entangling gates has a rank-one Fourier coefficient tensor on every subset of qubits. A singular value decomposition of a dataset's Fourier coefficients therefore indicates whether entanglement is needed, which qubits it connects, and a lower bound on the error of omitting it. Second, the rank of the quantum Fisher information matrix grows by $p_0$ per layer, after a first-layer deficit $d_0$, until it reaches a ceiling set by the dynamical Lie algebra. This law fixes the depth. Third, reading out all $2^N - 1$ Pauli-Z products from one batch of shots resolves half of the state's directions, the most any single-basis readout can. A single-qubit readout resolves an exponentially small fraction. For the Madelon dataset, the rules prescribe 7 blocks of 3 qubits at depth 3: a 239-parameter classifier with 78.5% test accuracy, found without a grid search. Ablations confirm three predicted effects: shallower circuits, smaller blocks and dropping reuploading all lower accuracy.

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.05079 — 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-04T12:29:47.403Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).