Related papers: Improved Error-Scaling for Adiabatic Quantum State…
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…
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 present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
We investigate the non-adiabatic implementation of an adiabatic quantum teleportation protocol, finding that perfect fidelity can be achieved through resonance. We clarify the physical mechanisms of teleportation, for three qubits, by…
We introduce an adiabatic long-range quantum communication proposal based on a quantum dot array. By adiabatically varying the external gate voltage applied on the system, the quantum information encoded in the electron can be transported…
Quantum computing promises significant improvements of computation capabilities in various fields such as machine learning and complex optimization problems. Recent technological advancements suggest that the adiabatic quantum computing…
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…
Many schemes to realize quantum state transfer in spin chains are not robust to random fluctuations in the spin-spin coupling strength. In efforts to achieve robust quantum state transfer, an adiabatic quantum population transfer scheme is…
We review a scheme for the systematic design of quantum control protocols based on shortcuts to adiabaticity in few-level quantum systems. The adiabatic dynamics is accelerated by introducing high-frequency modulations in the control…
Adiabatic transport of information is a widely invoked resource in connection with quantum information processing and distribution. The study of adiabatic transport via spin-half chains or clusters is standard in the literature, while in…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey linear and universal scaling at the point where the mass…
We present a perturbative method to estimate the spectral gap for adiabatic quantum optimization, based on the structure of the energy levels in the problem Hamiltonian. We show that for problems that have exponentially large number of…
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…
Let the adiabatic invariant of action variable in slow-fast Hamiltonian system with two degrees of freedom have two limiting values along the trajectories as time tends to infinity. The difference of two limits is exponentially small in…
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. [Suba\c{s}i et al., Phys. Rev. Lett.…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…
We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization. This is applied to random-field antiferromagnetic Ising spin models. The algorithm is catalyzed in such a way that the evolution…