We present a quantum algorithm for simulating open quantum systems coupled to Gaussian environments valid for any configuration and coupling strength. The algorithm is applicable to problems with strongly coupled, or non-Markovian, environments; problems with multiple environments out of mutual equilibrium; and problems with time-dependent Hamiltonians. We show that the algorithm can reproduce the true dynamics of such problems at arbitrary accuracy and, for a broad range of problems, only adds a minor resource cost relative to Trotterized time evolution; the cost is low-degree polynomial in the inverse target accuracy. The algorithm is based on the insight that any Gaussian environment can be represented as a train of ancillary qubits that sequentially interact with the system through a time-local coupling, given by the convolution square root of the bath correlation function; this is a secondary result of our work. In numerical simulations of a spin-boson model, we find accurate simulations can be achieved with moderate ( 10 1 – 10 3 ) ancilla counts in the intermediate to strong-coupling regimes. Our results open up applications of quantum computers for efficient simulation of nonequilibrium and open quantum systems.
We present a quantum algorithm for simulating open quantum systems coupled to Gaussian environments valid for any configuration and coupling strength. The algorithm is applicable to problems with strongly coupled, or non-Markovian, environments; problems with multiple environments out of mutual equilibrium; and problems with time-dependent Hamiltonians. We show that the algorithm can reproduce the true dynamics of such problems at arbitrary accuracy and, for a broad range of problems, only adds a minor resource cost relative to Trotterized time evolution; the cost is low-degree polynomial in the inverse target accuracy. The algorithm is based on the insight that any Gaussian environment can be represented as a train of ancillary qubits that sequentially interact with the system through a time-local coupling, given by the convolution square root of the bath correlation function; this is a secondary result of our work. In numerical simulations of a spin-boson model, we find accurate simulations can be achieved with moderate ( 10 1 – 10 3 ) ancilla counts in the intermediate to strong-coupling regimes. Our results open up applications of quantum computers for efficient simulation of nonequilibrium and open quantum systems.
We present an error-controlled framework for the quantum simulation of non-Markovian open-system dynamics in Gaussian environments. For a system coupled linearly to a Gaussian environment with zero mean, the bath's influence on the reduced dynamics is completely determined by its two-time correlation kernel. This allows us to replace the microscopic environment with an equivalent bath that has the same kernel. On a finite simulation interval, a rank-N approximation of the kernel yields an effective bath of N bosonic modes with time-dependent couplings to the system. To encode these modes in qubits, we first truncate each mode to its lowest d occupation levels. When stronger couplings lead to large occupations, we introduce coupling dilution, which replaces each mode with several more weakly coupled copies while preserving the bath correlation kernel. This distributes excitations across more modes and trades additional modes for smaller local dimensions. We derive explicit reduced-state error bounds and establish polynomial circuit width and depth in simulation time and inverse accuracy under stated spectral-decay and coupling-regularity assumptions, provided elementary unitaries admit polynomial-cost implementations.
In the study of open quantum systems, one typically obtains the decoherence dynamics by solving a master equation. The master equation is derived using knowledge of some basic properties of the system, the environment, and their interaction: One basically needs to know the operators through which the system couples to the environment and the spectral density of the environment. For a large system, it could become prohibitively difficult to even write down the appropriate master equation, let alone solve it on a classical computer. In this paper, we present a quantum algorithm for simulating the dynamics of an open quantum system. On a quantum computer, the environment can be simulated using ancilla qubits with properly chosen single-qubit frequencies and with properly designed coupling to the system qubits. The parameters used in the simulation are easily derived from the parameters of the system + environment Hamiltonian. The algorithm is designed to simulate Markovian dynamics, but it can also be used to simulate non-Markovian dynamics provided that this dynamics can be obtained by embedding the system of interest into a larger system that obeys Markovian dynamics. We estimate the resource requirements for the algorithm. In particular, we show that for sufficiently slow decoherence a single ancilla qubit could be sufficient to represent the entire environment, in principle.
A method for the systematic construction of few-body damped harmonic oscillator networks accurately reproducing the effect of general bosonic environments in open quantum systems is presented. Under the sole assumptions of a Gaussian environment and regardless of the system coupled to it, an algorithm to determine the parameters of an equivalent set of interacting damped oscillators obeying a Markovian quantum master equation is introduced. By choosing a suitable coupling to the system and minimizing an appropriate distance between the two-time correlation function of this effective bath and that of the target environment, the error induced in the reduced dynamics of the system is brought under rigorous control. The interactions among the effective modes provide remarkable flexibility in replicating non-Markovian effects on the system even with a small number of oscillators, and the resulting Lindblad equation for the system and the modes may therefore be integrated at a very reasonable computational cost using standard methods for Markovian problems, even in strongly nonperturbative coupling regimes and at arbitrary temperatures including zero. We apply the method to an exactly solvable problem in order to demonstrate its accuracy, and present two studies based on current research in the context of coherent transport in biological aggregates and organic photovoltaics as more realistic examples of its use and potential; performance and versatility are highlighted, and theoretical and numerical advantages over existing methods, as well as possible future improvements, are discussed.
We present an efficient algorithm for simulating open quantum systems dynamics described by the Lindblad master equation on quantum computers, addressing key challenges in the field. In contrast to existing approaches, our method achieves two significant advancements. First, we employ a repetition of unitary gates on a set of n system qubits and, remarkably, only a single ancillary bath qubit representing the environment. It follows that, for the typical case of m locality of the Lindblad operators, we reach an exponential improvement of the number of ancilla in terms of m and up to a polynomial improvement in ancilla overhead for large n with respect to other approaches. Although stochasticity is introduced, requiring multiple circuit realizations, the sampling overhead is independent of the system size. Second, we show that, under fixed accuracy conditions, our algorithm enables a reduction in the number of Trotter steps compared to other approaches, substantially decreasing circuit depth. These advancements hold particular significance for near-term quantum computers, where minimizing both width and depth is critical due to inherent noise in their dynamics. Published by the American Physical Society 2024
All systems are open to an essentially uncontrollable environment that acts as a source of decoherence and dissipation. In some cases the environment's only effect is to add a weak relaxation mechanism and thus can be ignored for short timescales. In others, however, the presence of the environment can fundamentally alter the behavior of the system. Such is the case in mesoscopic superconductors where the environment can stabilize superconductivity and in spin-boson systems where the environment induces a localization transition. Likewise, in technological applications we are often interested in systems operating far from equilibrium. Here the environment might act as a particle reservoir or strong driving force. In all these examples, we need accurate methods to describe the influence of the environment on the system and to solve for the resulting dynamics or equilibrium states. In this thesis, we develop computational and conceptual approaches to efficiently simulate quantum systems in contact with an environment. Our starting point is the use of numerical renormalization techniques. Thus, we restrict our attention to one-dimensional lattices or small quantum systems coupled to an environment. We have developed several complementary algorithms: a superoperator renormalization algorithm for simulating real-time Markovian dynamics and for calculating states in thermal equilibrium; a blocking algorithm for simulating integro-differential equations with long-time memory; and a tensor network algorithm for branched lattices, which can be used to simulate strongly dissipative systems. Further, we provide support for an idea that to generically and accurately simulate the real-time dynamics of strongly dissipative systems, one has to include all or part of the environment within the simulation. In addition, we discuss applications and open questions.
Research in open quantum system dynamics has received growing interest in recent years, and its ongoing investigation has uncovered many intriguing physics departing from closed systems. A particularly useful application of the open quantum system theory is to simulate quantum dynamical processes in condensed phase materials. As the quantum degree of freedom is constantly under the influence of its thermal environment, the accurate description of the dynamics often requires non-Markovian time evolution at finite temperature. Such calculation is usually quite challenging on classical computers as extensive memory storage is required. In this work, we focus on a quantum system linearly coupled to its harmonic bath and present a path integral based quantum algorithm that time-evolves the reduced density matrix under finite temperature non-Markovian dynamics. To treat the nonunitary time evolution, the Sz.-Nagy dilation scheme is used for the conversion to unitary dynamics that can be implementable on gate-based quantum computers. The modified Hadamard test is then used to retrieve all the information of the reduced density matrix. Complexity analysis shows that the memory requirement has exponential reduction on the quantum machine whereas the runtime complexity stays roughly the same as for the classical computer. It points to the possibility of using this algorithm to simulate multilevel and multisite non-Markovian quantum dynamics that are beyond the reach of classical computers. The algorithm makes no ad hoc assumptions and extends naturally beyond Markovian and weak coupling regimes. We validated the algorithm on the quantum simulator with the spin-boson model and demonstrated its excellent agreement with the classical computer benchmark. Published by the American Physical Society 2024