Basic quantum subroutines: finding multiple marked elements and summing numbers
We show how to find all $k$ marked elements in a list of size $N$ using the optimal number $O(\sqrt{N k})$ of quantum queries and only a polylogarithmic overhead in the gate complexity, in the setting where one has a small quantum memory. Previous algorithms either incurred a factor $k$ overhead in...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2024-03-01
|
| Edice: | Quantum |
| On-line přístup: | https://quantum-journal.org/papers/q-2024-03-14-1284/pdf/ |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|