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


2025 | Conference Paper | LibreCat-ID: 50272
Rudolph, Dorian, et al. “Quantum 2-SAT on Low Dimensional Systems Is $\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” 16th Innovations in Theoretical Computer Science (ITCS), vol. 325, no. 85, 2025, pp. 1–24, doi:10.4230/LIPIcs.ITCS.2025.85.
LibreCat | DOI | arXiv
 

2024 | Journal Article | LibreCat-ID: 48544 | OA
Gharibian, Sevag. “Guest Column: The 7 Faces of Quantum NP.” ACM SIGACT News, vol. 54, no. 4, 2024, pp. 54–91.
LibreCat | Files available | Download (ext.)
 

2024 | Conference Paper | LibreCat-ID: 50406
Gharibian, Sevag, and Jonas Kamminga. “BQP, Meet NP: Search-to-Decision Reductions and Approximate Counting.” Proceedings of 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP), vol. 297, no. 70, 2024, pp. 1–19.
LibreCat | arXiv
 

2024 | Preprint | LibreCat-ID: 55037
Buhrman, Harry, et al. “Beating Grover Search for Low-Energy Estimation and State Preparation.” ArXiv:2407.03073, 2024.
LibreCat | arXiv
 

2024 | Conference Paper | LibreCat-ID: 50273
Agarwal, Avantika, et al. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), vol. 306, no. 7, 2024, pp. 7–17, doi:10.4230/LIPIcs.MFCS.2024.7.
LibreCat | DOI | arXiv
 

2024 | Preprint | LibreCat-ID: 56950
Gharibian, Sevag, and Carsten Hecht. “Hardness of Approximation for Ground State Problems.” ArXiv:2411.04874, 2024.
LibreCat | arXiv
 

2024 | Preprint | LibreCat-ID: 56944
Huber, Felix, et al. “Second Order Cone Relaxations for Quantum Max Cut.” ArXiv:2411.04120, 2024.
LibreCat | arXiv
 

2024 | Preprint | LibreCat-ID: 57866
Aldi, Marco, et al. “An Unholy Trinity: TFNP, Polynomial Systems, and the Quantum  Satisfiability Problem.” ArXiv:2412.19623.
LibreCat | arXiv
 

2023 | Conference Paper | LibreCat-ID: 32407
Gharibian, Sevag, et al. “Improved Hardness Results for the Guided Local Hamiltonian Problem.” Proceedings of the 50th EATCS International Colloquium on Automata, Languages and Programming (ICALP), vol. 261, no. 32, 2023, pp. 1–19, doi:10.4230/LIPIcs.ICALP.2023.32.
LibreCat | DOI | arXiv
 

2023 | Journal Article | LibreCat-ID: 50271
Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture.” SIAM Journal on Computing, vol. 52, no. 4, Society for Industrial & Applied Mathematics (SIAM), 2023, pp. 1009–38, doi:10.1137/22m1513721.
LibreCat | DOI
 

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

2023 | Conference Paper | LibreCat-ID: 20841 | OA
Gharibian, Sevag, et al. “The Complexity of Translationally Invariant Problems beyond Ground State Energies.” Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science (STACS), vol. 254, 2023, p. 54:1-54:21, doi:https://doi.org/10.4230/LIPIcs.STACS.2023.54.
LibreCat | DOI | Download (ext.) | arXiv
 

2023 | Conference Paper | LibreCat-ID: 34138
Bittel, Lennart, et al. “The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate.” Proceedings of the 38th Computational Complexity Conference (CCC), vol. 264, no. 34, 2023, p. 34:1-34:24, doi:10.4230/LIPIcs.CCC.2023.34.
LibreCat | DOI | arXiv
 

2022 | Conference Paper | LibreCat-ID: 27531 | OA
Gharibian, Sevag, and François Le Gall. “Dequantizing the Quantum Singular Value Transformation: Hardness and  Applications to Quantum Chemistry and the Quantum PCP Conjecture.” Proceedings of the 54th ACM Symposium on Theory of Computing (STOC), 2022, pp. 19–32.
LibreCat | Download (ext.) | arXiv
 

2022 | Journal Article | LibreCat-ID: 34700
Gharibian, Sevag, et al. “Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2).” Computational Complexity, vol. 31, no. 2, 13, Springer Science and Business Media LLC, 2022, doi:10.1007/s00037-022-00231-8.
LibreCat | DOI
 

2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian, Sevag, and Dorian Rudolph. “On Polynomially Many Queries to NP or QMA Oracles.” 13th Innovations in Theoretical Computer Science (ITCS 2022), vol. 215, no. 75, 2022, pp. 1–27, doi:10.4230/LIPIcs.ITCS.2022.75.
LibreCat | DOI | Download (ext.)
 

2021 | Journal Article | LibreCat-ID: 29780
Broadbent, Anne, et al. “Towards Quantum One-Time Memories from Stateless Hardware.” Quantum, vol. 5, 429, Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften, 2021, doi:10.22331/q-2021-04-08-429.
LibreCat | DOI
 

2020 | Conference Paper | LibreCat-ID: 13226 | OA
Gharibian, Sevag, et al. “Oracle Complexity Classes and Local Measurements on Physical  Hamiltonians.” Proceedings of the 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 2020, p. 38.
LibreCat | Download (ext.) | arXiv
 

2020 | Conference Paper | LibreCat-ID: 8426
Broadbent, Anne, et al. “Towards Quantum One-Time Memories from Stateless Hardware.” Proceedings of the 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC), vol. 158, Leibniz International Proceedings in Informatics (LIPIcs), 2020, p. 6:1-6:25.
LibreCat | Download (ext.) | arXiv
 

2020 | Journal Article | LibreCat-ID: 16927 | OA
Gharibian, Sevag, et al. “On Efficiently Solvable Cases of Quantum K-SAT.” Communications in Mathematical Physics, 2020.
LibreCat | Download (ext.) | arXiv
 

Filters and Search Terms

(person=71541)

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed