pith. sign in

arxiv: quant-ph/0308060 · v1 · submitted 2003-08-11 · 🪐 quant-ph

A new adiabatic quantum search algorithm

classification 🪐 quant-ph
keywords algorithmadiabaticquantumanalysiscomplexitydatabasesoptimizedsearch
0
0 comments X
read the original abstract

We present a new adiabatic quantum algorithm for searching over structured databases. The new algorithm is optimized using a simplified complexity analysis.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.