Editing Travelling Ballot Based Protocol

This example protocol implements the task of [[Quantum Electronic Voting| Quantum E-voting. The protocol uses two entangled qudits, one as a blank ballot that travels from voter to voter and the second one for computing the election result.
The first quantum scheme in this category was introduced by Vaccaro and later improved.

==Assumptions==

==Outline==
We consider N voters who wish to cast their vote secretly. The election authority prepares an entangled state, keeps one of the qudits, and passes the other one as the ballot qudit. Each voter receives the ballot qudit from the previous voter, casts her vote by applying a unitary and then forwards the qudit to the next voter. In the end, the authority obtains the election outcome by measuring the two qudits.

==Notations==
* <math>V_{i}: i^{th}</math> voter
* c: number of possible candidates
* N: number of voters
* <math>v_{i}:</math> vote of <math>i^{th}</math> voter
* T: election authority
* m: number of yes votes

== Requirements ==
*  Quantum channel for qudit communication
* Qudit Measurement Device for election authority
* Quantum memory to store qudits

==Properties==
This type of protocol is subject to double voting and privacy attacks when several voters are colluding.
* Double voting: A corrupted voter can apply the “yes” unitary operation many times without being detected.
* Privacy attack: An adversary that corrupts voters <math>V_{k−1}</math> and <math>V_{k+1}</math> can learn how voter <math>V_k</math> voted with probability 1.
@@ Line 23: / Line 23: @@
 This type of protocol is subject to double voting and privacy attacks when several voters are colluding.
 * Double voting: A corrupted voter can apply the “yes” unitary operation many times without being detected.
-* Privacy attack: An adversary that corrupts voters <math>V_{k-1}</math> and <math>V_{k+1}</math> can learn how voter <math>V_k</math> voted with probability 1.
+* Privacy attack: An adversary that corrupts voters <math>V_{k−1}</math> and <math>V_{k+1}</math> can learn how voter <math>V_k</math> voted with probability 1.
-==Protocol Description==
-*Setup phase:
-T prepares the state <math>|\phi_0\rangle =\dfrac{1}{\sqrt{N}}\sum_{j=0}^{N-1}|j\rangle_V |j\rangle_T</math>, keeps the second qudit and passes the first to voter <math> V_1</math> as the ballot qudit.
-* Casting phase:
-For k = 1, ... ,N, <math>V_k </math>receives the ballot qudit and applies the unitary <math>U^{v_{k}}=\sum_{j=0}^{N-1}|j+1\rangle \langle j|</math>, where <math>v_k = 1</math> signifies a yes vote and <math>v_k = 0</math> a no vote.
-Then, <math> V_k</math> forwards the ballot qudit to the next voter <math>V_{k+1}</math> and <math> V_N</math> to T.
-* Tallying phase:
-The global state held by T after all voters have voted is:
-<math>|\phi_N\rangle =\dfrac{1}{\sqrt{N}}\sum_{j=0}^{N-1}|j+m\rangle_V|j\rangle_T</math>
-T measures the two qudits in the computational basis, subtracts the two results, and obtains the outcome m.
-==Further Information==
-<div style='text-align: right;'>''*contributed by Sara Sarfaraz''</div>