Dorian Rudolph

dorian@campus.uni-paderborn.de
ID
57863

10 Publications

Mark all

[10]
2026 | Conference Paper | LibreCat-ID: 57866
Aldi M, Gharibian S, Rudolph D. An unholy trinity: TFNP, polynomial systems, and the quantum  satisfiability problem. In: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Vol 362. ; 2026:7:1-7:24.
LibreCat | arXiv
 
[9]
2026 | Preprint | LibreCat-ID: 67088
Gharibian S, Hecht C, Rudolph D. Semidefinite extension complexity of the separable set, with applications to approximate disentanglers. arXiv:260909033.
LibreCat | arXiv
 
[8]
2026 | Preprint | LibreCat-ID: 67292
Karaiskos G, Raza A, Rudolph D, Koh DE, Gharibian S. Verification Complexity and Extension of Classical Shadows. arXiv:260940107. Published online 2026.
LibreCat | arXiv
 
[7]
2026 | Preprint | LibreCat-ID: 67291
Rudolph D, Motamedi A, Sambrani D, et al. A physical and universal model of bosonic computations with Solovay-Kitaev theorem.
LibreCat
 
[6]
2026 | Conference Paper | LibreCat-ID: 61777
Karaiskos G, Rudolph D, Meyer JJ, Eisert J, Gharibian S. How hard is it to verify a classical shadow? In: International Colloquium on Automata, Languages, and Programming (ICALP). Vol 374. ; 2026:1-23.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Rudolph D, Gharibian S, Nagaj D. 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). Vol 325. ; 2025:1-24. doi:10.4230/LIPIcs.ITCS.2025.85
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Chabaud U, Gharibian S, Mehraban S, et al. Energy, Bosons and Computational Complexity. arXiv:251008545. Published online 2025.
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Kremer S-L, Rudolph D, Gharibian S. Quantum k-SAT Related Hypergraph Problems. arXiv:250617066. Published online 2025.
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS). Vol 306. ; 2024:7-17. doi:10.4230/LIPIcs.MFCS.2024.7
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian S, Rudolph D. On polynomially many queries to NP or QMA oracles. In: 13th Innovations in Theoretical Computer Science (ITCS 2022). Vol 215. ; 2022:1-27. doi:10.4230/LIPIcs.ITCS.2022.75
LibreCat | DOI | Download (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed

10 Publications

Mark all

[10]
2026 | Conference Paper | LibreCat-ID: 57866
Aldi M, Gharibian S, Rudolph D. An unholy trinity: TFNP, polynomial systems, and the quantum  satisfiability problem. In: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026). Vol 362. ; 2026:7:1-7:24.
LibreCat | arXiv
 
[9]
2026 | Preprint | LibreCat-ID: 67088
Gharibian S, Hecht C, Rudolph D. Semidefinite extension complexity of the separable set, with applications to approximate disentanglers. arXiv:260909033.
LibreCat | arXiv
 
[8]
2026 | Preprint | LibreCat-ID: 67292
Karaiskos G, Raza A, Rudolph D, Koh DE, Gharibian S. Verification Complexity and Extension of Classical Shadows. arXiv:260940107. Published online 2026.
LibreCat | arXiv
 
[7]
2026 | Preprint | LibreCat-ID: 67291
Rudolph D, Motamedi A, Sambrani D, et al. A physical and universal model of bosonic computations with Solovay-Kitaev theorem.
LibreCat
 
[6]
2026 | Conference Paper | LibreCat-ID: 61777
Karaiskos G, Rudolph D, Meyer JJ, Eisert J, Gharibian S. How hard is it to verify a classical shadow? In: International Colloquium on Automata, Languages, and Programming (ICALP). Vol 374. ; 2026:1-23.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Rudolph D, Gharibian S, Nagaj D. 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). Vol 325. ; 2025:1-24. doi:10.4230/LIPIcs.ITCS.2025.85
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Chabaud U, Gharibian S, Mehraban S, et al. Energy, Bosons and Computational Complexity. arXiv:251008545. Published online 2025.
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Kremer S-L, Rudolph D, Gharibian S. Quantum k-SAT Related Hypergraph Problems. arXiv:250617066. Published online 2025.
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Agarwal A, Gharibian S, Koppula V, Rudolph D. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. In: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS). Vol 306. ; 2024:7-17. doi:10.4230/LIPIcs.MFCS.2024.7
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian S, Rudolph D. On polynomially many queries to NP or QMA oracles. In: 13th Innovations in Theoretical Computer Science (ITCS 2022). Vol 215. ; 2022:1-27. doi:10.4230/LIPIcs.ITCS.2022.75
LibreCat | DOI | Download (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: AMA

Export / Embed