An improved lower bound on query complexity for quantum PAC learning
type: Item
instance of: scholarly article
title: An improved lower bound on query complexity for quantum PAC learning
zbMATH Open document ID: 1260.68192
author: Chi Zhang
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Q32
Mathematics Subject Classification ID: 68Q12
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6150225
zbMATH Keywords: probably approximately correct learning
zbMATH Keywords: lower bound
zbMATH Keywords: quantum algorithm
zbMATH Keywords: VC dimension
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2010.10.007
OpenAlex ID: W2009381781
cites work: Q4847941
cites work: Q4228473
cites work: Rapid solution of problems by quantum computation
cites work: Quantum Complexity Theory
cites work: Learning DNF over the Uniform Distribution Using a Quantum Example Oracle
cites work: Equivalences and Separations Between Quantum and Classical Learnability
cites work: Improved bounds on quantum learning algorithms
cites work: A theory of the learnable
cites work: Q2706552
cites work: Q4544834
cites work: A general lower bound on the number of examples needed for learning
cites work: Learnability and the Vapnik-Chervonenkis dimension
cites work: Quantum lower bounds by polynomials
cites work: Q4004139
cites work: Matrix Analysis
cites work: Introduction to algorithms
DOI: 10.1016/J.IPL.2010.10.007
description: scientific article; zbMATH DE number 6150225