Login / Signup
On the Hardness of Analyzing Quantum Programs Quantitatively.
Martin Avanzini
Georg Moser
Romain Péchoux
Simon Perdrix
Published in:
ESOP (2) (2024)
Keyphrases
</>
computational complexity
phase transition
quantum computation
ground truth
worst case
np hardness
programming environment
high level
quantum mechanics
quantum inspired