For bridge weight w=M, a continuous-time quantum walk on the simplex of complete graphs finds a marked vertex with 80% probability in O(sqrt(N)) time, the first analytical proof of optimal search on this graph, while numerics extend optimality to w>=sqrt(M).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal and Deterministic Quantum Search on the Simplex of Complete Graphs
For bridge weight w=M, a continuous-time quantum walk on the simplex of complete graphs finds a marked vertex with 80% probability in O(sqrt(N)) time, the first analytical proof of optimal search on this graph, while numerics extend optimality to w>=sqrt(M).