2 papers
quant-ph2025
Quantum Merlin-Arthur proof systems for synthesizing quantum states
Hugo Delavenne, François Le Gall, Yupan Liu +1
Complexity theory typically focuses on the difficulty of solving computational problems using classical inputs and outputs, even with a quantum computer. In the quantum world, it i…
quant-ph2024
Quantum State Synthesis: Relation with Decision Complexity Classes and Impossibility of Synthesis Error Reduction
Hugo Delavenne, François Le Gall
This work investigates the relationships between quantum state synthesis complexity classes (a recent concept in computational complexity that focuses on the complexity of preparin…