Sciweavers

3 search results - page 1 / 1
» On the Hardness of Distinguishing Mixed-State Quantum Comput...
Sort
View
STACS
2005
Springer
14 years 4 months ago
Quantum Interactive Proofs with Competing Provers
This paper studies quantum refereed games, which are quantum interactive proof systems with two competing provers: one that tries to convince the verifier to accept and the other...
Gus Gutoski, John Watrous
EUROCRYPT
2005
Springer
14 years 4 months ago
Computational Indistinguishability Between Quantum States and Its Cryptographic Application
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...
Akinori Kawachi, Takeshi Koshiba, Harumichi Nishim...