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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11128-005-0001-2 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009155360 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: quant-ph/0411140 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S11128-005-0001-2 / rank
 
Normal rank

Latest revision as of 00:14, 19 December 2024

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

    Statements

    Identifiers