Sciweavers

10 search results - page 2 / 2
» Exponential Separation of Quantum and Classical Non-interact...
Sort
View
COLT
2010
Springer
13 years 3 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 8 months 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
2004
Springer
114views Education» more  CORR 2004»
13 years 4 months ago
Quantum Communication Cannot Simulate a Public Coin
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
Dmitry Gavinsky, Julia Kempe, Ronald de Wolf
CORR
2006
Springer
97views Education» more  CORR 2006»
13 years 5 months ago
The one-way communication complexity of the Boolean Hidden Matching Problem
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
Iordanis Kerenidis, Ran Raz
CORR
2002
Springer
166views Education» more  CORR 2002»
13 years 4 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