Sciweavers

95 search results - page 3 / 19
» Separating Quantum and Classical Learning
Sort
View
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 8 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
CORR
2011
Springer
193views Education» more  CORR 2011»
13 years 3 months ago
Advice Coins for Classical and Quantum Computation
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
Scott Aaronson, Andrew Drucker
NIPS
2003
13 years 10 months ago
Training a Quantum Neural Network
Most proposals for quantum neural networks have skipped over the problem of how to train the networks. The mechanics of quantum computing are different enough from classical compu...
Bob Ricks, Dan Ventura
ECCC
2006
87views more  ECCC 2006»
13 years 8 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
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
14 years 2 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski