This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2011 26th Annual IEEE Conference on Computational Complexity
Approximation Algorithms for QMA-Complete Problems
San Jose, California USA
June 08-June 11
ISBN: 978-0-7695-4411-3
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and initiate its study. We present two main results. The first shows that a non-trivial approximation ratio can be obtained in the class NP using product states. The second result (which builds on the first one), gives a polynomial time (classical) algorithm providing a similar approximation ratio for dense instances of the problem. The latter result is based on an adaptation of the "exhaustive sampling method" by Arora et al. [J. Comp. Sys. Sci. 58, p.193 (1999)] to the quantum setting, and might be of independent interest.
Index Terms:
approximation algorithms, QMA-complete, local Hamiltonian, exhaustive sampling
Citation:
Sevag Gharibian, Julia Kempe, "Approximation Algorithms for QMA-Complete Problems," ccc, pp.178-188, 2011 26th Annual IEEE Conference on Computational Complexity, 2011
Usage of this product signifies your acceptance of the Terms of Use.