{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:PIRBGS2KDF6HEFLFDUPEY37MTX","short_pith_number":"pith:PIRBGS2K","schema_version":"1.0","canonical_sha256":"7a22134b4a197c7215651d1e4c6fec9dc979d41cf2a0ca9a19f2081ccc46a98f","source":{"kind":"arxiv","id":"2011.07977","version":1},"attestation_state":"computed","paper":{"title":"Circuit-based quantum random access memory for classical data with continuous amplitudes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Adenilton J. da Silva, Daniel K. Park, Ismael C. S. de Araujo, Tiago M. L. de Veras","submitted_at":"2020-11-16T14:17:06Z","abstract_excerpt":"Loading data in a quantum device is required in several quantum computing applications. Without an efficient loading procedure, the cost to initialize the algorithms can dominate the overall computational cost. A circuit-based quantum random access memory named FF-QRAM can load M n-bit patterns with computational cost O(CMn) to load continuous data where C depends on the data distribution. In this work, we propose a strategy to load continuous data without post-selection with computational cost O(Mn). The proposed method is based on the probabilistic quantum memory, a strategy to load binary d"},"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":"2011.07977","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-11-16T14:17:06Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"1cc5603fcfd4fb6c2e056327a4567e576a3a022af240be990b0723178b5b5d81","abstract_canon_sha256":"2696e577f5ad6fa1fdbbeeb95913edd838b8efcb0098d124aaa89f731540f456"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:51:56.131011Z","signature_b64":"RjhSCR8CoqkUQix7dqGYG5rS6mswKOg6POlpJgkKTOUv2azKPFMN93VRWsD0NgygQ4FkGuZm1SEOxaupEJEHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a22134b4a197c7215651d1e4c6fec9dc979d41cf2a0ca9a19f2081ccc46a98f","last_reissued_at":"2026-07-05T01:51:56.130598Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:51:56.130598Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Circuit-based quantum random access memory for classical data with continuous amplitudes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Adenilton J. da Silva, Daniel K. Park, Ismael C. S. de Araujo, Tiago M. L. de Veras","submitted_at":"2020-11-16T14:17:06Z","abstract_excerpt":"Loading data in a quantum device is required in several quantum computing applications. Without an efficient loading procedure, the cost to initialize the algorithms can dominate the overall computational cost. A circuit-based quantum random access memory named FF-QRAM can load M n-bit patterns with computational cost O(CMn) to load continuous data where C depends on the data distribution. In this work, we propose a strategy to load continuous data without post-selection with computational cost O(Mn). The proposed method is based on the probabilistic quantum memory, a strategy to load binary d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07977","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/2011.07977/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":"2011.07977","created_at":"2026-07-05T01:51:56.130664+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.07977v1","created_at":"2026-07-05T01:51:56.130664+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07977","created_at":"2026-07-05T01:51:56.130664+00:00"},{"alias_kind":"pith_short_12","alias_value":"PIRBGS2KDF6H","created_at":"2026-07-05T01:51:56.130664+00:00"},{"alias_kind":"pith_short_16","alias_value":"PIRBGS2KDF6HEFLF","created_at":"2026-07-05T01:51:56.130664+00:00"},{"alias_kind":"pith_short_8","alias_value":"PIRBGS2K","created_at":"2026-07-05T01:51:56.130664+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/PIRBGS2KDF6HEFLFDUPEY37MTX","json":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX.json","graph_json":"https://pith.science/api/pith-number/PIRBGS2KDF6HEFLFDUPEY37MTX/graph.json","events_json":"https://pith.science/api/pith-number/PIRBGS2KDF6HEFLFDUPEY37MTX/events.json","paper":"https://pith.science/paper/PIRBGS2K"},"agent_actions":{"view_html":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX","download_json":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX.json","view_paper":"https://pith.science/paper/PIRBGS2K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.07977&json=true","fetch_graph":"https://pith.science/api/pith-number/PIRBGS2KDF6HEFLFDUPEY37MTX/graph.json","fetch_events":"https://pith.science/api/pith-number/PIRBGS2KDF6HEFLFDUPEY37MTX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX/action/storage_attestation","attest_author":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX/action/author_attestation","sign_citation":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX/action/citation_signature","submit_replication":"https://pith.science/pith/PIRBGS2KDF6HEFLFDUPEY37MTX/action/replication_record"}},"created_at":"2026-07-05T01:51:56.130664+00:00","updated_at":"2026-07-05T01:51:56.130664+00:00"}