Improved bounds on quantum learning algorithms (Q2491374): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / 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: On the Power of Quantum Computation / 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: The geometry of quantum learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2004 / 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: A theory of the learnable / 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: Oracles and queries that are sufficient for exact learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: How many queries are needed to learn? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Complexity Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables / rank
 
Normal rank

Revision as of 16:13, 24 June 2024

scientific article
Language Label Description Also known as
English
Improved bounds on quantum learning algorithms
scientific article

    Statements

    Identifiers