How to transform graph states using single-qubit operations: computational complexity and algorithms.
Axel DahlbergJonas HelsenStephanie WehnerPublished in: CoRR (2018)
Keyphrases
- computational complexity
- graph theory
- computational efficiency
- computational cost
- computationally efficient
- strongly connected components
- optimization problems
- special case
- significant improvement
- worst case
- motion estimation
- random walk
- np hard
- orders of magnitude
- directed graph
- weighted graph
- high computational complexity
- graph search
- data mining