Better lower bound for quantum algorithms searching an ordered list

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 1999, Pages 352-357

  Ambainis, Andris ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOUNDARY CONDITIONS; PROBABILITY; QUANTUM THEORY; QUEUEING THEORY;

GROVERS ALGORITHM; QUANTUM ALGORITHMS; QUANTUM BINARY SEARCH;

ALGORITHMS;

EID: 0033346632     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)