{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KDOPKFPFC6J6EESLNCAKSFQFHU","short_pith_number":"pith:KDOPKFPF","schema_version":"1.0","canonical_sha256":"50dcf515e51793e2124b6880a916053d10d643fe7f7ffce53496501def2dcbcf","source":{"kind":"arxiv","id":"2502.06767","version":2},"attestation_state":"computed","paper":{"title":"Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Alvin Lu, Shifan Xu, Yongshan Ding","submitted_at":"2025-02-10T18:47:16Z","abstract_excerpt":"Quantum Random Access Memory (QRAM) is a crucial architectural component for querying classical or quantum data in superposition, enabling algorithms with wide-ranging applications in quantum arithmetic, quantum chemistry, machine learning, and quantum cryptography. In this work, we introduce Fat-Tree QRAM, a novel query architecture capable of pipelining multiple quantum queries simultaneously while maintaining desirable scalings in query speed and fidelity. Specifically, Fat-Tree QRAM performs $O(\\log (N))$ independent queries in $O(\\log (N))$ time using $O(N)$ qubits, offering immense paral"},"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":"2502.06767","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2025-02-10T18:47:16Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"d90d1cc8732e8fef1a6ab9a7218ea00cf0d12d16402611827ba18d15214021c3","abstract_canon_sha256":"5a749a8c68e933e9b47f64843cf98d3414c09fcb3031d1d478e47c5d49178493"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:22:56.712914Z","signature_b64":"TgIy91eAM/0vyiTzxkYnQ3UHQh7d7YjVUXBd3X7krNd08dhYsJA3c+B0ju8AktBSMF7U2cMVv3342QB6y1J5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50dcf515e51793e2124b6880a916053d10d643fe7f7ffce53496501def2dcbcf","last_reissued_at":"2026-07-05T10:22:56.712296Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:22:56.712296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fat-Tree QRAM: A High-Bandwidth Shared Quantum Random Access Memory for Parallel Queries","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"quant-ph","authors_text":"Alvin Lu, Shifan Xu, Yongshan Ding","submitted_at":"2025-02-10T18:47:16Z","abstract_excerpt":"Quantum Random Access Memory (QRAM) is a crucial architectural component for querying classical or quantum data in superposition, enabling algorithms with wide-ranging applications in quantum arithmetic, quantum chemistry, machine learning, and quantum cryptography. In this work, we introduce Fat-Tree QRAM, a novel query architecture capable of pipelining multiple quantum queries simultaneously while maintaining desirable scalings in query speed and fidelity. Specifically, Fat-Tree QRAM performs $O(\\log (N))$ independent queries in $O(\\log (N))$ time using $O(N)$ qubits, offering immense paral"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06767","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/2502.06767/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":"2502.06767","created_at":"2026-07-05T10:22:56.712384+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06767v2","created_at":"2026-07-05T10:22:56.712384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06767","created_at":"2026-07-05T10:22:56.712384+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDOPKFPFC6J6","created_at":"2026-07-05T10:22:56.712384+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDOPKFPFC6J6EESL","created_at":"2026-07-05T10:22:56.712384+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDOPKFPF","created_at":"2026-07-05T10:22:56.712384+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/KDOPKFPFC6J6EESLNCAKSFQFHU","json":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU.json","graph_json":"https://pith.science/api/pith-number/KDOPKFPFC6J6EESLNCAKSFQFHU/graph.json","events_json":"https://pith.science/api/pith-number/KDOPKFPFC6J6EESLNCAKSFQFHU/events.json","paper":"https://pith.science/paper/KDOPKFPF"},"agent_actions":{"view_html":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU","download_json":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU.json","view_paper":"https://pith.science/paper/KDOPKFPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06767&json=true","fetch_graph":"https://pith.science/api/pith-number/KDOPKFPFC6J6EESLNCAKSFQFHU/graph.json","fetch_events":"https://pith.science/api/pith-number/KDOPKFPFC6J6EESLNCAKSFQFHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU/action/storage_attestation","attest_author":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU/action/author_attestation","sign_citation":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU/action/citation_signature","submit_replication":"https://pith.science/pith/KDOPKFPFC6J6EESLNCAKSFQFHU/action/replication_record"}},"created_at":"2026-07-05T10:22:56.712384+00:00","updated_at":"2026-07-05T10:22:56.712384+00:00"}