DocumentCode :
3080482
Title :
Classical vs Quantum Fingerprinting
Author :
Sanders, Barry
Author_Institution :
Inst. for Quantum Inf. Sci., Calgary Univ., Alta.
fYear :
2005
fDate :
21-21 May 2005
Firstpage :
2
Lastpage :
5
Abstract :
When communication is expensive, the important task of testing two binary strings for equality can be achieved by generating relatively short fingerprints of each string and comparing those fingerprints. Quantum fingerprinting, in which the fingerprint is encoded onto qubits (the quantum version of the bit), is significantly less expensive: exponentially better in the case of no shared randomness and potentially perfect for the case of shared entanglement. Single-qubit quantum fingerprinting is feasible, and we have demonstrated its advantages theoretically and experimentally
Keywords :
communication complexity; fingerprint identification; quantum computing; classical fingerprinting; quantum fingerprinting; qubit; Complexity theory; Distributed computing; Fingerprint recognition; Information science; Nonlinear optics; Protocols; Quantum computing; Quantum entanglement; Quantum mechanics; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multiple-Valued Logic, 2005. Proceedings. 35th International Symposium on
Conference_Location :
Calgary, BC
ISSN :
0195-623X
Print_ISBN :
0-7695-2336-6
Type :
conf
DOI :
10.1109/ISMVL.2005.13
Filename :
1423153
Link To Document :
بازگشت