{"doi":"10.1109/ccc.2011.15","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1101.3884","open_access":"1"}],"date_updated":"2023-02-28T11:04:02Z","publication_status":"published","publication_identifier":{"isbn":["9781457701795"]},"author":[{"full_name":"Gharibian, Sevag","last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379","id":"71541"},{"last_name":"Kempe","first_name":"Julia","full_name":"Kempe, Julia"}],"year":"2011","title":"Approximation Algorithms for QMA-Complete Problems","department":[{"_id":"623"},{"_id":"7"}],"type":"conference","date_created":"2019-03-01T12:06:18Z","abstract":[{"text":"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.","lang":"eng"}],"extern":"1","publication":"IEEE Annual Conference on Computational Complexity (CCC 2011)","user_id":"71541","publisher":"IEEE","_id":"8176","conference":{"name":"2011 IEEE 26th Annual Conference on Computational Complexity (CCC)","location":"San Jose, USA"},"status":"public","oa":"1","external_id":{"arxiv":["1101.3884"]},"citation":{"ieee":"S. Gharibian and J. Kempe, “Approximation Algorithms for QMA-Complete Problems,” presented at the 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA, 2011, doi: <a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>.","apa":"Gharibian, S., &#38; Kempe, J. (2011). Approximation Algorithms for QMA-Complete Problems. <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>. 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA. <a href=\"https://doi.org/10.1109/ccc.2011.15\">https://doi.org/10.1109/ccc.2011.15</a>","short":"S. Gharibian, J. Kempe, in: IEEE Annual Conference on Computational Complexity (CCC 2011), IEEE, 2011.","chicago":"Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” In <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/ccc.2011.15\">https://doi.org/10.1109/ccc.2011.15</a>.","mla":"Gharibian, Sevag, and Julia Kempe. “Approximation Algorithms for QMA-Complete Problems.” <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>.","bibtex":"@inproceedings{Gharibian_Kempe_2011, title={Approximation Algorithms for QMA-Complete Problems}, DOI={<a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>}, booktitle={IEEE Annual Conference on Computational Complexity (CCC 2011)}, publisher={IEEE}, author={Gharibian, Sevag and Kempe, Julia}, year={2011} }","ama":"Gharibian S, Kempe J. Approximation Algorithms for QMA-Complete Problems. In: <i>IEEE Annual Conference on Computational Complexity (CCC 2011)</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ccc.2011.15\">10.1109/ccc.2011.15</a>"}}