Classical searches are O(N). Grover's (quantum) algorithm can perform such searches in O(N^(1/2)) and is optimal, so what you're talking about can't be faster t

Classical searches are O(N). Grover's (quantum) algorithm can perform such searches in O(N^(1/2)) and is optimal, so what you're talking about can't be faster than that (without nonlocal variables or some nonsense like that).