Write, autoreview, editor, reviewer
3,129
edits
Quantum Fingerprinting: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary |
|||
| Line 1: | Line 1: | ||
This [https://arxiv.org/abs/quant-ph/0102001 example protocol] allows two parties (two quantum clients) to | This [https://arxiv.org/abs/quant-ph/0102001 example protocol] allows two parties (two quantum clients) to distinguish their quantum inputs while maintaining the privacy of their own input by comparing their fingerprints alone. The protocol does not permit the two parties to interact directly with each other, hence they send the fingerprints of their respective inputs to a trusted third party (quantum server), where the third party tests that distinguishes two unknown quantum fingerprints with high probability. The quantum fingerprints are exponentially shorter than the original inputs. | ||
</br></br> | </br></br> | ||
'''Tags:''' [[Fingerprinting]] | |||
'''Tags:''' Fingerprinting | |||
==Assumptions== | ==Assumptions== | ||
* | * The two quantum clients have no shared key in this protocol. | ||
* | * The server is trusted | ||
==Outline== | ==Outline== | ||
| Line 28: | Line 27: | ||
==Hardware Requirements== | ==Hardware Requirements== | ||
* Authenticated Quantum channel capable of sending a pair of qubits. | * Authenticated Quantum channel capable of sending a pair of qubits. | ||
* Quantum memory for server to store the fingerprints. | * Quantum memory for the server to store the fingerprints. | ||
* Measurement devices for the server. | * Measurement devices for the server. | ||
* A one-time quantum channel from both clients to the server. | |||
==Notation== | ==Notation== | ||
| Line 39: | Line 39: | ||
==Properties== | ==Properties== | ||
* The computational complexity of this protocol is <math>\mathcal{O}(\log{}n)</math>. | * The computational complexity of this protocol is <math>\mathcal{O}(\log{}n)</math>. | ||
* Given an <math>n</math>-bit input, the protocol requires a quantum fingerprint of minimum <math>\log{}n</math> bits which contains quantum information. | * Given an <math>n</math>-bit input, the protocol requires a quantum fingerprint of minimum <math>\log{}n</math> bits which contains quantum information. | ||
* The quantum fingerprint is defined as the state <math>|h_x\rangle</math>, where <math>{E(x)}</math> is the fingerprint of the input <math>x</math>. <math>{E_i(x)}</math> is the <math>{i^{th}}</math> bit of <math>{E(x)}</math>. </br> | * The quantum fingerprint is defined as the state <math>|h_x\rangle</math>, where <math>{E(x)}</math> is the fingerprint of the input <math>x</math>. <math>{E_i(x)}</math> is the <math>{i^{th}}</math> bit of <math>{E(x)}</math>. </br> | ||