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:0711.3676 · Physical Review A

Entanglement growth and simulation efficiency in one-dimensional quantum lattice systems

Álvaro Perales, Guifré Vidal

Published Oct 31, 2008• 49 citations
arXivHTMLPDF

Abstract

We study the evolution of one-dimensional quantum lattice systems when the ground state is perturbed by altering one site in the middle of the chain. For a large class of models, we observe a similar pattern of entanglement growth during the evolution, characterized by a moderate increase of significant Schmidt coefficients in all relevant bipartite decompositions of the state. As a result, the evolution can be accurately described by a matrix product state and efficiently simulated using the time-evolving block decimation algorithm.

DOI
10.1103/physreva.78.042337

Related papers

Entanglement dynamics in harmonic-oscillator chains

Razmik G. Unanyan, Michael Fleischhauer

We study the long-time evolution of the bipartite entanglement in translationally invariant one-dimensional harmonic lattice systems. We show that for Gaussian states, in quadratic interactions with periodic boundary conditions, there exists a lower bound for the von Neumann entropy which increases linearly in time. This implies that the dynamics of harmonic lattice systems can in general not efficiently be simulated by algorithms based on matrix-product decompositions of the quantum state, and interactions are needed to suppress the entanglement growth with time.

Physical Review A•Jun 26, 2014•13 citations

Infinite time-evolving block decimation algorithm beyond unitary evolution

Román Orús, Guifré Vidal

The infinite time-evolving block decimation algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional (1D) quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely, the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e., master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in two-dimensional (2D) classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states approach to infinite 2D quantum lattice systems.

arXiv:0711.3960•Physical Review B•Oct 14, 2008•466 citations

Mixed-State Dynamics in One-Dimensional Quantum Lattice Systems: A Time-Dependent Superoperator Renormalization Algorithm

Michael P. Zwolak, Guifré Vidal

We present an algorithm to study mixed-state dynamics in one-dimensional quantum lattice systems. The algorithm can be used, e.g., to construct thermal states or to simulate real time evolution given by a generic master equation. Its two main ingredients are (i) a superoperator renormalization scheme to efficiently describe the state of the system and (ii) the time evolving block decimation technique to efficiently update the state during a time evolution. The computational cost of a simulation increases significantly with the amount of correlations between subsystems, but it otherwise depends only linearly on the system size. We present simulations involving quantum spins and fermions in one spatial dimension.

arXiv:cond-mat/0406440•Physical Review Letters•Nov 12, 2004•655 citations

Classical Simulation of quantum evolution on tree graphs

Yaoyun Shi, Luming Duan

We propose an efficient algorithm to classically simulate quantum evolution on tree graphs with bounded entanglement for any bipartite partition along an edge of the tree. The algorithm combines the Schmidt decomposition with the tensor network state, where the latter is a natural extension of the matrix product states from chains to graphs. As an interesting application of this algorithm, we show that any one-way quantum computation on tree graphs can be efficiently simulated with a classical computer.

•Nov 8, 2005•0 citations

Large bond-dimension time-evolution block decimation study of the XXZ quantum spin chains of S = 1/2 and 1

Hwan Bin Choi, Ji-Woo Lee

We study quantum phase transitions of a XXZ spin model with spin S = 1/2 and 1 in one dimension. The XXZ spin chain is one of basic models in understanding various one-dimensional magnetic materials. To study this model, we construct infinite-lattice matrix product state (iMPS), which is a tensor product form for a one-dimensional many-body quantum wave function. By using timeevolution- block-decimation method (TEBD) on iMPS, we obtain the ground states of the XXZ model at zero temperature. This method is very delicate in calculating ground states so that we developed a reliable method of finding the ground state with the dimension of entanglement coefficients up to 300, which is beyond the previous works. By analyzing ground-state energies, half-chain entanglement entropies, and entanglement spectrum, we found the signatures of quantum phase transitions between ferromagnetic phase, XY phase, Haldane phase, and antiferromagnetic phase.

Journal of the Korean Physical Society•Sep 1, 2017•3 citations

Comparing bipartite entropy growth in open-system matrix-product simulation methods

Guillermo Preisser, David Wellnitz, Thomas Botzung +1 more

The dynamics of one-dimensional quantum many-body systems is often numerically simulated with matrix-product states (MPSs). The computational complexity of MPS methods is known to be related to the growth of entropies of reduced density matrices for bipartitions of the chain. While for closed systems the entropy relevant for the complexity is uniquely defined by the entanglement entropy, for open systems it depends on the choice of the representation. Here, we systematically compare the growth of different entropies relevant to the complexity of matrix-product representations in open-system simulations. We simulate an $XXZ$ spin-1/2 chain in the presence of spontaneous emission and absorption and dephasing. We compare simulations using a representation of the full density matrix as a matrix-product density operator (MPDO) with a quantum trajectory unraveling, where each trajectory is itself represented by an MPS (QT + MPS). We show that the bipartite entropy in the MPDO description (operator entanglement, OE) generally scales more favorably with time than the entropy in QT + MPS (trajectory entanglement, TE): (i) For spontaneous emission and absorption the OE vanishes while the TE grows and reaches a constant value for large dissipative rates and sufficiently long times; (ii) for dephasing the OE exhibits only logarithmic growth while the TE grows polynomially. Although QT + MPS requires a smaller local state space, the more favorable entropy growth can thus make MPDO simulations fundamentally more efficient than QT + MPS. Furthermore, MPDO simulations allow for easier exploitation of higher-order Trotter decompositions and translational invariance, allowing for larger time steps and system sizes.

arXiv:2303.09426•Physical Review A•Jul 18, 2023•18 citations
We study the evolution of one-dimensional quantum lattice systems when the ground state is perturbed by altering one site in the middle of the chain. For a large class of models, we observe a similar pattern of entanglement growth during the evolution, characterized by a moderate increase of significant Schmidt coefficients in all relevant bipartite decompositions of the state. As a result, the evolution can be accurately described by a matrix product state and efficiently simulated using the time-evolving block decimation algorithm.
We study the long-time evolution of the bipartite entanglement in translationally invariant one-dimensional harmonic lattice systems. We show that for Gaussian states, in quadratic interactions with periodic boundary conditions, there exists a lower bound for the von Neumann entropy which increases linearly in time. This implies that the dynamics of harmonic lattice systems can in general not efficiently be simulated by algorithms based on matrix-product decompositions of the quantum state, and interactions are needed to suppress the entanglement growth with time.
The infinite time-evolving block decimation algorithm [G. Vidal, Phys. Rev. Lett. 98, 070201 (2007)] allows to simulate unitary evolution and to compute the ground state of one-dimensional (1D) quantum lattice systems in the thermodynamic limit. Here we extend the algorithm to tackle a much broader class of problems, namely, the simulation of arbitrary one-dimensional evolution operators that can be expressed as a (translationally invariant) tensor network. Relatedly, we also address the problem of finding the dominant eigenvalue and eigenvector of a one-dimensional transfer matrix that can be expressed in the same way. New applications include the simulation, in the thermodynamic limit, of open (i.e., master equation) dynamics and thermal states in 1D quantum systems, as well as calculations with partition functions in two-dimensional (2D) classical systems, on which we elaborate. The present extension of the algorithm also plays a prominent role in the infinite projected entangled-pair states approach to infinite 2D quantum lattice systems.
We present an algorithm to study mixed-state dynamics in one-dimensional quantum lattice systems. The algorithm can be used, e.g., to construct thermal states or to simulate real time evolution given by a generic master equation. Its two main ingredients are (i) a superoperator renormalization scheme to efficiently describe the state of the system and (ii) the time evolving block decimation technique to efficiently update the state during a time evolution. The computational cost of a simulation increases significantly with the amount of correlations between subsystems, but it otherwise depends only linearly on the system size. We present simulations involving quantum spins and fermions in one spatial dimension.
We propose an efficient algorithm to classically simulate quantum evolution on tree graphs with bounded entanglement for any bipartite partition along an edge of the tree. The algorithm combines the Schmidt decomposition with the tensor network state, where the latter is a natural extension of the matrix product states from chains to graphs. As an interesting application of this algorithm, we show that any one-way quantum computation on tree graphs can be efficiently simulated with a classical computer.
We study quantum phase transitions of a XXZ spin model with spin S = 1/2 and 1 in one dimension. The XXZ spin chain is one of basic models in understanding various one-dimensional magnetic materials. To study this model, we construct infinite-lattice matrix product state (iMPS), which is a tensor product form for a one-dimensional many-body quantum wave function. By using timeevolution- block-decimation method (TEBD) on iMPS, we obtain the ground states of the XXZ model at zero temperature. This method is very delicate in calculating ground states so that we developed a reliable method of finding the ground state with the dimension of entanglement coefficients up to 300, which is beyond the previous works. By analyzing ground-state energies, half-chain entanglement entropies, and entanglement spectrum, we found the signatures of quantum phase transitions between ferromagnetic phase, XY phase, Haldane phase, and antiferromagnetic phase.
The dynamics of one-dimensional quantum many-body systems is often numerically simulated with matrix-product states (MPSs). The computational complexity of MPS methods is known to be related to the growth of entropies of reduced density matrices for bipartitions of the chain. While for closed systems the entropy relevant for the complexity is uniquely defined by the entanglement entropy, for open systems it depends on the choice of the representation. Here, we systematically compare the growth of different entropies relevant to the complexity of matrix-product representations in open-system simulations. We simulate an XXZXXZXXZ spin-1/2 chain in the presence of spontaneous emission and absorption and dephasing. We compare simulations using a representation of the full density matrix as a matrix-product density operator (MPDO) with a quantum trajectory unraveling, where each trajectory is itself represented by an MPS (QT + MPS). We show that the bipartite entropy in the MPDO description (operator entanglement, OE) generally scales more favorably with time than the entropy in QT + MPS (trajectory entanglement, TE): (i) For spontaneous emission and absorption the OE vanishes while the TE grows and reaches a constant value for large dissipative rates and sufficiently long times; (ii) for dephasing the OE exhibits only logarithmic growth while the TE grows polynomially. Although QT + MPS requires a smaller local state space, the more favorable entropy growth can thus make MPDO simulations fundamentally more efficient than QT + MPS. Furthermore, MPDO simulations allow for easier exploitation of higher-order Trotter decompositions and translational invariance, allowing for larger time steps and system sizes.