{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:C47ECGBAQSYAGPFP2WBTYCYS2W","short_pith_number":"pith:C47ECGBA","schema_version":"1.0","canonical_sha256":"173e41182084b0033cafd5833c0b12d58cfebc6d539cd7ffb110a2b28ea8437b","source":{"kind":"arxiv","id":"2405.11436","version":1},"attestation_state":"computed","paper":{"title":"Quantum sampling algorithms for quantum state preparation and matrix block-encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Burak \\c{S}ahino\\u{g}lu, Jessica Lemieux, Karthik Seetharam, Matteo Lostaglio, Sam Pallister, Sukin Sim, William Pol","submitted_at":"2024-05-19T03:46:11Z","abstract_excerpt":"The problems of quantum state preparation and matrix block-encoding are ubiquitous in quantum computing: they are crucial parts of various quantum algorithms for the purpose for initial state preparation as well as loading problem relevant data. We first present an algorithm based on QRS that prepares a quantum state $|\\psi_f\\rangle \\propto \\sum^N_{x=1} f(x)|x\\rangle$. When combined with efficient reference states the algorithm reduces the cost of quantum state preparation substantially, if certain criteria on $f$ are met. When the preparation of the reference state is not the dominant cost, a"},"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":"2405.11436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-19T03:46:11Z","cross_cats_sorted":[],"title_canon_sha256":"16d196ff9836ebd495d1339f54df440d14e97ee08c2435270b80333691a81057","abstract_canon_sha256":"bef9d43320bf4c9c0f108b91cd4ec4abab5551363e7c3ea9002a6dcdfa8440a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:20:39.220970Z","signature_b64":"P+2aKU7K+M2Yrib8p9RsulgKUYk1xPwSjKxeHLK3e8LN8+kkxCJEfRKrUBhCaKr8Nl7b6h6LZFWpXoYDwSq9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"173e41182084b0033cafd5833c0b12d58cfebc6d539cd7ffb110a2b28ea8437b","last_reissued_at":"2026-07-05T08:20:39.220565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:20:39.220565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum sampling algorithms for quantum state preparation and matrix block-encoding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Burak \\c{S}ahino\\u{g}lu, Jessica Lemieux, Karthik Seetharam, Matteo Lostaglio, Sam Pallister, Sukin Sim, William Pol","submitted_at":"2024-05-19T03:46:11Z","abstract_excerpt":"The problems of quantum state preparation and matrix block-encoding are ubiquitous in quantum computing: they are crucial parts of various quantum algorithms for the purpose for initial state preparation as well as loading problem relevant data. We first present an algorithm based on QRS that prepares a quantum state $|\\psi_f\\rangle \\propto \\sum^N_{x=1} f(x)|x\\rangle$. When combined with efficient reference states the algorithm reduces the cost of quantum state preparation substantially, if certain criteria on $f$ are met. When the preparation of the reference state is not the dominant cost, a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.11436","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/2405.11436/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":"2405.11436","created_at":"2026-07-05T08:20:39.220624+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.11436v1","created_at":"2026-07-05T08:20:39.220624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.11436","created_at":"2026-07-05T08:20:39.220624+00:00"},{"alias_kind":"pith_short_12","alias_value":"C47ECGBAQSYA","created_at":"2026-07-05T08:20:39.220624+00:00"},{"alias_kind":"pith_short_16","alias_value":"C47ECGBAQSYAGPFP","created_at":"2026-07-05T08:20:39.220624+00:00"},{"alias_kind":"pith_short_8","alias_value":"C47ECGBA","created_at":"2026-07-05T08:20:39.220624+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2507.22562","citing_title":"Minimizing entanglement entropy for enhanced quantum state preparation","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W","json":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W.json","graph_json":"https://pith.science/api/pith-number/C47ECGBAQSYAGPFP2WBTYCYS2W/graph.json","events_json":"https://pith.science/api/pith-number/C47ECGBAQSYAGPFP2WBTYCYS2W/events.json","paper":"https://pith.science/paper/C47ECGBA"},"agent_actions":{"view_html":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W","download_json":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W.json","view_paper":"https://pith.science/paper/C47ECGBA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.11436&json=true","fetch_graph":"https://pith.science/api/pith-number/C47ECGBAQSYAGPFP2WBTYCYS2W/graph.json","fetch_events":"https://pith.science/api/pith-number/C47ECGBAQSYAGPFP2WBTYCYS2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W/action/storage_attestation","attest_author":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W/action/author_attestation","sign_citation":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W/action/citation_signature","submit_replication":"https://pith.science/pith/C47ECGBAQSYAGPFP2WBTYCYS2W/action/replication_record"}},"created_at":"2026-07-05T08:20:39.220624+00:00","updated_at":"2026-07-05T08:20:39.220624+00:00"}