Related papers: Quantum Dissipative Search via Lindbladians
It has been found that Markovian quantum dissipative processes, described by the Lindblad equation, may have attractive steady-state manifolds, in which dissipation and decoherence can play a positive role to quantum information processing.…
The fundamental difference between closed and open quantum dynamics lies in their environmental interaction: closed systems are perfectly isolated and evolve reversibly under unitary Hamiltonian dynamics, whereas open systems continuously…
The dynamics of Gaussian states for open quantum systems described by Lindblad equations can be solved analytically for systems with quadratic Hamiltonians and linear Lindbladians, showing the familiar phenomena of dissipation and…
With the rapid progress in quantum hardware, there has been an increased interest in new quantum algorithms to describe complex many-body systems searching for the still-elusive goal of 'useful quantum advantage'. Surprisingly, quantum…
We define the hitting time for a model of continuous-time open quantum walks in terms of quantum jumps. Our starting point is a master equation in Lindblad form, which can be taken as the quantum analogue of the rate equation for a…
The Lindblad equation is widely employed in studies of Markovian quantum open systems. Here, firstly, a simple result is presented on the time evolution of the non Neumann entropy under the Lindblad equation, which enables one to examine if…
Recent works on quantum resource theories of non-Gaussianity, which are based upon the type of tools available in contemporary experimental settings, put Gaussian states and their convex combinations on equal footing. Motivated by this, in…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
A dynamical symmetry is employed to determine the structure of the quantum non-Markovian time-local master equation. Such a structure is composed from two components: scalar kinetic coefficients and the standard quantum Markovian operator…
Quantum search is among the most important algorithms in quantum computing. At its core is quantum amplitude amplification, a technique that achieves a quadratic speedup over classical search by combining two global reflections: the oracle,…
We study controllability of finite-dimensional open quantum systems under a general Markovian control model combining full coherent (unitary) control with tunable dissipative channels. Assuming the Hamiltonian controls is a H\"ormander…
We compare discrete-time quantum walks on graphs to their natural classical equivalents, which we argue are lifted Markov chains, that is, classical Markov chains with added memory. We show that these can simulate quantum walks, allowing us…
We study general ``normally'' distributed random unitary transformations. These distributions can be defined in terms of a diffusive random walk in the respective group manifold, formally underpinned by the concept of infinite divisibility.…
The dynamics of a typical open quantum system, namely a quantum Brownian particle in a harmonic potential, is studied focussing on its non-Markovian regime. Both an analytic approach and a stochastic wave function approach are used to…
The fully quantized model of double qubits coupled to a common bath is solved using the quantum state diffusion (QSD) approach in the non-Markovian regime. We have established the explicit time-local non-Markovian QSD equations for the…
We present a detailed study of a simple quantum stochastic process, the quantum phase space Brownian motion, which we obtain as the Markovian limit of a simple model of open quantum system. We show that this physical description of the…
We introduce quantized bipartite walks, compute their spectra, generalize the algorithms of Grover \cite{g} and Ambainis \cite{amb03} and interpret them as quantum walks with memory. We compare the performance of walk based classical and…
The Markov Chain Monte Carlo method is at the heart of efficient approximation schemes for a wide range of problems in combinatorial enumeration and statistical physics. It is therefore very natural and important to determine whether…
We propose a quantum algorithm for solving combinatorial search problems that uses only a sequence of measurements. The algorithm is similar in spirit to quantum computation by adiabatic evolution, in that the goal is to remain in the…
We introduce a universal method for accelerating Lindblad dynamics that preserves the original trajectory through Hilbert space. The technique provides exact fast processes analytically, which are Markovian and do not require manipulation…