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.
4 Publications
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: 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