Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.12665

Low Rank Structure of the Reduced Transition Matrix

Cathy Li, Bruno Bertini, Katja Klobas, Tianci Zhou

quant-phSubmitted May 12, 2026• Announced May 14, 2026• 3 citations
arXivHTMLPDF

Abstract

The influence-matrix formalism provides an alternative route to the classical simulation of quantum dynamics. Because influence matrices retain information only about the effective bath seen by local observables, they are expected to be easier to simulate than the full wavefunction. Recent work, however, has shown that they carry strong temporal correlations even in maximally chaotic systems, making them difficult to represent efficiently. Here we show that the reduced transition matrix, a suitable combination of influence matrices that directly determines local expectation values, can nevertheless be efficiently approximated. We first show that the truncation error is controlled by its singular-value spectrum, which naturally motivates a low-rank approximation. We then prove that, for chaotic dual-unitary circuits, the associated entropy grows at most logarithmically in time. Our conclusions follow from exact results for random dual-unitary circuits and are further supported by numerical results for fixed instances of both dual-unitary and random circuits.

Comments
17 pages, 8 figures, main text plus appendices

Related papers

Temporal entanglement transition in chaotic quantum many-body dynamics

Ilya Vilkoviskiy, Michael Sonner, Qi Camm Huang +3 more

Temporal entanglement (TE) of an influence matrix (IM) has been proposed as a measure of complexity of simulating dynamics of local observables in a many-body system. Foligno et al. [Phys. Rev. X 13, 041008 (2023)] recently argued that the TE in chaotic 1d quantum circuits obeys linear (volume-law) scaling with evolution time. To reconcile this apparent high complexity of IM with the rapid thermalization of local observables, here we study the relation between TE, non-Markovianity, and local temporal correlations for chaotic quantum baths. By exactly solving a random-unitary bath model, and bounding distillable entanglement between future and past degrees of freedom, we identify a regime where TE is extensive and reflects genuine non-Markovianity. This memory, however, is entirely contained in highly complex temporal correlations, and its effect on few-point temporal correlators is negligible. An IM coarse-graining procedure, reducing the allowed frequency of measurements of the probe system, results in a transition from volume- to {subvolume- (area or logarithmic)} law TE scaling. We demonstrate the generality of this TE transition in 1d circuits by analyzing the kicked Ising model analytically at dual-unitary points, as well as numerically away from them. This finding indicates that dynamics of local observables are fully captured by a subvolume-law IM. We provide evidence that the compact IM MPS obtained via standard compression algorithms accurately describes local~evolution.

quant-pharXiv:2511.03846•PRX Quantum•Nov 7, 2025•9 citations

Approximate strong simulation of one-dimensional quantum dynamics via reduced transition matrix

Matilde Grassi

Tensor networks enable the classical simulation of quantum many-body systems by restricting the description to the weakly entangled region of the Hilbert space. For the real-time dynamics of one-dimensional chains, the standard Time-Evolving Block Decimation algorithm compresses the evolved state as a matrix product state, whose bond dimension grows exponentially in time after a global quench (the entanglement barrier). This thesis addresses the approximate strong simulation of the dynamics: the computation of a single amplitude between two product states, to a prescribed relative precision. The spatio-temporal network is contracted along the spatial direction rather than in time (transverse contraction), and the amplitude becomes the overlap of a left and a right temporal matrix product state. Instead of truncating each half on its reduced density matrix, we truncate on the reduced transition matrix (RTM), built from both halves at once, so as to retain the directions relevant to their overlap. The resulting self-consistency problem is solved by sweeping the cut across the system until the amplitude converges. The algorithm, based on recent proposals and modified in its convergence criteria and bond-dimension schedule, was implemented from scratch in Julia and tested on kicked Ising and random brickwork circuits, and on the Trotterised mixed-field Ising chain in the gapped, critical and chaotic regimes. For circuits, we find numerical evidence that the required bond dimension grows subexponentially over the accessible time window. We relate this behaviour to the exponential decay of the RTM singular values: the cost is set by the tail of the spectrum, while the RTM entropy serves as a diagnostic of its structure. For Hamiltonian evolution, the accessible window is too short to determine the growth law. This method evaluates single probabilities without representing the evolved state, with potential applications to cross-entropy benchmarking.

•Oct 29, 2026•0 citations

Solvable Quantum Circuits with non-Markovian Influence Matrices

Samuel H. Pickering, Max McGinley, Bhavik Kumar +1 more

Influence matrices encode the action exerted on local subsystems by the rest of an extended quantum many-body system during their evolution. Thus, knowledge of the influence matrix facilitates computationally efficient simulations of local dynamics. Here we propose a new systematic approach to generating quantum circuits with complex dynamics for which the influence matrices can be written down exactly. In contrast to previous frameworks of this kind, such as dual-unitary circuits, the resulting influence matrices are non-Markovian, exhibiting nontrivial temporal correlations. We explicitly construct a broad family of circuits of this kind, based on dressing free-fermion (matchgate) circuits with appropriately chosen interaction terms. We show that, contrary to previous solvable instances, these circuits produce patterns of correlations that closely resemble that of typical many-body systems. Our approach can be directly interpreted in terms of an error correction scheme where the terms breaking the solvability of the influence matrices play the role of errors.

cond-mat.stat-mechCross-listedarXiv:2607.25969•Jul 29, 2026•1 citation

Temporal Entanglement in Chaotic Quantum Circuits

Alessandro Foligno, Tianci Zhou, Bruno Bertini

The concept of space evolution (or space-time duality) has emerged as a promising approach for studying quantum dynamics.The basic idea involves exchanging the roles of space and time, evolving the system using a space transfer matrix rather than the time evolution operator.The infinite-volume limit is then described by the fixed points of the latter transfer matrix, also known as influence matrices.To establish the potential of this method as a bona fide computational scheme, it is important to understand whether the influence matrices can be efficiently encoded in a classical computer.Here we begin this quest by presenting a systematic characterization of their entanglement-dubbed temporal entanglement-in chaotic quantum systems.We consider the most general form of space evolution, i.e., evolution in a generic spacelike direction, and present two fundamental results.First, we show that temporal entanglement always follows a volume law in time.Second, we identify two marginal cases-(i) pure space evolution in generic chaotic systems and (ii) any spacelike evolution in dual-unitary circuits-where Rényi entropies with index larger than one are sublinear in time while the von Neumann entanglement entropy grows linearly.We attribute this behavior to the existence of a product state with large overlap with the influence matrices.This unexpected structure in the temporal entanglement spectrum might be the key to an efficient computational implementation of the space evolution.

arXiv:2302.08502•Physical Review X•Oct 11, 2023•51 citations

Strong Simulation of 1D Quantum Circuits via Reduced Transition Matrices

Matilde Grassi, Stefano Carignano, Luca Tagliacozzo +1 more

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.

quant-pharXiv:2610.02082•Oct 2, 2026•0 citations

Eigenstate Correlations in Dual-Unitary Quantum Circuits: Partial Spectral Form Factor

Felix Fritzsch, Maximilian F. I. Kieler, Arnd Bäcker

While the notion of quantum chaos is tied to random matrix spectral correlations, also eigenstate properties in chaotic systems are often assumed to be described by random matrix theory. Analytic insights into eigenstate correlations can be obtained by the recently introduced partial spectral form factor. Here, we study the partial spectral form factor in chaotic dual-unitary quantum circuits in the thermodynamic limit. We compute the latter for a finite subsystem in a brickwork circuit coupled to an infinite complement. For initial times, shorter than the subsystem's size, spatial locality and (dual) unitarity implies a constant partial spectral form factor, clearly deviating from the linear ramp of the random matrix prediction. In contrast, for larger times we prove, that the partial spectral form factor follows the random matrix result up to exponentially suppressed corrections. We supplement our exact analytical results by semi-analytic computations performed in the thermodynamic limit as well as with numerics for finite-size systems.

arXiv:2407.19929•Quantum•Apr 17, 2025•13 citations
The influence-matrix formalism provides an alternative route to the classical simulation of quantum dynamics. Because influence matrices retain information only about the effective bath seen by local observables, they are expected to be easier to simulate than the full wavefunction. Recent work, however, has shown that they carry strong temporal correlations even in maximally chaotic systems, making them difficult to represent efficiently. Here we show that the reduced transition matrix, a suitable combination of influence matrices that directly determines local expectation values, can nevertheless be efficiently approximated. We first show that the truncation error is controlled by its singular-value spectrum, which naturally motivates a low-rank approximation. We then prove that, for chaotic dual-unitary circuits, the associated entropy grows at most logarithmically in time. Our conclusions follow from exact results for random dual-unitary circuits and are further supported by numerical results for fixed instances of both dual-unitary and random circuits.
Temporal entanglement (TE) of an influence matrix (IM) has been proposed as a measure of complexity of simulating dynamics of local observables in a many-body system. Foligno et al. [Phys. Rev. X 13, 041008 (2023)] recently argued that the TE in chaotic 1d quantum circuits obeys linear (volume-law) scaling with evolution time. To reconcile this apparent high complexity of IM with the rapid thermalization of local observables, here we study the relation between TE, non-Markovianity, and local temporal correlations for chaotic quantum baths. By exactly solving a random-unitary bath model, and bounding distillable entanglement between future and past degrees of freedom, we identify a regime where TE is extensive and reflects genuine non-Markovianity. This memory, however, is entirely contained in highly complex temporal correlations, and its effect on few-point temporal correlators is negligible. An IM coarse-graining procedure, reducing the allowed frequency of measurements of the probe system, results in a transition from volume- to {subvolume- (area or logarithmic)} law TE scaling. We demonstrate the generality of this TE transition in 1d circuits by analyzing the kicked Ising model analytically at dual-unitary points, as well as numerically away from them. This finding indicates that dynamics of local observables are fully captured by a subvolume-law IM. We provide evidence that the compact IM MPS obtained via standard compression algorithms accurately describes local~evolution.
Tensor networks enable the classical simulation of quantum many-body systems by restricting the description to the weakly entangled region of the Hilbert space. For the real-time dynamics of one-dimensional chains, the standard Time-Evolving Block Decimation algorithm compresses the evolved state as a matrix product state, whose bond dimension grows exponentially in time after a global quench (the entanglement barrier). This thesis addresses the approximate strong simulation of the dynamics: the computation of a single amplitude between two product states, to a prescribed relative precision. The spatio-temporal network is contracted along the spatial direction rather than in time (transverse contraction), and the amplitude becomes the overlap of a left and a right temporal matrix product state. Instead of truncating each half on its reduced density matrix, we truncate on the reduced transition matrix (RTM), built from both halves at once, so as to retain the directions relevant to their overlap. The resulting self-consistency problem is solved by sweeping the cut across the system until the amplitude converges. The algorithm, based on recent proposals and modified in its convergence criteria and bond-dimension schedule, was implemented from scratch in Julia and tested on kicked Ising and random brickwork circuits, and on the Trotterised mixed-field Ising chain in the gapped, critical and chaotic regimes. For circuits, we find numerical evidence that the required bond dimension grows subexponentially over the accessible time window. We relate this behaviour to the exponential decay of the RTM singular values: the cost is set by the tail of the spectrum, while the RTM entropy serves as a diagnostic of its structure. For Hamiltonian evolution, the accessible window is too short to determine the growth law. This method evaluates single probabilities without representing the evolved state, with potential applications to cross-entropy benchmarking.
Influence matrices encode the action exerted on local subsystems by the rest of an extended quantum many-body system during their evolution. Thus, knowledge of the influence matrix facilitates computationally efficient simulations of local dynamics. Here we propose a new systematic approach to generating quantum circuits with complex dynamics for which the influence matrices can be written down exactly. In contrast to previous frameworks of this kind, such as dual-unitary circuits, the resulting influence matrices are non-Markovian, exhibiting nontrivial temporal correlations. We explicitly construct a broad family of circuits of this kind, based on dressing free-fermion (matchgate) circuits with appropriately chosen interaction terms. We show that, contrary to previous solvable instances, these circuits produce patterns of correlations that closely resemble that of typical many-body systems. Our approach can be directly interpreted in terms of an error correction scheme where the terms breaking the solvability of the influence matrices play the role of errors.
The concept of space evolution (or space-time duality) has emerged as a promising approach for studying quantum dynamics.The basic idea involves exchanging the roles of space and time, evolving the system using a space transfer matrix rather than the time evolution operator.The infinite-volume limit is then described by the fixed points of the latter transfer matrix, also known as influence matrices.To establish the potential of this method as a bona fide computational scheme, it is important to understand whether the influence matrices can be efficiently encoded in a classical computer.Here we begin this quest by presenting a systematic characterization of their entanglement-dubbed temporal entanglement-in chaotic quantum systems.We consider the most general form of space evolution, i.e., evolution in a generic spacelike direction, and present two fundamental results.First, we show that temporal entanglement always follows a volume law in time.Second, we identify two marginal cases-(i) pure space evolution in generic chaotic systems and (ii) any spacelike evolution in dual-unitary circuits-where Rényi entropies with index larger than one are sublinear in time while the von Neumann entanglement entropy grows linearly.We attribute this behavior to the existence of a product state with large overlap with the influence matrices.This unexpected structure in the temporal entanglement spectrum might be the key to an efficient computational implementation of the space evolution.
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.
While the notion of quantum chaos is tied to random matrix spectral correlations, also eigenstate properties in chaotic systems are often assumed to be described by random matrix theory. Analytic insights into eigenstate correlations can be obtained by the recently introduced partial spectral form factor. Here, we study the partial spectral form factor in chaotic dual-unitary quantum circuits in the thermodynamic limit. We compute the latter for a finite subsystem in a brickwork circuit coupled to an infinite complement. For initial times, shorter than the subsystem's size, spatial locality and (dual) unitarity implies a constant partial spectral form factor, clearly deviating from the linear ramp of the random matrix prediction. In contrast, for larger times we prove, that the partial spectral form factor follows the random matrix result up to exponentially suppressed corrections. We supplement our exact analytical results by semi-analytic computations performed in the thermodynamic limit as well as with numerics for finite-size systems.