Related papers: Efficient Quantum Algorithms for Simulating Lindbl…
The Lindblad master equation is a foundational tool for modeling the dynamics of open quantum systems. As its use has extended far beyond its original domain, the boundaries of its validity have grown opaque. In particular, the rise of new…
Using quantum algorithms to simulate complex physical processes and correlations in quantum matter has been a major direction of quantum computing research, towards the promise of a quantum advantage over classical approaches. In this work…
The efficient simulation of quantum dynamics and ground states is a central challenge in physics and a key frontier for quantum advantage. While short-time evolution in one-dimensional systems can often be simulated classically, extending…
It is shown that the operator sum representation for non-Markovian dynamics and the Lindblad master equation in Markovian limit can be derived from a formal solution to quantum Liouville equation for a qubit system in the presence of…
We examine the time discretization of Lindblad master equations in infinite-dimensional Hilbert spaces. Our study is motivated by the fact that, with unbounded Lindbladian, projecting the evolution onto a finite-dimensional subspace using a…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
The quantum open-system simulation is an important category of quantum simulation. By simulating the thermalisation process at the zero temperature, we can solve the ground-state problem of quantum systems. To realise the open-system…
Approaching the long-time dynamics of non-Markovian open quantum systems presents a challenging task if the bath is strongly coupled. Recent proposals address this problem through a representation of the so-called process tensor in terms of…
We describe a simple algorithm for sampling $n$-qubit Clifford operators uniformly at random. The algorithm outputs the Clifford operators in the form of quantum circuits with at most $5n + 2n^2$ elementary gates and a maximum depth of…
We consider the problem of model reduction for Markovian quantum systems whose dynamics are described by a time-dependent Lindblad generator -- notably, as arising in the presence of external control. Our approach, which builds upon Krylov…
Ab-initio simulations of multiple heavy quarks propagating in a Quark-Gluon Plasma are computationally difficult to perform due to the large dimension of the space of density matrices. This work develops machine learning algorithms to…
We consider open many-body systems governed by a time-dependent quantum master equation with short-range interactions. With a generalized Lieb-Robinson bound, we show that the evolution in this very generic framework is quasi-local, i.e.,…
Starting from a geometric perspective, we derive a quantum speed limit for arbitrary open quantum evolution, which could be Markovian or non-Markovian, providing a fundamental bound on the time taken for the most general quantum dynamics.…
Environmental noise on a controlled quantum system is generally modeled by a dissipative Lindblad equation. This equation describes the average state of the system via the density matrix $\rho$. One way of deriving this Lindblad equation is…
The purpose of this article is to derive a Markovian approximation of the reduced time dynamics of observables for the Pauli-Fierz Hamiltonian with a precise control of the error terms. In that aim, we define a Lindblad operator associated…
We examine the effectiveness of Lindblad master equation in capturing the short-time dynamics of entanglement and purity in open quantum systems. Focusing on two interacting two-level systems interacting with a larger environment, we…
Quantum computers are known for their potential to achieve up-to-exponential speedup compared to classical computers for certain problems. To exploit the advantages of quantum computers, we propose quantum algorithms for linear stochastic…
An $n$-qubit quantum circuit is said to be peaked if it has an output probability that is at least inverse-polynomially large as a function of $n$. We describe a classical algorithm with quasipolynomial runtime $n^{O(\log{n})}$ that…
The numerical integration of the Schr\"odinger equation by discretization of time is explored for the curved manifolds arising from finite representations based on evolving basis states. In particular, the unitarity of the evolution is…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…