Distributing Graph States Over Arbitrary Quantum Networks: Difference between revisions
Distributing Graph States Over Arbitrary Quantum Networks (edit)
Revision as of 20:04, 6 January 2022
, 6 January 2022Edit by Lucas: Corrections and suggestions from our last talk - Removed Kaushik's name
(Added the properties part. I'm going to send the images by email/slack) |
(Edit by Lucas: Corrections and suggestions from our last talk - Removed Kaushik's name) |
||
| Line 1: | Line 1: | ||
This protocol [https://arxiv.org/abs/1811.05445 (1)] implements the task of distributing arbitrary graph states over quantum networks of arbitrary topology. The goal is to distribute this states in a way that is most efficient in terms of the number of Bell pairs consumed and the number of operations realized by the protocol. | |||
'''Tags:'''[[:Category:Specific Task|Specific Task]], [[Entanglement Routing]] | |||
'''Tags:'''[[:Category:Specific Task|Specific Task]] | |||
==Assumptions== | ==Assumptions== | ||
| Line 14: | Line 13: | ||
==Outline== | ==Outline== | ||
The protocol [https://arxiv.org/abs/1811.05445 1] aims to distribute multipartite entangled states that are represented by graph states over fixed networks of arbitrary topology. They first introduce a protocol to distribute GHZ states that considering the assumptions takes a single time step and is optimal in terms of the Bell pair used. Their second protocol is a generalization of the first one and can distribute any arbitrary graph state using at most twice as many Bell pairs and steps than the optimal distributing protocol for the worst case scenario. | The protocol [https://arxiv.org/abs/1811.05445 (1)] aims to distribute multipartite entangled states that are represented by graph states over fixed networks of arbitrary topology. They first introduce a protocol to distribute GHZ states that considering the assumptions takes a single time step and is optimal in terms of the Bell pair used. Their second protocol is a generalization of the first one and can distribute any arbitrary graph state using at most twice as many Bell pairs and steps than the optimal distributing protocol for the worst case scenario. | ||
In this protocol a quantum network is represented as a graph | In this protocol a quantum network is represented as a graph | ||
| Line 151: | Line 150: | ||
# [https://arxiv.org/abs/1811.05445 Meignant, Markham and Grosshans (2019)] | # [https://arxiv.org/abs/1811.05445 Meignant, Markham and Grosshans (2019)] | ||
<div style='text-align: right;'>'' | <!-- Version 1 --> | ||
<div style='text-align: right;'>''Contributed by Lucas Arenstein during the QOSF Mentorship Program''</div> | |||
<div style='text-align: right;'>''Mentor: Shraddha Singh</div> | |||