Sciweavers

1713 search results - page 5 / 343
» On the Importance of Being Quantum
Sort
View
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 4 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
FOCS
1998
IEEE
15 years 1 months ago
The Quantum Communication Complexity of Sampling
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
Andris Ambainis, Leonard J. Schulman, Amnon Ta-Shm...
ALGORITHMICA
2002
104views more  ALGORITHMICA 2002»
14 years 9 months ago
Security of Quantum Key Distribution against All Collective Attacks
Security of quantum key distribution against sophisticated attacks is among the most important issues in quantum information theory. In this work we prove security against a very ...
Eli Biham, Michel Boyer, Gilles Brassard, Jeroen v...
COCO
2004
Springer
156views Algorithms» more  COCO 2004»
15 years 3 months ago
Multiparty Quantum Coin Flipping
We investigate coin-flipping protocols for multiple parties in a quantum broadcast setting: • We propose and motivate a definition for quantum broadcast. Our model of quantum ...
Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, He...
CORR
1999
Springer
138views Education» more  CORR 1999»
14 years 9 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo