88 search results - page 18 / 18 » Quantum lower bounds by quantum arguments |
IMA
2003
Springer
13 years 10 months ago
2003
Springer
In extension of the bit commitment task and following work initiated by Crépeau and Kilian, we introduce and solve the problem of characterising the optimal rate at which a discr...
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distribu...
COCO
2008
Springer
13 years 6 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...