Skip to content

Author

Thomas G. Wong

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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