implements Coin Flipping
This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.
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:
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.
acheck
Two single qubit quantum states $\\\psi(0) = c|0\\\rangle + s|1\\\rangle$ and $\\\psi(1) = c|0\\\rangle – s|1\\\rangle$, where $c, s \\\in \\\mathbb{R}$ are defined such that the angle between them is $\\\theta$.
$\\\theta$ is proposed to be $\\\pi / 9$. Thus, $\\\Phi(0) = \\\otimes_{k=1}^{n} \\\psi(0)$ and $\\\Phi(1) = \\\otimes_{k=1}^{n} \\\psi(1)$.
Final bits:
No content has been added to this section, yet!
| Description | Link |
|---|---|
| Based on "Unconditionally Secure Quantum Coin Tossing". | Link |
| A SimulaQron implementation of the quantum coin flipping protocol. | Link |
No content has been added to this section, yet!
implements Coin Flipping
This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.
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:
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.
acheck
Two single qubit quantum states $\\\psi(0) = c|0\\\rangle + s|1\\\rangle$ and $\\\psi(1) = c|0\\\rangle – s|1\\\rangle$, where $c, s \\\in \\\mathbb{R}$ are defined such that the angle between them is $\\\theta$.
$\\\theta$ is proposed to be $\\\pi / 9$. Thus, $\\\Phi(0) = \\\otimes_{k=1}^{n} \\\psi(0)$ and $\\\Phi(1) = \\\otimes_{k=1}^{n} \\\psi(1)$.
Final bits:
No content has been added to this section, yet!
| Description | Link |
|---|---|
| Based on "Unconditionally Secure Quantum Coin Tossing". | Link |
| A SimulaQron implementation of the quantum coin flipping protocol. | Link |
No content has been added to this section, yet!
implements Coin Flipping
This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.
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:
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.
acheck
Two single qubit quantum states $\\\psi(0) = c|0\\\rangle + s|1\\\rangle$ and $\\\psi(1) = c|0\\\rangle – s|1\\\rangle$, where $c, s \\\in \\\mathbb{R}$ are defined such that the angle between them is $\\\theta$.
$\\\theta$ is proposed to be $\\\pi / 9$. Thus, $\\\Phi(0) = \\\otimes_{k=1}^{n} \\\psi(0)$ and $\\\Phi(1) = \\\otimes_{k=1}^{n} \\\psi(1)$.
Final bits:
No content has been added to this section, yet!
| Description | Link |
|---|---|
| Based on "Unconditionally Secure Quantum Coin Tossing". | Link |
| A SimulaQron implementation of the quantum coin flipping protocol. | Link |
No content has been added to this section, yet!
implements Coin Flipping
This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.
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:
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.
acheck
Two single qubit quantum states $\\\psi(0) = c|0\\\rangle + s|1\\\rangle$ and $\\\psi(1) = c|0\\\rangle – s|1\\\rangle$, where $c, s \\\in \\\mathbb{R}$ are defined such that the angle between them is $\\\theta$.
$\\\theta$ is proposed to be $\\\pi / 9$. Thus, $\\\Phi(0) = \\\otimes_{k=1}^{n} \\\psi(0)$ and $\\\Phi(1) = \\\otimes_{k=1}^{n} \\\psi(1)$.
Final bits:
No content has been added to this section, yet!
No content has been added to this section, yet!
implements Coin Flipping
This protocol allows two remote participants to share a uniformly distributed random bit. The parties do not trust each other and can only use classical and quantum channels to communicate. The protocol allows them to perform what coin tossing for nearby parties performs without the involvement of any trusted third party.
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:
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.
acheck
Two single qubit quantum states $\\\psi(0) = c|0\\\rangle + s|1\\\rangle$ and $\\\psi(1) = c|0\\\rangle – s|1\\\rangle$, where $c, s \\\in \\\mathbb{R}$ are defined such that the angle between them is $\\\theta$.
$\\\theta$ is proposed to be $\\\pi / 9$. Thus, $\\\Phi(0) = \\\otimes_{k=1}^{n} \\\psi(0)$ and $\\\Phi(1) = \\\otimes_{k=1}^{n} \\\psi(1)$.
Final bits:
No content has been added to this section, yet!
No content has been added to this section, yet!