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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 79; číslo 2; s. 509 - 529
Hlavní autori:	Jeffery, Stacey, Magniez, Frederic, de Wolf, Ronald
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.10.2017 Springer Nature B.V Springer Verlag
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!