121 search results - page 17 / 25 » The complexity of the Quantum Adiabatic Algorithm |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
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...
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
ANTS
2004
Springer
15 years 3 months ago
2004
Springer
Given an algebraic number field K, such that [K : Q] is constant, we show that the problem of computing the units group O∗ K is in the complexity class SPP. As a consequence, w...
112
Voted
FCT
2005
Springer
15 years 3 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
ISNN
2009
Springer
15 years 4 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...