7 Publications

Mark all

[7]
2026 | Conference Paper | LibreCat-ID: 57866
Aldi, Marco, Sevag Gharibian, and Dorian Rudolph. “An Unholy Trinity: TFNP, Polynomial Systems, and the Quantum  Satisfiability Problem.” In 17th Innovations in Theoretical Computer Science Conference (ITCS 2026), 362:7:1-7:24, 2026.
LibreCat | arXiv
 
[6]
2026 | Conference Paper | LibreCat-ID: 61777
Karaiskos, Georgios, Dorian Rudolph, Johannes Jakob Meyer, Jens Eisert, and Sevag Gharibian. “How Hard Is It to Verify a Classical Shadow?” In International Colloquium on Automata, Languages, and Programming (ICALP), 374:1–23, 2026.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Rudolph, Dorian, Sevag Gharibian, and Daniel Nagaj. “Quantum 2-SAT on Low Dimensional Systems Is $\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” In 16th Innovations in Theoretical Computer Science (ITCS), 325:1–24, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.85.
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Chabaud, Ulysse, Sevag Gharibian, Saeed Mehraban, Arsalan Motamedi, Hamid Reza Naeij, Dorian Rudolph, and Dhruva Sambrani. “Energy, Bosons and Computational Complexity.” ArXiv:2510.08545, 2025.
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Kremer, Simon-Luca, Dorian Rudolph, and Sevag Gharibian. “Quantum K-SAT Related Hypergraph Problems.” ArXiv:2506.17066, 2025.
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” In Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 306:7–17, 2024. https://doi.org/10.4230/LIPIcs.MFCS.2024.7.
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian, Sevag, and Dorian Rudolph. “On Polynomially Many Queries to NP or QMA Oracles.” In 13th Innovations in Theoretical Computer Science (ITCS 2022), 215:1–27, 2022. https://doi.org/10.4230/LIPIcs.ITCS.2022.75.
LibreCat | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed

7 Publications

Mark all

[7]
2026 | Conference Paper | LibreCat-ID: 57866
Aldi, Marco, Sevag Gharibian, and Dorian Rudolph. “An Unholy Trinity: TFNP, Polynomial Systems, and the Quantum  Satisfiability Problem.” In 17th Innovations in Theoretical Computer Science Conference (ITCS 2026), 362:7:1-7:24, 2026.
LibreCat | arXiv
 
[6]
2026 | Conference Paper | LibreCat-ID: 61777
Karaiskos, Georgios, Dorian Rudolph, Johannes Jakob Meyer, Jens Eisert, and Sevag Gharibian. “How Hard Is It to Verify a Classical Shadow?” In International Colloquium on Automata, Languages, and Programming (ICALP), 374:1–23, 2026.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Rudolph, Dorian, Sevag Gharibian, and Daniel Nagaj. “Quantum 2-SAT on Low Dimensional Systems Is $\mathsf{QMA}_1$-Complete:  Direct Embeddings and Black-Box Simulation.” In 16th Innovations in Theoretical Computer Science (ITCS), 325:1–24, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.85.
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Chabaud, Ulysse, Sevag Gharibian, Saeed Mehraban, Arsalan Motamedi, Hamid Reza Naeij, Dorian Rudolph, and Dhruva Sambrani. “Energy, Bosons and Computational Complexity.” ArXiv:2510.08545, 2025.
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Kremer, Simon-Luca, Dorian Rudolph, and Sevag Gharibian. “Quantum K-SAT Related Hypergraph Problems.” ArXiv:2506.17066, 2025.
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Agarwal, Avantika, Sevag Gharibian, Venkata Koppula, and Dorian Rudolph. “Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower  Bounds.” In Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 306:7–17, 2024. https://doi.org/10.4230/LIPIcs.MFCS.2024.7.
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian, Sevag, and Dorian Rudolph. “On Polynomially Many Queries to NP or QMA Oracles.” In 13th Innovations in Theoretical Computer Science (ITCS 2022), 215:1–27, 2022. https://doi.org/10.4230/LIPIcs.ITCS.2022.75.
LibreCat | DOI | Download (ext.)
 

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed