The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems.

Daniel Gottesman Sandy Irani

Published in: Theory Comput. (2013)

Keyphrases

optimization problems
decision problems
polynomial hierarchy
quantum computation
np complete
benchmark problems
social networks
bayesian networks
computational complexity
object recognition
problems involving
difficult problems
graph coloring