Sciweavers

5215 search results - page 14 / 1043
» Quantum clustering algorithms
Sort
View
SODA
2003
ACM
100views Algorithms» more  SODA 2003»
13 years 11 months ago
Quantum algorithms for some hidden shift problems
Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structure of functions, especially periodi...
Wim van Dam, Sean Hallgren, Lawrence Ip
ALT
2006
Springer
14 years 6 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
14 years 1 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
14 years 10 months ago
Short seed extractors against quantum storage
Some, but not all, extractors resist adversaries with limited quantum storage. In this paper we show that Trevisan's extractor has this property, thereby showing an extractor...
Amnon Ta-Shma
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
14 years 3 months ago
Bounds for Error Reduction with Few Quantum Queries
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandak...