2020-10-22

# Transforming graph states to Bell-pairs is NP-Complete

## Publication

### Publication

*
Quantum
,
Volume 4
p. 348
*

Critical to the construction of large scale quantum networks, i.e. a quantum internet, is the development of fast algorithms for managing entanglement present in the network. One fundamental building block for a quantum internet is the distribution of Bell pairs between distant nodes in the network. Here we focus on the problem of transforming multipartite entangled states into the tensor product of bipartite Bell pairs between specific nodes using only a certain class of local operations and classical communication. In particular we study the problem of deciding whether a given graph state, and in general a stabilizer state, can be transformed into a set of Bell pairs on specific vertices using only single-qubit Clifford operations, single-qubit Pauli measurements and classical communication. We prove that this problem is NP-Complete.

Additional Metadata | |
---|---|

doi.org/10.22331/q-2020-10-22-348 | |

Quantum | |

Quantum Software Consortium | |

Organisation | Algorithms and Complexity |

Dahlberg, A., Helsen, J., & Wehner, S. (2020). Transforming graph states to Bell-pairs is NP-Complete. Quantum, 4. doi:10.22331/q-2020-10-22-348 |