Sciweavers

4084 search results - page 5 / 817
» The Method of Quantum Clustering
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Quantum clustering algorithms
By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, ...
Esma Aïmeur, Gilles Brassard, Sébastie...
ICPR
2008
IEEE
15 years 3 months ago
Graph drawing using quantum commute time
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
David Emms, Edwin R. Hancock, Richard C. Wilson
AIPS
2006
14 years 11 months ago
Automated Planning Using Quantum Computation
This paper presents an adaptation of the standard quantum search technique to enable application within Dynamic Programming, in order to optimise a Markov Decision Process. This i...
Sanjeev Naguleswaran, Langford B. White, I. Fuss
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 9 months ago
Inverting a permutation is as hard as unordered search
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
Ashwin Nayak
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
15 years 1 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson