Wiesner Quantum Money: Difference between revisions

Wiesner Quantum Money (edit)

Revision as of 11:00, 9 May 2019

380 bytes added , 9 May 2019

no edit summary

Mahshid

Write

31

edits

@@ Line 1: / Line 1: @@
 A classical money/banknote has a unique serial number and the bank can provide a verification according to these serial numbers. However, Wiesner suggests that a quantum money has also a number of isolated two-state quantum system and the two-state systems are located in one of four states.
-Assumptions
-) The two state systems must be isolated from the rest of universe enoughly 2) When Wiesner wrote his thesis, there was no device operating in which the phase coherence of a two state system was preserved for longer then about a second
+'''Tags:''' [[:Category: Multi Party Protocols|Multi Party Protocols]], non-local games, [[:Category: Quantum Enhanced Classical Functionality|Quantum Enhanced Classical Functionality]], [[:Category: Specific Task|Specific Task]]
-OUTLINE Let’s us think that the money has twenty isoleted system Si, i=1....20. At the mint created two random binary sequences of twenty digits each which we can call M i and N i, i=1,,...20, M i = 0 or 1 and Ni = 0 or 1. Then the two-state systems are placed in one of the four states a, b, alpha, beta in accordance with the scheme shown in Fig.
+[[Category: Prepare and Measure Network Stage]]
-) Bank prepares a pair of orthonormal base states for each state system. Then two
+[[Category: Specific Tasks]]
-state system are located in one of the four states a, b, alpha, beta in accordance 2) The bank records all polarizations and their serial numbers. On the bank note/
+[[Category: Quantum Enhanced Classical Functionality]]
-quantum money the serial number can be seen, while polarizations are kept secret 3) If the money is returned to the mint, then check that if each isolated system is still in
+[[Category: Multi Party Protocols]]
-its initial state or not.
-) If someone copies the money then she/he cannot recover Ni because since she does
+==Assumptions==
-not know Mi. She does not know what measurement to make an Si NOTATION Si = isolated system Mi and Ni = random binary sequences a,b,alpha,beta = states REQUIREMENTS
+* The two-state systems must be isolated from the rest of universe, roughly.
-) Network stage: quantum memory network PROPERTIES
+* When Wiesner wrote his thesis, there was no device operating in which the phase coherence of a two-state system was preserved for longer than about a second.
-) Wiesner’s schema requires a central bank for verifying the money 2) The “qubit” was used firstly in Wiesner’s article 3) Pairs of conjugate variables has same relation with Heisenberg uncertanity principle Pseudocode Input: Product state of N qubit and a serial number Outout: approved/rejected
+==Outline==
-) Money has two component (|S>,k), k is a serial number of the banknote and S is a product state of N qubits. For every N qubits of the product states are choosen randomly in {|0>, |1>,|+>,| ->} 2) Serial numbers and their states are recorded and kept at the mint7 3) For verifying the money, the mint looks the serial number and their correspending
+Let the money have twenty isolated systems <math>S_i\in\{a, b, \alpha, \beta\}, i=1,...,20</math>. The mint creates two random binary sequences of twenty digits <math>M_i,N_i\in\{0,1\}</math> where <math>i=1,...,20</math>. Then, two-state systems are placed in one of four states <math>a, b, \alpha, \beta</math> as shown in Fig.
-states. Thus, each qubit is measured in the right basis, {|0>,|1>} or {|+>,|->}, and looked if corresponded to the classical description of the state. 4) If the result(measurement) <1, rejected (If somebody wants to copy a piece of quantum money, she can choose the measurement basis at random for each qubit of a quantum money state. For each qubit, If he guesses the right basis, she will find the right value with probability 1. In the other case, she will find the right value with probability 1/2. so, the probability that an attacker guesses correctly the quantum money state is (3/4)^N )
+# Bank prepares a pair of orthonormal base states for each state system. Then the two-state system is located in one of four states <math>a, b, \alpha, \beta</math>
-Furthermore Information
+# The bank records all polarizations and their serial numbers. On the banknote/quantum money the serial number can be seen, while polarizations are kept secret.
+# If the money is returned to the mint, it checks whether each isolated system is still in its initial state or not.
+Note that since no one except the Mint knows <math>M_i</math> and <math>N_i</math>, even if someone copies the money, he cannot recover the polarization.
+==Notation==
+*<math>S_i</math>= Isolated system
+*<math>M_i,N_i</math>= Random binary sequences
+*<math>a,b,\alpha,\beta</math>= States
+==Requirements==
+* Network stage: quantum memory network
+==Properties==
+* The scheme requires a central bank for verifying the money
+* Pairs of conjugate variables has the same relation with Heisenberg uncertainty principle
+* The success probability of the adversary in guessing the state of the target quantum money is <math>(3/4)^N</math>
+==Pseudocode==
+'''Input''': Product state of <math>N</math> qubit and a serial number</br>
+'''Output''': approved/rejected </br>
+'''Stage 1: Preparation'''
+# The Mint generate a quantum money composed of two component <math>(|S\rangle,k)</math> where <math>k</math> is the serial number of the banknote and <math>S</math> is a product state of <math>N</math> qubits. Each qubit is randomly chosen from the set <math>\{|0\rangle,|1\rangle,|+\rangle,|-\rangle\}</math>
+# Serial numbers and their states are recorded and kept at the Mint
+'''Stage 2: Verification'''
+# The Mint looks for the serial number and the corresponding measurement basis in its database. Thus, each qubit is measured in the right basis,<math>\{|0\rangle,|1\rangle\}</math> or <math>\{|+\rangle,|-\rangle\}</math>.
+# The Mint outputs 1 if the result of the measurement corresponds with the data stored in its database, otherwise it returns 0.
+==Furthermore Information==
 http://users.cms.caltech.edu/~vidick/teaching/120_qcrypto/wiesner.pdf