Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
43 Publications
2019 | Conference Paper | LibreCat-ID: 13297 | 
Gharibian, S., & Parekh, O. (2019). Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut. Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 145, 31:1-31:17. https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31
LibreCat
| DOI
| Download (ext.)
2019 | Journal Article | LibreCat-ID: 13558 |
Gharibian, S., & Yirka, J. (2019). The complexity of simulating local measurements on quantum systems. Quantum, 3, 189. https://doi.org/10.22331/q-2019-09-30-189
LibreCat
| DOI
| Download (ext.)
2018 | Conference Paper | LibreCat-ID: 8162 |
Aldi, M., de Beaudrap, N., Gharibian, S., & Saeedi, S. (2018). On Efficiently Solvable Cases of Quantum k-SAT. In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, p. 38:1-38:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.38
LibreCat
| DOI
| Download (ext.)
| arXiv
2018 | Conference Paper | LibreCat-ID: 8161 |
Gharibian, S., Santha, M., Sikora, J., Sundaram, A., & Yirka, J. (2018). Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2). In I. Potapov, P. Spirakis, & J. Worrell (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) (Vol. 117, p. 58:1-58:16). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2018.58
LibreCat
| DOI
| Download (ext.)
| arXiv
2018 | Conference Paper | LibreCat-ID: 8160 |
Gharibian, S., & Yirka, J. (2018). The Complexity of Simulating Local Measurements on Quantum Systems. In M. Wilde (Ed.), 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017) (Vol. 73, p. 2:1-2:17). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.TQC.2017.2
LibreCat
| DOI
| Download (ext.)
| arXiv
2018 | Journal Article | LibreCat-ID: 8167 |
Gharibian, S., & Sikora, J. (2018). Ground State Connectivity of Local Hamiltonians. ACM Transactions on Computation Theory (TOCT), 10(2), 8:1-8:28. https://doi.org/10.1145/3186587
LibreCat
| DOI
| Download (ext.)
| arXiv
2016 | Conference Paper | LibreCat-ID: 8159 |
de Beaudrap, N., & Gharibian, S. (2016). A Linear Time Algorithm for Quantum 2-SAT. In R. Raz (Ed.), Proceedings of the 31st Conference on Computational Complexity (CCC 2016) (Vol. 50, p. 27:1-17:21). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.CCC.2016.27
LibreCat
| DOI
| Download (ext.)
| arXiv
2015 | Conference Paper | LibreCat-ID: 8164 |
Gharibian, S., & Sikora, J. (2015). Ground State Connectivity of Local Hamiltonians. In M. M. Halld{\’o}rsson, K. Iwama, N. Kobayashi, & B. Speckmann (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2015) (pp. 617–628). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-47672-7_50
LibreCat
| DOI
| Download (ext.)
| arXiv
2015 | Journal Article | LibreCat-ID: 8166 |
Gharibian, S., Huang, Y., Landau, Z., & Woo Shin, S. (2015). Quantum Hamiltonian Complexity. Foundations and Trends® in Theoretical Computer Science, 10(3), 159–282. https://doi.org/10.1561/0400000066
LibreCat
| DOI
| Download (ext.)
| arXiv
2015 | Journal Article | LibreCat-ID: 8168 |
Gharibian, S., Landau, Z., Woo Shin, S., & Wang, G. (2015). Tensor network non-zero testing. Quantum Information & Computation, 15(9{\ & }10), 885–899.
LibreCat
| Download (ext.)
| arXiv
2014 | Journal Article | LibreCat-ID: 8171 |
Gharibian, S., & Kempe, J. (2014). Hardness of approximation for quantum problems. Quantum Information & Computation, 14(5–6), 517–540.
LibreCat
| Download (ext.)
| arXiv
2014 | Journal Article | LibreCat-ID: 8172 |
W. Berry, D., Cleve, R., & Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Information & Computation, 14(1–2), 1–30.
LibreCat
| Download (ext.)
| arXiv
2013 | Dissertation | LibreCat-ID: 8425 |
Gharibian, S. (2013). Approximation, Proof Systems, and Correlations in a Quantum World.
LibreCat
| Files available
| Download (ext.)
| arXiv
2013 | Journal Article | LibreCat-ID: 8173 |
Gharibian, S., Sikora, J., & Upadhyay, S. (2013). QMA variants with polynomially many provers. Quantum Information & Computation, 13(1–2), 135–157.
LibreCat
| Download (ext.)
| arXiv
2012 | Conference Paper | LibreCat-ID: 8169 |
Gharibian, S., & Kempe, J. (2012). Hardness of Approximation for Quantum Problems. In A. Czumaj, K. Mehlhorn, A. Pitts, & R. Wattenhofer (Eds.), International Colloquium on Automata, Languages, and Programming (ICALP 2012) (pp. 387–398). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_33
LibreCat
| DOI
| Download (ext.)
| arXiv
2012 | Journal Article | LibreCat-ID: 8175 |
Gharibian, S., & Kempe, J. (2012). Approximation Algorithms for QMA-Complete Problems. SIAM Journal on Computing, 41(4), 1028–1050. https://doi.org/10.1137/110842272
LibreCat
| DOI
| Download (ext.)
| arXiv
2012 | Journal Article | LibreCat-ID: 8174 |
Gharibian, S. (2012). Quantifying nonclassicality with local unitary operations. Physical Review A, 86, 042106. https://doi.org/10.1103/PhysRevA.86.042106
LibreCat
| DOI
| Download (ext.)
| arXiv
2011 | Journal Article | LibreCat-ID: 8178 |
Gharibian, S., PIANI, M., ADESSO, G., CALSAMIGLIA, J., & HORODECKI, P. (2011). Characterizing Quantumness via Entanglement Creation. International Journal of Quantum Information, 09(07n08), 1701–1713. https://doi.org/10.1142/s0219749911008258
LibreCat
| DOI
| Download (ext.)
| arXiv
2011 | Conference Paper | LibreCat-ID: 8176 |
Gharibian, S., & Kempe, J. (2011). Approximation Algorithms for QMA-Complete Problems. IEEE Annual Conference on Computational Complexity (CCC 2011). 2011 IEEE 26th Annual Conference on Computational Complexity (CCC), San Jose, USA. https://doi.org/10.1109/ccc.2011.15
LibreCat
| DOI
| Download (ext.)
| arXiv
2011 | Journal Article | LibreCat-ID: 8177 |
Piani, M., Gharibian, S., Adesso, G., Calsamiglia, J., Horodecki, P., & Winter, A. (2011). All Nonclassical Correlations Can Be Activated into Distillable Entanglement. Physical Review Letters, 106(22). https://doi.org/10.1103/physrevlett.106.220403
LibreCat
| DOI
| Download (ext.)
| arXiv