Editing Distributing Graph States Over Arbitrary Quantum Networks
Jump to navigation
Jump to search
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 1: | Line 1: | ||
Under construction [https://arxiv.org/abs/1811.05445 Meignant, Markham and Grosshans (2019)] | |||
'''Tags:'''[[:Category:Specific Task|Specific Task | |||
'''Tags:'''[[:Category:Specific Task|Specific Task]] | |||
==Assumptions== | ==Assumptions== | ||
Line 13: | Line 14: | ||
==Outline== | ==Outline== | ||
The protocol [https://arxiv.org/abs/1811.05445 | 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 150: | Line 151: | ||
# [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;'>''*contributed by Lucas Arenstein''</div> | |||
<div style='text-align: right;'>'' | |||