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. (2026). An unholy trinity: TFNP, polynomial systems, and the quantum  satisfiability problem. 17th Innovations in Theoretical Computer Science Conference (ITCS 2026), 362, 7:1-7:24.
LibreCat | arXiv
 
[9]
2026 | Preprint | LibreCat-ID: 67088
Gharibian, S., Hecht, C., & Rudolph, D. (n.d.). Semidefinite extension complexity of the separable set, with applications to approximate disentanglers. In arXiv:2609.09033.
LibreCat | arXiv
 
[8]
2026 | Preprint | LibreCat-ID: 67292
Karaiskos, G., Raza, A., Rudolph, D., Koh, D. E., & Gharibian, S. (2026). Verification Complexity and Extension of Classical Shadows. In arXiv:2609.40107.
LibreCat | arXiv
 
[7]
2026 | Preprint | LibreCat-ID: 67291
Rudolph, D., Motamedi, A., Sambrani, D., Reza Naeij, H., Chabaud, U., Gharibian, S., & Mehraban, S. (n.d.). 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, J. J., Eisert, J., & Gharibian, S. (2026). How hard is it to verify a classical shadow? International Colloquium on Automata, Languages, and Programming (ICALP), 374(123), 1–23.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Rudolph, D., Gharibian, S., & Nagaj, D. (2025). 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), 325(85), 1–24. https://doi.org/10.4230/LIPIcs.ITCS.2025.85
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Chabaud, U., Gharibian, S., Mehraban, S., Motamedi, A., Naeij, H. R., Rudolph, D., & Sambrani, D. (2025). Energy, Bosons and Computational Complexity. In arXiv:2510.08545.
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Kremer, S.-L., Rudolph, D., & Gharibian, S. (2025). Quantum k-SAT Related Hypergraph Problems. In arXiv:2506.17066.
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Agarwal, A., Gharibian, S., Koppula, V., & Rudolph, D. (2024). Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower  bounds. Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 306(7), 7–17. https://doi.org/10.4230/LIPIcs.MFCS.2024.7
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
Gharibian, S., & Rudolph, D. (2022). On polynomially many queries to NP or QMA oracles. 13th Innovations in Theoretical Computer Science (ITCS 2022), 215(75), 1–27. https://doi.org/10.4230/LIPIcs.ITCS.2022.75
LibreCat | DOI | Download (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed

10 Publications

Mark all

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

Search

Filter Publications

Display / Sort

Citation Style: APA

Export / Embed