Preprint
Aug 2026
Optimal and Deterministic Quantum Search on the Simplex of Complete Graphs
The first analytical proof of optimal quantum search on the simplex of complete graphs is given, proving that it occurs when the weight of the bridges equals $M$ and that the optimal runtime is achieved more broadly whenever the weight is at least $\sqrt{M}$.
Kiyoji Huang Fujiwara, Yujia Shi, Thomas G. Wong
· 0 citations