Related papers: Accuracy vs run time in adiabatic quantum search
Precise and efficient control of quantum systems is essential to perform quantum information processing tasks. In terms of adiabatic speedup via leakage elimination operator approach, for a closed system, the ideal pulse control conditions…
Quantum annealing (QA) is a heuristic search algorithm that can run on Adiabatic Quantum Computation (AQC) processors to solve combinatorial optimization problems. Although theoretical studies and simulations on classic hardware have shown…
We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control…
Adiabatic elimination is a perturbative model reduction technique based on timescale separation and often used to simplify the description of composite quantum systems. We here analyze a quantum experiment where the perturbative expansion…
We consider the effect of two different environments on the performance of the quantum adiabatic search algorithm, a thermal bath at finite temperature, and a structured environment similar to the one encountered in systems coupled to the…
Existing quantum algorithms for quantum chemistry work well near the equilibrium geometry of molecules, but the results can become unstable when the chemical bonds are broken at large atomic distances. For any adiabatic approach, this…
The consistency of quantum adiabatic theorem has been doubted recently. It is shown in the present paper that the difference between the adiabatic solution and the exact solution to the Schrodinger equation with a slowly changing driving…
A new implementation of an adiabatically-trained ensemble model is derived that shows significant improvements over classical methods. In particular, empirical results of this new algorithm show that it offers not just higher performance,…
We review the quantum adiabatic approximation for closed systems, and its recently introduced generalization to open systems (M.S. Sarandy and D.A. Lidar, e-print quant-ph/0404147). We also critically examine a recent argument claiming that…
While adiabatic quantum computation (AQC) possesses some intrinsic robustness to noise, it is expected that a form of error control will be necessary for large scale computations. Error control ideas developed for circuit-model quantum…
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…
The robustness of the local adiabatic quantum search to decoherence in the instantaneous eigenbasis of the search Hamiltonian is examined. We demonstrate that the asymptotic time-complexity of the ideal closed case is preserved, as long as…
Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build an error-corrected quantum computer is ongoing, noisy, intermediate-scale quantum (NISQ) devices provide…
A simple proof of quantum adiabatic theorem is provided. Quantum adiabatic approximation is divided into two kinds. For Hamiltonian H(t/T), a relation between the size of the error caused by quantum adiabatic approximation and the parameter…
Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition…
We propose a hybrid quantum-classical approximate optimization algorithm for photonic quantum computing, specifically tailored for addressing continuous-variable optimization problems. Inspired by counterdiabatic protocols, our algorithm…
The ability to efficiently prepare ground states of quantum Hamiltonians via adiabatic protocols is typically limited by the smallest energy gap encountered during the quantum evolution. This presents a key obstacle for quantum simulation…
We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along…
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 study the eigenlevel spectrum of quantum adiabatic algorithm for 3-satisfiability problem, focusing on single-solution instances. The properties of the ground state and the associated gap, crucial for determining the running time of the…