Editing Multipartite Entanglement Verification
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 10: | Line 10: | ||
==Outline== | ==Outline== | ||
This protocol is based on the work in [https://www.nature.com/articles/ncomms13251 W. McCutcheon, A. Pappa et al.]. The goal is for a specific party called the | This protocol is based on the work in [https://www.nature.com/articles/ncomms13251 W. McCutcheon, A. Pappa et al.]. The goal is for a specific party called the Verifier to check whether the source has shared a GHZ-state among the n-nodes network. It goes as follow: | ||
* '''Sharing phase:''' The source creates and shares an n-qubits quantum state to all the parties using a state generation resource and quantum channels. | * '''Sharing phase:''' The source creates and shares an n-qubits quantum state to all the parties using a state generation resource and quantum channels. | ||
* '''Verification phase:''' The verifier | * '''Verification phase:''' The verifier sends angles to each party that corresponds to measurement basis, using classical authenticated channels | ||
* Each party, including the verifier, measures its qubits in the basis indicated by the received angle. | |||
* It then sends its outcome to the verifier. | |||
* The Verifier checks the parity of the outcomes and broadcast if the shared state was a GHZ state. | |||
==Notation== | ==Notation== | ||
Line 47: | Line 50: | ||
\tau=\min_{U}\mbox{TD}(|\phi_{0}^{n} \rangle\langle \phi_{0}^{n}|, U|\psi \rangle \langle \psi | U^{\dagger} ) | \tau=\min_{U}\mbox{TD}(|\phi_{0}^{n} \rangle\langle \phi_{0}^{n}|, U|\psi \rangle \langle \psi | U^{\dagger} ) | ||
</math> | </math> | ||
and where TD is the trace distance and <math>U</math> is a quantum operation acting on <math>D</math> the subspace of dishonest parties involved in the protocol (ie a tensor product of an unitary operator on <math>D</math> and the identity operator on the rest) | and where TD is the trace distance and <math>U</math> is a quantum operation acting on <math>D</math> the subspace of dishonest parties involved in the protocol (ie a tensor product of an unitary operator on <math>D</math> and the identity operator on the rest). | ||
* This protocol still works in the presence of photon losses. | * This protocol still works in the presence of photon losses. | ||
* This protocol is composably secure meaning that it can be used as a subroutine in a bigger protocol. A direct application of this protocol is to perform it sequentially many times with a source sending state at each round and to randomly use the shared state at some point if the protocol has output 0 at each round. We then are sure up to a certain threshold that the shared state is a GHZ state. | |||
* This protocol is secure | |||
==Pseudo Code== | ==Pseudo Code== | ||
Line 81: | Line 81: | ||
:* Send the outcome <math>y_{i}</math> to the Verifier via the private classical channel resource . | :* Send the outcome <math>y_{i}</math> to the Verifier via the private classical channel resource . | ||
<li style="display: inline-block;"> [[File: | <li style="display: inline-block;"> [[File:ConcreteResourceThetaMEV.jpg|frame|400px|Abstract Cryptography figure for the MEV protocol. Each blue box is a converter representing a protocol a party is following and red boxes are the resources used.]]</li> | ||
==Further Information== | ==Further Information== |