Metraipolis › archive › dc_303e63266dd2
Unifying and Extending Strong Simulation of Quantum Circuits — arXiv:2610.00547
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.00547
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:37:17.945Z
- SHA-256 of the archived text
ccfc6013418fb052386030d51558b6c0be7050a563e4b6e911eca84a83dab7d9- Stable URL of this page
https://metraipolis.com/documento/dc_303e63266dd2
How to cite
Unifying and Extending Strong Simulation of Quantum Circuits — arXiv:2610.00547 — arXiv (en), https://arxiv.org/abs/2610.00547 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_303e63266dd2 (Metraipolis archive dc_303e63266dd2, sha256 ccfc6013418fb052386030d51558b6c0be7050a563e4b6e911eca84a83dab7d9)
BibTeX
@misc{dc303e63266dd2,
title = {Unifying and Extending Strong Simulation of Quantum Circuits — arXiv:2610.00547},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.00547},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_303e63266dd2; sha256 ccfc6013418fb052386030d51558b6c0be7050a563e4b6e911eca84a83dab7d9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.00547. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits. A circuit becomes a sum-product query: factors encode gates, internal wire variables are aggregated, and free boundary variables index transition amplitudes. The central insight is that distinct sources of simulation tractability can be exploited within the same InsideOut evaluation scheme. The query specifies what is computed; the evaluation plan, semiring, and representation of intermediate factors determine the cost. This view unifies structural and algebraic simulation guarantees. With explicit factor representations, FAQ evaluation recovers the treewidth bound for tensor-network contraction and yields finer sparsity-sensitive bounds via fractional covers. Over a formal phase semiring, compressed intermediate factors recover rank-width-based simulation for compatible quadratic phase representations. For Clifford circuits, affine-quadratic factors are closed under multiplication and marginalization and remain polynomial in size, yielding polynomial-time exact amplitude computation without any bounded-width assumption. Beyond these recoveries, the framework yields a new tractability criterion: tensor layout symmetry width. This parameter combines local cut-rank with separator symmetry through exact tree-tensor representations. We give a constructive evaluation bound and exhibit a circuit family with bounded tensor layout symmetry width but unbounded phase-graph rank-width and circuit line-graph treewidth. These results establish representation-aware FAQ evaluation as a common algorithmic foundation for classical simulation and a systematic route to new tractable regimes. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph) ; Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2610.00547 — 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-07T11:19:01.641Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-10-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).