Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices
Abstract
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)=|brabxU(T)ketby|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.
Related
- Symmetry-Reduced Variational Quantum Simulation of the U(5)→ SU(3) Quantum Phase Transition in the Interacting Boson Model
- Machine Learning Approaches to Building Quantum Circuits for Sets of Matrices
- Quantum simulation of classical RCL circuits via complexification and Schrödingerization
- Quantum Simulation of a Hyperbolically Driven Quantum System with Superconducting Circuits
- Complexity of tensor network simulation for noisy quantum circuits
BibTeX
@misc{grassi2026strong,
title = {{Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices}},
author = {Matilde Grassi and Stefano Carignano and Luca Tagliacozzo and Jacopo De Nardis},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.02082},
eprint = {2610.02082},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.02082},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices
AU - Matilde Grassi
AU - Stefano Carignano
AU - Luca Tagliacozzo
AU - Jacopo De Nardis
PY - 2026
DA - 2026/10/01
PB - arXiv
DO - 10.48550/arxiv.2610.02082
UR - https://arxiv.org/abs/2610.02082
AB - 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)=|brabxU(T)ketby|^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.
ER -