20
edits
Quantum Fingerprinting: Difference between revisions
Undo revision 3457 by Marc (talk)
Tag: Rollback |
Tag: Undo |
||
| Line 1: | Line 1: | ||
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 | |||
* The fingerprints can consist of quantum information. | |||
==Outline== | ==Outline== | ||
Here, two quantum clients want to check if their quantum inputs are distinct while also keeping their inputs secret. They prepare quantum fingerprints of their individual inputs and send these states to the server. Next stage involves the server a SWAP test on the fingerprints to check their equality. This is repeated several times on the same fingerprints to reduce the error probability. | |||
</br> | </br> | ||
* '''Client's preparation''': | |||
** The client prepares the fingerprint of initial input sized <math>n</math>-bits. This fingerprint has a length of <math>\log_{}n</math> bits. The client now sends this fingerprint to the server through a quantum channel. Both the clients do this process simultaneously. | |||
* '''Client's preparation''': The client prepares the fingerprint of initial input sized <math>n</math>-bits. This fingerprint has a length of <math>\log_{}n</math> bits. The client now sends this fingerprint to the server through a quantum channel. Both the clients do this process simultaneously. | |||
* '''Server's preparation''': The server receives the two fingerprints from both the clients and prepares the operations to distinguish them. The server independently repeats the computation process with the fingerprints several times to reduce the error probability in detecting whether the equality of the two states. | * '''Server's preparation''': The server receives the two fingerprints from both the clients and prepares the operations to distinguish them. The server independently repeats the computation process with the fingerprints several times to reduce the error probability in detecting whether the equality of the two states. | ||
| Line 24: | Line 22: | ||
If the initial input of the two parties are equal, this would be inferred from the corresponding fingerprints with no error probability and the outcome of the protocol would be correct. However, if the two fingerprints are of different inputs, there exists a non-zero probability that the outcome of the protocol is incorrect. Therefore, there exists a one sided error in the measurement. This one sided error is reduced by repeating the server operations several times with the same fingerprints. | If the initial input of the two parties are equal, this would be inferred from the corresponding fingerprints with no error probability and the outcome of the protocol would be correct. However, if the two fingerprints are of different inputs, there exists a non-zero probability that the outcome of the protocol is incorrect. Therefore, there exists a one sided error in the measurement. This one sided error is reduced by repeating the server operations several times with the same fingerprints. | ||
==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== | ||
* <math>|h_x\rangle</math>, Quantum fingerprint for <math>n</math>-bit input <math>x</math>. | * <math>|h_x\rangle</math>, Quantum fingerprint for <math>n</math>-bit input <math>x</math>. | ||
<math>|h_x\rangle = \frac{1}{\sqrt{m}}\sum_{i=1}^{m} |i\rangle|E_i(x)\rangle</math> | |||
* <math>E(x)</math>, Fingerprint function associated with input <math>{x\in \{0, 1\}^n}</math> which maps <math>n</math>-bit input to <math>m</math>-bit fingerprint. | * <math>E(x)</math>, Fingerprint function associated with input <math>{x\in \{0, 1\}^n}</math> which maps <math>n</math>-bit input to <math>m</math>-bit fingerprint. | ||
* <math>\delta</math>, Fixed constant, such that <math>\delta<0</math>. | * <math>\delta</math>, Fixed constant, such that <math>\delta<0</math>. | ||
| Line 36: | Line 36: | ||
==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> | ||
* The hamming distance i.e. the number of positions between two strings of same length, at which the corresponding symbols are different, of <math>{E(x)}</math> and <math>{E(y)}</math> is at least <math>{(1+\delta)m}</math>. | * The hamming distance i.e. the number of positions between two strings of same length, at which the corresponding symbols are different, of <math>{E(x)}</math> and <math>{E(y)}</math> is at least <math>{(1+\delta)m}</math>. | ||
* Any two fingerprints, <math>|h_x\rangle</math> and <math>|h_y\rangle</math> have an inner product of at most <math>{\delta}</math>. | * Any two fingerprints, <math>|h_x\rangle</math> and <math>|h_y\rangle</math> have an inner product of at most <math>{\delta}</math>. | ||
| Line 56: | Line 54: | ||
'''Stage 2''': Server's preparation | '''Stage 2''': Server's preparation | ||
* Server prepares an ancilla qubit <math>|0\rangle</math> for final measurement purpose, and thus starts with the state <math>|0\rangle|h_x\rangle|h_y\rangle</math>. | * Server prepares an ancilla qubit <math>|0\rangle</math> for final measurement purpose, and thus starts with the state <math>|0\rangle|h_x\rangle|h_y\rangle</math>. | ||
* Server creates an entangled state by applying the gate | * Server creates an entangled state by applying the gate <math>G = {(H\otimes I)(c-SWAP)(H\otimes I)}</math>. | ||
<math>G = {(H\otimes I)(c-SWAP)(H\otimes I)}</math> | |||
* The server measures the first qubit and transmits the output to both the parties. | * The server measures the first qubit and transmits the output to both the parties. | ||