Sciweavers

2661 search results - page 2 / 533
» Quantum Complexity Classes
Sort
View
STOC
2006
ACM
141views Algorithms» more  STOC 2006»
15 years 10 months ago
Zero-knowledge against quantum attacks
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...
John Watrous
ALT
2006
Springer
15 years 7 months ago
How Many Query Superpositions Are Needed to Learn?
Abstract. This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setti...
Jorge Castro
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 10 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
CORR
2004
Springer
76views Education» more  CORR 2004»
14 years 10 months ago
Quantum Complexity Classes
Tereza Tusarova
COCO
2001
Springer
161views Algorithms» more  COCO 2001»
15 years 2 months ago
Communication Complexity Lower Bounds by Polynomials
The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPRpairs). Some lower boun...
Harry Buhrman, Ronald de Wolf