Quantifying Grover speed-ups beyond asymptotic analysis
Run-times of quantum algorithms are often studied via an asymptotic, worst-case analysis. Whilst useful, such a comparison can often fall short: it is not uncommon for algorithms with a large worst-case run-time to end up performing well on instances of practical interest. To remedy this it is neces...
| Váldodahkkit: | , , , |
|---|---|
| Materiálatiipa: | Artihkal |
| Giella: | English |
| Almmustuhtton: |
Verein zur Förderung des Open Access Publizierens in den Quantenwissenschaften
2023-10-01
|
| Ráidu: | Quantum |
| Liŋkkat: | https://quantum-journal.org/papers/q-2023-10-10-1133/pdf/ |