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

Joonas Ilmavirta, Matti Lassas, Jinpeng Lu +2

We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $B\subset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2\in B$…