Related papers: Non-Markovian decoherence in the adiabatic quantum…
We investigate continuous quantum error correction, comparing performance under a Markovian error model to two distinct non-Markovian models. The first non-Markovian model involves an interaction Hamiltonian between the system and an…
The character of evolution of an open quantum system is often encoded in the correlation function of the environment or, equivalently, in the spectral density function of the interaction. When the environment is heterogeneous, e.g. consists…
Non-Markovian evolution of an open quantum system can be induced by the memory effects of a reservoir. Although a reservoir with stronger memory effects may seem like it should cause stronger non-Markovian effects on the system of interest,…
We provide model reduction formulas for open quantum systems consisting of a target component which weakly interacts with a strongly dissipative environment. The time-scale separation between the uncoupled dynamics and the interaction…
Recently several quantum search algorithms based on quantum walks were proposed. Those algorithms differ from Grover's algorithm in many aspects. The goal is to find a marked vertex in a graph faster than classical algorithms. Since the…
The search of an unstructured database amounts to finding one element having a certain property out of $N$ elements. The classical search with an oracle checking one element at a time requires on average $N/2$ steps. The Grover algorithm…
We analyze precision bounds for a local phase estimation in the presence of general, non-Markovian phase noise. We demonstrate that the metrological equivalence of product and maximally entangled states that holds under strictly Markovian…
A gapped quantum system that is adiabatically perturbed remains approximately in its eigenstate after the evolution. We prove that, for constant gap, general quantum processes that approximately prepare the final eigenstate require a…
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…
We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of $N$ items. In particular we examine the effects on the computation time of adding energy to the system. We find that by…
Background: Solving nuclear many-body problems with an ab initio approach is widely recognized as a computationally challenging problem. Quantum computers offer a promising path to address this challenge. There are urgent needs to develop…
We study the geometric phase of a two-level atom coupled to an environment with Lorentzian spectral density. The non-Markovian effect on the geometric phase is explored analytically and numerically. In the weak coupling limit the…
The use of the adiabatic approximation in practical applications, as in adiabatic quantum computation, demands an assessment of the errors made in finite-time evolutions. Aiming at such scenarios, we derive bounds relating error and…
We address the non-Markovian character of quantum maps describing the interaction of a qubit with a random classical field. In particular, we evaluate trace- and capacity-based non-Markovianity measures for two relevant classes of…
Quantum algorithm design plays a crucial role in exploiting the computational advantage of quantum devices. Here we develop a deep-reinforcement-learning based approach for quantum adiabatic algorithm design. Our approach is generically…
Open quantum systems exhibit a rich phenomenology, in comparison to closed quantum systems that evolve unitarily according to the Schr\"odinger equation. The dynamics of an open quantum system are typically classified into Markovian and…
In the continuum limit (large number of qubits), adiabatic quantum algorithms display a remarkable similarity to sweeps through quantum phase transitions. We find that transitions of second or higher order are advantageous in comparison to…
The robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian is examined. We demonstrate that the asymptotic time-complexity of the ideal closed case is preserved, as long as…
A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is…
Non-Markovian dynamics is studied for two interacting quibts strongly coupled to a dissipative bosonic environment. For the first time, we have derived the non-Markovian quantum state diffusion (QSD) equation for the coupled two-qubit…