Sciweavers

Share
8 search results - page 1 / 2
» Quantum versus Classical Learnability
Sort
View
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
10 years 1 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
ICALP
2001
Springer
10 years 1 months ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
ALGORITHMICA
2002
121views more  ALGORITHMICA 2002»
9 years 9 months ago
Sharp Quantum versus Classical Query Complexity Separations
We obtain the strongest separation between quantum and classical query complexity known to date--specifically, we define a black-box problem that requires exponentially many querie...
J. Niel de Beaudrap, Richard Cleve, John Watrous
ECCC
2006
87views more  ECCC 2006»
9 years 9 months ago
The Learnability of Quantum States
Traditional quantum state tomography requires a number of measurements that grows exponentially with the number of qubits n. But using ideas from computational learning theory, we...
Scott Aaronson
PPL
2010
147views more  PPL 2010»
9 years 7 months ago
Key Distribution versus Key Enhancement in Quantum Cryptography
It has been said that quantum cryptography in general o ers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, ...
Naya Nagy, Marius Nagy, Selim G. Akl
books