Transforming graph states to Bell-pairs is NP-Complete.
Axel DahlbergJonas HelsenStephanie WehnerPublished in: CoRR (2019)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- graph representation
- np hard
- satisfiability problem
- randomly generated
- pairwise
- conjunctive queries
- pspace complete
- graph model
- constraint satisfaction problems
- directed graph
- graph structure
- graph theory
- undirected graph
- state transition
- similarity scores
- graph matching
- random walk
- transition matrix
- weighted graph
- directed acyclic graph
- connected components
- graph partitioning
- bipartite graph
- state transitions