Quantum speed-up for unsupervised learning (Q1945031): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60307406, #quickstatements; #temporary_batch_1711574657256
Created claim: DBLP publication ID (P1635): journals/ml/AimeurBG13, #quickstatements; #temporary_batch_1731468600454
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reversibility of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengths and Weaknesses of Quantum Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4819589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum pseudo-telepathy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelizing quantum circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4939137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication and complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826665 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the diameter of a point set in high dimensional Euclidean space. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Random Access Memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542520 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel clustering algorithm based on quantum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid classical-quantum clustering algorithm based on quantum walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quantum query complexity of approximating the median and related statistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Walk Based Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535084 / 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: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5312442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/ml/AimeurBG13 / rank
 
Normal rank

Latest revision as of 04:54, 13 November 2024

scientific article
Language Label Description Also known as
English
Quantum speed-up for unsupervised learning
scientific article

    Statements

    Quantum speed-up for unsupervised learning (English)
    0 references
    0 references
    0 references
    0 references
    28 March 2013
    0 references
    unsupervised learning
    0 references
    clustering
    0 references
    quantum learning
    0 references
    quantum information processing
    0 references
    Grover's algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers