Abstract Many-body quantum systems are subjected to the Curse of Dimensionality: The dimension of the Hilbert space H, where these systems live in, grows exponentially with number of their components. However, with some systems, it is possible to escape the curse by using a low-rank tensor approximation known as “matrix-product state/operator (MPS/O) representation” in the quantum community and “tensor-train decomposition” among applied mathematicians. Motivated by recent advances in computational quantum physics, we consider chains of N spins coupled by nearest-neighbor interactions. The spins are subjected to an action coming from the environment. Spatially disordered interaction and environment-induced decoherence drive systems into non-trivial asymptotic states. The dissipative evolution is modeled with a Markovian master equation in the Lindblad form. By implementing the MPO technique and propagating system states with the time-evolving block decimation scheme, which allows keeping the length of the state descriptions fixed, it is in principle possible to reach the asymptotic states. We propose and realize a cluster implementation of this idea. The implementation on four nodes allowed us to resolve the asymptotic states of the model systems with N = 128 spins (total dimension of the Hilbert space dimH = 2128 ≈ 1039).
Abstract Many-body quantum systems are subjected to the Curse of Dimensionality: The dimension of the Hilbert space H, where these systems live in, grows exponentially with number of their components. However, with some systems, it is possible to escape the curse by using a low-rank tensor approximation known as “matrix-product state/operator (MPS/O) representation” in the quantum community and “tensor-train decomposition” among applied mathematicians. Motivated by recent advances in computational quantum physics, we consider chains of N spins coupled by nearest-neighbor interactions. The spins are subjected to an action coming from the environment. Spatially disordered interaction and environment-induced decoherence drive systems into non-trivial asymptotic states. The dissipative evolution is modeled with a Markovian master equation in the Lindblad form. By implementing the MPO technique and propagating system states with the time-evolving block decimation scheme, which allows keeping the length of the state descriptions fixed, it is in principle possible to reach the asymptotic states. We propose and realize a cluster implementation of this idea. The implementation on four nodes allowed us to resolve the asymptotic states of the model systems with N = 128 spins (total dimension of the Hilbert space dimH = 2128 ≈ 1039).
Matrix product states (MPSs) and matrix product operators (MPOs) are fundamental tools in the study of quantum many-body systems, particularly in the context of tensor network methods such as time-evolving block decimation (TEBD). However, constructing compact MPO representations for Hamiltonians with interactions beyond nearest neighbors, such as those arising in atomic, molecular, and optical (AMO) systems or in systems with ring geometry, remains a challenge. In this paper, we propose an approach for the direct construction of compact MPOs tailored specifically for the exponential of spin Hamiltonians. This approach allows for a more efficient time evolution, using TEBD, of spin systems with interactions beyond nearest neighbors, such as long-range spin chains, periodic systems, and more complex cluster models, with interactions involving more than two spins.
Numerical methods for obtaining exact dynamics of non-Markovian open quantum systems are mostly limited to either small systems or to short-time evolution only. Here, we propose a new algorithm for computing process tensors--matrix product operator (MPO) representations that capture the environment influence--which achieves greatly enhanced computational scalings with system size, while maintaining linear scaling with simulation length. We build on recent developments in the field which allow for long-time evolutions through process tensors which have a time-translational invariance. These can be built for general Gaussian environments and generic coupling operators with the system using infinite time-evolving block decimation (iTEBD). We introduce a modified iTEBD algorithm using intermediate compression steps which bring down the computation time scaling with system size d from O(d8) to O(d4), as well as significantly lowering the required memory. To illustrate the power of this method, we apply it to the problem of dispersive qubit readout in circuit QED, which was previously out-of-reach numerically. The full treatment of the measurement resonator, which requires a large system space, combined with the long simulation times precipitated by the separation of timescales between the measurement drive and the environment dissipation, is now possible. The algorithm we introduce not only allows for capturing non-Markovian dynamics in large open quantum systems, but also further extends all the existing capabilities of process tensors, for example in quantum optimal control, or in computation of multi-time correlations or of steady states, to more complex systems with tens of levels.
Abstract Tensor network methods as presented in our open source matrix product states software have opened up the possibility to study many-body quantum physics in one and quasi-one-dimensional systems in an easily accessible package similar to density functional theory codes but for strongly correlated dynamics. Here, we address methods which allow one to capture the full entanglement without truncation of the Hilbert space. Such methods are suitable for validation of and comparisons to tensor network algorithms, but especially useful in the case of new kinds of quantum states with high entanglement violating the truncation in tensor networks. Quantum cellular automata are one example for such a system, characterized by tunable complexity, entanglement, and a large spread over the Hilbert space. Beyond the evolution of pure states as a closed system, we adapt the techniques for open quantum systems simulated via the Lindblad master equation. We present three algorithms for solving closed-system many-body time evolution without truncation of the Hilbert space. Exact diagonalization methods have the advantage that they not only keep the full entanglement but also require no approximations to the propagator. Seeking the limits of a maximal number of qubits on a single core, we use Trotter decompositions or Krylov approximation to the exponential of the Hamiltonian. All three methods are also implemented for open systems represented via the Lindblad master equation built from local channels. We show their convergence parameters and focus on efficient schemes for their implementations including Abelian symmetries, e.g. symmetry used for number conservation in the Bose–Hubbard model or discrete symmetries in the quantum Ising model. We present the thermalization timescale in the long-range quantum Ising model as a key example of how exact diagonalization contributes to novel physics.
The nonequilibrium effects of dissipation and drive play a key role in an immense variety of nanoscale and mesoscale quantum systems. To understand the behaviour of open quantum systems, we need accurate methods that capture the influence of the environment on the system, while managing the exponentially large Hilbert space required to describe the system. Tensor network algorithms offer an efficient way to approach this challenge. In this thesis, we develop and apply tensor network techniques to study the dynamics and steady states of various open quantum systems. The first part of the thesis focuses on the driven dissipative many body physics in coupled cavity arrays described by Born-Markov master equations. We extend transfer matrix product operator methods to Liouvillian dynamics, and utilize them to compute dynamical correlation functions and fluorescence spectrum of an infinite coupled cavity array in 1D. We also investigate thermalization, and observe the emergence of a quasi-thermal steady state with a negative effective temperature. In another study, we use infinite projected entangled pair state (iPEPS) methods to compute steady states of coupled cavity lattices in 2D. We find that a straightforward adaptation of iPEPS to Liouvillian dynamics is unstable, contradicting a recent publication in the field. The second part investigates more general systems involving strong couplings and structured environments that induce non-Markovian dynamics. We develop a powerful time-evolving matrix product operator (TEMPO) algorithm that builds on Feynman-Vernon influence functional formalism, and uses matrix product states (MPS) to represent the temporal non-Markovian correlations efficiently. We apply TEMPO to study the localization phase transition of the spin-boson model and the dynamics of two spatially separated two-level systems coupled to a common environment. Finally, we propose the Toblerone TEMPO algorithm, which extends TEMPO to many-body systems interacting with general bosonic environments.
An algorithm for the simulation of the evolution of slightly entangled quantum states has been recently proposed as a tool to study time-dependent phenomena in one-dimensional quantum systems. Its key feature is a time-evolving block-decimation (TEBD) procedure to identify and dynamically update the relevant, conveniently small, subregion of the otherwise exponentially large Hilbert space. Potential applications of the TEBD algorithm are the simulation of time-dependent Hamiltonians, transport in quantum systems far from equilibrium and dissipative quantum mechanics. In this paper we translate the TEBD algorithm into the language of matrix product states in order to both highlight and exploit its resemblances to the widely used density-matrix renormalization-group (DMRG) algorithms. The TEBD algorithm, being based on updating a matrix product state in time, is very accessible to the DMRG community and it can be enhanced by using well-known DMRG techniques, for instance in the event of good quantum numbers. More importantly, we show how it can be simply incorporated into existing DMRG implementations to produce a remarkably effective and versatile ‘adaptive time-dependent DMRG’ variant, that we also test and compare to previous proposals.
We investigate tensor-train approaches to the solution of the time-dependent Schrödinger equation for chain-like quantum systems with on-site and nearest-neighbor interactions only. Using efficient low-rank tensor train representations, we aim at reducing memory consumption and computational costs. As an example, coupled excitons and phonons modeled in terms of Fröhlich-Holstein type Hamiltonians are studied here. By comparing our tensor-train based results with semi-analytical results, we demonstrate the key role of the ranks of the quantum state vectors. Typically, an excellent quality of the solutions is found only when the maximum number of ranks exceeds a certain value. One class of propagation schemes builds on splitting the Hamiltonian into two groups of interleaved nearest-neighbor interactions commutating within each of the groups. In particular, the 4-th order Yoshida-Neri and the 8-th order Kahan-Li symplectic composition yield results close to machine precision. Similar results are found for 4-th and 8-th order global Krylov scheme. However, the computational effort currently restricts the use of these four propagators to rather short chains which also applies to propagators based on the time-dependent variational principle, typically used for matrix product states. Yet another class of propagators involves explicit, time-symmetrized Euler integrators. Especially the 4-th order variant is recommended for quantum simulations of longer chains, even though the high precision of the splitting schemes cannot be reached. Moreover, the scaling of the computational effort with the dimensions of the local Hilbert spaces is much more favorable for the differencing than for splitting or variational schemes.