523 search results - page 17 / 105 » On the Power of Quantum Proofs |
146
click to vote
ASIACRYPT
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We introduce weaker models for non-interactive zero knowledge, in which the dealer is not restricted to deal a truly random string and may also have access to the input t...
195
click to vote
COCO
2009
Springer
16 years 18 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
156
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...