Dorian Rudolph

Photo
About

I'm a PhD student in quantum computation at Paderborn University, supervised by Sevag Gharibian.

[] mail at dorianrudolph dot com
CV(09/26)Research statementarXivGitHub

Research

My work is mainly in quantum complexity theory. I am also interested in continuous-variable quantum computation, quantum algorithms, cryptography, boson sampling and theoretical computer science in general.

Preprints:
  1. S. Grewal, D. Rudolph. QMA has perfect completeness. arXiv:2609.13032, 2026.
    • D. Rudolph, A. Motamedi, D. Sambrani, H. R. Naeij, U. Chabaud, S. Gharibian, S. Mehraban. A physical and universal model of bosonic computations with Solovay-Kitaev theorem. arXiv:2609.40226, 2026.
      • G. Karaiskos, A. Raza, D. Rudolph, D. E. Koh, S. Gharibian. Verification Complexity and Extension of Classical Shadows. arXiv:2609.40107, 2026.
        • D. Miloschewsky, S. Podder, D. Rudolph. Promises should be taken seriously: On relativization with promise problems. arXiv:2609.07945, 2026.
          • S. Gharibian, C. Hecht, D. Rudolph. Semidefinite extension complexity of the separable set, with applications to approximate disentanglers. arXiv:2609.09033, 2026.
            Publications and Talks
            1. D. Miloschewsky, S. Podder, D. Rudolph. En Route to a Standard QMA1 vs. QCMA Oracle Separation. arXiv:2604.26921, 2026.
            2. U. Chabaud, S. Gharibian, S. Mehraban, A. Motamedi, H. R. Naeij, D. Rudolph, D. Sambrani. Energy, Bosons and Computational Complexity. arXiv:2510.08545, 2025.
              • Accepted at TQC 2026.
              • Poster at QIP 2026.
            3. S. Grewal, D. Rudolph. On the Pure Quantum Polynomial Hierarchy and Quantified Hamiltonian Complexity. arXiv:2510.06522, 2025.
              • Accepted at ICALP 2026 and TQC 2026.
              • Poster at QIP 2026.
            4. G. Karaiskos, D. Rudolph, J. J. Meyer, J. Eisert, S. Gharibian. How hard is it to verify a classical shadow? arXiv:2510.08515, 2025.
              • Accepted at ICALP 2026.
              • Poster at QIP 2026.
            5. V. Upreti, D. Rudolph, U. Chabaud. Bounding the computational power of bosonic systems. arXiv:2503.03600, 2025.
            6. D. Rudolph. Towards a universal gateset for QMA1. arXiv:2411.02681, 2024.
            7. J. Kamminga, D. Rudolph. On the Complexity of Pure-State Consistency of Local Density Matrices. arXiv:2411.03096, 2024.
              • Proceedings of the 16th Innovations in Theoretical Computer Science Conference (ITCS 2026), DOI:10.4230/LIPIcs.ITCS.2026.83.
              • Talk at QIP 2025 (both authors are students).
            8. M. Aldi, S. Gharibian, D. Rudolph. An unholy trinity: TFNP, polynomial systems, and the quantum satisfiability problem. arXiv:2412.19623, 2024.
              • Proceedings of the 16th Innovations in Theoretical Computer Science Conference (ITCS 2026), DOI:10.4230/LIPIcs.ITCS.2026.7.
              • Talk at TQC 2024 (Theory of Quantum Computation, Communication and Cryptography).
              • Poster at QIP 2024 (Quantum Information Processing).
            9. D. Rudolph, S. Gharibian, D. Nagaj. Quantum 2-SAT on low dimensional systems is QMA1-complete: Direct embeddings and black-box simulation. arXiv:2401.02368, 2024.
            10. A. Agarwal, S. Gharibian, V. Koppula, D. Rudolph. Quantum Polynomial Hierarchies: Karp-Lipton, error reduction, and lower bounds. arXiv:2401.01633, 2024.
            11. S. Gharibian, D. Rudolph. Quantum space, ground space traversal, and how to embed multi-prover interactive proofs into unentanglement. arXiv:2206.05243, 2022.
            12. S. Gharibian, D. Rudolph. On polynomially many queries to NP or QMA oracles. arXiv:2111.02296, 2021.
            Non-quantum computing work:
            1. K. Hinnenthal, D. Rudolph, C. Scheideler. Shape Formation in a Three-dimensional Model for Hybrid Programmable Matter.
              • Talk at 36th European Workshop on Computational Geometry (ext. abstract), 2020.
            2. D. Rudolph. Approximating the Sweepwidth of Polygons with Holes.
              • Talk at 35th European Workshop on Computational Geometry (EuroCG) (ext. abstract), 2019.
            3. R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler. Shape Recognition by a Finite Automaton Robot.
            4. R. Gmyr, K. Hinnenthal, I. Kostitsyna, F. Kuhn, D. Rudolph, C. Scheideler, T. Strothmann. Forming tile shapes with simple robots.

            Theses

            1. Master thesis: On the Power of P with Access to a QMA Oracle.
              (Supervisor: Sevag Gharibian)
            2. Bachelor thesis: Decontaminating Planar Regions With Finite Automaton Robots and Tiles.
              (Supervisor: Christian Scheideler)
            Legal notice / Impressum / Privacy policy