Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity via quantum walks

Many computational problems are subject to a quantum speed-up: one might find that a problem having an O(n^3)-time or O(n^2)-time classic algorithm can be solved by a known O(n^1.5)-time or O(n)-time quantum algorithm. The question naturally arises: how much quantum speed-up is possible? The area of...

Celý popis

Podrobná bibliografia

Vydané v:	arXiv.org
Hlavní autori:	Buhrman, Harry, Loff, Bruno, Patro, Subhasree, Speelman, Florian
Médium:	Paper
Jazyk:	English
Vydavateľské údaje:	Ithaca Cornell University Library, arXiv.org 03.06.2021
Predmet:	Algorithms Complexity Computational geometry Lower bounds Upper bounds
ISSN:	2331-8422
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!