{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/q-means-a-quantum-algorithm-for-unsupervised","title":"q-means: A quantum algorithm for unsupervised machine learning","arxiv_id":"1812.03584","date":"2018-12-10","proceeding":"NeurIPS 2019 12","authors":["Iordanis Kerenidis","Jonas Landman","Alessandro Luongo","Anupam Prakash"],"abstract":"Quantum machine learning is one of the most promising applications of a\nfull-scale quantum computer. Over the past few years, many quantum machine\nlearning algorithms have been proposed that can potentially offer considerable\nspeedups over the corresponding classical algorithms. In this paper, we\nintroduce q-means, a new quantum algorithm for clustering which is a canonical\nproblem in unsupervised machine learning. The $q$-means algorithm has\nconvergence and precision guarantees similar to $k$-means, and it outputs with\nhigh probability a good approximation of the $k$ cluster centroids like the\nclassical algorithm. Given a dataset of $N$ $d$-dimensional vectors $v_i$ (seen\nas a matrix $V \\in \\mathbb{R}^{N \\times d})$ stored in QRAM, the running time\nof q-means is $\\widetilde{O}\\left( k d \\frac{\\eta}{\\delta^2}\\kappa(V)(\\mu(V) +\nk \\frac{\\eta}{\\delta}) + k^2 \\frac{\\eta^{1.5}}{\\delta^2} \\kappa(V)\\mu(V)\n\\right)$ per iteration, where $\\kappa(V)$ is the condition number, $\\mu(V)$ is\na parameter that appears in quantum linear algebra procedures and $\\eta =\n\\max_{i} ||v_{i}||^{2}$. For a natural notion of well-clusterable datasets, the\nrunning time becomes $\\widetilde{O}\\left( k^2 d \\frac{\\eta^{2.5}}{\\delta^3} +\nk^{2.5} \\frac{\\eta^2}{\\delta^3} \\right)$ per iteration, which is linear in the\nnumber of features $d$, and polynomial in the rank $k$, the maximum square norm\n$\\eta$ and the error parameter $\\delta$. Both running times are only\npolylogarithmic in the number of datapoints $N$. Our algorithm provides\nsubstantial savings compared to the classical $k$-means algorithm that runs in\ntime $O(kdN)$ per iteration, particularly for the case of large datasets.","url_abs":"http://arxiv.org/abs/1812.03584v2","url_pdf":"http://arxiv.org/pdf/1812.03584v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"q-means-a-quantum-algorithm-for-unsupervised","repo_url":"https://github.com/JonasLandman/quantum_kmeans_NeurIPS_2019","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"q-means-a-quantum-algorithm-for-unsupervised","repo_url":"https://github.com/Morcu/q-means","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"quantum-machine-learning","task_name":"Quantum Machine Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.03584","atlas_url":"https://app.syntology.ai/?focus=1812.03584","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.03584"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.03584"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1812.03584"},"call":"get_harvested_code_for_paper(arxiv_id=\"1812.03584\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"1812.03584"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.03584\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.03584"},"call":"get_concepts_for_paper(arxiv_id=\"1812.03584\")"}],"by_repo":[{"repo":"JonasLandman/quantum_kmeans_NeurIPS_2019","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"Morcu/q-means","kind":"listed","samples":5,"ran":5,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/1812.03584.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/1812.03584.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Morcu/q-means","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/JonasLandman/quantum_kmeans_NeurIPS_2019","reach":{"status":"ok"}}],"summary":{"ran":5},"n_samples":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"listed":{"samples":5,"ran":5,"n_ran_checked":5,"n_instrument":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"official_not_harvested":{"repositories":["JonasLandman/quantum_kmeans_NeurIPS_2019"],"harvested_for_other_papers":[0],"samples_from_other_repositories":5,"other_repositories":1,"samples_unlocated":0},"n_pointer_only_for_licence":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":5,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-26","last":"2026-09-26","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"d46135fffb951703","code_sha256_prefix":"d46135fffb951703","entry":"binary_combinations","repo":"Morcu/q-means","repo_kind":"listed","path":"time_benchmarks.py","file_url":"https://github.com/Morcu/q-means/blob/HEAD/time_benchmarks.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"n:int/0/int","fixture_out_type":"list","level_recorded_at":"2026-09-26T05:30:53.715539+00:00","code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"d46135fffb951703"}},{"code_sha256":"f19b1caca3444d05","code_sha256_prefix":"f19b1caca3444d05","entry":"encode_feature","repo":"Morcu/q-means","repo_kind":"listed","path":"time_benchmarks.py","file_url":"https://github.com/Morcu/q-means/blob/HEAD/time_benchmarks.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:ndarray/1/float","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T05:00:14.332320+00:00","retrieve_with":{"tool":"get_code","code_sha256":"f19b1caca3444d05"},"code_page":null,"census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"f19b1caca3444d05"}},{"code_sha256":"57c67ea68b2e1170","code_sha256_prefix":"57c67ea68b2e1170","entry":"euclidean_distance","repo":"Morcu/q-means","repo_kind":"listed","path":"time_benchmarks.py","file_url":"https://github.com/Morcu/q-means/blob/HEAD/time_benchmarks.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"point:ndarray/1/float, centroids:list/1/ndarray","fixture_out_type":"ndarray","level_recorded_at":"2026-09-26T05:00:14.332320+00:00","code_page":"/code/euclidean-distance","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"57c67ea68b2e1170"}},{"code_sha256":"cb8d4ea12aad946d","code_sha256_prefix":"cb8d4ea12aad946d","entry":"generate_dataset","repo":"Morcu/q-means","repo_kind":"listed","path":"datasets.py","file_url":"https://github.com/Morcu/q-means/blob/HEAD/datasets.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"k:int/0/int, n_data_points_per_class:int/0/int","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T05:00:14.332320+00:00","code_page":"/code/generate-dataset","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"cb8d4ea12aad946d"}},{"code_sha256":"37118eb36d26892b","code_sha256_prefix":"37118eb36d26892b","entry":"load_dataset","repo":"Morcu/q-means","repo_kind":"listed","path":"datasets.py","file_url":"https://github.com/Morcu/q-means/blob/HEAD/datasets.py","link_basis":"harvester_set","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"signature":"name:str/0/str","fixture_out_type":"tuple","level_recorded_at":"2026-09-26T05:00:14.332320+00:00","code_page":"/code/load-dataset","census":null,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"37118eb36d26892b"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"007a67e545c20f446e07e6c01c4024040e19467ea0215f305c0d13f05f48602b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}