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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 79; no. 2; pp. 509 - 529
Main Authors:	Jeffery, Stacey, Magniez, Frederic, de Wolf, Ronald
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.10.2017 Springer Nature B.V Springer Verlag
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!