{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NEWQ5UY3FVCZ43Y6YBZU44LXLV","short_pith_number":"pith:NEWQ5UY3","schema_version":"1.0","canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","source":{"kind":"arxiv","id":"1901.02362","version":1},"attestation_state":"computed","paper":{"title":"Circuit-Based Quantum Random Access Memory for Classical Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel K. Park, Francesco Petruccione, June-Koo Kevin Rhee","submitted_at":"2019-01-08T15:26:24Z","abstract_excerpt":"A prerequisite for many quantum information processing tasks to truly surpass classical approaches is an efficient procedure to encode classical data in quantum superposition states. In this work, we present a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way. For registering or updating classical data consisting of $M$ entries, each represented by $n$ bits, the method requires $O(n)$ qubits and $O(Mn)$ steps. With post-selection at an additional cost, our method can also store continuous data as proba"},"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":"1901.02362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-08T15:26:24Z","cross_cats_sorted":[],"title_canon_sha256":"41c92ee01fc180def4c14d46fa7bee81a7426d97f764924315c6f8715df2cf13","abstract_canon_sha256":"2fcadf61ed8d9432125a919583376fc357265f5fa567fc69f5d6f4b361b90ebe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:22.092888Z","signature_b64":"G/tl8pBdh/b69aMtX7qyED1W0nrLajN411vu1oczMqKppG1sNOFXHUTygOqwcjq0nZCsZPnooWJHOCtH8naSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"692d0ed31b2d459e6f1ec0734e71775d45de77f9c362236ae6616f350b46e0a5","last_reissued_at":"2026-05-17T23:48:22.092362Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:22.092362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit-Based Quantum Random Access Memory for Classical Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniel K. Park, Francesco Petruccione, June-Koo Kevin Rhee","submitted_at":"2019-01-08T15:26:24Z","abstract_excerpt":"A prerequisite for many quantum information processing tasks to truly surpass classical approaches is an efficient procedure to encode classical data in quantum superposition states. In this work, we present a circuit-based flip-flop quantum random access memory to construct a quantum database of classical information in a systematic and flexible way. For registering or updating classical data consisting of $M$ entries, each represented by $n$ bits, the method requires $O(n)$ qubits and $O(Mn)$ steps. With post-selection at an additional cost, our method can also store continuous data as proba"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02362","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":""},"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":"1901.02362","created_at":"2026-05-17T23:48:22.092450+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02362v1","created_at":"2026-05-17T23:48:22.092450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02362","created_at":"2026-05-17T23:48:22.092450+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEWQ5UY3FVCZ","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEWQ5UY3FVCZ43Y6","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEWQ5UY3","created_at":"2026-05-18T12:33:24.271573+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/NEWQ5UY3FVCZ43Y6YBZU44LXLV","json":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV.json","graph_json":"https://pith.science/api/pith-number/NEWQ5UY3FVCZ43Y6YBZU44LXLV/graph.json","events_json":"https://pith.science/api/pith-number/NEWQ5UY3FVCZ43Y6YBZU44LXLV/events.json","paper":"https://pith.science/paper/NEWQ5UY3"},"agent_actions":{"view_html":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV","download_json":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV.json","view_paper":"https://pith.science/paper/NEWQ5UY3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02362&json=true","fetch_graph":"https://pith.science/api/pith-number/NEWQ5UY3FVCZ43Y6YBZU44LXLV/graph.json","fetch_events":"https://pith.science/api/pith-number/NEWQ5UY3FVCZ43Y6YBZU44LXLV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/action/storage_attestation","attest_author":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/action/author_attestation","sign_citation":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/action/citation_signature","submit_replication":"https://pith.science/pith/NEWQ5UY3FVCZ43Y6YBZU44LXLV/action/replication_record"}},"created_at":"2026-05-17T23:48:22.092450+00:00","updated_at":"2026-05-17T23:48:22.092450+00:00"}