2661 search results - page 8 / 533 » Quantum Complexity Classes |
148
click to vote
COCO
2000
Springer
15 years 5 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
75
Voted
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract— Two-level quantum systems are important quantum models that are useful for the conceptual development and construction of quantum technologies. In this paper we provide...
134
click to vote
FCT
2005
Springer
15 years 6 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 ...
146
click to vote
LOGCOM
2010
14 years 7 months ago
2010
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
119
Voted
STACS
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...