Metraipolis › archive › dc_9b11529ca100
Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices — arXiv:2610.02082
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.02082
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:38:23.509Z
- SHA-256 of the archived text
0c1aba4d107de27e5dc2169201ccac9637996a343b04fb12a204cffe9fea5f83- Stable URL of this page
https://metraipolis.com/documento/dc_9b11529ca100
How to cite
Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices — arXiv:2610.02082 — arXiv (en), https://arxiv.org/abs/2610.02082 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b11529ca100 (Metraipolis archive dc_9b11529ca100, sha256 0c1aba4d107de27e5dc2169201ccac9637996a343b04fb12a204cffe9fea5f83)
BibTeX
@misc{dc9b11529ca100,
title = {Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices — arXiv:2610.02082},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.02082},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b11529ca100; sha256 0c1aba4d107de27e5dc2169201ccac9637996a343b04fb12a204cffe9fea5f83},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.02082. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Tensor networks are powerful tools for simulating quantum many-body systems, but the growth of spatial entanglement severely limits the direct evolution of pure states under chaotic unitary circuits. Here we consider a more targeted task: the approximate strong simulation of a specified output probability of a 1D chaotic brick-wall circuit at finite relative precision. Given input and output bit strings $\by$ and $\bx$, we evaluate $p(\bx|\by)=|\bra{\bx}U(T)\ket{\by}|^2$ using the Sweeping RTM algorithm, a transverse tensor-network contraction based on reduced transition matrices (RTMs). The algorithm compresses the left and right temporal boundary states jointly, seeking an output probability that converges across spatial cuts and as the bond dimension is increased. For chaotic one-dimensional brick-wall circuits at a fixed relative target precision, we find numerical evidence that the bond dimension required to obtain stable estimates grows subexponentially over the accessible time window. Our findings open a direct route to classical probability queries for chaotic quantum circuits, with potential applications to benchmarking and learning tasks.
Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-10-02 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph) ; Statistical Mechanics (cond-mat.stat-mech).
Pagina del lavoro: https://arxiv.org/abs/2610.02082 — 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.742Z 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).