◍wovepaper
SearchResearchersInstitutions
Sign in
cs.DSJul 9, 2010
15
citations (OpenAlex)
authors
  • Ying-Yu Zhang
  • Song-Feng Lu
institutions
  • Huazhong University of Science and Technology
arXiv abstractPDF
paper

Quantum search by partial adiabatic evolution

arXiv:1007.1528 · doi:10.1103/PhysRevA.82.034304

Abstract

A quantum search algorithm based on the partial adiabatic evolution\cite{Tulsi2009} is provided. We calculate its time complexity by studying the Hamiltonian in a two-dimensional Hilbert space. It is found that the algorithm improves the time complexity, which is O(N/M​), of the local adiabatic search algorithm\cite{Roland2002}, to O(N​/M).

References in corpus (11)

  • Quantum Mechanics helps in searching for a needle in a haystack
  • A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
  • Quantum Search by Local Adiabatic Evolution
  • Robustness of adiabatic quantum computation
  • Simple proof of equivalence between adiabatic quantum computation and the circuit model
  • Sufficiency Criterion for the Validity of the Adiabatic Approximation
  • First-order transitions and the performance of quantum algorithms in random optimization problems
  • Adiabatic Quantum Computation and Deutsch's Algorithm
  • A modified quantum adiabatic evolution for the Deutsch-Jozsa problem
  • From quantum circuits to adiabatic algorithms
  • Adiabatic Quantum Computation with a 1D projector Hamiltonian

Cited by in corpus (1)

  • Comment on Partial Adiabatic Quantum Search
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.