{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:YZFBRPLZXTQYABPH3QTZYWVQCH","short_pith_number":"pith:YZFBRPLZ","schema_version":"1.0","canonical_sha256":"c64a18bd79bce18005e7dc279c5ab011da8b90eaa3261546c69db8ca4fa03394","source":{"kind":"arxiv","id":"2106.05299","version":3},"attestation_state":"computed","paper":{"title":"Grover's Algorithm for Question Answering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"quant-ph","authors_text":"A. D. Correia, H. T. C. Stoof, M. Moortgat","submitted_at":"2021-06-09T18:00:13Z","abstract_excerpt":"Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language question in English, thus contributing to the growing field of Quantum Natural Language Processing. Using a grammar that can be interpreted as tensor contractions, each word is represented as a quantum state that serves as input to the quantum circuit. We here introduce a quantum measurement to contract the representations of words, resulting in the represen"},"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":"2106.05299","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2021-06-09T18:00:13Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"dfcc797468852b0f6cca8ba95ea5ad5defba99708dde83373f6f8b837e509bbe","abstract_canon_sha256":"f90ac367ab9f9b72380a5378382f1dbf613bf11decc7355b57aeb55af0d33b7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:55.594994Z","signature_b64":"ASMfkrwur1rtHoFLFk7lJxJsqplzCruw4K172JA2sGJWjy/eE00I3neGfZTE1G0nnvF6sMA+UcVqSkckPV2VCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c64a18bd79bce18005e7dc279c5ab011da8b90eaa3261546c69db8ca4fa03394","last_reissued_at":"2026-07-05T03:51:55.594638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:55.594638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Grover's Algorithm for Question Answering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"quant-ph","authors_text":"A. D. Correia, H. T. C. Stoof, M. Moortgat","submitted_at":"2021-06-09T18:00:13Z","abstract_excerpt":"Grover's algorithm, a well-know quantum search algorithm, allows one to find the correct item in a database, with quadratic speedup. In this paper we adapt Grover's algorithm to the problem of finding a correct answer to a natural language question in English, thus contributing to the growing field of Quantum Natural Language Processing. Using a grammar that can be interpreted as tensor contractions, each word is represented as a quantum state that serves as input to the quantum circuit. We here introduce a quantum measurement to contract the representations of words, resulting in the represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.05299","kind":"arxiv","version":3},"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/2106.05299/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":"2106.05299","created_at":"2026-07-05T03:51:55.594693+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.05299v3","created_at":"2026-07-05T03:51:55.594693+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.05299","created_at":"2026-07-05T03:51:55.594693+00:00"},{"alias_kind":"pith_short_12","alias_value":"YZFBRPLZXTQY","created_at":"2026-07-05T03:51:55.594693+00:00"},{"alias_kind":"pith_short_16","alias_value":"YZFBRPLZXTQYABPH","created_at":"2026-07-05T03:51:55.594693+00:00"},{"alias_kind":"pith_short_8","alias_value":"YZFBRPLZ","created_at":"2026-07-05T03:51:55.594693+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.00321","citing_title":"QTP-Net: A Quantum Text Pre-training Network for Natural Language Processing","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH","json":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH.json","graph_json":"https://pith.science/api/pith-number/YZFBRPLZXTQYABPH3QTZYWVQCH/graph.json","events_json":"https://pith.science/api/pith-number/YZFBRPLZXTQYABPH3QTZYWVQCH/events.json","paper":"https://pith.science/paper/YZFBRPLZ"},"agent_actions":{"view_html":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH","download_json":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH.json","view_paper":"https://pith.science/paper/YZFBRPLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.05299&json=true","fetch_graph":"https://pith.science/api/pith-number/YZFBRPLZXTQYABPH3QTZYWVQCH/graph.json","fetch_events":"https://pith.science/api/pith-number/YZFBRPLZXTQYABPH3QTZYWVQCH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH/action/storage_attestation","attest_author":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH/action/author_attestation","sign_citation":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH/action/citation_signature","submit_replication":"https://pith.science/pith/YZFBRPLZXTQYABPH3QTZYWVQCH/action/replication_record"}},"created_at":"2026-07-05T03:51:55.594693+00:00","updated_at":"2026-07-05T03:51:55.594693+00:00"}