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.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
other 1
citation-polarity summary
fields
quant-ph 2verdicts
UNVERDICTED 2roles
other 1polarities
unclear 1representative citing papers
A layer-by-layer classical variational disentanglement algorithm compiles preparation circuits for matrix product states by minimizing bipartite entanglement to reduce bond dimensions.
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.