Sciweavers

508 search results - page 52 / 102
» Quantum Computers
Sort
View
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
14 years 11 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson
COCO
2004
Springer
82views Algorithms» more  COCO 2004»
14 years 4 months ago
On the Power of Quantum Proofs
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
Ran Raz, Amir Shpilka
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 2 days ago
A multi-start quantum-inspired evolutionary algorithm for solving combinatorial optimization problems
Quantum-inspired evolutionary algorithms (QIEAs), as a subset of evolutionary computation, are based on the principles of quantum computing such as quantum bits and quantum superp...
Parvaz Mahdabi, Saeed Jalili, Mahdi Abadi
PPL
2010
97views more  PPL 2010»
13 years 9 months ago
On the Importance of Being Quantum
Game playing is commonly cited in debates concerning human versus machine intelligence, and Chess is often at the center of such debates. However, the role of Chess in delineating...
Selim G. Akl
COMPUTER
2000
96views more  COMPUTER 2000»
13 years 10 months ago
Beyond Bits: The Future of Quantum Information Processing
Andrew M. Steane, Eleanor G. Rieffel