{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:FTSCK6BGVLF57NJ64GTISPPKPG","short_pith_number":"pith:FTSCK6BG","schema_version":"1.0","canonical_sha256":"2ce4257826aacbdfb53ee1a6893dea79851e0f67083397c4b4d2448dc1c1d53b","source":{"kind":"arxiv","id":"2303.05207","version":2},"attestation_state":"computed","paper":{"title":"Efficient and Error-Resilient Data Access Protocols for a Limited-Sized Quantum Random Access Memory","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cheng Xue, Guo-Ping Guo, Huan-Yu Liu, Meng-Han Dou, Tai-Ping Sun, Tian-Rui Zou, Xi-Ning Zhuang, Yuan Fang, Yu-Chun Wu, Yun-Jie Wang, Zhao-Yun Chen","submitted_at":"2023-03-09T12:21:18Z","abstract_excerpt":"Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size and a fully error-correction implementation, it is essential to consider a practical case where the QRAM has a limited size. In this work, we focus on the access of larger data sizes without keeping on increasing the size of the QRAM. Firstly, we address the challenge of word length, as real-world datasets typically have larger word lengths than the single-bit"},"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":"2303.05207","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2023-03-09T12:21:18Z","cross_cats_sorted":[],"title_canon_sha256":"51be328ea00df239b870e04c7d797f85614617295bde8afd3ccd25b0db6a43d4","abstract_canon_sha256":"40e6e60d4c42c47cc9991e4d7896fff7ee7c4053885b031bcbcce30008cd9b2a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:23:02.381413Z","signature_b64":"2ug9j9MKEkfd1n8vi/IekExmWtViK+iKXsIxvXXJaKF2bOTzlJNx5EVDxNlvPaN4xmm3A5hNdVJK/7kADW6BCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ce4257826aacbdfb53ee1a6893dea79851e0f67083397c4b4d2448dc1c1d53b","last_reissued_at":"2026-07-05T06:23:02.380967Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:23:02.380967Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Error-Resilient Data Access Protocols for a Limited-Sized Quantum Random Access Memory","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Cheng Xue, Guo-Ping Guo, Huan-Yu Liu, Meng-Han Dou, Tai-Ping Sun, Tian-Rui Zou, Xi-Ning Zhuang, Yuan Fang, Yu-Chun Wu, Yun-Jie Wang, Zhao-Yun Chen","submitted_at":"2023-03-09T12:21:18Z","abstract_excerpt":"Quantum Random Access Memory (QRAM) is a critical component for loading classical data into quantum computers. While constructing a practical QRAM presents several challenges, including the impracticality of an infinitely large QRAM size and a fully error-correction implementation, it is essential to consider a practical case where the QRAM has a limited size. In this work, we focus on the access of larger data sizes without keeping on increasing the size of the QRAM. Firstly, we address the challenge of word length, as real-world datasets typically have larger word lengths than the single-bit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.05207","kind":"arxiv","version":2},"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/2303.05207/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":"2303.05207","created_at":"2026-07-05T06:23:02.381038+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.05207v2","created_at":"2026-07-05T06:23:02.381038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.05207","created_at":"2026-07-05T06:23:02.381038+00:00"},{"alias_kind":"pith_short_12","alias_value":"FTSCK6BGVLF5","created_at":"2026-07-05T06:23:02.381038+00:00"},{"alias_kind":"pith_short_16","alias_value":"FTSCK6BGVLF57NJ6","created_at":"2026-07-05T06:23:02.381038+00:00"},{"alias_kind":"pith_short_8","alias_value":"FTSCK6BG","created_at":"2026-07-05T06:23:02.381038+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":51,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG","json":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG.json","graph_json":"https://pith.science/api/pith-number/FTSCK6BGVLF57NJ64GTISPPKPG/graph.json","events_json":"https://pith.science/api/pith-number/FTSCK6BGVLF57NJ64GTISPPKPG/events.json","paper":"https://pith.science/paper/FTSCK6BG"},"agent_actions":{"view_html":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG","download_json":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG.json","view_paper":"https://pith.science/paper/FTSCK6BG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.05207&json=true","fetch_graph":"https://pith.science/api/pith-number/FTSCK6BGVLF57NJ64GTISPPKPG/graph.json","fetch_events":"https://pith.science/api/pith-number/FTSCK6BGVLF57NJ64GTISPPKPG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG/action/storage_attestation","attest_author":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG/action/author_attestation","sign_citation":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG/action/citation_signature","submit_replication":"https://pith.science/pith/FTSCK6BGVLF57NJ64GTISPPKPG/action/replication_record"}},"created_at":"2026-07-05T06:23:02.381038+00:00","updated_at":"2026-07-05T06:23:02.381038+00:00"}