Zobrazeno 1 - 1
of 1
pro vyhledávání: '"DalFavero, Benjamin"'
The optimal runtime of a quantum computer searching a database is typically cited as the square root of the number of items in the database, which is famously achieved by Grover's algorithm. With parallel oracles, however, it is possible to search fa
Externí odkaz:
http://arxiv.org/abs/2408.05376