{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:QMSD5CAQXQG22EBEINZ4C5WI5E","short_pith_number":"pith:QMSD5CAQ","schema_version":"1.0","canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","source":{"kind":"arxiv","id":"2506.00132","version":1},"attestation_state":"computed","paper":{"title":"Productionizing Quantum Mass Production","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nathan Wiebe, Tanuj Khattar, William J. Huggins","submitted_at":"2025-05-30T18:10:50Z","abstract_excerpt":"For many practical applications of quantum computing, the most costly steps involve coherently accessing classical data. We help address this challenge by applying mass production techniques, which can reduce the cost of applying an operation multiple times in parallel. We combine these techniques with modern approaches for classical data loading based on \"quantum read-only memory\" (QROM). We find that we can polynomially reduce the total number of gates required for data loading, but we find no advantage in cost models that only count the number of non-Clifford gates. Furthermore, for realist"},"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":"2506.00132","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-30T18:10:50Z","cross_cats_sorted":[],"title_canon_sha256":"ea81516a4cf89b3f8a47d91a33d385d88c09a96c999b287ae09478b8fac4a397","abstract_canon_sha256":"438b22943cbc75622f8cb8675e1bdfd786bb43348041cf98e7d1dea2c48f00a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:29.467412Z","signature_b64":"Stp4KUQY8gs38ThDH+WPELATSw5wVlBhWqLQZNrJTIiYaHNipHEw3TLLuPRnRBw9Pwmg0gWnmLJBrRI+C6jADg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83243e8810bc0dad10244373c176c8e9309fb85318aba7faa5fbb3c3e8c098a4","last_reissued_at":"2026-07-05T11:13:29.466988Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:29.466988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Productionizing Quantum Mass Production","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nathan Wiebe, Tanuj Khattar, William J. Huggins","submitted_at":"2025-05-30T18:10:50Z","abstract_excerpt":"For many practical applications of quantum computing, the most costly steps involve coherently accessing classical data. We help address this challenge by applying mass production techniques, which can reduce the cost of applying an operation multiple times in parallel. We combine these techniques with modern approaches for classical data loading based on \"quantum read-only memory\" (QROM). We find that we can polynomially reduce the total number of gates required for data loading, but we find no advantage in cost models that only count the number of non-Clifford gates. Furthermore, for realist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.00132","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/2506.00132/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":"2506.00132","created_at":"2026-07-05T11:13:29.467045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.00132v1","created_at":"2026-07-05T11:13:29.467045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.00132","created_at":"2026-07-05T11:13:29.467045+00:00"},{"alias_kind":"pith_short_12","alias_value":"QMSD5CAQXQG2","created_at":"2026-07-05T11:13:29.467045+00:00"},{"alias_kind":"pith_short_16","alias_value":"QMSD5CAQXQG22EBE","created_at":"2026-07-05T11:13:29.467045+00:00"},{"alias_kind":"pith_short_8","alias_value":"QMSD5CAQ","created_at":"2026-07-05T11:13:29.467045+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/QMSD5CAQXQG22EBEINZ4C5WI5E","json":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E.json","graph_json":"https://pith.science/api/pith-number/QMSD5CAQXQG22EBEINZ4C5WI5E/graph.json","events_json":"https://pith.science/api/pith-number/QMSD5CAQXQG22EBEINZ4C5WI5E/events.json","paper":"https://pith.science/paper/QMSD5CAQ"},"agent_actions":{"view_html":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E","download_json":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E.json","view_paper":"https://pith.science/paper/QMSD5CAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.00132&json=true","fetch_graph":"https://pith.science/api/pith-number/QMSD5CAQXQG22EBEINZ4C5WI5E/graph.json","fetch_events":"https://pith.science/api/pith-number/QMSD5CAQXQG22EBEINZ4C5WI5E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/action/storage_attestation","attest_author":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/action/author_attestation","sign_citation":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/action/citation_signature","submit_replication":"https://pith.science/pith/QMSD5CAQXQG22EBEINZ4C5WI5E/action/replication_record"}},"created_at":"2026-07-05T11:13:29.467045+00:00","updated_at":"2026-07-05T11:13:29.467045+00:00"}