2661 search results - page 23 / 533 » Quantum Complexity Classes |
112
click to vote
CRYPTO
2012
Springer
13 years 3 months ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
84
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
123
Voted
STOC
2007
ACM
16 years 28 days ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
COCO
2009
Springer
15 years 7 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
103
Voted
COCO
2008
Springer
15 years 2 months ago
2008
Springer
We present a new variant of the quantum adversary method. All adversary methods give lower bounds on the quantum query complexity of a function by bounding the change of a progres...