Sciweavers

95 search results - page 5 / 19
» Separating Quantum and Classical Learning
Sort
View
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 8 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
14 years 8 days ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 8 months ago
Quantum Time-Space Tradeoffs for Sorting
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Hartmut Klauck
STOC
2007
ACM
136views Algorithms» more  STOC 2007»
14 years 8 months ago
Exponential separations for one-way quantum communication complexity, with applications to cryptography
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, ...
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
13 years 8 months ago
On the Quantum Chromatic Number of a Graph
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
Peter J. Cameron, Ashley Montanaro, Michael W. New...