{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6R65YUCS7WTETVUF7FBBOJGHKD","short_pith_number":"pith:6R65YUCS","schema_version":"1.0","canonical_sha256":"f47ddc5052fda649d685f9421724c750ed3caf48a25f6fd62b7e490f4e1f96ed","source":{"kind":"arxiv","id":"2408.06061","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Compositional Text Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"quant-ph","authors_text":"Bob Coecke (Quantinuum), Konstantinos Meichanetzidis (Quantinuum), Tuomas Laakkonen (Quantinuum)","submitted_at":"2024-08-12T11:21:40Z","abstract_excerpt":"Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is motivated by a compositional approach to rendering AI interpretable: the behavior of the whole can be understood in terms of the behavior of parts, and the way they are put together. For the model-native primitive operation of text similarity, we derive quantum algorithms for fault-tolerant quantum computers to solve the task of question-answering within QDisCoCi"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2408.06061","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-12T11:21:40Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"4e5005f3e0709503f55df02f7e936751300520e9b06c14c5729609dff0c34e70","abstract_canon_sha256":"a9dfd484b265a9a8af2e641c9bca8d362ed095480db6334ebf8c150113a5ef14"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:29.177236Z","signature_b64":"6db2ZXNOcGPfuFeE3a2PzFFGPYsjYkAb+DqGkcIYW/qjVGUojpM0gDRjwE7w+yrqjR+ud5xtMs1msX9+lvbaDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f47ddc5052fda649d685f9421724c750ed3caf48a25f6fd62b7e490f4e1f96ed","last_reissued_at":"2026-07-05T08:54:29.176833Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:29.176833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Compositional Text Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"quant-ph","authors_text":"Bob Coecke (Quantinuum), Konstantinos Meichanetzidis (Quantinuum), Tuomas Laakkonen (Quantinuum)","submitted_at":"2024-08-12T11:21:40Z","abstract_excerpt":"Quantum computing and AI have found a fruitful intersection in the field of natural language processing. We focus on the recently proposed DisCoCirc framework for natural language, and propose a quantum adaptation, QDisCoCirc. This is motivated by a compositional approach to rendering AI interpretable: the behavior of the whole can be understood in terms of the behavior of parts, and the way they are put together. For the model-native primitive operation of text similarity, we derive quantum algorithms for fault-tolerant quantum computers to solve the task of question-answering within QDisCoCi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.06061","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2408.06061/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2408.06061","created_at":"2026-07-05T08:54:29.176888+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.06061v1","created_at":"2026-07-05T08:54:29.176888+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.06061","created_at":"2026-07-05T08:54:29.176888+00:00"},{"alias_kind":"pith_short_12","alias_value":"6R65YUCS7WTE","created_at":"2026-07-05T08:54:29.176888+00:00"},{"alias_kind":"pith_short_16","alias_value":"6R65YUCS7WTETVUF","created_at":"2026-07-05T08:54:29.176888+00:00"},{"alias_kind":"pith_short_8","alias_value":"6R65YUCS","created_at":"2026-07-05T08:54:29.176888+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11417","citing_title":"String Diagrams for Quantum Foundations, Computing and Natural Language Processing","ref_index":194,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD","json":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD.json","graph_json":"https://pith.science/api/pith-number/6R65YUCS7WTETVUF7FBBOJGHKD/graph.json","events_json":"https://pith.science/api/pith-number/6R65YUCS7WTETVUF7FBBOJGHKD/events.json","paper":"https://pith.science/paper/6R65YUCS"},"agent_actions":{"view_html":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD","download_json":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD.json","view_paper":"https://pith.science/paper/6R65YUCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.06061&json=true","fetch_graph":"https://pith.science/api/pith-number/6R65YUCS7WTETVUF7FBBOJGHKD/graph.json","fetch_events":"https://pith.science/api/pith-number/6R65YUCS7WTETVUF7FBBOJGHKD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD/action/storage_attestation","attest_author":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD/action/author_attestation","sign_citation":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD/action/citation_signature","submit_replication":"https://pith.science/pith/6R65YUCS7WTETVUF7FBBOJGHKD/action/replication_record"}},"created_at":"2026-07-05T08:54:29.176888+00:00","updated_at":"2026-07-05T08:54:29.176888+00:00"}