Quantum Constraint Problems can be complete for BQP, QCMA, and more. - Alex Meiburg (CoRR, 2021)

Reduction Rules and ILP Are All You Need: Minimal Directed Feedback Vertex Set. - Alex Meiburg (CoRR, 2022)

Generative Learning of Continuous Data by Tensor Networks. - Alex Meiburg; Jing Chen; Jacob Miller 003; Raphaëlle Tihon; Guillaume Rabusseau; Alejandro Perdomo-Ortiz (CoRR, 2023)

Complexity of Finding and Measuring Ground States in Quantum Systems - Alexander Meiburg (2023)

Inapproximability of Positive Semidefinite Permanents and Quantum State Tomography. - Alexander Meiburg (Algorithmica, 2023)

Quantum SAT Problems with Finite Sets of Projectors Are Complete for a Plethora of Classes. - Ricardo Rivera Cardoso; Alex Meiburg; Daniel Nagaj (TQC, 2025)

Bounding the Graph Capacity With Quantum Mechanics and Finite Automata. - Alexander Meiburg (IEEE Trans. Inf. Theory, 2025)