D. Rudolph, S. Gharibian, and D. Nagaj, “Quantum 2-SAT on low dimensional systems is $\'6dathsfQMA_1$-complete:  Direct embeddings and black-box simulation,” arXiv:2401.02368. 2024.
LibreCat: /record/50272
arXiv: 2401.02368

S. Gharibian, “Guest Column: The 7 faces of quantum NP,” ACM SIGACT News, vol. 54, no. 4, pp. 54–91, 2024.
LibreCat: /record/48544

A. Agarwal, S. Gharibian, V. Koppula, and D. Rudolph, “Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds,” arXiv:2401.01633. 2024.
LibreCat: /record/50273
arXiv: 2401.01633

S. Gharibian and J. Kamminga, “BQP, meet NP: Search-to-decision reductions and approximate counting.”
LibreCat: /record/50406
arXiv: 2401.03943

S. Gharibian and D. Rudolph, “Quantum space, ground space traversal, and how to embed multi-prover  interactive proofs into unentanglement,”10.4230/LIPIcs.ITCS.2023.53__in 14th Innovations in Theoretical Computer Science (ITCS), 2023, vol. 251, p. 53:1-53:23, doi:10.4230/LIPIcs.ITCS.2023.53 .
LibreCat: /record/31872
DOI: 10.4230/LIPIcs.ITCS.2023.53
arXiv: 2206.05243

S. Gharibian, J. Watson, and J. Bausch, “The Complexity of Translationally Invariant Problems beyond Ground State Energies,”https://doi.org/10.4230/LIPIcs.STACS.2023.54__in Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), 2023, vol. 254, p. 54:1-54:21, doi:https://doi.org/10.4230/LIPIcs.STACS.2023.54 .
LibreCat: /record/20841
DOI: https://doi.org/10.4230/LIPIcs.STACS.2023.54
arXiv: 2012.12717

L. Bittel, S. Gharibian, and M. Kliesch, “The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate,”10.4230/LIPIcs.CCC.2023.34__in Proceedings of the 38th Computational Complexity Conference (CCC), 2023, vol. 264, no. 34, p. 34:1-34:24, doi:10.4230/LIPIcs.CCC.2023.34 .
LibreCat: /record/34138
DOI: 10.4230/LIPIcs.CCC.2023.34
arXiv: 2211.12519

S. Gharibian, R. Hayakawa, F. L. Gall, and T. Morimae, “Improved Hardness Results for the Guided Local Hamiltonian Problem,”10.4230/LIPIcs.ICALP.2023.32__in Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 2023, vol. 261, no. 32, pp. 1–19, doi:10.4230/LIPIcs.ICALP.2023.32 .
LibreCat: /record/32407
DOI: 10.4230/LIPIcs.ICALP.2023.32
arXiv: 2207.10250

S. Gharibian and F. Le Gall, “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture,”10.1137/22m1513721__SIAM Journal on Computing, vol. 52, no. 4, pp. 1009–1038, 2023, doi:10.1137/22m1513721 .
LibreCat: /record/50271
DOI: 10.1137/22m1513721

S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum generalizations of the polynomial hierarchy with applications to QMA(2),”10.1007/s00037-022-00231-8__Computational Complexity, vol. 31, no. 2, Art. no. 13, 2022, doi:10.1007/s00037-022-00231-8 .
LibreCat: /record/34700
DOI: 10.1007/s00037-022-00231-8

S. Gharibian and D. Rudolph, “On polynomially many queries to NP or QMA oracles,”10.4230/LIPIcs.ITCS.2022.75__in 13th Innovations in Theoretical Computer Science (ITCS 2022), 2022, vol. 215, no. 75, pp. 1–27, doi:10.4230/LIPIcs.ITCS.2022.75 .
LibreCat: /record/27160
DOI: 10.4230/LIPIcs.ITCS.2022.75

S. Gharibian and F. L. Gall, “Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture,” in Proceedings of the 54th ACM Symposium on Theory of Computing (STOC), 2022, pp. 19–32.
LibreCat: /record/27531
arXiv: 2111.09079

A. Broadbent, S. Gharibian, and H.-S. Zhou, “Towards Quantum One-Time Memories from Stateless Hardware,”10.22331/q-2021-04-08-429__Quantum, vol. 5, Art. no. 429, 2021, doi:10.22331/q-2021-04-08-429 .
LibreCat: /record/29780
DOI: 10.22331/q-2021-04-08-429

A. Broadbent, S. Gharibian, and H.-S. Zhou, “Towards Quantum One-Time Memories from Stateless Hardware,” in Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), 2020, vol. 158, p. 6:1-6:25.
LibreCat: /record/8426
arXiv: 1810.05226

S. Gharibian, M. Aldi, N. de Beaudrap, and S. Saeedi, “On efficiently solvable cases of Quantum k-SAT,” Communications in Mathematical Physics, 2020.
LibreCat: /record/16927
arXiv: 1712.09617

S. Gharibian, S. Piddock, and J. Yirka, “Oracle complexity classes and local measurements on physical  Hamiltonians,” in Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020, p. 38.
LibreCat: /record/13226
arXiv: 1909.05981

S. Gharibian and O. Parekh, “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut,”10.4230/LIPICS.APPROX-RANDOM.2019.31__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: /record/13297
DOI: 10.4230/LIPICS.APPROX-RANDOM.2019.31

S. Gharibian and J. Yirka, “The complexity of simulating local measurements on quantum systems,”10.22331/q-2019-09-30-189__Quantum, vol. 3, p. 189, 2019, doi:10.22331/q-2019-09-30-189 .
LibreCat: /record/13558
DOI: 10.22331/q-2019-09-30-189

M. Aldi, N. de Beaudrap, S. Gharibian, and S. Saeedi, “On Efficiently Solvable Cases of Quantum k-SAT,”10.4230/LIPIcs.MFCS.2018.38__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: /record/8162
DOI: 10.4230/LIPIcs.MFCS.2018.38
arXiv: 1712.09617

S. Gharibian, M. Santha, J. Sikora, A. Sundaram, and J. Yirka, “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2),”10.4230/LIPIcs.MFCS.2018.58__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: /record/8161
DOI: 10.4230/LIPIcs.MFCS.2018.58
arXiv: 1805.11139