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

Scaling analysis and ensemble measures in quantum systems

Jeffrey Morais

Published Jan 1, 2026• 0 citations
OpenAlex

Abstract

We investigate finite-size equilibration and dephasing timescales in one-dimensional quantum lattice models using exact diagonalization and tensor network methods. We define and compare operational relaxation and equilibration times and examine their dependence on Hilbert-space dimension, local observable, initial state, and tensor- network bond dimension. Across the simulated sizes, the extracted equilibration times vary much more slowly than the exponentially growing Hilbert-space dimension. Exact diagonalization and two-site time-dependent variational principle results agree in some regimes but show substantial model-, size-, and state-dependent discrepancies in others, so bond-dimension convergence is distinguished from agreement with exact dynamics. In the XXZ chain, eigenstates are stationary, while nonstationary initial states exhibit different finite-size dephasing times that cannot be inferred from participation ratio alone. In the spinless fermion model, particle-number conservation restricts the dynamics to symmetry sectors and permits separate comparisons for even- and odd-site charge-density-wave preparations. These calculations provide finite-size benchmarks for observable equilibration and for the numerical limitations of tensor-network time evolution.

Related papers

Numerically exact quantum dynamics of low-dimensional lattice systems

Kloss, Benedikt

In this thesis I present contributions to the development, analysis and application of tensor network state methods for numerically exact quantum dynamics in one and two-dimensional lattice systems. The setting of numerically exact quantum dynamics is introduced in Chapter 2. This includes a discussion of exact diagonalization approaches and massively parallel implementations thereof as well as a brief introduction of tensor network states. In Chapter 3, I perform a detailed analysis of the performance of n-ary tree tensor network states for simulating the dynamics of two-dimensional lattices. This constitutes the first application of this class of tensor network to dynamics in two spatial dimensions, a long-standing challenge, and the method is found to perform on par with existing state-of-the-art approaches. Chapter 4 showcases the efficacy of a novel tensor network format I developed, tailored to electron-phonon coupled problems in their single-electron sector, through an application to the Holstein model. The applicability of the approach to a broad range of parameters of the model allows to reveal the strong influence of the spread of the electron distribution on the initial state of the phonons at the site where the electron is introduced, for which a simple physical picture is offered. I depart from method development in Chapter 5 and analyse the prospects of using tensor network states evolved using the time-dependent variational principle as an approximate approach to determine asymptotic transport properties with a finite, moderate computational effort. The method is shown to not yield the correct asymptotics in a clean, non-integrable system and can thus not be expected to work in generic systems, outside of finely tuned parameter regimes of certain models. Chapters 6 and 7 are concerned with studies of spin transport in long-range interacting systems using tensor network state methods. For the clean case, discussed in Chapter 6, we find that for sufficiently short-ranged interactions, the spreading of the bulk of the excitation is diffusive and thus dominated by the local part of the interaction, while the tail of the excitation decays with a powerlaw that is twice as large as the powerlaw of the interaction. Similarly, in the disordered case, analysed in Chapter 7, we find subdiffusive transport of spin and sub-linear growth of entanglement entropy. This behaviour is in agreement with the behaviour of systems with local interactions at intermediate disorder strength, but provides evidence against the phenomelogical Griffith picture of rare, strongly disordered insulating regions. We generalize the latter to long-ranged interactions and show that it predicts to diffusion, in contrast to the local case where it results in subdiffusive behaviour.

•Jan 1, 2021•0 citations

Timescales of quantum and classical chaotic spin models evolving toward equilibrium

F. Borgonovi, Felix M. Izrailev, Léa Ferreira dos Santos

We investigate quench dynamics in a one-dimensional spin model, comparing both quantum and classical descriptions. Our primary focus is on the different timescales involved in the evolution of the observables as they approach statistical relaxation. Numerical simulations, supported by semianalytical analysis, reveal that the relaxation of single-particle energies (global quantity) and on-site magnetization (local observable) occurs on a timescale independent of the system size L. This relaxation process is equally well-described by classical equations of motion and quantum solutions, demonstrating excellent quantum-classical correspondence, provided the system is strongly chaotic. The correspondence persists even for small quantum spin values (S=1), where a semiclassical approximation is not applicable. Conversely, for the participation ratio, which characterizes the initial state spread in the many-body Hilbert space and which lacks a classical analog, the relaxation timescale is system-size dependent.

arXiv:2307.05681•Physical review. E•Apr 14, 2025•2 citations

Relaxation of non-integrable systems and correlation functions

Jonathon Riddell, Luis Pedro García-Pintos, Alvaro Martin Alhambra

We investigate early-time equilibration rates of observables in closed many-body quantum systems and compare them to those of two correlation functions, first introduced by Kubo and Srednicki. We explore whether these different rates coincide at a universal value that sets the timescales of processes at a finite energy density. We find evidence for this coincidence when the initial conditions are sufficiently generic, or typical. We quantify this with the effective dimension of the state and with a state-observable effective dimension, which estimate the number of energy levels that participate in the dynamics. Our findings are confirmed by proving that these different timescales coincide for dynamics generated by Haar-random Hamiltonians. This also allows to quantitatively understand the scope of previous theoretical results on equilibration timescales and on random matrix formalisms. We approach this problem with exact, full spectrum diagonalization. The numerics are carried out in a non-integrable Heisenberg-like Hamiltonian, and the dynamics are investigated for several pairs of observables and states.

arXiv:2112.09475•Dec 17, 2021•2 citations

Simulation Complexity of Open Quantum Dynamics: Connection with Tensor Networks

I. A. Luchnikov, Stephen Vintskevich, Henni Ouerdane +1 more

The difficulty to simulate the dynamics of open quantum systems resides in their coupling to many-body reservoirs with exponentially large Hilbert space. Applying a tensor network approach in the time domain, we demonstrate that effective small reservoirs can be defined and used for modeling open quantum dynamics. The key element of our technique is the timeline reservoir network (TRN), which contains all the information on the reservoir's characteristics, in particular, the memory effects timescale. The TRN has a one-dimensional tensor network structure, which can be effectively approximated in full analogy with the matrix product approximation of spin-chain states. We derive the sufficient bond dimension in the approximated TRN with a reduced set of physical parameters: coupling strength, reservoir correlation time, minimal timescale, and the system's number of degrees of freedom interacting with the environment. The bond dimension can be viewed as a measure of the open dynamics complexity. Simulation is based on the semigroup dynamics of the system and effective reservoir of finite dimension. We provide an illustrative example showing the scope for new numerical and machine learning-based methods for open quantum systems.

arXiv:1812.00043•Physical Review Letters•Apr 23, 2019•89 citations

Tensor network approaches to open quantum systems, higher dimensional lattices and random quantum circuits

James Allen

In this thesis, we will start by introducing some tensor network methods used to simulate complex physical system. First, we will simulate a neutral atom open quantum system, to develop a relationship between the noise, system size, and performance of a quantum approximate optimization algorithm (QAOA) iteration on this system. In order to help maintain the physicality of the density matrix representing the system, we develop a purity-preserving truncation technique that performs better than a naïve matrix product operator representation while being far more efficient than approaches based on matrix product density operators. We find that for most noise sources, the effect of noise on a QAOA iteration does not scale with system size, although the failure rate of the circuit increases. Next, we will find the ground state of Kagome lattices over different spin values, and identify different properties of the phases found there. In particular, we look at the Jz-J2 phase diagram of the XXZ model on a Kagome lattice for spins 1/2 to 2. For each spin value above 1, we identify a narrow intermediate phase between the q=0 and root(3)-by-root(3) phases that has nematic ordering in their next-nearest neighbour bonds. For spin 1, we also find a wide intermediate phase around the Heisenberg point that has no consistent order parameter. In addition, we will develop a new method of time evolving two-dimensional tensor networks in the form of projected entangled pair states (PEPS), based on converting the PEPS to an isometric tensor network state for each update. This method may be more efficient than a full update based on the boundary MPS method, but the numerical data is inconclusive on whether it has advantages over a simple update. In addition, we will also demonstrate some theoretical and numerical results on random quantum circuits (RQC). We first develop a scheme for numerically computing the anticoncentration of two-dimensional brickwork circuits for a large system size limit and depths up to 15. This approach is based on taking the statistical mechanics model of RQCs and interpreting a depth-wise slice of the system as the matrix product operator in an infinite DMRG algorithm. We find that for these depths, the two-dimensional brickwork maintains the log-depth anticoncentration relation found in one-dimensional brickworks by previous works. We also find that the statistical mechanics model of two-dimensional brickworks naturally hosts a quasiparticle model at very low local Hilbert space dimensions. Next, we show a generalization of results on the epsilon-approximate t-design depths of RQCs to a much wider class of architectures. Previous results were successful at proving that the approximate t-design depth is linear in system size for one-dimensional brickwork architectures, but were unable to generalize these results to arbitrary architectures. We develop an approach based on bounding subleading singular values for each layer in a particular connected block of gates, which naturally translates to a "cluster-merging picture" in which a hierarchy of graphs is connected over time. With this, we were able to translate established one-dimensional brickwork bounds to any possible architecture, preserving system size linearity in the vast majority of them. Finally, we will develop results on bounding the spectral gap of these circuits, which helps lower the t dependence of the approximate t-design depths. In particular, we show that the spectral gap of a one-dimensional brickwork is independent of t for all t <= q, where q is the local Hilbert space dimension of the original circuit. Thus, the epsilon-approximate t-design depth in the small epsilon limit has no t dependence at all. We accomplish this by reducing the spectral gap of a one-dimensional brickwork of any size to a spectral gap of an operator on an effective three-site system. Then, we bound this operator by simplifying its domain according to irreducible representations of the symmetric group, and obtain bounds on the resulting matrix product.

•Aug 27, 2024•0 citations

Equilibration times in clean and noisy systems

Lorenzo Campos Venuti, Sunil Yeshwanth, Stephan Haas

We study the equilibration dynamics of closed finite quantum systems and address the question of the time needed for the system to equilibrate. In particular, we focus on the scaling of the equilibration time ${T}_{\mathrm{eq}}$ with the system size $L$. For clean systems, we give general arguments predicting ${T}_{\mathrm{eq}}=O({L}^{0})$ for clustering initial states, while for small quenches around a critical point we find ${T}_{\mathrm{eq}}=O({L}^{\ensuremath{\zeta}})$ where $\ensuremath{\zeta}$ is the dynamical critical exponent. We then analyze noisy systems where exponentially large time scales are known to exist. Specifically, we consider the tight-binding model with diagonal impurities and give numerical evidence that in this case ${T}_{\mathrm{eq}}\ensuremath{\sim}B{e}^{C{L}^{\ensuremath{\psi}}}$ where $B,C,\phantom{\rule{0.16em}{0ex}}\ensuremath{\psi}$ are observable-dependent constants. Finally, we consider another noisy system whose evolution dynamics is randomly sampled from a circular unitary ensemble. Here, we are able to prove analytically that ${T}_{\mathrm{eq}}=O(1)$, thus showing that noise alone is not sufficient for slow equilibration dynamics.

arXiv:1212.3367•Physical Review A•Mar 15, 2013•14 citations
We investigate finite-size equilibration and dephasing timescales in one-dimensional quantum lattice models using exact diagonalization and tensor network methods. We define and compare operational relaxation and equilibration times and examine their dependence on Hilbert-space dimension, local observable, initial state, and tensor- network bond dimension. Across the simulated sizes, the extracted equilibration times vary much more slowly than the exponentially growing Hilbert-space dimension. Exact diagonalization and two-site time-dependent variational principle results agree in some regimes but show substantial model-, size-, and state-dependent discrepancies in others, so bond-dimension convergence is distinguished from agreement with exact dynamics. In the XXZ chain, eigenstates are stationary, while nonstationary initial states exhibit different finite-size dephasing times that cannot be inferred from participation ratio alone. In the spinless fermion model, particle-number conservation restricts the dynamics to symmetry sectors and permits separate comparisons for even- and odd-site charge-density-wave preparations. These calculations provide finite-size benchmarks for observable equilibration and for the numerical limitations of tensor-network time evolution.
In this thesis I present contributions to the development, analysis and application of tensor network state methods for numerically exact quantum dynamics in one and two-dimensional lattice systems. The setting of numerically exact quantum dynamics is introduced in Chapter 2. This includes a discussion of exact diagonalization approaches and massively parallel implementations thereof as well as a brief introduction of tensor network states. In Chapter 3, I perform a detailed analysis of the performance of n-ary tree tensor network states for simulating the dynamics of two-dimensional lattices. This constitutes the first application of this class of tensor network to dynamics in two spatial dimensions, a long-standing challenge, and the method is found to perform on par with existing state-of-the-art approaches. Chapter 4 showcases the efficacy of a novel tensor network format I developed, tailored to electron-phonon coupled problems in their single-electron sector, through an application to the Holstein model. The applicability of the approach to a broad range of parameters of the model allows to reveal the strong influence of the spread of the electron distribution on the initial state of the phonons at the site where the electron is introduced, for which a simple physical picture is offered. I depart from method development in Chapter 5 and analyse the prospects of using tensor network states evolved using the time-dependent variational principle as an approximate approach to determine asymptotic transport properties with a finite, moderate computational effort. The method is shown to not yield the correct asymptotics in a clean, non-integrable system and can thus not be expected to work in generic systems, outside of finely tuned parameter regimes of certain models. Chapters 6 and 7 are concerned with studies of spin transport in long-range interacting systems using tensor network state methods. For the clean case, discussed in Chapter 6, we find that for sufficiently short-ranged interactions, the spreading of the bulk of the excitation is diffusive and thus dominated by the local part of the interaction, while the tail of the excitation decays with a powerlaw that is twice as large as the powerlaw of the interaction. Similarly, in the disordered case, analysed in Chapter 7, we find subdiffusive transport of spin and sub-linear growth of entanglement entropy. This behaviour is in agreement with the behaviour of systems with local interactions at intermediate disorder strength, but provides evidence against the phenomelogical Griffith picture of rare, strongly disordered insulating regions. We generalize the latter to long-ranged interactions and show that it predicts to diffusion, in contrast to the local case where it results in subdiffusive behaviour.
We investigate quench dynamics in a one-dimensional spin model, comparing both quantum and classical descriptions. Our primary focus is on the different timescales involved in the evolution of the observables as they approach statistical relaxation. Numerical simulations, supported by semianalytical analysis, reveal that the relaxation of single-particle energies (global quantity) and on-site magnetization (local observable) occurs on a timescale independent of the system size L. This relaxation process is equally well-described by classical equations of motion and quantum solutions, demonstrating excellent quantum-classical correspondence, provided the system is strongly chaotic. The correspondence persists even for small quantum spin values (S=1), where a semiclassical approximation is not applicable. Conversely, for the participation ratio, which characterizes the initial state spread in the many-body Hilbert space and which lacks a classical analog, the relaxation timescale is system-size dependent.
We investigate early-time equilibration rates of observables in closed many-body quantum systems and compare them to those of two correlation functions, first introduced by Kubo and Srednicki. We explore whether these different rates coincide at a universal value that sets the timescales of processes at a finite energy density. We find evidence for this coincidence when the initial conditions are sufficiently generic, or typical. We quantify this with the effective dimension of the state and with a state-observable effective dimension, which estimate the number of energy levels that participate in the dynamics. Our findings are confirmed by proving that these different timescales coincide for dynamics generated by Haar-random Hamiltonians. This also allows to quantitatively understand the scope of previous theoretical results on equilibration timescales and on random matrix formalisms. We approach this problem with exact, full spectrum diagonalization. The numerics are carried out in a non-integrable Heisenberg-like Hamiltonian, and the dynamics are investigated for several pairs of observables and states.
The difficulty to simulate the dynamics of open quantum systems resides in their coupling to many-body reservoirs with exponentially large Hilbert space. Applying a tensor network approach in the time domain, we demonstrate that effective small reservoirs can be defined and used for modeling open quantum dynamics. The key element of our technique is the timeline reservoir network (TRN), which contains all the information on the reservoir's characteristics, in particular, the memory effects timescale. The TRN has a one-dimensional tensor network structure, which can be effectively approximated in full analogy with the matrix product approximation of spin-chain states. We derive the sufficient bond dimension in the approximated TRN with a reduced set of physical parameters: coupling strength, reservoir correlation time, minimal timescale, and the system's number of degrees of freedom interacting with the environment. The bond dimension can be viewed as a measure of the open dynamics complexity. Simulation is based on the semigroup dynamics of the system and effective reservoir of finite dimension. We provide an illustrative example showing the scope for new numerical and machine learning-based methods for open quantum systems.
In this thesis, we will start by introducing some tensor network methods used to simulate complex physical system. First, we will simulate a neutral atom open quantum system, to develop a relationship between the noise, system size, and performance of a quantum approximate optimization algorithm (QAOA) iteration on this system. In order to help maintain the physicality of the density matrix representing the system, we develop a purity-preserving truncation technique that performs better than a naïve matrix product operator representation while being far more efficient than approaches based on matrix product density operators. We find that for most noise sources, the effect of noise on a QAOA iteration does not scale with system size, although the failure rate of the circuit increases. Next, we will find the ground state of Kagome lattices over different spin values, and identify different properties of the phases found there. In particular, we look at the Jz-J2 phase diagram of the XXZ model on a Kagome lattice for spins 1/2 to 2. For each spin value above 1, we identify a narrow intermediate phase between the q=0 and root(3)-by-root(3) phases that has nematic ordering in their next-nearest neighbour bonds. For spin 1, we also find a wide intermediate phase around the Heisenberg point that has no consistent order parameter. In addition, we will develop a new method of time evolving two-dimensional tensor networks in the form of projected entangled pair states (PEPS), based on converting the PEPS to an isometric tensor network state for each update. This method may be more efficient than a full update based on the boundary MPS method, but the numerical data is inconclusive on whether it has advantages over a simple update. In addition, we will also demonstrate some theoretical and numerical results on random quantum circuits (RQC). We first develop a scheme for numerically computing the anticoncentration of two-dimensional brickwork circuits for a large system size limit and depths up to 15. This approach is based on taking the statistical mechanics model of RQCs and interpreting a depth-wise slice of the system as the matrix product operator in an infinite DMRG algorithm. We find that for these depths, the two-dimensional brickwork maintains the log-depth anticoncentration relation found in one-dimensional brickworks by previous works. We also find that the statistical mechanics model of two-dimensional brickworks naturally hosts a quasiparticle model at very low local Hilbert space dimensions. Next, we show a generalization of results on the epsilon-approximate t-design depths of RQCs to a much wider class of architectures. Previous results were successful at proving that the approximate t-design depth is linear in system size for one-dimensional brickwork architectures, but were unable to generalize these results to arbitrary architectures. We develop an approach based on bounding subleading singular values for each layer in a particular connected block of gates, which naturally translates to a "cluster-merging picture" in which a hierarchy of graphs is connected over time. With this, we were able to translate established one-dimensional brickwork bounds to any possible architecture, preserving system size linearity in the vast majority of them. Finally, we will develop results on bounding the spectral gap of these circuits, which helps lower the t dependence of the approximate t-design depths. In particular, we show that the spectral gap of a one-dimensional brickwork is independent of t for all t <= q, where q is the local Hilbert space dimension of the original circuit. Thus, the epsilon-approximate t-design depth in the small epsilon limit has no t dependence at all. We accomplish this by reducing the spectral gap of a one-dimensional brickwork of any size to a spectral gap of an operator on an effective three-site system. Then, we bound this operator by simplifying its domain according to irreducible representations of the symmetric group, and obtain bounds on the resulting matrix product.
We study the equilibration dynamics of closed finite quantum systems and address the question of the time needed for the system to equilibrate. In particular, we focus on the scaling of the equilibration time Teq{T}_{\mathrm{eq}}Teq​ with the system size LLL. For clean systems, we give general arguments predicting Teq=O(L0){T}_{\mathrm{eq}}=O({L}^{0})Teq​=O(L0) for clustering initial states, while for small quenches around a critical point we find ${T}_{\mathrm{eq}}=O({L}^{\ensuremath{\zeta}})$ where $\ensuremath{\zeta}$ is the dynamical critical exponent. We then analyze noisy systems where exponentially large time scales are known to exist. Specifically, we consider the tight-binding model with diagonal impurities and give numerical evidence that in this case ${T}_{\mathrm{eq}}\ensuremath{\sim}B{e}^{C{L}^{\ensuremath{\psi}}}$ where $B,C,\phantom{\rule{0.16em}{0ex}}\ensuremath{\psi}$ are observable-dependent constants. Finally, we consider another noisy system whose evolution dynamics is randomly sampled from a circular unitary ensemble. Here, we are able to prove analytically that Teq=O(1){T}_{\mathrm{eq}}=O(1)Teq​=O(1), thus showing that noise alone is not sufficient for slow equilibration dynamics.