Related papers: Quantum Dissipative Search via Lindbladians
The quantum adiabatic unstructured search algorithm is one of only a handful of quantum adiabatic optimization algorithms to exhibit provable speedups over their classical counterparts. With no fault tolerance theorems to guarantee the…
We show that all non-relativistic quantum processes, whether open or closed, are either unitary or probabilistic unitary, i.e., probabilistic combination of unitary evolutions. This means that for open quantum systems, its continuous…
Spatial search by discrete-time quantum walk can find a marked node on any ergodic, reversible Markov chain $P$ quadratically faster than its classical counterpart, i.e.\ in a time that is in the square root of the hitting time of $P$.…
Providing entanglement for the design of quantum technologies in the presence of noise constitutes today's main challenge in quantum information science. A framework is required that assesses the build-up of entanglement in realistic…
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…
Stochastic Gradient Descent (SGD) and its variants underpin modern machine learning by enabling efficient optimization of large-scale models. However, their local search nature limits exploration in complex landscapes. In this paper, we…
We derive a modified Lindblad equation for the state of quantum dot tunnel coupled to a Markovian lead when the spin state of the dot is driven by an oscillating magnetic field. We show that the equation is a completely positive,…
We show that by a suitable choice of time-dependent Hamiltonian, the search for a marked item in an unstructured database can be achieved in unit time, using Adiabatic Quantum Computation. This is a considerable improvement over the…
We study generic open quantum systems with Markovian dissipation, focusing on a class of stochastic Liouvillian operators of Lindblad form with independent random dissipation channels (jump operators) and a random Hamiltonian. We perform a…
We study discrete quantum dynamics where single evolution step consists of unitary system transformation followed by decoherence via coupling to an environment. Often non-Markovian memory effects are attributed to structured environments…
We consider quantum jump trajectories of Markovian open quantum systems subject to stochastic in time resets of their state to an initial configuration. The reset events provide a partitioning of quantum trajectories into consecutive time…
When simulating the dynamics of open quantum systems with quantum computers, it is essential to accurately approximate the system's behaviour while preserving the physicality of its evolution. Traditionally, for Markovian open quantum…
Non-equilibrium steady states are a focal point of research in the study of open quantum systems. Previous variational algorithms for searching these steady states have suffered from resource-intensive implementations due to vectorization…
In this paper we propose a continuous-time, dissipative Markov dynamics that asymptotically drives a network of n-dimensional quantum systems to the set of states that are invariant under the action of the subsystem permutation group. The…
Classical artificial neural networks, built from perceptrons as their elementary units, possess enormous expressive power. Here we investigate a quantum neural network architecture, which follows a similar paradigm. It is structurally…
We study the non-Markovian decoherence and disentanglement dynamics of dissipative quantum systems with special emphasis on non-Gaussian continuous variable systems. The dynamics are described by the Hu-Paz-Zhang master equation of quantum…
We propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain. The algorithm is based on a quantum walk \'a la Szegedy (2004) that is defined in terms of the…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
A systematic approach to the non-Markovian quantum dynamics of open systems is given by the projection operator techniques of nonequilibrium statistical mechanics. Combining these methods with concepts from quantum information theory and…
In the case of the discrete time coined quantum walk the reduced dynamics of the coin shows non-Markovian recurrence features due to information back-flow from the position degree of freedom. Here we study how this non-Markovian behavior is…