Related papers: Quantum Adiabatic Evolution Algorithms with Differ…
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to…
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…
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…
A condition on the Hamiltonian of a time-dependent quantum mechanical system is derived which, if satisfied, implies optimal adiabaticity (defined below). The condition is expressed in terms of the Hamiltonian and in terms of the evolution…
We propose a novel adiabatic time evolution (ATE) method for obtaining the ground state of a quantum many-electron system on a quantum circuit based on first quantization. As a striking feature of the ATE method, it consists of only unitary…
The preparation of a given quantum state on a quantum computing register is a typically demanding operation, requiring a number of elementary gates that scales exponentially with the size of the problem. Using the adiabatic theorem for…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a…
We present two applications of emergent local Hamiltonians to speed up quantum adiabatic protocols for isolated noninteracting and weakly interacting fermionic systems in one-dimensional lattices. We demonstrate how to extract maximal work…
We consider a periodically driven system where the high-frequency driving protocol consists of a sequence of potentials switched on and off at different instants within a period. We explore the possibility of introducing an adiabatic…
Implementation of quantum logical gates for multilevel system is demonstrated through decoherence control under the quantum adiabatic method using simple phase modulated laser pulses. We make use of selective population inversion and…
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…
Topological orders are a class of exotic states of matter characterized by patterns of long-range entanglement. Certain topologically ordered systems are proposed as potential realization of fault-tolerant quantum computation. Topological…
We study a simple system described by a 2x2 Hamiltonian and the evolution of the quantum states under the influence of a perturbation. More precisely, when the initial Hamiltonian is not degenerate,we check analytically the validity of the…
In this paper we analyze the performance of the Quantum Adiabatic Evolution algorithm on a variant of Satisfiability problem for an ensemble of random graphs parametrized by the ratio of clauses to variables, $\gamma=M/N$. We introduce a…
Quantum adiabatic algorithms are commonly analyzed through local spectral properties of an interpolating Hamiltonian, most notably the minimum energy gap. While this perspective captures an important constraint on adiabatic runtimes, it…
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…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…