Approximation algorithms for QMA-complete problems

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2011, Pages 178-188

  Gharibian, Sevag ^a   Kempe, Julia ^b,c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b TEL AVIV UNIVERSITY   (Israel)

^c CNRS   (France)

Author keywords

Approximation algorithms; Exhaustive sampling; Local Hamiltonian; QMA complete

Indexed keywords

APPROXIMATION RATIOS; CONSTRAINT SATISFACTION PROBLEMS; EXHAUSTIVE SAMPLING; LOCAL HAMILTONIANS; NON-TRIVIAL; POLYNOMIAL-TIME; QMA-COMPLETE; QUANTUM SETTING; RESEARCH AREAS; SAMPLING METHOD; THEORETICAL COMPUTER SCIENCE;

COMPUTATIONAL COMPLEXITY; HAMILTONIANS; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 80052014767     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2011.15     Document Type: Conference Paper

References (63)

1. A. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation. American Mathematical Society, 2002.
2. Y.-K. Liu, "Consistency of local density matrices is QMA-complete," in Lect. Notes Comput. Sc., vol. 4110, 2006, pp. 438-449. (Pubitemid 44577551)
3. S. Bravyi. (2006) Efficient algorithm for a quantum analogue of 2-SAT. [Online]. Available: http://arxiv.org/abs/quant-ph/0602108
4. Y.-K. Liu, M. Christandl, and F. Verstraete, "Quantum computational complexity of the N-representability problem: QMA complete," Phys. Rev. Lett., vol. 98, p. 110503, 2007.
5. S. Beigi and P. W. Shor. (2007) On the complexity of computing zero-error and Holevo capacity of quantum channels. [Online]. Available: http://arxiv.org/abs/0709.2090
6. B. Rosgen, "Testing non-isometry is QMA-complete," Lect. Notes Comput. Sc., vol. 6519/2011, pp. 63-76, 2011.
7. S. P. Jordan, D. Gosset, and P. J. Love, "QMA-complete problems for stoquastic Hamiltonians and Markov matrices," Phys. Rev. A, vol. 81, no. 3, p. 032331, 2010.
8. N. Schuch and F. Verstraete, "Computational complexity of interacting electrons and fundamental limitations of density functional theory," Nature Phys., vol. 5, pp. 732-735, 2009.
9. T.-C. Wei, M. Mosca, and A. Nayak, "Interacting boson problems can be QMA hard," Phys. Rev. Lett., vol. 104, p. 040501, 2010.
10. J. Kempe and O. Regev, "3-local Hamiltonian is QMA-complete," Quantum Inf. Comp., vol. 3, no. 3, pp. 258-264, 2003. (Pubitemid 37189508)
11. R. Oliveira and B. M. Terhal, "The complexity of quantum spin systems on a two-dimensional square lattice," Quantum Inf. Comp., vol. 8, no. 10, pp. 0900-0924, 2008.
12. J. Kempe, A. Kitaev, and O. Regev, "The complexity of the local Hamiltonian problem," SIAM J. Comput., vol. 35, no. 5, pp. 1070-1097, 2006. (Pubitemid 44599919)
13. D. Aharonov, D. Gottesman, S. Irani, and J. Kempe, "The power of quantum systems on a line," Commun. Math. Phys., vol. 287, pp. 41-65, 2009.
14. S. Bravyi and M. Vyalyi, "Commutative version of the local Hamiltonian problem and common eigenspace problem," Quantum Inf. Comp., vol. 5, no. 3, pp. 187-215, 2005. (Pubitemid 40855852)
15. D. Aharanov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, "Adiabatic quantum computation is equivalent to standard quantum computation," SIAM J. Comput., vol. 37, no. 1, pp. 166-194, 2007. (Pubitemid 351321992)
16. S. Bravyi, D. P. Divincenzo, R. Oliveira, and B. M. Terhal, "The complexity of the stoquastic local Hamiltonian problems," Quantum Inf. Comp., vol. 8, no. 5, pp. 0361-0385, 2008.
17. D. Aharonov, I. Arad, Z. Landau, and U. Vazirani, "The detectibility lemma and quantum gap amplification," in Proc. 41st ACM Syposium on Theory of Computing (STOC 2009), vol. 287, 2009, pp. 417-426.
18. J. I. Cirac and F. Verstraete, "Renormalization and tensor product states in spin chains and lattices," J. Phys. A, vol. 42, no. 50, p. 504004, 2009.
19. C. R. Laumann, A. M. Läuchli, R. Moessner, A. Scardicchio, and S. L. Sondhi, "Product, generic, and random generic quantum satisfiability, " Phys. Rev. A, vol. 81, p. 062345, 2010.
20. N. Schuch and J. I. Cirac, "Matrix product state and mean-field solutions for one-dimensional systems can be found efficiently," Phys. Rev. A, vol. 82, p. 012314, 2010.
21. S. Arora and B. Barak, Computational Complexity: A Modern Approach. Cambridge University Press, 2009.
22. D. Hochbaum, Approximation Algorithms for NP-Hard Problems. Wadsworth Publishing Company, 1997.
23. V. Vazirani, Approximation Algorithms. Springer, 2001.
24. S. Aaronson. (2006) The quantum PCP manifesto. [Online]. Available: http://scottaaronson.com/blog/?p=139
25. S. Arora and S. Safra, "Probabilistic checking of proofs: A new characterization of NP," J. ACM, vol. 45, no. 1, pp. 70-122, 1998. (Pubitemid 128615465)
26. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and the hardness of approximation problems," J. ACM, vol. 45, no. 3, pp. 501-555, 1998. (Pubitemid 128506634)
27. S. Khanna, M. Sudan, L. Trevisan, and D. Williamson, "The approximability of constraint satisfaction problems," SIAM J. Comput., vol. 30, no. 6, pp. 1863-1920, 2001. (Pubitemid 34125441)
28. W. F. de la Vega, "MAX-CUT has a randomized approximation scheme in dense graphs," Random Struct. Algor., vol. 8, no. 3, pp. 187-198, 1996.
29. A. M. Frieze and R. Kannan, "The regularity lemma and approximation schemes dense problems," in Proc. 37th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1996), 1996, pp. 12-20.
30. O. Goldreich, S. Goldwasser, and D. Ron, "Property testing and its connection to learning and approximation," J. ACM, vol. 45, no. 4, pp. 653-750, 1998. (Pubitemid 128488791)
31. S. Arora, D. Karger, and M. Karpinski, "Polynomial time approximation schemes for dense instances of NP-hard problems," J. Comput. Syst. Sci., vol. 58, pp. 193-210, 1999.
32. W. F. de la Vega and M. Karpinski, "Polynomial time approximation of dense weighted instances of MAX-CUT," Random Struct. Algor., vol. 16, pp. 314-332, 2000.
33. N. Alon, W. F. de la Vega, R. Kannan, and M. Karpinski, "Random sampling and approximation of MAX-CSP problems," in Proc. 34th Symposium on Theory of Computing (STOC 2002), 2002, pp. 232-239. (Pubitemid 35009382)
34. C. Bazgan, W. F. de la Vega, and M. Karpinski, "Polynomial time approximation schemes for dense instances of minimum constraint satisfaction," Random Struct. Algor., vol. 23, no. 1, pp. 73-91, 2003.
35. W. F. de la Vega, M. Karpinski, R. Kannan, and S. Vempala, "Tensor decomposition and approximation schemes for constraint satisfaction problems," in Proc. 37th Symposium on Theory of Computing (STOC 2005). ACM Press, 2005, pp. 747-754. (Pubitemid 43098648)
36. M. Grötschel, L. Lovàsz, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, 1993.
37. S. R. White, "Density matrix formulation for quantum renor-malization groups," Phys. Rev. Lett., vol. 69, pp. 2863-2866, 1992.
38. S. R. White, "Density-matrix algorithms for quantum renor-malization groups," Phys. Rev. B, vol. 48, pp. 10 345-10 356, 1993.
39. S. Östlund and S. Rommer, "Thermodynamic limit of density matrix renormalization," Phys. Rev. Lett., vol. 75, pp. 3537-3540, 1995.
40. S. Rommer and S. Östlund, "Class of ansatz wave functions for one-dimensional spin systems and their relation to the density matrix renormalization group," Phys. Rev. B, vol. 55, pp. 2164-2181, 1997.
41. U. Schollwöck, "The density-matrix renormalization group," Rev. Mod. Phys., vol. 77, pp. 259-315, 2005. (Pubitemid 41490660)
42. I. Peschel, X. Wang, M. Kaulke, and K. H. (Edgs.), "Density-matrix renormalization - a new numerical method in physics," in Lect. Notes Phys., vol. 528. Springer-Verlag, 1998.
43. N. Bansal, S. Bravyi, and B. M. Terhal, "Classical approximation schemes for the ground-state energy of quantum and classical Ising spin Hamiltonians on planar graphs," Quantum Inf. Comp., vol. 9, no. 7&8, pp. 0701-0720, 2009.
44. D. Aharonov, I. Arad, and S. Irani, "Efficient algorithm for approximating one-dimensional ground states," Phys. Rev. A, vol. 82, p. 012315, 2010.
45. J. Håstad, "On the approximation resistance of a random predicate," in Lect. Notes Comput. Sc., vol. 4627, 2007, pp. 149-163.
46. P. Austrin and E. Mossel, "Approximation resistant predicates from pairwise independence," in Proc. 23rd IEEE Conference on Computational Complexity, 2008, pp. 249-258.
47. J. Håstad, "Some optimal inapproximability results," in Proc. 29th Symposium on Theory of Computing (STOC 1997), 1997, pp. 1-10.
48. M. Charikar, K. Makarychev, and Y. Makarychev, "Near-optimal algorithms for maximum constraint satisfaction problems," in Lect. Notes Comput. Sc., vol. 4627, 2007, pp. 149-
49. M. Lewin, D. Livnat, and U. Zwick, "Improved rounding techniques for MAX 2-SAT and MAX DI-CUT problems," in Proc. 9th International IPCO Conference on Integer Programming and Combinatorial Optimization (IPCO 2002), 2002, pp. 67-82.
50. S. Khot, "On the power of unique 2-prover 1-round games," in Proc. 34th Symposium on Theory of Computing (STOC 2002), 2002, pp. 767-775. (Pubitemid 35009440)
51. L. Trevisan, "Parallel approximation algorithms by positive linear programming," Algorithmica, vol. 21, no. 1, pp. 72-88, 1998. (Pubitemid 128664053)
52. G. Hast, "Approximating Max kCSP - outperforming a random assignment with almost a linear factor," in Proc. 32nd International Colloquium on Automata, Languages, and Programming (ICALP 2005), 2005, pp. 956-968. (Pubitemid 41436160)
53. A. Samorodnitsky and L. Trevisan, "Gowers uniformity, influences of variables, and PCPs," in Proc. 38th Symposium on Theory of Computing (STOC 2006), 2006, pp. 11-20. (Pubitemid 44306533)
54. A. C. Doherty, P. A. Parrilo, and F. M. Spedalieri, "Complete family of separability criteria," Phys. Rev. A, vol. 69, p. 022308, 2004.
55. R. Jain, Z. Ji, S. Upadhyay, and J. Watrous, "QIP=PSPACE," in Proc. 42nd Symposium on Theory of Computing (STOC 2010), 2010, pp. 573-581.
56. T. Lee, R. Mittal, B. W. Reichardt, and R. Spalek. (2010) An adversary for algorithms. [Online]. Available: http://arxiv.org/abs/1011.3020
57. S. Tamaryan, T.-C. Wei, and D. Park, "Maximally entangled three-qubit states via geometric measure of entanglement," Phys. Rev. A, vol. 80, p. 052315, 2009.
58. T.-C. Wei and P. M. Goldbart, "Geometric measure of entanglement and applications to bipartite and multipartite quantum states," Phys. Rev. A, vol. 68, p. 042307, 2003.
59. G. Kimura, "The Bloch vector for N-level systems," Phys. Lett. A, vol. 314, no. 5, Aug. 2003.
60. W. Höffding, "Probability inequalities for sums of bounded random variables," J. Am. Stat. Assoc., vol. 58, no. 301, pp. 13-30, 1964.
61. J. Watrous, "Semidefinite programs for completely bounded norms," Theory of Comput., vol. 5, pp. 217-238, 2009.
62. M. Bellare and J. Rompel, "Randomness-efficient oblivious sampling," in Proc. 28th Annual IEEE Symposium on the Foundations of Computer Science (FOCS 1994), 1994, pp. 276-287.
63. M. Bellare, O. Goldreich, and S. Goldwasser, "Randomness in interactive proofs," Comput. Complex., vol. 3, pp. 319-354, 1993.