Sciweavers

164 search results - page 1 / 33
» The Learnability of Quantum States
Sort
View
ECCC
2006
87views more  ECCC 2006»
13 years 4 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
ICALP
2001
Springer
13 years 9 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
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
13 years 9 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
ENTCS
2007
113views more  ENTCS 2007»
13 years 4 months ago
Quantum Programming With Mixed States
d abstract) Paolo Zuliani 1 Department of Computer Science Princeton University Princeton, NJ 08544, USA In this paper we offer a programming approach to quantum computation usin...
Paolo Zuliani
ALT
2006
Springer
14 years 1 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