{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:ZG2GTQHR55L2KG2U6KOTVROPKW","short_pith_number":"pith:ZG2GTQHR","schema_version":"1.0","canonical_sha256":"c9b469c0f1ef57a51b54f29d3ac5cf5597f85ea65a6d4b59a5bafafd956633ff","source":{"kind":"arxiv","id":"2411.15612","version":1},"attestation_state":"computed","paper":{"title":"Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. K. Weiss, Shifan Xu, Shruti Puri, S. M. Girvin, Yongshan Ding","submitted_at":"2024-11-23T17:27:30Z","abstract_excerpt":"Proposals for quantum random access memory (QRAM) generally have a binary-tree structure, and thus require hardware that is exponential in the depth of the QRAM. For solid-state based devices, a fabrication yield that is less than $100\\%$ implies that certain addresses at the bottom of the tree become inaccessible if a router in the unique path to that address is faulty. We discuss how to recover a functioning QRAM in the presence of faulty routers. We present the \\texttt{IterativeRepair} algorithm, which constructs QRAMs layer by layer until the desired depth is reached. This algorithm utiliz"},"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":"2411.15612","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-11-23T17:27:30Z","cross_cats_sorted":[],"title_canon_sha256":"ec5c8349bf95a4adae3b3b76fc0b524ffd6af6df94d2dc7103f99038cc870754","abstract_canon_sha256":"5028a84f50f56f193f6700e3e0e5d008b67507c42fe8df75be097b8f14f6b57f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:38.023194Z","signature_b64":"sVrMkWzZpdfbtmJjOTW6z53kcOXV8mxHI+lJJqgqS744R2xhKQvVeaCJfXr3N35Nkgn27z0+hDwVti35H8SVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9b469c0f1ef57a51b54f29d3ac5cf5597f85ea65a6d4b59a5bafafd956633ff","last_reissued_at":"2026-07-05T09:39:38.022530Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:38.022530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faulty towers: recovering a functioning quantum random access memory in the presence of defective routers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"D. K. Weiss, Shifan Xu, Shruti Puri, S. M. Girvin, Yongshan Ding","submitted_at":"2024-11-23T17:27:30Z","abstract_excerpt":"Proposals for quantum random access memory (QRAM) generally have a binary-tree structure, and thus require hardware that is exponential in the depth of the QRAM. For solid-state based devices, a fabrication yield that is less than $100\\%$ implies that certain addresses at the bottom of the tree become inaccessible if a router in the unique path to that address is faulty. We discuss how to recover a functioning QRAM in the presence of faulty routers. We present the \\texttt{IterativeRepair} algorithm, which constructs QRAMs layer by layer until the desired depth is reached. This algorithm utiliz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15612","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/2411.15612/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":"2411.15612","created_at":"2026-07-05T09:39:38.022615+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.15612v1","created_at":"2026-07-05T09:39:38.022615+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15612","created_at":"2026-07-05T09:39:38.022615+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZG2GTQHR55L2","created_at":"2026-07-05T09:39:38.022615+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZG2GTQHR55L2KG2U","created_at":"2026-07-05T09:39:38.022615+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZG2GTQHR","created_at":"2026-07-05T09:39:38.022615+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.10318","citing_title":"Analysis and Suppression of Errors in Quantum Random Access Memory under Extended Noise Models","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW","json":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW.json","graph_json":"https://pith.science/api/pith-number/ZG2GTQHR55L2KG2U6KOTVROPKW/graph.json","events_json":"https://pith.science/api/pith-number/ZG2GTQHR55L2KG2U6KOTVROPKW/events.json","paper":"https://pith.science/paper/ZG2GTQHR"},"agent_actions":{"view_html":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW","download_json":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW.json","view_paper":"https://pith.science/paper/ZG2GTQHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.15612&json=true","fetch_graph":"https://pith.science/api/pith-number/ZG2GTQHR55L2KG2U6KOTVROPKW/graph.json","fetch_events":"https://pith.science/api/pith-number/ZG2GTQHR55L2KG2U6KOTVROPKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW/action/storage_attestation","attest_author":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW/action/author_attestation","sign_citation":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW/action/citation_signature","submit_replication":"https://pith.science/pith/ZG2GTQHR55L2KG2U6KOTVROPKW/action/replication_record"}},"created_at":"2026-07-05T09:39:38.022615+00:00","updated_at":"2026-07-05T09:39:38.022615+00:00"}