Transforming graph states to Bell-pairs is NP-Complete.
Axel DahlbergJonas HelsenStephanie WehnerPublished in: Quantum (2020)
Keyphrases
- np complete
- polynomial time complexity
- bounded treewidth
- randomly generated
- satisfiability problem
- graph theory
- np hard
- conjunctive queries
- random walk
- computational complexity
- state transition
- graph structure
- phase transition
- constraint satisfaction problems
- pairwise
- weighted graph
- structured data
- similarity scores
- data complexity
- graph theoretic
- origin destination
- pspace complete
- graph construction
- protein interaction
- graph matching
- graph representation
- graph partitioning
- decision problems
- directed graph
- reinforcement learning
- state space