Write
31
edits
Quantum Coin: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary |
|||
| Line 8: | Line 8: | ||
* '''Quantum coin Generation''' - The TTP chooses k random 4-bit strings, keeps them in secret and produce k quantum states. A newly issued quantum coin consists of a piece of paper glued to k quantum registers that hold k quantum states. The piece of paper contains a unique identification tag and k initially unmarked positions, where the i-th position has to be marked in k-bit classical register P when the corresponding quantum state is used in the verification protocol. | * '''Quantum coin Generation''' - The TTP chooses k random 4-bit strings, keeps them in secret and produce k quantum states. A newly issued quantum coin consists of a piece of paper glued to k quantum registers that hold k quantum states. The piece of paper contains a unique identification tag and k initially unmarked positions, where the i-th position has to be marked in k-bit classical register P when the corresponding quantum state is used in the verification protocol. | ||
* '''Quantum coin Verification''' - To verify a quantum coin through classical communication with the TTP, its holder sends the identification number of the quantum coin to the TTP. Then, the TTP and the coin holder exchange some classical information for choosing some quantum registers. The coin holder measures the chosen registers and sends their corresponding classical information to the TTP. The TTP verifies the authenticity of the coin by the secret information he possesses. | * '''Quantum coin Verification''' - To verify a quantum coin through classical communication with the TTP, its holder sends the identification number of the quantum coin to the TTP. Then, the TTP and the coin holder exchange some classical information for choosing some quantum registers. The coin holder measures the chosen registers and sends their corresponding classical information to the TTP. The TTP verifies the authenticity of the coin by the secret information he possesses. | ||
==Notations== | |||
* <math>HMP_4</math>-states: <math>|\alpha(x)\rangle=\dfrac{1}{2}\sum_{1\leq i\leq4}(-1)^{x_i}|i\rangle</math>, <math>x\in\{0, 1\}</math> | |||
==Requirements== | ==Requirements== | ||
| Line 13: | Line 15: | ||
== Properties == | == Properties == | ||
* '''General Features''': | * '''General Features''': | ||
** No need to quantum communication for quantum coin verification. | ** No need to quantum communication for quantum coin verification. | ||
| Line 48: | Line 48: | ||
<div style='text-align: right;'>''*contributed by Mashid Delavar''</div> | <div style='text-align: right;'>''*contributed by Mashid Delavar''</div> | ||
==Further Information== | |||
Gavinsky, Dmitry. "Quantum money with classical verification." 2012 IEEE 27th Conference on Computational Complexity. IEEE, 2012, Available at: http://users.math.cas.cz/~gavinsky/papers/QuMoClaV.pdf | |||