Sherpa Romeo green journal. Permission to archive final published version.We show that by a suitable choice of a time-dependent Hamiltonian, Deutsch’s algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both global and local adiabatic evolutions.Ye
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a pr...
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bat...
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly...
AbstractWe construct a family of time-independent Hamiltonians which are able to perform universally...
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating o...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Michael Sipser give a quantum algorithm for solving in...
We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) ...
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the q...
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground sta...
The goal of this paper is to study the effect of entanglement on the running time of a quantum compu...
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic...
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bat...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Michael Sipser give a quantum algorithm for solving in...
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for ...
This paper concerns quantum heuristics that are able to extend the domain of quantum computing defin...
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a pr...
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bat...
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly...
AbstractWe construct a family of time-independent Hamiltonians which are able to perform universally...
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating o...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Michael Sipser give a quantum algorithm for solving in...
We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) ...
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the q...
Quantum adiabatic algorithm is a method of solving computational problems by evolving the ground sta...
The goal of this paper is to study the effect of entanglement on the running time of a quantum compu...
We derive a version of the adiabatic theorem that is especially suited for applications in adiabatic...
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bat...
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, Michael Sipser give a quantum algorithm for solving in...
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for ...
This paper concerns quantum heuristics that are able to extend the domain of quantum computing defin...
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a pr...
We introduce and study the adiabatic dynamics of free-fermion models subject to a local Lindblad bat...
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly...
DOI
Add to ORKG