2479 search results - page 11 / 496 » Quantum complexity theory |
FOCS
1998
IEEE
14 years 1 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
COCO
1998
Springer
14 years 1 months ago
1998
Springer
We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the p...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We describe a reduction from the problem of unordered search (with a unique solution) to the problem of inverting a permutation. Since there is a straightforward reduction in the ...
STOC
2006
ACM
14 years 9 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
IIR
2010
13 years 10 months ago
2010
In this work, we summarise the development of a ranking principle based on quantum probability theory, called the Quantum Probability Ranking Principle (QPRP), and we also provide...