Sciweavers

10 search results - page 2 / 2
» Quantum One-Way Communication is Exponentially Stronger Than...
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 5 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
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
STOC
2001
ACM
129views Algorithms» more  STOC 2001»
14 years 5 months ago
Interaction in quantum communication and the complexity of set disjointness
One of the most intriguing facts about communication using quantum states is that these states cannot be used to transmit more classical bits than the number of qubits used, yet i...
Hartmut Klauck, Ashwin Nayak, Amnon Ta-Shma, David...
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 1 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
QUANTUMCOMM
2009
Springer
13 years 11 months ago
The Case for Quantum Key Distribution
Quantum key distribution (QKD) promises secure key agreement by using quantum mechanical systems. We argue that QKD will be an important part of future cryptographic infrastructur...
Douglas Stebila, Michele Mosca, Norbert Lütke...