{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MJNCTU3D4W2OQJSXBHOIHOXSLB","short_pith_number":"pith:MJNCTU3D","schema_version":"1.0","canonical_sha256":"625a29d363e5b4e8265709dc83baf2585ed1fc0d335d24f54548b675a30b933c","source":{"kind":"arxiv","id":"2505.20265","version":1},"attestation_state":"computed","paper":{"title":"A distillation-teleportation protocol for fault-tolerant QRAM","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Alexander M. Dalzell, Andr\\'as Gily\\'en, Connor T. Hann, Fernando G.S.L. Brand\\~ao, Grant Salton, Quynh T. Nguyen, Sam McArdle","submitted_at":"2025-05-26T17:42:56Z","abstract_excerpt":"We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation, given access to a specialized, noisy QRAM device. For coherently accessing classical memories of size $2^n$, our protocol consumes only $\\mathrm{poly}(n)$ fault-tolerant quantum resources (logical gates, logical qubits, quantum error correction cycles, etc.), avoiding the need to perform active error correction on all $\\Omega(2^n)$ components of the QRAM device. This is the first rigorous conceptual demonstration that a specialized, noisy QRAM device could be useful for implementi"},"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":"2505.20265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-05-26T17:42:56Z","cross_cats_sorted":[],"title_canon_sha256":"303aa60c850c3df445737bb57cb71745f9e5106df3c390e127de0d080a06d266","abstract_canon_sha256":"17b3f8a72cd7fd55070bc72c5c33ad4843cdb953400aeb8c0519756c5c3bf5b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:09:55.378968Z","signature_b64":"Elpae5VxGeaYE9quD1YZYRsm+mgk6bx0CxMlINWleA+ZkqkK7znvSdvtZPRNJ5FhhyaNcaoOw45GcWqKRDrPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"625a29d363e5b4e8265709dc83baf2585ed1fc0d335d24f54548b675a30b933c","last_reissued_at":"2026-07-05T11:09:55.378499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:09:55.378499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A distillation-teleportation protocol for fault-tolerant QRAM","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aleksander Kubica, Alexander M. Dalzell, Andr\\'as Gily\\'en, Connor T. Hann, Fernando G.S.L. Brand\\~ao, Grant Salton, Quynh T. Nguyen, Sam McArdle","submitted_at":"2025-05-26T17:42:56Z","abstract_excerpt":"We present a protocol for fault-tolerantly implementing the logical quantum random access memory (QRAM) operation, given access to a specialized, noisy QRAM device. For coherently accessing classical memories of size $2^n$, our protocol consumes only $\\mathrm{poly}(n)$ fault-tolerant quantum resources (logical gates, logical qubits, quantum error correction cycles, etc.), avoiding the need to perform active error correction on all $\\Omega(2^n)$ components of the QRAM device. This is the first rigorous conceptual demonstration that a specialized, noisy QRAM device could be useful for implementi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.20265","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/2505.20265/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":"2505.20265","created_at":"2026-07-05T11:09:55.378550+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.20265v1","created_at":"2026-07-05T11:09:55.378550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.20265","created_at":"2026-07-05T11:09:55.378550+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJNCTU3D4W2O","created_at":"2026-07-05T11:09:55.378550+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJNCTU3D4W2OQJSX","created_at":"2026-07-05T11:09:55.378550+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJNCTU3D","created_at":"2026-07-05T11:09:55.378550+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2503.13832","citing_title":"Refined Criteria for QRAM Error Suppression via Efficient Large-Scale QRAM Simulator","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21570","citing_title":"Quantum Purity Amplification for Arbitrary Eigenstates and Multiple Outputs","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07195","citing_title":"Accelerating Inference for Multilayer Neural Networks with Quantum Computers","ref_index":71,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21457","citing_title":"An Exponential Sample-Complexity Advantage for Coherent Quantum Inference","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25644","citing_title":"Efficient Complex-Valued State Preparation on Bucket Brigade QRAM","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07639","citing_title":"Exponential quantum advantage in processing massive classical data","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB","json":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB.json","graph_json":"https://pith.science/api/pith-number/MJNCTU3D4W2OQJSXBHOIHOXSLB/graph.json","events_json":"https://pith.science/api/pith-number/MJNCTU3D4W2OQJSXBHOIHOXSLB/events.json","paper":"https://pith.science/paper/MJNCTU3D"},"agent_actions":{"view_html":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB","download_json":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB.json","view_paper":"https://pith.science/paper/MJNCTU3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.20265&json=true","fetch_graph":"https://pith.science/api/pith-number/MJNCTU3D4W2OQJSXBHOIHOXSLB/graph.json","fetch_events":"https://pith.science/api/pith-number/MJNCTU3D4W2OQJSXBHOIHOXSLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB/action/storage_attestation","attest_author":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB/action/author_attestation","sign_citation":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB/action/citation_signature","submit_replication":"https://pith.science/pith/MJNCTU3D4W2OQJSXBHOIHOXSLB/action/replication_record"}},"created_at":"2026-07-05T11:09:55.378550+00:00","updated_at":"2026-07-05T11:09:55.378550+00:00"}