Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we develop quantum circuits for optimal simulation of Markovian and Non-Markovian open quantum systems. The circuits use ancilla qubits to simulate the environment, and memory effects are induced by storing information about the system on extra qubits. We simulate the amplitude damping channel and dephasing channel as examples of the framework and infer (Non-)Markovianity from the (non-)monotonic behaviour of the dynamics. Further, we develop a method to optimize simulations by decomposing complex open quantum dynamics into smaller parts, that can be simulated using a small number of qubits. We show that this optimization reduces quantum space complexity from $O(l)$ to $O(1)$ for simulating the environment.
Digital quantum simulation on quantum systems require algorithms that can be implemented using finite quantum resources. Recent studies have demonstrated digital quantum simulation of open quantum systems on Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we develop quantum circuits for optimal simulation of Markovian and Non-Markovian open quantum systems. The circuits use ancilla qubits to simulate the environment, and memory effects are induced by storing information about the system on extra qubits. We simulate the amplitude damping channel and dephasing channel as examples of the framework and infer (Non-)Markovianity from the (non-)monotonic behaviour of the dynamics. Further, we develop a method to optimize simulations by decomposing complex open quantum dynamics into smaller parts, that can be simulated using a small number of qubits. We show that this optimization reduces quantum space complexity from O(l) to O(1) for simulating the environment.
Over the last two decades the field of quantum simulations has experienced incredible \ngrowth, which, coupled with progress in the development of controllable quantum \nplatforms, has recently begun to allow for the realisation of quantum simulations of a \nplethora of quantum phenomena in a variety of controllable quantum platforms. Within \nthe context of these developments, we investigate within this thesis methods for the \nquantum simulation of open quantum systems. \nMore specically, in the first part of the thesis we consider the simulation of Markovian \nopen quantum systems, and begin by leveraging previously constructed universal \nsets of single-qubit Markovian processes, as well as techniques from Hamiltonian simulation, \nfor the construction of an efficient algorithm for the digital quantum simulation \nof arbitrary single-qubit Markovian open quantum systems. The algorithm we provide, \nwhich requires only a single ancillary qubit, scales slightly superlinearly with respect \nto time, which given a recently proven no fast-forwarding theorem for Markovian dynamics, \nis therefore close to optimal. Building on these results, we then proceed to \nexplicitly construct a universal set of Markovian processes for quantum systems of any \ndimension. Specifically, we prove that any Markovian open quantum system, described \nby a one-parameter semigroup of quantum channels, can be simulated through coherent \noperations and sequential simulations of processes from the universal set. Under the assumption \nthat these universal Markovian processes can be efficiently implemented, this \nallows us to propose an efficient algorithm for a wide class of Markovian open quantum \nsystems, while simultaneously providing a tool for combining and exploiting existing \nsimulation methods. \nIn the second part of this thesis we then consider the simulation of many-body non- \nMarkovian open quantum systems. In particular, we develop an algorithmic procedure \nfor the quantum simulation of system propagators which are not completely positive \nmaps, which allows us to provide an explicit algorithm for the digital quantum simulation \nof many-body locally-indivisible non-Markovian open quantum systems described by \ntime-dependent master equations. Finally we construct generalised Suzuki-Lie-Trotter \ntheorems which allow us to analyse the efficiency of our method, which is expected to \nbe experimentally achievable for a variety of interesting cases.
Many-body systems arising in condensed matter physics and quantum optics inevitably couple to the environment and need to be modelled as open quantum systems. While near-optimal algorithms have been developed for simulating many-body quantum dynamics, algorithms for their open system counterparts remain less well investigated. We address the problem of simulating geometrically local many-body open quantum systems interacting with a stationary Gaussian environment. Under a smoothness assumption on the system-environment interaction, we develop near-optimal algorithms that, for a model with N spins and evolution time t, attain a simulation error δ in the system-state with O(Nt(Nt/δ)o(1)) gates, O(t(Nt/δ)o(1)) parallelized circuit depth and O~(N(Nt/δ)o(1)) ancillas. We additionally show that, if only simulating local observables is of interest, then the circuit depth of the digital algorithm can be chosen to be independent of the system size N. This provides theoretical evidence for the utility of these algorithms for simulating physically relevant models, where typically local observables are of interest, on pre-fault tolerant devices. Finally, for the limiting case of Markovian dynamics with commuting jump operators, we propose two algorithms based on sampling a Wiener process and on a locally dilated Hamiltonian construction, respectively. These algorithms reduce the asymptotic gate complexity on N compared to currently available algorithms in terms of the required number of geometrically local gates.
Quantum simulation of open quantum systems in the noisy intermediate-scale quantum (NISQ) era is hindered by the non-unitary nature of dissipative dynamics and the limited quantum resources available on near-term quantum processors. In this work, we propose a resource-efficient algorithm for simulating Lindbladian dynamics on NISQ devices. For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel that approximates the target dissipative dynamics and enables ancilla-free implementation through trajectory sampling. To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework. In this framework, a depth-adaptive parameterized quantum circuit is trained to approximate repeated Trotterized Hamiltonian simulation operators, which are then used to replace repeated unitary segments appearing in the sampled trajectories. Importantly, the training procedure can also be performed without auxiliary qubits. Numerical simulations of the dissipative quantum XY model demonstrate the accuracy and resource efficiency of the proposed algorithm. Our results provide a practical route toward ancilla-free and depth-reduced simulation of open quantum systems on near-term quantum hardware.
One of the first proposals for the use of quantum computers was the simulation of quantum systems. Over the past three decades, great strides have been made in the development of algorithms for simulating closed quantum systems and the more complex open quantum systems. In this tutorial, we introduce the methods used in the simulation of single qubit Markovian open quantum systems. It combines various existing notations into a common framework that can be extended to more complex open system simulation problems. The only currently available algorithm for the digital simulation of single qubit open quantum systems is discussed in detail. A modification to the implementation of the simpler channels is made that removes the need for classical random sampling, thus making the modified algorithm a strictly quantum algorithm. The modified algorithm makes use of quantum forking to implement the simpler channels that approximate the total channel. This circumvents the need for quantum circuits with a large number of CNOT gates. Quanta 2023; 12: 131–163.
Universal quantum algorithms (UQA) implemented on fault-tolerant quantum computers are expected to achieve an exponential speedup over classical counterparts. However, the deep quantum circuits make the UQA implausible in the current era. With only the noisy intermediate-scale quantum (NISQ) devices in hand, we introduce the quantum-assisted quantum algorithm, which reduces the circuit depth of UQA via NISQ technology. Based on this framework, we present two quantum-assisted quantum algorithms for simulating open quantum systems, which utilize two parameterized quantum circuits to achieve a short-time evolution. We propose a variational quantum state preparation method, as a subroutine to prepare the ancillary state, for loading a classical vector into a quantum state with a shallow quantum circuit and logarithmic number of qubits. We demonstrate numerically our approaches for a two-level system with an amplitude damping channel and an open version of the dissipative transverse field Ising model on two sites.
Simulating open quantum systems on digital quantum computers typically relies on the use of auxiliary qubits, resulting in overheads of noisy multi-qubit gates, that severely limit execution on near-term hardware. In this work, we explore the simulation of non-Markovian dynamics as well as memory channels leveraging the method of trajectory mixing, valid for mixed unitary channels. This allows to drastically reduce circuit depth, trading entangling gates for a statistical mixture of independent, pure state trajectories. Using a realistic noise model calibrated to modern quantum processors, we show the benefits of this approach, yielding higher state fidelity and better preservation of quantum correlations. This shows the possibility of simulating long-time non-Markovian evolutions with low noise and limited resources.