A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification (Q3387032): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Rapid solution of problems by quantum computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum cryptography based on Bell’s theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Perceptrons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum artificial neural network architectures and components / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strategy for quantum algorithm design assisted by machine learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization performance of Bayes optimal classification algorithm for learning a perceptron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3886867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computation and Quantum Information / rank
 
Normal rank

Latest revision as of 08:21, 24 July 2024

scientific article
Language Label Description Also known as
English
A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification
scientific article

    Statements

    A quantum speedup in machine learning: finding an<i>N</i>-bit Boolean function for a classification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 January 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references