Sciweavers

88 search results - page 17 / 18
» Quantum lower bounds by quantum arguments
Sort
View
ALGORITHMICA
2002
94views more  ALGORITHMICA 2002»
13 years 5 months ago
The Quantum Black-Box Complexity of Majority
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...
Thomas P. Hayes, Samuel Kutin, Dieter van Melkebee...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 10 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
ASIACRYPT
2009
Springer
13 years 12 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
TIT
2008
105views more  TIT 2008»
13 years 3 months ago
State Discrimination With Post-Measurement Information
We introduce a new state discrimination problem in which we are given additional information about the state after the measurement, or more generally, after a quantum memory bound ...
Manuel A. Ballester, Stephanie Wehner, Andreas Win...
EUROCRYPT
2003
Springer
13 years 10 months ago
New Bounds in Secret-Key Agreement: The Gap between Formation and Secrecy Extraction
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
Renato Renner, Stefan Wolf