Related papers: Hilbert Space Average Method and adiabatic quantum…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
We develop further the approach to upper and lower bounds in quantum dynamics via complex analysis methods which was introduced by us in a sequence of earlier papers. Here we derive upper bounds for non-time averaged outside probabilities…
The theoretical investigation of non-adiabatic processes is hampered by the complexity of the coupled electron-nuclear dynamics beyond the Born-Oppenheimer approximation. Classically, the simulation of such reactions is limited by the…
In this paper, decoherence is studied for quantum systems undergoing adiabatic processes, which are coupled to huge quantum environments. It is shown that decoherence can happen with respect to a preferred basis given by transient…
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We…
An operator-valued quantum phase space formula is constructed. The phase space formula of Quantum Mechanics provides a natural link between first and second quantization, thus contributing to the understanding of quantization problem. By…
We propose a theory of adiabaticity in quantum Markovian dynamics based on a decomposition of the Hilbert space induced by the asymptotic behavior of the Lindblad semigroup. A central idea of our approach is that the natural generalization…
We show that it is possible to use a classical computer to efficiently simulate the adiabatic evolution of a quantum system in one dimension with a constant spectral gap, starting the adiabatic evolution from a known initial product state.…
The simulation of quantum systems has been a key aim of quantum technologies for decades, and the generalisation to open systems is necessary to include physically realistic systems. We introduce an approach for quantum simulations of open…
We introduce an alternative way to derive the generalized form of the master equation recently presented by J. P. Pekola et al. [Phys. Rev. Lett. 105, 030401 (2010)] for an adiabatically steered two-level quantum system interacting with a…
Grover's search algorithm was originally proposed for circuit-based quantum computers. A crucial part of it is to query an oracle -- a black-box unitary operation. Generation of this oracle is formally beyond the original algorithm design.…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
We analyze the quantization of dynamical systems that do not involve any background notion of space and time. We give a set of conditions for the introduction of an intrinsic time in quantum mechanics. We show that these conditions are a…
We introduce a modified model where h-dependent artificial interface conditions, occurring at the boundary of an interaction region, allow to obtain adiabatic approximations for the relevant resonant states connected to the quantum…
The purpose of this work is to understand the effect of an external environment on the adiabatic dynamics of a quantum critical system. By means of scaling arguments we derive a general expression for the density of excitations produced in…
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both…
In this paper the evolution of a quantum system drived by a non-Hermitian Hamiltonian depending on slowly-changing parameters is studied by building an universal high-order adiabatic approximation(HOAA) method with Berry's phase ,which is…
Near-term quantum processors are limited in terms of the number of qubits and gates they can afford. They nevertheless give unprecedented access to programmable quantum systems that can efficiently, although imperfectly, simulate quantum…
We study a general quantum system interacting with environment modeled by the bosonic heat bath of Caldeira and Leggett type. General interaction Hamiltonians are considered that commute with the system's Hamiltonian so that there is no…
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground state of a slowly varying Hamiltonian. The technique uses evolution of the ground state of a slowly varying Hamiltonian to reach the required…