<s>
Quantum	B-Algorithm
fingerprinting	I-Algorithm
is	O
a	O
proposed	O
technique	O
that	O
uses	O
a	O
quantum	B-Architecture
computer	I-Architecture
to	O
generate	O
a	O
string	O
with	O
a	O
similar	O
function	O
to	O
the	O
cryptographic	B-Algorithm
hash	I-Algorithm
function	I-Algorithm
.	O
</s>
<s>
To	O
do	O
this	O
,	O
quantum	O
states	O
are	O
produced	O
from	O
the	O
O(logn )	O
-qubit	O
state	O
fingerprints	O
and	O
sent	O
to	O
the	O
referee	O
who	O
performs	O
the	O
Swap	B-Algorithm
test	I-Algorithm
to	O
detect	O
if	O
the	O
fingerprints	O
are	O
similar	O
or	O
different	O
with	O
a	O
high	O
probability	O
.	O
</s>
<s>
If	O
unconditional	O
guarantees	O
of	O
security	O
are	O
needed	O
,	O
and	O
if	O
it	O
is	O
impractical	O
for	O
the	O
communicating	O
parties	O
to	O
arrange	O
to	O
share	O
a	O
secret	O
that	O
can	O
be	O
used	O
in	O
a	O
Carter	O
–	O
Wegman	O
MAC	O
,	O
this	O
technique	O
might	O
one	O
day	O
be	O
faster	O
than	O
classical	O
techniques	O
given	O
a	O
quantum	B-Architecture
computer	I-Architecture
with	O
5	O
to	O
10	O
qubits	O
.	O
</s>
