Related papers: Why the Quantitative Condition Fails to Reveal Qua…
In order to understand quantum decoherence of a quantum system due to its interaction with a large system behaving classically, we introduce the concept of adiabatic quantum entanglement based on the Born-Oppenhemeir approximation. In the…
Keeping a quantum system in a given instantaneous eigenstate is a control problem with numerous applications, e.g., in quantum information processing. The problem is even more challenging in the setting of open quantum systems, where…
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The…
We discuss a toy model for adiabatic quantum computation which displays some phenomenological properties expected in more realistic implementations. This model has two free parameters: the adiabatic evolution parameter $s$ and the $\alpha$…
In the conventional quantum mechanics (i.e., hermitian QM) the adia- batic theorem for systems subjected to time periodic fields holds only for bound systems and not for open ones (where ionization and dissociation take place) [D. W. Hone,…
We provide an elementary proof of the quantum adiabatic theorem.
In this work, we attempt to solve the integer-weight knapsack problem using the D-Wave 2000Q adiabatic quantum computer. The knapsack problem is a well-known NP-complete problem in computer science, with applications in economics, business,…
We provide a rigorous generalization of the quantum adiabatic theorem for open systems described by a Markovian master equation with time-dependent Liouvillian $\mathcal{L}(t)$. We focus on the finite system case relevant for adiabatic…
We illustrate the adiabatic quantum computing solution of the knapsack problem with both integer profits and weights. For problems with $n$ objects (or items) and integer capacity $c$, we give specific examples using both an Ising class…
Quantum computation by adiabatic evolution, as described in quant-ph/0001106, will solve satisfiability problems if the running time is long enough. In certain special cases (that are classically easy) we know that the quantum algorithm…
The quantum adiabatic theorem, a cornerstone of quantum mechanics, asserts that a gapped quantum system remains in its instantaneous eigenstate during sufficiently slow evolution, provided no resonances occur. Here we challenge this…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
We apply a recently developed quasi-diabatic (QD) scheme to the symmetric quasi-classical (SQC) approach for accurate quantum dynamics propagation. By using the adiabatic states as the quasi-diabatic states during a short-time quantum…
We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong…
Over the last decades, there have been many proposals for quantum computation. One of the promising candidates is adiabatic quantum computation (AQC). The central idea of AQC is about finding the ground state of a system with a problem…
Recently a method for adiabatic quantum computation has been proposed and there has been considerable speculation about its efficiency for NP-complete problems. Heuristic arguments in its favor are based on the unproven assumption of an…
In this work, we examine the validity of quantum adiabatic theorem in thermodynamic systems. For a $d$-dimensional quantum many-body system, we show that the duration time $\tau_0$ required by its ground-state adiabatic process does not…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
Recently, some quantum algorithms have been implemented by quantum adiabatic evolutions. In this paper, we discuss the accurate relation between the running time and the distance of the initial state and the final state of a kind of quantum…