Rudolph, Dorian, Sevag Gharibian, and Daniel 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

Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” ACM SIGACT News 54, no. 4 (2024): 54–91.
LibreCat: /record/48544

Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” ArXiv:2401.01633, 2024.
LibreCat: /record/50273
arXiv: 2401.01633

Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” In Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP), n.d.
LibreCat: /record/50406
arXiv: 2401.03943

Gharibian, Sevag, and Dorian Rudolph. “Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover  Interactive Proofs into Unentanglement.”https://doi.org/10.4230/LIPIcs.ITCS.2023.53__In 14th Innovations in Theoretical Computer Science (ITCS), 251:53:1-53:23, 2023.https://doi.org/10.4230/LIPIcs.ITCS.2023.53 .
LibreCat: /record/31872
DOI: 10.4230/LIPIcs.ITCS.2023.53
arXiv: 2206.05243

Gharibian, Sevag, James Watson, and Johannes 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), 254:54:1-54:21, 2023.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

Bittel, Lennart, Sevag Gharibian, and Martin Kliesch. “The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate.”https://doi.org/10.4230/LIPIcs.CCC.2023.34__In Proceedings of the 38th Computational Complexity Conference (CCC), 264:34:1-34:24. Leibniz International Proceedings in Informatics (LIPIcs), 2023.https://doi.org/10.4230/LIPIcs.CCC.2023.34 .
LibreCat: /record/34138
DOI: 10.4230/LIPIcs.CCC.2023.34
arXiv: 2211.12519

Gharibian, Sevag, Ryu Hayakawa, François Le Gall, and Tomoyuki Morimae. “Improved Hardness Results for the Guided Local Hamiltonian Problem.”https://doi.org/10.4230/LIPIcs.ICALP.2023.32__In Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), 261:1–19, 2023.https://doi.org/10.4230/LIPIcs.ICALP.2023.32 .
LibreCat: /record/32407
DOI: 10.4230/LIPIcs.ICALP.2023.32
arXiv: 2207.10250

Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.”https://doi.org/10.1137/22m1513721__SIAM Journal on Computing 52, no. 4 (2023): 1009–38.https://doi.org/10.1137/22m1513721 .
LibreCat: /record/50271
DOI: 10.1137/22m1513721

Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).”https://doi.org/10.1007/s00037-022-00231-8__Computational Complexity 31, no. 2 (2022).https://doi.org/10.1007/s00037-022-00231-8 .
LibreCat: /record/34700
DOI: 10.1007/s00037-022-00231-8

Gharibian, Sevag, and Dorian Rudolph. “On Polynomially Many Queries to NP or QMA Oracles.”https://doi.org/10.4230/LIPIcs.ITCS.2022.75__In 13th Innovations in Theoretical Computer Science (ITCS 2022), 215:1–27, 2022.https://doi.org/10.4230/LIPIcs.ITCS.2022.75 .
LibreCat: /record/27160
DOI: 10.4230/LIPIcs.ITCS.2022.75

Gharibian, Sevag, and François Le 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), 19–32, 2022.
LibreCat: /record/27531
arXiv: 2111.09079

Broadbent, Anne, Sevag Gharibian, and Hong-Sheng Zhou. “Towards Quantum One-Time Memories from Stateless Hardware.”https://doi.org/10.22331/q-2021-04-08-429__Quantum 5 (2021).https://doi.org/10.22331/q-2021-04-08-429 .
LibreCat: /record/29780
DOI: 10.22331/q-2021-04-08-429

Broadbent, Anne, Sevag Gharibian, and Hong-Sheng 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), 158:6:1-6:25. Leibniz International Proceedings in Informatics (LIPIcs), 2020.
LibreCat: /record/8426
arXiv: 1810.05226

Gharibian, Sevag, Marco Aldi, Niel de Beaudrap, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.” Communications in Mathematical Physics, 2020.
LibreCat: /record/16927
arXiv: 1712.09617

Gharibian, Sevag, Stephen Piddock, and Justin Yirka. “Oracle Complexity Classes and Local Measurements on Physical  Hamiltonians.” In Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 38, 2020.
LibreCat: /record/13226
arXiv: 1909.05981

Gharibian, Sevag, and Ojas Parekh. “Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut.”https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31__In Proceedings of the 22nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 145:31:1-31:17. Leibniz International Proceedings in Informatics (LIPIcs), 2019.https://doi.org/10.4230/LIPICS.APPROX-RANDOM.2019.31 .
LibreCat: /record/13297
DOI: 10.4230/LIPICS.APPROX-RANDOM.2019.31

Gharibian, Sevag, and Justinhttps://doi.org/10.22331/q-2019-09-30-189__Yirka. “The Complexity of Simulating Local Measurements on Quantum Systems.”https://doi.org/10.22331/q-2019-09-30-189__Quantum 3 (2019): 189.https://doi.org/10.22331/q-2019-09-30-189 .
LibreCat: /record/13558
DOI: 10.22331/q-2019-09-30-189

Aldi, Marco, Niel de Beaudrap, Sevag Gharibian, and Seyran Saeedi. “On Efficiently Solvable Cases of Quantum K-SAT.”https://doi.org/10.4230/LIPIcs.MFCS.2018.38__In 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:38:1-38:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.MFCS.2018.38 .
LibreCat: /record/8162
DOI: 10.4230/LIPIcs.MFCS.2018.38
arXiv: 1712.09617

Gharibian, Sevag, Miklos Santha, Jamie Sikora, Aarthi Sundaram, and Justin Yirka. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).”https://doi.org/10.4230/LIPIcs.MFCS.2018.58__In 43rd International Symposium on Mathematical Foundations  of Computer Science (MFCS 2018), edited by Igor Potapov, Paul Spirakis, and James Worrell, 117:58:1-58:16. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018.https://doi.org/10.4230/LIPIcs.MFCS.2018.58 .
LibreCat: /record/8161
DOI: 10.4230/LIPIcs.MFCS.2018.58
arXiv: 1805.11139