相关论文: Rapid Data Search using Adiabatic Quantum Computat…

We propose a strategy for modeling the behavior of an adiabatic quantum computer described by an Ising Hamiltonian with $N$ sites and the coordination number $Z$. The method is based on the $1/Z$ expansion for the density matrix of the…

Digitized adiabatic quantum factorization is a hybrid algorithm that exploits the advantage of digitized quantum computers to implement efficient adiabatic algorithms for factorization through gate decompositions of analog evolutions. In…

This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded…

A typical goal of a quantum simulation is to find the energy levels and eigenstates of a given Hamiltonian. This can be realized by adiabatically varying the system control parameters to steer an initial eigenstate into the eigenstate of…

Let $H(t)=(1-t/T)H_0 + (t/T)H_1$, $t\in [0,T]$, be the Hamiltonian governing an adiabatic quantum algorithm, where $H_0$ is diagonal in the Hadamard basis and $H_1$ is diagonal in the computational basis. We prove that $H_0$ and $H_1$ must…

Designing quantum algorithms with a speedup over their classical analogs is a central challenge in quantum information science. Motivated by recent experimental observations of a superlinear quantum speedup in solving the Maximum…

Quantum adiabatic optimization (QAO) is performed using a time-dependent Hamiltonian $H(s)$ with spectral gap $\gamma(s)$. Assuming the existence of an oracle $\Gamma$ such that $\gamma_\min = \Theta\left(\min_s\Gamma(s)\right)$, we provide…

Adiabatic quantum optimization has attracted a lot of attention because small scale simulations gave hope that it would allow to solve NP-complete problems efficiently. Later, negative results proved the existence of specifically designed…

In the quantum database search problem we are required to search for an item in a database. In this paper, we consider a generalization of this problem, where we are provided d identical copes of a database each with N items which we can…

We present a comprehensive review of past research into adiabatic quantum computation and then propose a scalable architecture for an adiabatic quantum computer that can treat NP-hard problems without requiring local coherent operations.…

The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other…

Quantum integer factorization is a potential quantum computing solution that may revolutionize cryptography. Nevertheless, a scalable and efficient quantum algorithm for noisy intermediate-scale quantum computers looks far-fetched. We…

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…

Database search has wide applications and is used as a subroutine in many important algorithms. We shall consider a database with one target item. Quantum algorithm finds the target item in a database faster than any classical algorithm. It…

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…

Adiabatic quantum computing~(AQC) is based on the adiabatic principle, where a quantum system remains in an instantaneous eigenstate of the driving Hamiltonian. The final state of the Hamiltonian encodes solution to the problem of interest.…

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…

Models of quantum computation are important because they change the physical requirements for achieving universal quantum computation (QC). For example, one-way QC requires the preparation of an entangled "cluster" state followed by…

Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the…

We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control…