相关论文: General error estimate for adiabatic quantum compu…

Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…

Adiabatic quantum optimization is a procedure to solve a vast class of optimization problems by slowly changing the Hamiltonian of a quantum system. The evolution time necessary for the algorithm to be successful scales inversely with the…

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…

The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…

We give a sufficient condition for the quantum adiabatic approximation, which is quantitative and can be used to estimate error caused by this approximation. We also discuss when the traditional condition is sufficient.

Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…

We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…

In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…

In 2004 Ambainis and Regev formulated a certain form of quantum adiabatic theorem and provided an elementary proof which is especially accessible to computer scientists. Their result is achieved by discretizing the total adiabatic evolution…

A common trick for designing faster quantum adiabatic algorithms is to apply the adiabaticity condition locally at every instant. However it is often difficult to determine the instantaneous gap between the lowest two eigenvalues, which is…

Since the discovery of adiabatic quantum computing, a need has arisen for rigorously proven bounds for the error in the adiabatic approximation. We present in this paper, a rigorous and elementary derivation of upper and lower bounds on the…

Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…

The viability of adiabatic quantum computation depends on the slow evolution of the Hamiltonian. The adiabatic switching theorem provides an asymptotic series for error estimates in $1/T$, based on the lowest non-zero derivative of the…

Adiabatic quantum computing is a framework for quantum computing that is superficially very different to the standard circuit model. However, it can be shown that the two models are computationally equivalent. The key to the proof is a…

The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…

The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of…

Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…

Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra…

The partial adiabatic search algorithm was introduced in [A. Tulsi, Phys. Rev. A 80, 052328 (2009)] as a modification of the usual adiabatic algorithm for quantum search with the idea that most of the interesting computation only happens…

We decompose the quantum adiabatic evolution as the products of gauge invariant unitary operators and obtain the exact nonadiabatic correction in the adiabatic approximation. A necessary and sufficient condition that leads to adiabatic…