Sciweavers

5215 search results - page 23 / 1043
» Quantum clustering algorithms
Sort
View
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 10 months ago
Toward a general theory of quantum games
We study properties of quantum strategies, which are complete specifications of a given party's actions in any multiple-round interaction involving the exchange of quantum in...
Gus Gutoski, John Watrous
FOCS
1998
IEEE
14 years 2 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
COCO
2008
Springer
118views Algorithms» more  COCO 2008»
13 years 11 months ago
Quantum Expanders: Motivation and Constructions
: We define quantum expanders in a natural way. We give two constructions of quantum expanders, both based on classical expander constructions. The first construction is algebraic,...
Avraham Ben-Aroya, Oded Schwartz, Amnon Ta-Shma
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 4 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
IPPS
2006
IEEE
14 years 3 months ago
Multiple sequence alignment by quantum genetic algorithm
In this paper we describe a new approach for the well known problem in bioinformatics: Multiple Sequence Alignment (MSA). MSA is fundamental task as it represents an essential pla...
L. Abdesslem, M. Soham, B. Mohamed