Maximum speedup in quantum search: \(O\)(1) running time

DOI10.1023/A:1027391204528zbMath1037.81010arXivquant-ph/0204087OpenAlexW3000318405WikidataQ59444031 ScholiaQ59444031MaRDI QIDQ1421613

Younghun Kwon, Joonwoo Bae

Publication date: 3 February 2004

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0204087

zbMATH Keywords

Hamiltonianquantum searchquantum evolutionquadratic speedup

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

The travelling salesman problem and adiabatic quantum computation: an algorithm ⋮ A class of time-energy uncertainty relations for time-dependent Hamiltonians

This page was built for publication: Maximum speedup in quantum search: \(O\)(1) running time