CoChat

Improved Bounds on Quantum Learning Algorithms

Open access
Atici, Alp, Servedio, Rocco A. · 2005 · Quantum Information Processing
Cited by 67

The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.

Abstract

AbstractIn this article we give several new results on the complexity of algorithms that learn Boolean functions from quantum queries and quantum examples. Hunziker et al.[Quantum Information Processing, to appear] conjectured that for any class C of Boolean functions, the number of quantum black-box queries which are required to exactly identify an unknown function from C is $$O(\frac{\log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$$, where $$\hat{\gamma}^{C}$$ is a combinatorial parameter of the class C. We essentially resolve this conjecture in the affirmative by giving a quantum algorithm that, for any class C, identifies any unknown function from C using $$O(\frac{\log |C| \log \log |C|}{\sqrt{{\hat{\gamma}}^{C}}})$$ quantum black-box queries.We consider a range of natural problems intermediate between the exact learning problem (in which the learner must obtain all bits of information about the black-box function) and the usual problem of computing a predicate (in which the learner must obtain only one bit of information about the black-box function). We give positive and negative results on when the quantum and classical query complexities of these intermediate problems are polynomially related to each other.Finally, we improve the known lower bounds on the number of quantum examples (as opposed to quantum black-box queries) required for ɛ, Δ-PAC learning any concept class of Vapnik-Chervonenkis dimension d over the domain $$\{0,1\}^n$$ from $$\Omega({\frac d n})$$ to $$\Omega(\frac{1}{\epsilon}\log \frac{1}{\delta}+d+\frac{\sqrt{d}}{\epsilon})$$. This new lower bound comes closer to matching known upper bounds for classical PAC learning.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s11128-005-0001-2

Cites

8 of 8 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 8 references

Cited by

See all 67

Metadata

Authors
Atici, A., & Servedio, R. A.
Venue
Quantum Information Processing
Published
2005-10-18
Volume
4
Issue
5
Pages
355-386
ISSN
  • 1570-0755 (ISSN-L)
  • 1573-1332
OpenAlex
W2009155360
Cited by
67
References
8
FWCI
3.44
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Improved Bounds on Quantum Learning Algorithms. https://app.cochat.ai/papers/10.1007/s11128-005-0001-2
The paper
Atici, A., & Servedio, R. A. (2005). Improved Bounds on Quantum Learning Algorithms. Quantum Information Processing. https://doi.org/10.1007/s11128-005-0001-2

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.