5215 search results - page 30 / 1043 » Quantum clustering algorithms |
75
Voted
ICANNGA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. This paper proposes an automated quantum circuit synthesis approach, using a genetic algorithm. We consider the circuit as a successive rippling of the so-called gate sec...
105
click to vote
TOC
2010
14 years 4 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
70
Voted
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
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...
STOC
1998
ACM
15 years 1 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
STOC
1997
ACM
15 years 1 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...