Editing Distributing Graph States Over Arbitrary Quantum Networks (section)

==Properties==
* The optimality of the protocol depends on the network topology and the wanted graph state to distribute.
* Analysing the consumption of Bell pair between nodes and considering the worst case scenario that is to entangle each qubit with the opposite one over a line network we have the following upper bounds:
{| class="wikitable" 
|-
! Distribute
! Cost
! Bound
|-
|rowspan="2"| N-GHZ
| EPR
| <math>N-1</math>
|-
| T
| <math>1</math>
|-
|rowspan="2"| Arbitrary Graph State
| EPR
| <math>\left\lfloor \frac{N}{2} \right\rfloor^2</math>
|-
| T
| <math>\left\lfloor \frac{N}{2} \right\rfloor</math>
|-
|}