The database search thing is, according to my understanding, widely misinterpreted. As Wikipedia says:
Although the purpose of Grover’s algorithm is usually described as “searching a database”, it may be more accurate to describe it as “inverting a function”. In fact since the oracle for an unstructured database requires at least linear complexity, the algorithm cannot be used for actual databases.
To actually build Quantum Postgres, you need something that can store an enormous number of qubits, like a hard drive.
Yeah, no quantum postgres (or, pardon the namespace collision, no quantum Oracle), but maybe some unstructured tree search. Which could also be useful for game AIs, incidentally, since quadratic speedup can make a lot of difference there. But yeah, this depends on having fault-tolerant QC with many thousands or maybe hundreds of thousands qubits.
The database search thing is, according to my understanding, widely misinterpreted. As Wikipedia says:
To actually build Quantum Postgres, you need something that can store an enormous number of qubits, like a hard drive.
Yeah, no quantum postgres (or, pardon the namespace collision, no quantum Oracle), but maybe some unstructured tree search. Which could also be useful for game AIs, incidentally, since quadratic speedup can make a lot of difference there. But yeah, this depends on having fault-tolerant QC with many thousands or maybe hundreds of thousands qubits.