Adversary lower bounds for nonadaptive quantum algorithms
type: Item
instance of: scholarly article
title: Adversary lower bounds for nonadaptive quantum algorithms
zbMATH Open document ID: 1206.68127
author: Pascal Koiran
author: Jürgen Landes
author: Natacha Portier
author: Penghui Yao
published in: Journal of Computer and System Sciences
publication date: 2010-07-08T00:00:00Z
full work available at URL: nonadaptQuantum.pdf
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5731995
zbMATH Keywords: query complexity
zbMATH Keywords: quantum algorithms
zbMATH Keywords: lower bounds
zbMATH Keywords: adversary method
zbMATH Keywords: nonadaptive algorithms
MaRDI profile type: Publication
OpenAlex ID: W1888573181
cites work: Lower bounds for local search by quantum arguments
cites work: Quantum lower bounds for the collision and the element distinctness problems
cites work: Polynomial degree vs. quantum query complexity
cites work: Sampling algorithms
cites work: Quantum lower bounds by polynomials
cites work: Quantum Query Complexity of Some Graph Problems
cites work: Hidden translation and orbit coset in quantum computing
cites work: Q3396568
cites work: Automata, Languages and Programming
cites work: The quantum query complexity of the abelian hidden subgroup problem
cites work: Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
cites work: Mathematical Foundations of Computer Science 2004
DOI: 10.1016/J.JCSS.2009.10.007
description: scientific article; zbMATH DE number 5731995