{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:UDU64LJGTRALWCCWZOMEW6PAVA","short_pith_number":"pith:UDU64LJG","schema_version":"1.0","canonical_sha256":"a0e9ee2d269c40bb0856cb984b79e0a802ad376af28cee6a40569cc266829c42","source":{"kind":"arxiv","id":"2605.20334","version":1},"attestation_state":"computed","paper":{"title":"Halving the cost of QROM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danial Motlagh, Matthew Pocrnic","submitted_at":"2026-05-19T18:00:04Z","abstract_excerpt":"Table lookup, often referred to as quantum read only memory (QROM), is one of the most widely used subroutines in quantum algorithms, and constitutes the majority share of algorithmic overheads in most practical applications of quantum computers. It involves the coherent loading of $N$ bitstrings of length $b$ in superposition, and naively has a non-Clifford cost of $N$ Toffolis. It is known that given access to $b\\, \\lambda$ dirty qubits, one can reduce the Toffoli cost of QROM to $2\\frac{N}{\\lambda} + 4b(\\lambda - 1)$. In this work, we first present an optimization to reduce this cost to $2\\"},"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":"2605.20334","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-05-19T18:00:04Z","cross_cats_sorted":[],"title_canon_sha256":"4dfa95daae7c25d034857fb7aebfa555205cdf948586f772f074450abfb10651","abstract_canon_sha256":"c495634d0da75cdbc32d7aef12d6e1faabf475bef9645cc8fc53a14105d982b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T00:04:25.656531Z","signature_b64":"WQJpyoAREwk6N1cOY5fEWzbvT4hZJ9FO/7Kd/i2wo04gYsvGQk4FvTajrg35bjooRJ7YcJqkaDIx2fNPax3DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0e9ee2d269c40bb0856cb984b79e0a802ad376af28cee6a40569cc266829c42","last_reissued_at":"2026-05-21T00:04:25.656083Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T00:04:25.656083Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Halving the cost of QROM","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Danial Motlagh, Matthew Pocrnic","submitted_at":"2026-05-19T18:00:04Z","abstract_excerpt":"Table lookup, often referred to as quantum read only memory (QROM), is one of the most widely used subroutines in quantum algorithms, and constitutes the majority share of algorithmic overheads in most practical applications of quantum computers. It involves the coherent loading of $N$ bitstrings of length $b$ in superposition, and naively has a non-Clifford cost of $N$ Toffolis. It is known that given access to $b\\, \\lambda$ dirty qubits, one can reduce the Toffoli cost of QROM to $2\\frac{N}{\\lambda} + 4b(\\lambda - 1)$. In this work, we first present an optimization to reduce this cost to $2\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.20334","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/2605.20334/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":"2605.20334","created_at":"2026-05-21T00:04:25.656154+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.20334v1","created_at":"2026-05-21T00:04:25.656154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.20334","created_at":"2026-05-21T00:04:25.656154+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDU64LJGTRAL","created_at":"2026-05-21T00:04:25.656154+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDU64LJGTRALWCCW","created_at":"2026-05-21T00:04:25.656154+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDU64LJG","created_at":"2026-05-21T00:04:25.656154+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/UDU64LJGTRALWCCWZOMEW6PAVA","json":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA.json","graph_json":"https://pith.science/api/pith-number/UDU64LJGTRALWCCWZOMEW6PAVA/graph.json","events_json":"https://pith.science/api/pith-number/UDU64LJGTRALWCCWZOMEW6PAVA/events.json","paper":"https://pith.science/paper/UDU64LJG"},"agent_actions":{"view_html":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA","download_json":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA.json","view_paper":"https://pith.science/paper/UDU64LJG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.20334&json=true","fetch_graph":"https://pith.science/api/pith-number/UDU64LJGTRALWCCWZOMEW6PAVA/graph.json","fetch_events":"https://pith.science/api/pith-number/UDU64LJGTRALWCCWZOMEW6PAVA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA/action/storage_attestation","attest_author":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA/action/author_attestation","sign_citation":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA/action/citation_signature","submit_replication":"https://pith.science/pith/UDU64LJGTRALWCCWZOMEW6PAVA/action/replication_record"}},"created_at":"2026-05-21T00:04:25.656154+00:00","updated_at":"2026-05-21T00:04:25.656154+00:00"}