Sciweavers

342 search results - page 28 / 69
» Quantum Algorithms
Sort
View
GECCO
2008
Springer
168views Optimization» more  GECCO 2008»
14 years 11 months 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
75
Voted
ICALP
2005
Springer
15 years 3 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
81
Voted
ICALP
2003
Springer
15 years 3 months ago
Quantum Search on Bounded-Error Inputs
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
Peter Høyer, Michele Mosca, Ronald de Wolf
STOC
2006
ACM
166views Algorithms» more  STOC 2006»
15 years 10 months ago
New upper and lower bounds for randomized and quantum local search
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
Shengyu Zhang
FOCS
2009
IEEE
15 years 5 months ago
Two-Message Quantum Interactive Proofs Are in PSPACE
We prove that QIP(2), the class of problems having two-message quantum interactive proof systems, is a subset of PSPACE. This relationship is obtained by means of an efficient pa...
Rahul Jain, Sarvagya Upadhyay, John Watrous