Editing Quantum Strong Coin Flipping (section)

==Outline==

We consider two parties who wish to perform a coin tossing experiment remotely.
Two single qubit quantum states are initially decided which have equal probability distribution in the computational basis and label them 0 and 1.
The Coin Tossing protocol consists of 5 steps:

# Both the parties prepare an equal number of random bits.
# Now, both parties prepare another equal number of random bits for each random bit prepared in step 1. For each random bit thus prepared, each party sends the other party a pair of qubits in the two states defined earlier, the sequence of which is decided by the random bit. 
# Both the parties now announce the xor of each random bit prepared in the second step with the corresponding random bit from the first step. Based on the value of the xor operation performed by the other party, each party returns one of the two qubits it received in the second step. For every random bit prepared in the first step, each party is now left with qubits in the state labelled by the other party's random bit.
# Both the parties now announce their random bits which they prepared in the first step. They also measure the qubits they did not return based on the values of the random bits announced by the other party. If any of the measurement fails, the protocol aborts.
# For every random bit prepared in the first step, each party now also measures the qubits they were returned back. If any of the measurement fails, the protocol aborts.

The final bit of each of the party is the xor of xor of the random bits they prepared in the first step and xor of the bits they measured in the fourth step.
This final bit is the random bit which has come up in the 'coin toss'.
Thus ends the protocol.