Related papers: Time evolution of controlled many-body quantum sys…
We describe a time evolution algorithm for quantum spin chains whose Hamiltonians are composed of an infinite uniform left and right bulk part, and an arbitrary finite region in between. The left and right bulk parts are allowed to be…
On the base of a Feynman-Kac--type formula involving Poisson stochastic processes, recently a Monte Carlo algorithm has been introduced, which describes exactly the real- or imaginary-time evolution of many-body lattice quantum systems. We…
The evolution of a quantum system under time-dependent driving exhibits phenomena that are absent in its stationary counterpart. However, the high dimensionality and non-commutative nature of quantum dynamics make this a challenging…
Theoretical understanding of strongly correlated systems in one spatial dimension (1D) has been greatly advanced by the density-matrix renormalization group (DMRG) algorithm, which is a variational approach using a class of…
Classical simulations of quantum circuits are vital for assessing potential quantum advantage and benchmarking devices, yet they require sophisticated methods to avoid the exponential growth of resources. Tensor network approaches, in…
Time-distributed Optimization (TDO) is an approach for reducing the computational burden of Model Predictive Control (MPC). When using TDO, optimization iterations are distributed over time by maintaining a running solution estimate and…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
Accurate models of the dynamics of quantum circuits are essential for optimizing and advancing quantum devices. Since first-principles models of environmental noise and dissipation in real quantum systems are often unavailable, deriving…
We compare accuracy of two prime time evolution algorithms involving Matrix Product States - tDMRG (time-dependent density matrix renormalization group) and TDVP (time-dependent variational principle). The latter is supposed to be superior…
We show that the time-dependent Schr\"odinger equation (TDSE) is the phenomenological dynamical law of evolution unraveled in the classical limit from a timeless formulation in terms of probability amplitudes conditioned by the values of…
The generalization of matrix product states (MPS) to continuous systems, as proposed in the breakthrough paper [F. Verstraete, J.I. Cirac, Phys. Rev. Lett. 104, 190405(2010)], provides a powerful variational ansatz for the ground state of…
We present an efficient quantum algorithm for simulating the dynamics of Markovian open quantum systems. The performance of our algorithm is similar to the previous state-of-the-art quantum algorithm, i.e., it scales linearly in evolution…
Quantum trajectories and superoperator algorithms implemented within the matrix product state (MPS) framework are powerful tools to simulate the real-time dynamics of open dissipative quantum systems. As for the unitary case, the reachable…
State-of-the-art quantum simulators permit local temporal control of interactions and midcircuit readout. These capabilities open the way towards the exploration of intriguing nonequilibrium phenomena. We illustrate this with a kinetically…
Combining the time-dependent variational principle (TDVP) algorithm with the parallelization scheme introduced by Stoudenmire and White for the density matrix renormalization group (DMRG), we present the first parallel matrix product state…
We introduce a time evolution algorithm for one-dimensional quantum field theories with periodic boundary conditions. This is done by applying the Dirac-Frenkel time-dependent variational principle to the set of translational invariant…
We investigate how dynamical decoupling methods may be used to manipulate the time evolution of quantum many-body systems. These methods consist of sequences of external control operations designed to induce a desired dynamics. The systems…
Towards the efficient simulation of near-term quantum devices using tensor network states, we introduce an improved real-space parallelizable matrix-product state (MPS) compression method. This method enables efficient compression of all…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
The recently proposed Clifford Circuits Augmented Matrix Product States (CA-MPS) (arXiv:2405.09217) seamlessly augments Density Matrix Renormalization Group with Clifford circuits. In CA-MPS, the entanglement from stabilizers is transferred…