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

Time evolution and deterministic optimization of correlator product states

Vid Stojevic, Philip J. D. Crowley, Tanja Đurić, Callum Grey, Andrew G. Green

Published Oct 17, 2016• 4 citations
arXivHTMLPDF

Abstract

We study a restricted class of correlator product states (CPS) for a spin-half chain in which each spin is contained in just two overlapping plaquettes. This class is also a restriction upon matrix product states (MPS) with local dimension ${2}^{n}$ ($n$ being the size of the overlapping regions of plaquettes) equal to the bond dimension. We investigate the trade-off between gains in efficiency due to this restriction against losses in fidelity. The time-dependent variational principle formulated for these states is numerically very stable. Moreover, it shows significant gains in efficiency compared to the naively related matrix product states---the evolution or optimization scales as ${2}^{3n}$ for the correlator product states versus ${2}^{4n}$ for the unrestricted matrix product state. However, much of this advantage is offset by a significant reduction in fidelity. Correlator product states break the local Hilbert space symmetry by the explicit selection of a local basis. We investigate this dependence in detail and formulate the broad principles under which correlator product states may be a useful tool. In particular, we find that scaling with overlap/bond order may be more stable with correlator product states allowing a more efficient extraction of critical exponents---we present an example in which the use of correlator product states is several orders of magnitude quicker than matrix product states.

DOI
10.1103/physrevb.94.165135

Related papers

Diversifying time evolution of matrix product states using BUGs

Kornél Kapás, Dominik Sulz, Charlotte Verhoeven +3 more

Time evolution of tensor-network states is a central tool for studying nonequilibrium dynamics in strongly correlated quantum systems. In the past decade, using the time-dependent variational principle (TDVP) discretized by projector-splitting has become the gold standard for evolving matrix product states (MPS) with long-range Hamiltonians. More recently, a conceptually different class of discretizations of the TDVP, the class of Basis Update and Galerkin (BUG) integrators, has been developed within the framework of dynamical low-rank approximation, offering an alternative, more flexible approach. In this work, we formulate two BUG integrators explicitly for MPS. The BUG integrators result in "single-site" MPS integrators that are robust with respect to small singular values, avoid backward-in-time substeps, and naturally allow for the adaptive choice of bond dimensions. We consider the augmented BUG integrator of first order and the midpoint BUG integrator of second order and clarify their relation to the projector-splitting discretization of the TDVP. Using representative models of strongly correlated quantum systems, like the XY spin model with long-range interaction and two-dimensional lattice models of fermions and spins of various lengths, we perform a systematic numerical comparison between BUG and projector-splitting time discretizations of the continuous-time TDVP, focusing on scalability, numerical complexity, and accuracy. We find that BUG integrators, due to their reduced numerical cost and the flexibility of the concept, provide a competitive and, in certain regimes, advantageous alternative to the well-established time-stepping by projector-splitting in TDVP, especially in models with large local dimensions, and in cases where observables are extracted with high temporal resolution.

cond-mat.str-elCross-listedarXiv:2609.12848•Sep 14, 2026•1 citation

Matrix product states for critical spin chains: Finite-size versus finite-entanglement scaling

B. Pirvu, Guifré Vidal, Frank Verstraete +1 more

We investigate the use of matrix product states (MPS) to approximate ground states of critical quantum spin chains with periodic boundary conditions (PBC). We identify two regimes in the $(N,D)$ parameter plane, where $N$ is the size of the spin chain and $D$ is the dimension of the MPS matrices. In the first regime, MPS can be used to perform finite size scaling (FSS). In the complementary regime, the MPS simulations show instead the clear signature of finite entanglement scaling (FES). In the thermodynamic limit (or large $N$ limit), only MPS in the FSS regime maintain a finite overlap with the exact ground state. This observation has implications on how to correctly perform FSS with MPS as well as on the performance of recent MPS algorithms for systems with PBC. It also gives clear evidence that critical models can actually be simulated very well with MPS by using the right scaling relations; in the appendixes, we give an alternative derivation of the result of Pollmann et al. [Phys. Rev. Lett. 102, 255701 (2009)] relating the bond dimension of the MPS to an effective correlation length.

arXiv:1204.3934•Physical Review B•Aug 13, 2012•149 citations

Measurement-induced phase transitions by matrix product states scaling

Guillaume Cecile, Hugo Lóio, Jacopo De Nardis

We study the time evolution of long quantum spin chains subjected to continuous monitoring projected on matrix product states (MPS) with fixed bond dimension, by means of the Time-Dependent Variational Principle (TDVP) algorithm. The latter gives an effective unitary evolution which approximates the real quantum evolution up to the projection error. We show that such error displays, at large times, a phase transition in the monitoring strength, which can be well detected by scaling analysis with relatively low values of bond dimensions. Moreover, in the presence of U ( 1 ) global spin charge, we show the existence of a charge-sharpening transition well separated from the entanglement transition which we detect by studying the charge fluctuations of a local subpart of the system at large times. Our work shows that quantum monitored dynamics projected on MPS manifolds contains relevant information on measurement-induced phase transitions and provides a new method to identify measured-induced phase transitions in systems of arbitrary dimensions and sizes. Published by the American Physical Society 2024

arXiv:2402.13160•Physical Review Research•Aug 26, 2024•16 citations

Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits

Asier Piñeiro Orioli, Chen Zhao, Guido Masella +3 more

Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we find that MPS efficiency depends sensitively on implementation choices, and we introduce a series of targeted optimizations that reduce bond dimensions and simulation time by several orders of magnitude compared to naive approaches. We illustrate this with examples including: (a) a rotated surface code quantum memory up to distance 11, (b) logical Bell-state preparation up to distance 9, (c) a 15-to-1 magic-state distillation circuit including hundreds of QEC rounds that we optimize to be simulated with only 11 logical qubits (187 physical qubits) and a maximal bond dimension of 64 in under 40 seconds, and (d) a narrow, deep random circuit that scales linearly with the number of T gates. These results demonstrate the importance of circuit-level optimizations and position MPS as a valuable complement to near-Clifford simulators for QEC circuits.

quant-pharXiv:2609.03073•Sep 4, 2026•2 citations

Dynamically Evolving Bond-Dimensions within the one-site Time-Dependent-Variational-Principle method for Matrix Product States: Towards efficient simulation of non-equilibrium open quantum dynamics

Angus Dunnett, Alex W. Chin

Understanding the emergent system-bath correlations in non-Markovian and non-perturbative open systems is a theoretical challenge that has benefited greatly from the application of Matrix Product State (MPS) methods. Here, we propose an autonmously adapative variant of the one-site Time-Dependent-Variational-Principle (1TDVP) method for many-body MPS wave-functions in which the local bond-dimensions can evolve to capture growing entanglement 'on the fly'. We achieve this by efficiently examining the effect of increasing each MPS bond-dimension in advance of each dynamic timestep, resulting in an MPS that can dynamically and inhomogeneously restructure itself as the complexity of the dynamics grows across time and space. This naturally leads to more efficient simulations, oviates the need for multiple convergence runs, and, as we demonstrate, is ideally suited to the typical, finite-temperature 'impurity' problems that describe open quantum system connected to multiple environments.

arXiv:2007.13528•Jul 27, 2020•8 citations

Exploiting translational invariance in matrix product state simulations of spin chains with periodic boundary conditions

B. Pirvu, Frank Verstraete, Guifré Vidal

We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension $D$ of the MPS, we discuss how to minimize the computational cost to obtain a seemingly optimal MPS approximation to the ground state. In a chain with $N$ sites and correlation length $\ensuremath{\xi}$, the computational cost formally scales as $g(D,\ensuremath{\xi}/N){D}^{3}$, where $g(D,\ensuremath{\xi}/N)$ is a nontrivial function. For $\ensuremath{\xi}\ensuremath{\ll}N$, this scaling reduces to ${D}^{3}$, independent of the system size $N$, making our method $N$ times faster than previous proposals. We apply the algorithm to obtain MPS approximations for the ground states of the critical quantum Ising and Heisenberg spin-$1/2$ models as well as for the noncritical Heisenberg spin-$1$ model. In the critical case, for any chain length $N$, we find a model-dependent bond dimension $D(N)$ above which the polynomial decay of correlations is faithfully reproduced throughout the entire system.

arXiv:1005.5195•Physical Review B•Mar 17, 2011•60 citations
We study a restricted class of correlator product states (CPS) for a spin-half chain in which each spin is contained in just two overlapping plaquettes. This class is also a restriction upon matrix product states (MPS) with local dimension 2n{2}^{n}2n (nnn being the size of the overlapping regions of plaquettes) equal to the bond dimension. We investigate the trade-off between gains in efficiency due to this restriction against losses in fidelity. The time-dependent variational principle formulated for these states is numerically very stable. Moreover, it shows significant gains in efficiency compared to the naively related matrix product states---the evolution or optimization scales as 23n{2}^{3n}23n for the correlator product states versus 24n{2}^{4n}24n for the unrestricted matrix product state. However, much of this advantage is offset by a significant reduction in fidelity. Correlator product states break the local Hilbert space symmetry by the explicit selection of a local basis. We investigate this dependence in detail and formulate the broad principles under which correlator product states may be a useful tool. In particular, we find that scaling with overlap/bond order may be more stable with correlator product states allowing a more efficient extraction of critical exponents---we present an example in which the use of correlator product states is several orders of magnitude quicker than matrix product states.
Time evolution of tensor-network states is a central tool for studying nonequilibrium dynamics in strongly correlated quantum systems. In the past decade, using the time-dependent variational principle (TDVP) discretized by projector-splitting has become the gold standard for evolving matrix product states (MPS) with long-range Hamiltonians. More recently, a conceptually different class of discretizations of the TDVP, the class of Basis Update and Galerkin (BUG) integrators, has been developed within the framework of dynamical low-rank approximation, offering an alternative, more flexible approach. In this work, we formulate two BUG integrators explicitly for MPS. The BUG integrators result in "single-site" MPS integrators that are robust with respect to small singular values, avoid backward-in-time substeps, and naturally allow for the adaptive choice of bond dimensions. We consider the augmented BUG integrator of first order and the midpoint BUG integrator of second order and clarify their relation to the projector-splitting discretization of the TDVP. Using representative models of strongly correlated quantum systems, like the XY spin model with long-range interaction and two-dimensional lattice models of fermions and spins of various lengths, we perform a systematic numerical comparison between BUG and projector-splitting time discretizations of the continuous-time TDVP, focusing on scalability, numerical complexity, and accuracy. We find that BUG integrators, due to their reduced numerical cost and the flexibility of the concept, provide a competitive and, in certain regimes, advantageous alternative to the well-established time-stepping by projector-splitting in TDVP, especially in models with large local dimensions, and in cases where observables are extracted with high temporal resolution.
We investigate the use of matrix product states (MPS) to approximate ground states of critical quantum spin chains with periodic boundary conditions (PBC). We identify two regimes in the (N,D)(N,D)(N,D) parameter plane, where NNN is the size of the spin chain and DDD is the dimension of the MPS matrices. In the first regime, MPS can be used to perform finite size scaling (FSS). In the complementary regime, the MPS simulations show instead the clear signature of finite entanglement scaling (FES). In the thermodynamic limit (or large NNN limit), only MPS in the FSS regime maintain a finite overlap with the exact ground state. This observation has implications on how to correctly perform FSS with MPS as well as on the performance of recent MPS algorithms for systems with PBC. It also gives clear evidence that critical models can actually be simulated very well with MPS by using the right scaling relations; in the appendixes, we give an alternative derivation of the result of Pollmann et al. [Phys. Rev. Lett. 102, 255701 (2009)] relating the bond dimension of the MPS to an effective correlation length.
We study the time evolution of long quantum spin chains subjected to continuous monitoring projected on matrix product states (MPS) with fixed bond dimension, by means of the Time-Dependent Variational Principle (TDVP) algorithm. The latter gives an effective unitary evolution which approximates the real quantum evolution up to the projection error. We show that such error displays, at large times, a phase transition in the monitoring strength, which can be well detected by scaling analysis with relatively low values of bond dimensions. Moreover, in the presence of U ( 1 ) global spin charge, we show the existence of a charge-sharpening transition well separated from the entanglement transition which we detect by studying the charge fluctuations of a local subpart of the system at large times. Our work shows that quantum monitored dynamics projected on MPS manifolds contains relevant information on measurement-induced phase transitions and provides a new method to identify measured-induced phase transitions in systems of arbitrary dimensions and sizes. Published by the American Physical Society 2024
Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we find that MPS efficiency depends sensitively on implementation choices, and we introduce a series of targeted optimizations that reduce bond dimensions and simulation time by several orders of magnitude compared to naive approaches. We illustrate this with examples including: (a) a rotated surface code quantum memory up to distance 11, (b) logical Bell-state preparation up to distance 9, (c) a 15-to-1 magic-state distillation circuit including hundreds of QEC rounds that we optimize to be simulated with only 11 logical qubits (187 physical qubits) and a maximal bond dimension of 64 in under 40 seconds, and (d) a narrow, deep random circuit that scales linearly with the number of T gates. These results demonstrate the importance of circuit-level optimizations and position MPS as a valuable complement to near-Clifford simulators for QEC circuits.
Understanding the emergent system-bath correlations in non-Markovian and non-perturbative open systems is a theoretical challenge that has benefited greatly from the application of Matrix Product State (MPS) methods. Here, we propose an autonmously adapative variant of the one-site Time-Dependent-Variational-Principle (1TDVP) method for many-body MPS wave-functions in which the local bond-dimensions can evolve to capture growing entanglement 'on the fly'. We achieve this by efficiently examining the effect of increasing each MPS bond-dimension in advance of each dynamic timestep, resulting in an MPS that can dynamically and inhomogeneously restructure itself as the complexity of the dynamics grows across time and space. This naturally leads to more efficient simulations, oviates the need for multiple convergence runs, and, as we demonstrate, is ideally suited to the typical, finite-temperature 'impurity' problems that describe open quantum system connected to multiple environments.
We present a matrix product state (MPS) algorithm to approximate ground states of translationally invariant systems with periodic boundary conditions. For a fixed value of the bond dimension DDD of the MPS, we discuss how to minimize the computational cost to obtain a seemingly optimal MPS approximation to the ground state. In a chain with NNN sites and correlation length $\ensuremath{\xi}$, the computational cost formally scales as $g(D,\ensuremath{\xi}/N){D}^{3}$, where $g(D,\ensuremath{\xi}/N)$ is a nontrivial function. For $\ensuremath{\xi}\ensuremath{\ll}N$, this scaling reduces to D3{D}^{3}D3, independent of the system size NNN, making our method NNN times faster than previous proposals. We apply the algorithm to obtain MPS approximations for the ground states of the critical quantum Ising and Heisenberg spin-1/21/21/2 models as well as for the noncritical Heisenberg spin-111 model. In the critical case, for any chain length NNN, we find a model-dependent bond dimension D(N)D(N)D(N) above which the polynomial decay of correlations is faithfully reproduced throughout the entire system.