Dorian Rudolph

dorian@campus.uni-paderborn.de
ID
57863

10 Publications

Mark all

[10]
2026 | Conference Paper | LibreCat-ID: 57866
An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
M. Aldi, S. Gharibian, D. Rudolph, in: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026), 2026, p. 7:1-7:24.
LibreCat | arXiv
 
[9]
2026 | Preprint | LibreCat-ID: 67088
Semidefinite extension complexity of the separable set, with applications to approximate disentanglers
S. Gharibian, C. Hecht, D. Rudolph, ArXiv:2609.09033 (n.d.).
LibreCat | arXiv
 
[8]
2026 | Preprint | LibreCat-ID: 67292
Verification Complexity and Extension of Classical Shadows
G. Karaiskos, A. Raza, D. Rudolph, D.E. Koh, S. Gharibian, ArXiv:2609.40107 (2026).
LibreCat | arXiv
 
[7]
2026 | Preprint | LibreCat-ID: 67291
A physical and universal model of bosonic computations with Solovay-Kitaev theorem
D. Rudolph, A. Motamedi, D. Sambrani, H. Reza Naeij, U. Chabaud, S. Gharibian, S. Mehraban, (n.d.).
LibreCat
 
[6]
2026 | Conference Paper | LibreCat-ID: 61777
How hard is it to verify a classical shadow?
G. Karaiskos, D. Rudolph, J.J. Meyer, J. Eisert, S. Gharibian, in: International Colloquium on Automata, Languages, and Programming (ICALP), 2026, pp. 1–23.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
D. Rudolph, S. Gharibian, D. Nagaj, in: 16th Innovations in Theoretical Computer Science (ITCS), 2025, pp. 1–24.
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Energy, Bosons and Computational Complexity
U. Chabaud, S. Gharibian, S. Mehraban, A. Motamedi, H.R. Naeij, D. Rudolph, D. Sambrani, ArXiv:2510.08545 (2025).
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Quantum k-SAT Related Hypergraph Problems
S.-L. Kremer, D. Rudolph, S. Gharibian, ArXiv:2506.17066 (2025).
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2024, pp. 7–17.
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
On polynomially many queries to NP or QMA oracles
S. Gharibian, D. Rudolph, in: 13th Innovations in Theoretical Computer Science (ITCS 2022), 2022, pp. 1–27.
LibreCat | DOI | Download (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed

10 Publications

Mark all

[10]
2026 | Conference Paper | LibreCat-ID: 57866
An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem
M. Aldi, S. Gharibian, D. Rudolph, in: 17th Innovations in Theoretical Computer Science Conference (ITCS 2026), 2026, p. 7:1-7:24.
LibreCat | arXiv
 
[9]
2026 | Preprint | LibreCat-ID: 67088
Semidefinite extension complexity of the separable set, with applications to approximate disentanglers
S. Gharibian, C. Hecht, D. Rudolph, ArXiv:2609.09033 (n.d.).
LibreCat | arXiv
 
[8]
2026 | Preprint | LibreCat-ID: 67292
Verification Complexity and Extension of Classical Shadows
G. Karaiskos, A. Raza, D. Rudolph, D.E. Koh, S. Gharibian, ArXiv:2609.40107 (2026).
LibreCat | arXiv
 
[7]
2026 | Preprint | LibreCat-ID: 67291
A physical and universal model of bosonic computations with Solovay-Kitaev theorem
D. Rudolph, A. Motamedi, D. Sambrani, H. Reza Naeij, U. Chabaud, S. Gharibian, S. Mehraban, (n.d.).
LibreCat
 
[6]
2026 | Conference Paper | LibreCat-ID: 61777
How hard is it to verify a classical shadow?
G. Karaiskos, D. Rudolph, J.J. Meyer, J. Eisert, S. Gharibian, in: International Colloquium on Automata, Languages, and Programming (ICALP), 2026, pp. 1–23.
LibreCat | arXiv
 
[5]
2025 | Conference Paper | LibreCat-ID: 50272
Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete: Direct embeddings and black-box simulation
D. Rudolph, S. Gharibian, D. Nagaj, in: 16th Innovations in Theoretical Computer Science (ITCS), 2025, pp. 1–24.
LibreCat | DOI | arXiv
 
[4]
2025 | Preprint | LibreCat-ID: 61776
Energy, Bosons and Computational Complexity
U. Chabaud, S. Gharibian, S. Mehraban, A. Motamedi, H.R. Naeij, D. Rudolph, D. Sambrani, ArXiv:2510.08545 (2025).
LibreCat | arXiv
 
[3]
2025 | Preprint | LibreCat-ID: 60432
Quantum k-SAT Related Hypergraph Problems
S.-L. Kremer, D. Rudolph, S. Gharibian, ArXiv:2506.17066 (2025).
LibreCat | arXiv
 
[2]
2024 | Conference Paper | LibreCat-ID: 50273
Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds
A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph, in: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2024, pp. 7–17.
LibreCat | DOI | arXiv
 
[1]
2022 | Conference Paper | LibreCat-ID: 27160 | OA
On polynomially many queries to NP or QMA oracles
S. Gharibian, D. Rudolph, in: 13th Innovations in Theoretical Computer Science (ITCS 2022), 2022, pp. 1–27.
LibreCat | DOI | Download (ext.)
 
Marked Publication(s)

Search

Filter Publications

Display / Sort

Export / Embed