{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:XI2KJLJ4K47AW4IZ3YLDUOUYN7","short_pith_number":"pith:XI2KJLJ4","schema_version":"1.0","canonical_sha256":"ba34a4ad3c573e0b7119de163a3a986ffa42993a546577aa9bf9fc86a8a6c634","source":{"kind":"arxiv","id":"0708.1879","version":2},"attestation_state":"computed","paper":{"title":"Quantum random access memory","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lorenzo Maccone, Seth Lloyd, Vittorio Giovannetti","submitted_at":"2007-08-14T12:53:08Z","abstract_excerpt":"A random access memory (RAM) uses n bits to randomly address N=2^n distinct memory cells. A quantum random access memory (qRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(log N) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust qRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical i"},"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":"0708.1879","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2007-08-14T12:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"31b23053c988b048e1653104fd2c57fc8b681715d78e8d8770599e8b9a9a6c10","abstract_canon_sha256":"2d4e73f92eeca75c2e9fda45bc17f34c72dff9ddf83def7c0fce6c7ce9df944a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:05:10.704722Z","signature_b64":"JPF4sS6xYDAI8vYn4F6yBlCqlvibm1ePDoofxFdSrtK0uIzblosU3f+y/Xku2prnO7M9BzBvK/5vJeEngQyfAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba34a4ad3c573e0b7119de163a3a986ffa42993a546577aa9bf9fc86a8a6c634","last_reissued_at":"2026-07-04T17:05:10.704321Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:05:10.704321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum random access memory","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lorenzo Maccone, Seth Lloyd, Vittorio Giovannetti","submitted_at":"2007-08-14T12:53:08Z","abstract_excerpt":"A random access memory (RAM) uses n bits to randomly address N=2^n distinct memory cells. A quantum random access memory (qRAM) uses n qubits to address any quantum superposition of N memory cells. We present an architecture that exponentially reduces the requirements for a memory call: O(log N) switches need be thrown instead of the N used in conventional (classical or quantum) RAM designs. This yields a more robust qRAM algorithm, as it in general requires entanglement among exponentially less gates, and leads to an exponential decrease in the power needed for addressing. A quantum optical i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.1879","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/0708.1879/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":"0708.1879","created_at":"2026-07-04T17:05:10.704385+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.1879v2","created_at":"2026-07-04T17:05:10.704385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.1879","created_at":"2026-07-04T17:05:10.704385+00:00"},{"alias_kind":"pith_short_12","alias_value":"XI2KJLJ4K47A","created_at":"2026-07-04T17:05:10.704385+00:00"},{"alias_kind":"pith_short_16","alias_value":"XI2KJLJ4K47AW4IZ","created_at":"2026-07-04T17:05:10.704385+00:00"},{"alias_kind":"pith_short_8","alias_value":"XI2KJLJ4","created_at":"2026-07-04T17:05:10.704385+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.28927","citing_title":"Quantum encodings that preserve persistent homology","ref_index":197,"is_internal_anchor":true},{"citing_arxiv_id":"2111.07992","citing_title":"Query and Depth Upper Bounds for Quantum Unitaries via Grover Search","ref_index":7,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12385","citing_title":"Lower overhead fault-tolerant building blocks for noisy quantum computers","ref_index":130,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06319","citing_title":"Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting","ref_index":83,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7","json":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7.json","graph_json":"https://pith.science/api/pith-number/XI2KJLJ4K47AW4IZ3YLDUOUYN7/graph.json","events_json":"https://pith.science/api/pith-number/XI2KJLJ4K47AW4IZ3YLDUOUYN7/events.json","paper":"https://pith.science/paper/XI2KJLJ4"},"agent_actions":{"view_html":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7","download_json":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7.json","view_paper":"https://pith.science/paper/XI2KJLJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.1879&json=true","fetch_graph":"https://pith.science/api/pith-number/XI2KJLJ4K47AW4IZ3YLDUOUYN7/graph.json","fetch_events":"https://pith.science/api/pith-number/XI2KJLJ4K47AW4IZ3YLDUOUYN7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7/action/storage_attestation","attest_author":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7/action/author_attestation","sign_citation":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7/action/citation_signature","submit_replication":"https://pith.science/pith/XI2KJLJ4K47AW4IZ3YLDUOUYN7/action/replication_record"}},"created_at":"2026-07-04T17:05:10.704385+00:00","updated_at":"2026-07-04T17:05:10.704385+00:00"}