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:2409.13603 · Physical review. B./Physical review. B

Pauli weight requirement of the matrix elements in time-evolved local operators: Dependence beyond the equilibration temperature

Carlos Ramos Marimón, Stefano Carignano, Luca Tagliacozzo

Published Mar 5, 2025• 0 citations
arXivHTMLPDF

Abstract

The complexity of simulating the out-of-equilibrium evolution of local operators in the Heisenberg picture is governed by the operator entanglement, which grows linearly in time for generic nonintegrable systems, leading to an exponential increase in computational resources. A promising approach to simplify this challenge involves discarding parts of the operator and focusing on a subspace formed by ``light'' Pauli strings---strings with few Pauli matrices---as proposed by Rakovszki et al. [Phys. Rev. B 105, 075131 (2022)]. In this work, we investigate whether this strategy can be applied to quenches starting from homogeneous product states. For ergodic dynamics, these initial states grant access to a wide range of equilibration temperatures. By concentrating on the desired matrix elements and retaining only the portion of the operator that contains Pauli strings parallel to the initial state, we uncover a complex scenario. In some cases, the light Pauli strings suffice to describe the dynamics, enabling efficient simulation with current algorithms. However, in other cases, heavier strings become necessary, pushing computational demands beyond our current capabilities. We analyze this behavior by introducing a measure of complexity, the operator weight entropy, which we compute for different operators across most points on the Bloch sphere.

DOI
10.1103/physrevb.111.094301

Related papers

Noise-induced Simulability Transition from Operator Scrambling

Neil Dowling, Xhek Turkeshi, Jacopo De Nardis +1 more

The complexity of simulating quantum many-body dynamics, or quantum computations, in the Heisenberg picture is governed by the scrambling of initially simple operators into superpositions of exponentially many Pauli strings. The corresponding expansion coefficients define the Pauli spectrum, whose structure controls the performance of classical algorithms based on truncating Pauli expansions. Here we determine the finite-depth Pauli spectrum of random quantum circuits, both in the noiseless case and in the presence of local noise, through its moments, given by the operator stabilizer Rényi entropies. In noiseless circuits, we uncover a hierarchy in the approach to the fully scrambled regime: low moments equilibrate at relatively short depths, while higher moments, which are sensitive to rare, large-amplitude Pauli coefficients, require parametrically larger depths. In noisy circuits, scrambling competes with an effective suppression of operator spreading. Above a critical error per cycle $γ_c N=\mathcal{O}(1)$, the operator fails to reach the fully scrambled distribution and remains supported on an atypically sparse subset of Pauli strings. Conversely, below this scale, we rigorously show that classical simulation remains exponentially hard, demonstrating that finite noise does not automatically imply classical simulability. The resulting noise-induced transition in operator complexity therefore delineates the boundary between intrinsically hard quantum dynamics and those that remain classically accessible.

quant-pharXiv:2605.18943•May 20, 2026•9 citations

On the out-of-equilibrium dynamics with tensor networks

Ramos Marimón, Carlos

[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.

•Sep 10, 2025•0 citations

An efficient Pauli decomposition algorithm for structured matrices

Daniel J. Spencer, Kishor Bharti, Alexey V. Gorshkov

Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only $k = \mathsf{poly}(n)$ Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in $n$. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least $1 - δ$, for any $δ$. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in $n$, $k$, and $\log(1/δ)$. These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.

quant-pharXiv:2606.31952•Jul 1, 2026•0 citations

Temporal entropy and the complexity of computing the expectation value of local operators after a quench

Stefano Carignano, Carlos Ramos Marimón, Luca Tagliacozzo

We study the computational complexity of simulating the time-dependent expectation value of a local operator in a one-dimensional quantum system by using temporal matrix product states(MPSs) and argue that it is intimately related to that of encoding temporal transition matrices and their partial traces. We show that we can upper-bound the rank of these reduced transition matrices by one of the Heisenberg evolution of local operators, thus making aconnection between two apparently different quantities, the temporal entanglement and the local operator entanglement(OE). As a result, whenever the local OE grows slower than linearly in time, we show that computing time-dependent expectation values of local operators using temporal MPSs is likely advantageous with respect to computing the same quantities using standard MPS techniques. Published by the American Physical Society 2024

arXiv:2307.11649•Physical Review Research•Jul 3, 2024•31 citations

Time Evolution Operators for Pauli-String based Quantum Hamiltonians

Huang, Qunsheng, Christian B. Mendl, Technische Universität München

Quantum computing promises a paradigm shift in computational capabilities, but its realization demands problem representations fundamentally different from classical methods. To harness quantum advantages, problems must be encoded in forms native to quantum systems—commonly via the Pauli basis, which maps operations to rotations on the Bloch sphere. This dissertation investigates the bottlenecks limiting the implementation of such encodings across quantum, hybrid, and classical contexts.

•Jan 1, 2025•0 citations

Quantum quench dynamics and entanglement

Tianci Zhou

Quantum quench is a non-equilibrium process where the Hamiltonian is suddenly changed during the quantum evolution. The change can be made by spatially local perturbations (local quench) or globally switching to a completely different Hamiltonian (global quench). This thesis investigates the post-quench non-equilibrium dynamics with an emphasis on the time dependence of the quantum entanglement. We inspect the scaling of entanglement entropy (EE) to learn how correlation and entanglement built up in a quench. We begin with two local quench examples. In Chap. 2, we apply a local operator to the groundstate of the quantum Lifshitz model and monitor the change of the EE. We find that the entanglement grows according to the dynamical exponent z = 2 and then saturates to the scaling dimension of the perturbing operator -- a value representing its strength. In Chap. 3, we study the evolution after connecting two different one-dimensional critical chains at their ends. The Loschmidt echo which measures the similarity between the evolved state and the initial one decays with a power law, whose exponent is the scaling dimension of the defect (junction). Among other conclusions, we see that the local quench dynamics contain universal information of the (critical) theory. In the global quench scenario, the change of the Hamiltonian affects all parts of the system. In this thesis, we focus on the global chaotic quench driven by generic non-integrable Hamiltonians. In Chap. 4, we propose to use the operator entanglement entropy of the unitary operator as a probe. Its fast linear entanglement production is sharply contrasted to the slow logarithmic spreading of the many-body localized system. The entanglement saturation suggests that the evolution operator in the long time can be modeled by a random unitary matrix. In Chap. 5, we construct a random tensor network which consists of random unitary matrices connected locally to model chaotic evolution with local interactions. We find that the entanglement dynamics is mapped to the statistical mechanics of interacting random walks. This appealing emergent picture allows us to understand the universal linear growth as well as the fluctuations of entanglement in a chaotic quench.

•Jul 6, 2018•0 citations
The complexity of simulating the out-of-equilibrium evolution of local operators in the Heisenberg picture is governed by the operator entanglement, which grows linearly in time for generic nonintegrable systems, leading to an exponential increase in computational resources. A promising approach to simplify this challenge involves discarding parts of the operator and focusing on a subspace formed by ``light'' Pauli strings---strings with few Pauli matrices---as proposed by Rakovszki et al. [Phys. Rev. B 105, 075131 (2022)]. In this work, we investigate whether this strategy can be applied to quenches starting from homogeneous product states. For ergodic dynamics, these initial states grant access to a wide range of equilibration temperatures. By concentrating on the desired matrix elements and retaining only the portion of the operator that contains Pauli strings parallel to the initial state, we uncover a complex scenario. In some cases, the light Pauli strings suffice to describe the dynamics, enabling efficient simulation with current algorithms. However, in other cases, heavier strings become necessary, pushing computational demands beyond our current capabilities. We analyze this behavior by introducing a measure of complexity, the operator weight entropy, which we compute for different operators across most points on the Bloch sphere.
The complexity of simulating quantum many-body dynamics, or quantum computations, in the Heisenberg picture is governed by the scrambling of initially simple operators into superpositions of exponentially many Pauli strings. The corresponding expansion coefficients define the Pauli spectrum, whose structure controls the performance of classical algorithms based on truncating Pauli expansions. Here we determine the finite-depth Pauli spectrum of random quantum circuits, both in the noiseless case and in the presence of local noise, through its moments, given by the operator stabilizer Rényi entropies. In noiseless circuits, we uncover a hierarchy in the approach to the fully scrambled regime: low moments equilibrate at relatively short depths, while higher moments, which are sensitive to rare, large-amplitude Pauli coefficients, require parametrically larger depths. In noisy circuits, scrambling competes with an effective suppression of operator spreading. Above a critical error per cycle γcN=O(1)γ_c N=\mathcal{O}(1)γc​N=O(1), the operator fails to reach the fully scrambled distribution and remains supported on an atypically sparse subset of Pauli strings. Conversely, below this scale, we rigorously show that classical simulation remains exponentially hard, demonstrating that finite noise does not automatically imply classical simulability. The resulting noise-induced transition in operator complexity therefore delineates the boundary between intrinsically hard quantum dynamics and those that remain classically accessible.
[eng] Quantum many-body dynamics is a vast field of physics at the intersection of statistical mechanics, condensed matter, quantum information, and computational physics. Understanding the time evolution of observable correlations—such as those involved in material responses—is both a milestone for technological advancement and a corner-stone for generating fundamental knowledge. At the intersection of emergent collective behavior in many-body systems, quantum physics, and information theory lies the classical simulation of out-of-equilibrium phenomena. Without numerical tools, progress in disciplines that require heavy computations with high-dimensional vectors and matrices would be limited to purely analytical predictions and constrained by the available expertise and resources needed to build benchmarking experiments. The goal of this thesis is to advance the classical simulation of quantum many-body systems using Tensor Networks. This technique has proven fruitful for predicting equilibrium ground states and thermal properties of one-dimensional systems, yet it still faces challenges when applied to out-of-equilibrium scenarios. In brief, the dynamics of experimentally accessible expectation values can be represented as a 2D Tensor Network, which must be contracted using iterative methods such as Time-Evolving Block Decimation. However, the memory and computational time required for these calculations—which reflect the methods’ complexity—are known to grow exponentially with the simulated physical time in generic systems. This limitation is often referred to in the literature as the entanglement barrier. This manuscript tackles the problem through the three inequivalent ways in which the 2D Tensor Network can be contracted. In Chapter 3, we study how Schrödinger-picture contraction from the state edge of the network can be modified to improve the convergence of iterative contraction and reduce truncation errors in small systems. To this end, we explore physical decoherence in optimized bases and artificial generalized decoherence, finding that both alternatives show promise for new protocols that overcome the entanglement barrier. In Chapter 4, we explore Heisenberg-picture contraction from the observable edge, combining the concept of generalized decoherence with Pauli Weight truncation. By thoroughly characterizing the Pauli weight requirements to accurately describe the time evolution of local expectation values from initial product states, we conclude that truncating off-diagonal Pauli Weights is an effective scheme for simulating long-time dynamics—and we successfully implement it. We conclude with a spatial characterization of Pauli Weight spreading, bridging Tensor Network simulations and the field of operator hydrodynamics. Finally, in Chapter 5, we focus on the transverse contraction of the 2D Tensor Net-work using the light-cone algorithm, analyzing its variants in terms of truncation strategies and convergence across different models. This leads to a systematic characterization of the method based on the integrability of the underlying Hamiltonians and single-spin noise models.
Decomposing classical matrices into linear combinations of Pauli strings is a major bottleneck for end-to-end implementations of near-term quantum algorithms. In this work, we consider a promise version of this Pauli decomposition problem in which the matrix is guaranteed to have support on only k=poly(n)k = \mathsf{poly}(n)k=poly(n) Pauli strings and is given through classical sparse query access. Existing Pauli decomposition algorithms are designed for the generic, dense problem and do not inherently take advantage of this promised sparsity, so these approaches take time that is exponential in nnn. We present a randomized classical algorithm that does take advantage of this sparsity and recovers the exact Pauli decomposition with success probability at least 1−δ1 - δ1−δ, for any δδδ. Under the stated access model, the algorithm executes with query and runtime complexity that is polynomial in nnn, kkk, and log⁡(1/δ)\log(1/δ)log(1/δ). These results show that, even though finding the Pauli decomposition is exponentially hard for general matrices, it becomes efficiently solvable for matrices that are known to be sparse in the Pauli basis, a regime that is relevant to near-term quantum algorithms operating on structured classical input.
We study the computational complexity of simulating the time-dependent expectation value of a local operator in a one-dimensional quantum system by using temporal matrix product states(MPSs) and argue that it is intimately related to that of encoding temporal transition matrices and their partial traces. We show that we can upper-bound the rank of these reduced transition matrices by one of the Heisenberg evolution of local operators, thus making aconnection between two apparently different quantities, the temporal entanglement and the local operator entanglement(OE). As a result, whenever the local OE grows slower than linearly in time, we show that computing time-dependent expectation values of local operators using temporal MPSs is likely advantageous with respect to computing the same quantities using standard MPS techniques. Published by the American Physical Society 2024
Quantum quench is a non-equilibrium process where the Hamiltonian is suddenly changed during the quantum evolution. The change can be made by spatially local perturbations (local quench) or globally switching to a completely different Hamiltonian (global quench). This thesis investigates the post-quench non-equilibrium dynamics with an emphasis on the time dependence of the quantum entanglement. We inspect the scaling of entanglement entropy (EE) to learn how correlation and entanglement built up in a quench. We begin with two local quench examples. In Chap. 2, we apply a local operator to the groundstate of the quantum Lifshitz model and monitor the change of the EE. We find that the entanglement grows according to the dynamical exponent z = 2 and then saturates to the scaling dimension of the perturbing operator -- a value representing its strength. In Chap. 3, we study the evolution after connecting two different one-dimensional critical chains at their ends. The Loschmidt echo which measures the similarity between the evolved state and the initial one decays with a power law, whose exponent is the scaling dimension of the defect (junction). Among other conclusions, we see that the local quench dynamics contain universal information of the (critical) theory. In the global quench scenario, the change of the Hamiltonian affects all parts of the system. In this thesis, we focus on the global chaotic quench driven by generic non-integrable Hamiltonians. In Chap. 4, we propose to use the operator entanglement entropy of the unitary operator as a probe. Its fast linear entanglement production is sharply contrasted to the slow logarithmic spreading of the many-body localized system. The entanglement saturation suggests that the evolution operator in the long time can be modeled by a random unitary matrix. In Chap. 5, we construct a random tensor network which consists of random unitary matrices connected locally to model chaotic evolution with local interactions. We find that the entanglement dynamics is mapped to the statistical mechanics of interacting random walks. This appealing emergent picture allows us to understand the universal linear growth as well as the fluctuations of entanglement in a chaotic quench.