Related papers: Excited state search using quantum annealing
We present the results of a detailed analysis of a general, unstructured adiabatic quantum search of a data base of $N$ items. In particular we examine the effects on the computation time of adding energy to the system. We find that by…
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…
Variational quantum eigensolver (VQE) is an appealing candidate for the application of near-term quantum computers. A technique introduced in [Higgot et al., Quantum 3, 156 (2019)], which is named variational quantum deflation (VQD), has…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
We propose a protocol for quantum adiabatic optimization, whereby an intermediary Hamiltonian that is diagonal in the computational basis is turned on and off during the interpolation. This `diagonal catalyst' serves to bias the energy…
We present an adiabatic approach to the design of entangling quantum operations with two electron spins localized in separate InAs/GaAs quantum dots via the Coulomb interaction between optically-excited localized states. Slowly-varying…
For quantum annealing, as opposed to circuit based quantum computing, the solution to a computational problem is encoded in the ground state of a quantum system. Therefore its susceptibility to environmental effects is a different but not…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
Grover's algorithm has achieved great success. But quantum search algorithms still are not complete algorithms because of Grover's Oracle. We concerned on this problem and present a new quantum search algorithm in adiabatic model without…
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and…
For the adiabatic version of Grover's quantum search algorithm as proposed by Roland and Cerf, we study the impact of decoherence caused by a rather general coupling to some environment. For quite generic conditions, we find that the…
An explicit algorithm for the travelling salesman problem is constructed in the framework of adiabatic quantum computation, AQC. The initial Hamiltonian for the AQC process admits canonical coherent states as the ground state, and the…
Within the evolving domain of quantum computational chemistry, the Variational Quantum Eigensolver (VQE) has been developed to explore not only the ground state but also the excited states of molecules. In this study, we compare the…
Calculating the molecular ground-state energy is a central challenge in computational chemistry. Conventional methods such as the Complete Active Space Configuration Interaction scale exponentially with molecular size, limiting their…
In the present study, we demonstrate how to perform, using quantum annealing, the singular value decomposition and the principal component analysis. Quantum annealing gives a way to find a ground state of a system, while the singular value…
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…
In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm is based on an iterative…
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…
Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution. Both analytical and numerical evidence suggests that under idealized, closed system conditions, 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…