A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.
Introducing structure to expedite quantum searching
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Quantum Search without Global Diffusion
A recursive construction preserves O(sqrt(N)) quantum search complexity with local operations on tensor-decomposable partitions, eliminating the need for global diffusion via degeneracy in reflection angles.