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