A non-unitary extension of Grover's algorithm achieves O(sqrt(N)) query complexity matching the optimal bound by using a single large rotation via block encoding and Chebyshev approximation, at the cost of one additional qubit.
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
UNVERDICTED 1representative citing papers
citing papers explorer
-
Non-unitary extension of Grover's search algorithm
A non-unitary extension of Grover's algorithm achieves O(sqrt(N)) query complexity matching the optimal bound by using a single large rotation via block encoding and Chebyshev approximation, at the cost of one additional qubit.