{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HNXCAYK5XLBU4VSRVOP3LFZNSE","short_pith_number":"pith:HNXCAYK5","schema_version":"1.0","canonical_sha256":"3b6e20615dbac34e5651ab9fb5972d913156720d13aaef989a027ead4b5a0de8","source":{"kind":"arxiv","id":"2607.10473","version":1},"attestation_state":"computed","paper":{"title":"Quantum algorithm for Clifford multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kagwe A. Muchane","submitted_at":"2026-07-11T20:38:19Z","abstract_excerpt":"Given two dense multivectors of the Clifford algebra $C\\ell(V, Q)$ with $N=2^{p+q}$ coefficients, the fastest known classical algorithms compute their geometric product in $O(N^{\\omega/2})$ arithmetic operations, where $\\omega$ denotes the matrix multiplication exponent. I show that, under amplitude encoding, a quantum computer executes the geometric product in $O(\\operatorname{polylog} N)$ time, using logarithmic space with sublogarithmic circuit depth. This exponential speedup establishes Clifford multiplication as a quantum primitive, providing an efficient computational foundation for quan"},"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":"2607.10473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2026-07-11T20:38:19Z","cross_cats_sorted":[],"title_canon_sha256":"7ec7ed07dd51cc02bdc5e74bd2518c9f717c4a7e86671d63430dbf2caa07a840","abstract_canon_sha256":"71afa5f8b80699d2f2a1f3286f515cb35f680a46cd9c171b87a8e35834ef292f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:17.499879Z","signature_b64":"iCregJnV7jsHgZrk2Fak+1Wef/zmJ6G3IPtGf7Ckk+h3NEqJzrqoM3y4AEa8NKDIdNMmmcPjykbQn2ECq78lAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b6e20615dbac34e5651ab9fb5972d913156720d13aaef989a027ead4b5a0de8","last_reissued_at":"2026-07-14T01:21:17.499078Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:17.499078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum algorithm for Clifford multiplication","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Kagwe A. Muchane","submitted_at":"2026-07-11T20:38:19Z","abstract_excerpt":"Given two dense multivectors of the Clifford algebra $C\\ell(V, Q)$ with $N=2^{p+q}$ coefficients, the fastest known classical algorithms compute their geometric product in $O(N^{\\omega/2})$ arithmetic operations, where $\\omega$ denotes the matrix multiplication exponent. I show that, under amplitude encoding, a quantum computer executes the geometric product in $O(\\operatorname{polylog} N)$ time, using logarithmic space with sublogarithmic circuit depth. This exponential speedup establishes Clifford multiplication as a quantum primitive, providing an efficient computational foundation for quan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10473","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/2607.10473/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":"2607.10473","created_at":"2026-07-14T01:21:17.499505+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10473v1","created_at":"2026-07-14T01:21:17.499505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10473","created_at":"2026-07-14T01:21:17.499505+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNXCAYK5XLBU","created_at":"2026-07-14T01:21:17.499505+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNXCAYK5XLBU4VSR","created_at":"2026-07-14T01:21:17.499505+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNXCAYK5","created_at":"2026-07-14T01:21:17.499505+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE","json":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE.json","graph_json":"https://pith.science/api/pith-number/HNXCAYK5XLBU4VSRVOP3LFZNSE/graph.json","events_json":"https://pith.science/api/pith-number/HNXCAYK5XLBU4VSRVOP3LFZNSE/events.json","paper":"https://pith.science/paper/HNXCAYK5"},"agent_actions":{"view_html":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE","download_json":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE.json","view_paper":"https://pith.science/paper/HNXCAYK5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10473&json=true","fetch_graph":"https://pith.science/api/pith-number/HNXCAYK5XLBU4VSRVOP3LFZNSE/graph.json","fetch_events":"https://pith.science/api/pith-number/HNXCAYK5XLBU4VSRVOP3LFZNSE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE/action/storage_attestation","attest_author":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE/action/author_attestation","sign_citation":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE/action/citation_signature","submit_replication":"https://pith.science/pith/HNXCAYK5XLBU4VSRVOP3LFZNSE/action/replication_record"}},"created_at":"2026-07-14T01:21:17.499505+00:00","updated_at":"2026-07-14T01:21:17.499505+00:00"}