Write, autoreview, editor, reviewer
3,125
edits
Quantum Fingerprinting: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
| Line 7: | Line 7: | ||
* The two quantum clients have no shared key in this protocol. | * The two quantum clients have no shared key in this protocol. | ||
* The server is trusted | * 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 57: | 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. | ||