{"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/quantum-algorithms-for-compositional-natural","title":"Quantum Algorithms for Compositional Natural Language Processing","arxiv_id":"1608.01406","date":"2016-08-04","proceeding":null,"authors":["William Zeng","Bob Coecke"],"abstract":"We propose a new application of quantum computing to the field of natural\nlanguage processing. Ongoing work in this field attempts to incorporate\ngrammatical structure into algorithms that compute meaning. In (Coecke,\nSadrzadeh and Clark, 2010), the authors introduce such a model (the CSC model)\nbased on tensor product composition. While this algorithm has many advantages,\nits implementation is hampered by the large classical computational resources\nthat it requires. In this work we show how computational shortcomings of the\nCSC approach could be resolved using quantum computation (possibly in addition\nto existing techniques for dimension reduction). We address the value of\nquantum RAM (Giovannetti,2008) for this model and extend an algorithm from\nWiebe, Braun and Lloyd (2012) into a quantum algorithm to categorize sentences\nin CSC. Our new algorithm demonstrates a quadratic speedup over classical\nmethods under certain conditions.","url_abs":"http://arxiv.org/abs/1608.01406v1","url_pdf":"http://arxiv.org/pdf/1608.01406v1.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":"quantum-algorithms-for-compositional-natural","repo_url":"https://github.com/ICHEC/QNLP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"dimensionality-reduction","task_name":"Dimensionality Reduction"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1608.01406","atlas_url":"https://app.syntology.ai/?focus=1608.01406","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1608.01406"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1608.01406\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1608.01406"},"call":"get_concepts_for_paper(arxiv_id=\"1608.01406\")"}],"by_repo":[{"repo":"ICHEC/QNLP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1601.07195"],"harvested_for_calls":[{"arxiv_id":"1601.07195","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1601.07195"},"call":"get_harvested_code_for_paper(arxiv_id=\"1601.07195\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"73841dc4a0c8d84a138d90bfb06f3c0ba053f0079f1ad36b9cd8e62469ffcce8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}