{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:QRLS5ZZ5X3REIPIO5CRI6BJL57","short_pith_number":"pith:QRLS5ZZ5","canonical_record":{"source":{"id":"2501.16136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-27T15:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"b07925e88ed487a44dc051f5ea062aa5f7b11cbb9ec99cbea785e565aaad5b99","abstract_canon_sha256":"4e190094ddfbf6f1ea08ff2f47f73b5301f87edd723adc79887b54141a27707f"},"schema_version":"1.0"},"canonical_sha256":"84572ee73dbee2443d0ee8a28f052befed73ee79d7ae15c22f96be5abaa51e03","source":{"kind":"arxiv","id":"2501.16136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16136","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16136v1","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16136","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"QRLS5ZZ5X3RE","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"QRLS5ZZ5X3REIPIO","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"QRLS5ZZ5","created_at":"2026-07-05T10:05:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:QRLS5ZZ5X3REIPIO5CRI6BJL57","target":"record","payload":{"canonical_record":{"source":{"id":"2501.16136","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-27T15:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"b07925e88ed487a44dc051f5ea062aa5f7b11cbb9ec99cbea785e565aaad5b99","abstract_canon_sha256":"4e190094ddfbf6f1ea08ff2f47f73b5301f87edd723adc79887b54141a27707f"},"schema_version":"1.0"},"canonical_sha256":"84572ee73dbee2443d0ee8a28f052befed73ee79d7ae15c22f96be5abaa51e03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:55.895924Z","signature_b64":"tmp60EUxpd4NIxjQ1iNkwjDWXTL4O7j1afFFX6d9EMLxM9b7CrjYYfwUf37fX46oU3GG794TMK0lZ9wxOz5RAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84572ee73dbee2443d0ee8a28f052befed73ee79d7ae15c22f96be5abaa51e03","last_reissued_at":"2026-07-05T10:05:55.895422Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:55.895422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.16136","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UUzdDH4exsIVXwmninr3zJvr8MwLiKp6Sd5/+5dmbZLIIkRhrC64qRYWU1LjgK0pCSBAVkADHBRdBUwcbI0oAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T21:40:00.205205Z"},"content_sha256":"c6686000aed8bb959dad54dfbb7f37742bd4cbb67c78d23322fab6d2e5988755","schema_version":"1.0","event_id":"sha256:c6686000aed8bb959dad54dfbb7f37742bd4cbb67c78d23322fab6d2e5988755"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:QRLS5ZZ5X3REIPIO5CRI6BJL57","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Vivien Vandaele","submitted_at":"2025-01-27T15:26:11Z","abstract_excerpt":"Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum circuits that perform multiplication over $GF(2^n)$ with $\\mathcal{O}(n^{\\log_2(3)})$ Toffoli gates. We propose a variant of our construction that achieves linear depth by using $\\mathcal{O}(n\\log_2(n))$ ancillary qubits. This approach provides the best known space-time trade-off for binary field multiplication with a subquadratic number of Toffoli gates. Additio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16136","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/2501.16136/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:05:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZaN/zSoVpWISSmCFqsoy6htxzQxF9jODA6/h59ZjRbcoAPa0LI1ukS+lc6rENUwEcQ5Ff+uQoxCqq5UXFGrXAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T21:40:00.205525Z"},"content_sha256":"89b0b8c1c85ed44dba4d48832d8d2c77d37e2bc1508d3c9aeb5c9e82ff5a85d9","schema_version":"1.0","event_id":"sha256:89b0b8c1c85ed44dba4d48832d8d2c77d37e2bc1508d3c9aeb5c9e82ff5a85d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57/bundle.json","state_url":"https://pith.science/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-13T21:40:00Z","links":{"resolver":"https://pith.science/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57","bundle":"https://pith.science/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57/bundle.json","state":"https://pith.science/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QRLS5ZZ5X3REIPIO5CRI6BJL57/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:QRLS5ZZ5X3REIPIO5CRI6BJL57","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4e190094ddfbf6f1ea08ff2f47f73b5301f87edd723adc79887b54141a27707f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-27T15:26:11Z","title_canon_sha256":"b07925e88ed487a44dc051f5ea062aa5f7b11cbb9ec99cbea785e565aaad5b99"},"schema_version":"1.0","source":{"id":"2501.16136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16136","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16136v1","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16136","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"pith_short_12","alias_value":"QRLS5ZZ5X3RE","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"pith_short_16","alias_value":"QRLS5ZZ5X3REIPIO","created_at":"2026-07-05T10:05:55Z"},{"alias_kind":"pith_short_8","alias_value":"QRLS5ZZ5","created_at":"2026-07-05T10:05:55Z"}],"graph_snapshots":[{"event_id":"sha256:89b0b8c1c85ed44dba4d48832d8d2c77d37e2bc1508d3c9aeb5c9e82ff5a85d9","target":"graph","created_at":"2026-07-05T10:05:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2501.16136/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum circuits that perform multiplication over $GF(2^n)$ with $\\mathcal{O}(n^{\\log_2(3)})$ Toffoli gates. We propose a variant of our construction that achieves linear depth by using $\\mathcal{O}(n\\log_2(n))$ ancillary qubits. This approach provides the best known space-time trade-off for binary field multiplication with a subquadratic number of Toffoli gates. Additio","authors_text":"Vivien Vandaele","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-27T15:26:11Z","title":"Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16136","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6686000aed8bb959dad54dfbb7f37742bd4cbb67c78d23322fab6d2e5988755","target":"record","created_at":"2026-07-05T10:05:55Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4e190094ddfbf6f1ea08ff2f47f73b5301f87edd723adc79887b54141a27707f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-01-27T15:26:11Z","title_canon_sha256":"b07925e88ed487a44dc051f5ea062aa5f7b11cbb9ec99cbea785e565aaad5b99"},"schema_version":"1.0","source":{"id":"2501.16136","kind":"arxiv","version":1}},"canonical_sha256":"84572ee73dbee2443d0ee8a28f052befed73ee79d7ae15c22f96be5abaa51e03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"84572ee73dbee2443d0ee8a28f052befed73ee79d7ae15c22f96be5abaa51e03","first_computed_at":"2026-07-05T10:05:55.895422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:05:55.895422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tmp60EUxpd4NIxjQ1iNkwjDWXTL4O7j1afFFX6d9EMLxM9b7CrjYYfwUf37fX46oU3GG794TMK0lZ9wxOz5RAA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:05:55.895924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.16136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6686000aed8bb959dad54dfbb7f37742bd4cbb67c78d23322fab6d2e5988755","sha256:89b0b8c1c85ed44dba4d48832d8d2c77d37e2bc1508d3c9aeb5c9e82ff5a85d9"],"state_sha256":"f467dee6dd172cdae4f655ae09dcb0ab6acf653bddf0edd87d53cbe52c2a8636"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hTJD4I9k6dnir+XHKVwT3yQ35OLZpFVlLbwYomo0BFePRtMmHOYi1jvX9cAmOaGPtFfmX2e+ni5Y6XydHIIZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T21:40:00.227176Z","bundle_sha256":"fe839e8dcd56467298c599b430bbd891f9d644333c29638d05598f48586ec145"}}