{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2CTSDWGA3PBINZ3G2KHGTK4ZC4","short_pith_number":"pith:2CTSDWGA","schema_version":"1.0","canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","source":{"kind":"arxiv","id":"2408.16794","version":2},"attestation_state":"computed","paper":{"title":"A quantum random access memory (QRAM) using a polynomial encoding of binary strings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Priyanka Mukhopadhyay","submitted_at":"2024-08-28T18:39:56Z","abstract_excerpt":"Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly. Integral to "},"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":"2408.16794","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-28T18:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"9afa8be587833585947d19152bdccc6547b63e07edc4e8c8a6670dd4623e2438","abstract_canon_sha256":"cd2b2510fbae8abea5628e6d80e57aa6cb842e2f1dbc8f970d7698f3be8fc0ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:38.778967Z","signature_b64":"QTyOuVknQyzLCrCovLLvvVGxfH2lQAwTxiHhWf2VGOa8NfvF/xk5a/qcpkWbcwKlmPnl8/5E6/idBj1U7s8EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","last_reissued_at":"2026-07-05T10:43:38.778499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:38.778499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum random access memory (QRAM) using a polynomial encoding of binary strings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Priyanka Mukhopadhyay","submitted_at":"2024-08-28T18:39:56Z","abstract_excerpt":"Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly. Integral to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16794","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/2408.16794/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":"2408.16794","created_at":"2026-07-05T10:43:38.778559+00:00"},{"alias_kind":"arxiv_version","alias_value":"2408.16794v2","created_at":"2026-07-05T10:43:38.778559+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16794","created_at":"2026-07-05T10:43:38.778559+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CTSDWGA3PBI","created_at":"2026-07-05T10:43:38.778559+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CTSDWGA3PBINZ3G","created_at":"2026-07-05T10:43:38.778559+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CTSDWGA","created_at":"2026-07-05T10:43:38.778559+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.13759","citing_title":"On the practicality of quantum sieving algorithms for the shortest vector problem","ref_index":161,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4","json":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4.json","graph_json":"https://pith.science/api/pith-number/2CTSDWGA3PBINZ3G2KHGTK4ZC4/graph.json","events_json":"https://pith.science/api/pith-number/2CTSDWGA3PBINZ3G2KHGTK4ZC4/events.json","paper":"https://pith.science/paper/2CTSDWGA"},"agent_actions":{"view_html":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4","download_json":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4.json","view_paper":"https://pith.science/paper/2CTSDWGA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2408.16794&json=true","fetch_graph":"https://pith.science/api/pith-number/2CTSDWGA3PBINZ3G2KHGTK4ZC4/graph.json","fetch_events":"https://pith.science/api/pith-number/2CTSDWGA3PBINZ3G2KHGTK4ZC4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/action/storage_attestation","attest_author":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/action/author_attestation","sign_citation":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/action/citation_signature","submit_replication":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/action/replication_record"}},"created_at":"2026-07-05T10:43:38.778559+00:00","updated_at":"2026-07-05T10:43:38.778559+00:00"}