RESUMEN
Chain-mapping techniques in combination with the time-dependent density matrix renormalization group are a powerful tool for the simulation of open-system quantum dynamics. For finite-temperature environments, however, this approach suffers from an unfavorable algorithmic scaling with increasing temperature. We prove that the system dynamics under thermal environments can be nonperturbatively described by temperature-dependent system-environmental couplings with the initial environment state being in its pure vacuum state, instead of a mixed thermal state. As a consequence, as long as the initial system state is pure, the global system-environment state remains pure at all times. The resulting speed-up and relaxed memory requirements of this approach enable the efficient simulation of open quantum systems interacting with highly structured environments in any temperature range, with applications extending from quantum thermodynamics to quantum effects in mesoscopic systems.
RESUMEN
We identify the conditions that guarantee equivalence of the reduced dynamics of an open quantum system (OQS) for two different types of environments-one a continuous bosonic environment leading to a unitary system-environment evolution and the other a discrete-mode bosonic environment resulting in a system-mode (nonunitary) Lindbladian evolution. Assuming initial Gaussian states for the environments, we prove that the two OQS dynamics are equivalent if both the expectation values and two-time correlation functions of the environmental interaction operators are the same at all times for the two configurations. Since the numerical and analytical description of a discrete-mode environment undergoing a Lindbladian evolution is significantly more efficient than that of a continuous bosonic environment in a unitary evolution, our result represents a powerful, nonperturbative tool to describe complex and possibly highly non-Markovian dynamics. As a special application, we recover and generalize the well-known pseudomodes approach to open-system dynamics.
RESUMEN
When the amount of entanglement in a quantum system is limited, the relevant dynamics of the system is restricted to a very small part of the state space. When restricted to this subspace the description of the system becomes efficient in the system size. A class of algorithms, exemplified by the time-evolving block-decimation (TEBD) algorithm, make use of this observation by selecting the relevant subspace through a decimation technique relying on the singular value decomposition (SVD). In these algorithms, the complexity of each time-evolution step is dominated by the SVD. Here we show that, by applying a randomized version of the SVD routine (RRSVD), the power law governing the computational complexity of TEBD is lowered by one degree, resulting in a considerable speed-up. We exemplify the potential gains in efficiency at the hand of some real world examples to which TEBD can be successfully applied and demonstrate that for those systems RRSVD delivers results as accurate as state-of-the-art deterministic SVD routines.