>It has been shown that a non-local hidden variable quantum computer could implement a search of an {\displaystyle N} N-item database in at most {\displaystyle O({\sqrt[{3}]{N}})} {\displaystyle O({\sqrt[{3}]{N}})} steps. This is faster than the {\displaystyle O({\sqrt {N}})} O({\sqrt {N}}) steps taken by Grover's algorithm.
From Wikipedia. I know jack shit about quantum computers but I know that local hidden variables aren't allowed. Combining that with the above, could the question of whether hidden variables exist at all be reduced to an experiment with a yes/no outcome?