Related papers: Beyond adiabatic elimination: Effective Hamiltonia…
Exceptional point in non-Hermitian system possesses fascinating properties. We present an exactly solvable attractor dynamics for the first time from a two-level time dependent non-Hermitian Hamiltonian. It allows a way to evolve to the…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time…
Geometric integrators of the Schr\"{o}dinger equation conserve exactly many invariants of the exact solution. Among these integrators, the split-operator algorithm is explicit and easy to implement, but, unfortunately, is restricted to…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
It has been recently realized that dissipative processes can be harnessed and exploited to the end of coherent quantum control and information processing. In this spirit we consider strongly dissipative quantum systems admitting a…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
Nontrivial spectral properties of non-Hermitian systems can give rise to intriguing effects that lack counterparts in Hermitian systems. For instance, when dynamically varying system parameters along a path enclosing an exceptional point…
In Amin and Choi \cite{AC09}, we show that an adiabatic quantum algorithm for the NP-hard maximum independent set (MIS) problem on a set of special family of graphs in which there are exponentially many local maxima would have the…
A stable and fast path linking two arbitrary states of a quantum system is generally required for state-engineering protocols, such as stimulated Raman adiabatic passage, shortcuts to adiabaticity, and holonomic transformation. Such a path…
Adiabatic quantum computing is a powerful framework for state preparation, while its evolution time often scales quadratically in the inverse Hamiltonian spectral gap, leading to sub-optimal computational complexity. In this work, we…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically…
Different techniques to speed up quantum adiabatic processes are currently being explored for applications in atomic, molecular and optical physics, such as transport, cooling and expansions, wavepacket splitting, or internal state control.…
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then…
The quantum measurement axiom dictates that physical observables and in particular the Hamiltonian must be diagonalizable and have a real spectrum. For a time-independent Hamiltonian (with a discrete spectrum) these conditions ensure the…
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…
Among various algorithms designed to exploit the specific properties of quantum computers with respect to classical ones, the quantum adiabatic algorithm is a versatile proposition to find the minimal value of an arbitrary cost function…
The adiabatic theorem addresses the dynamics of a target instantaneous eigenstate of a time-dependent Hamiltonian. We use a Feshbach P-Q partitioning technique to derive a closed one-component integro-differential equation. The resultant…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
The correspondence between long-range interacting quantum spin glasses and combinatorial optimization problems underpins the physical motivation for adiabatic quantum computing. On one hand, in disordered (quantum) spin systems, the focus…