The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP.

Dorit Aharonov Lior Eldar

Published in: Quantum Inf. Process. (2015)

Keyphrases

graph theory
graph representation
directed graph
graph matching
spanning tree
graph theoretic
computational complexity
np hard
data sets
graph partitioning
pattern recognition
database
graph structure
graph mining
graph databases
phase transition
multi objective
graph clustering
series parallel