Transforming graph states to Bell-pairs is NP-Complete
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....
Main Authors: | Axel Dahlberg, Jonas Helsen, Stephanie Wehner |
---|---|
Format: | Article |
Language: | English |
Published: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2020-10-01
|
Series: | Quantum |
Online Access: | https://quantum-journal.org/papers/q-2020-10-22-348/pdf/ |
Similar Items
-
NP-Completeness : Some graph theoretic examples
by: Grahn, Samuel
Published: (2016) -
Bell Numbers of Complete Multipartite Graphs
by: Julian Allagan, et al.
Published: (2016-08-01) -
Partitioning to three matchings of given size is NP-complete for bipartite graphs
by: Pálvölgyi Dömötör
Published: (2014-12-01) -
Tatamibari is NP-complete
by: Adler, Aviv, et al.
Published: (2021) -
np-Pair Correlations in the Isovector Pairing Model
by: Feng Pan, et al.
Published: (2021-08-01)