Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem

zbMatharXiv:2306.05253MaRDI QIDQ6510484

Matti Lassas, Lauri Ylinen, Joonas Ilmavirta, Jinpeng Lu, Lauri Oksanen

Publication date: 1 January 1

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Rigidity and flexibility of structures (aspects of discrete geometry) (52C25) Quantum algorithms and complexity in the theory of computing (68Q12)

This page was built for publication: Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem