235 search results - page 15 / 47 » Quantum certificate complexity |
113
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
125
click to vote
CSL
2003
Springer
15 years 8 months ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
155
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...
129
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We consider the quantum complexities of the following three problems: searching an ordered list, sorting an un-ordered list, and deciding whether the numbers in a list are all dis...
116
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
— We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we sh...