Optimal Parallel Quantum Query Algorithms

We study the complexity of quantum query algorithms that make p queries in parallel in each timestep. This model is in part motivated by the fact that decoherence times of qubits are typically small, so it makes sense to parallelize quantum algorithms as much as possible. We show tight bounds for a...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 79; H. 2; S. 509 - 529
Hauptverfasser:	Jeffery, Stacey, Magniez, Frederic, de Wolf, Ronald
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.10.2017 Springer Nature B.V Springer Verlag
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Functions (mathematics) Lower bounds Mathematical analysis Mathematics of Computing Parallel processing Qubits (quantum computing) Queries Theory of Computation Upper bounds Quantum algorithms Lower bounds Query complexity Parallel algorithms
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!