2661 search results - page 21 / 533 » Quantum Complexity Classes |
127
Voted
CORR
2011
Springer
14 years 7 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...
107
Voted
ICALP
2001
Springer
15 years 5 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...
95
Voted
TCS
2002
15 years 7 days ago
2002
We discuss several complexity measures for Boolean functions: certi cate complexity, sensitivity, block sensitivity, and the degree of a representing or approximating polynomial. ...
139
click to vote
COCO
2005
Springer
15 years 6 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
102
click to vote
STOC
2004
ACM
16 years 27 days ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...