An improved lower bound on query complexity for quantum PAC learning (Q1944033): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4847941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228473 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF over the Uniform Distribution Using a Quantum Example Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalences and Separations Between Quantum and Classical Learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on quantum learning algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4544834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general lower bound on the number of examples needed for learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum lower bounds by polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank

Latest revision as of 07:37, 6 July 2024

scientific article
Language Label Description Also known as
English
An improved lower bound on query complexity for quantum PAC learning
scientific article

    Statements

    An improved lower bound on query complexity for quantum PAC learning (English)
    0 references
    0 references
    4 April 2013
    0 references
    probably approximately correct learning
    0 references
    lower bound
    0 references
    quantum algorithm
    0 references
    VC dimension
    0 references
    computational complexity
    0 references

    Identifiers