{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WNWVN642NDOK4XTMCMJCU74AEK","short_pith_number":"pith:WNWVN642","schema_version":"1.0","canonical_sha256":"b36d56fb9a68dcae5e6c13122a7f80229f6e5dda167dbf51957d266341c0045e","source":{"kind":"arxiv","id":"2210.14892","version":2},"attestation_state":"computed","paper":{"title":"Quantum state preparation without coherent arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Mario Berta, Sam McArdle","submitted_at":"2022-10-26T17:48:31Z","abstract_excerpt":"We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to encode the function values. Instead, we use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function. Our method uses only 4 ancilla qubits (3 if the approximating polynomial has definite parity), providing order-of-magnitude qubit count reductions compared to state-of-the-art ap"},"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":"2210.14892","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-26T17:48:31Z","cross_cats_sorted":[],"title_canon_sha256":"d1df5be629e11dc950f77a19f8cd8de9716d2aae66792fb32fb947453fb4195b","abstract_canon_sha256":"747abd935ac9e3ab9672db8d78478e89c1bb64f8324b7b9d19bd0b70338c3c96"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:55.278439Z","signature_b64":"7k50B4P9SYYtNfIkbVud4h8vD6G3pebEEMe8ctpi7AdDCz1jL336b8MT2mAXn+iDqwya/Mtg7K+UvXbgjA4UCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b36d56fb9a68dcae5e6c13122a7f80229f6e5dda167dbf51957d266341c0045e","last_reissued_at":"2026-07-05T11:33:55.277963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:55.277963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum state preparation without coherent arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andr\\'as Gily\\'en, Mario Berta, Sam McArdle","submitted_at":"2022-10-26T17:48:31Z","abstract_excerpt":"We introduce a versatile method for preparing a quantum state whose amplitudes are given by some known function. Unlike existing approaches, our method does not require handcrafted reversible arithmetic circuits, or quantum table reads, to encode the function values. Instead, we use a template quantum eigenvalue transformation circuit to convert a low cost block encoding of the sine function into the desired function. Our method uses only 4 ancilla qubits (3 if the approximating polynomial has definite parity), providing order-of-magnitude qubit count reductions compared to state-of-the-art ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.14892","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/2210.14892/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":"2210.14892","created_at":"2026-07-05T11:33:55.278020+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.14892v2","created_at":"2026-07-05T11:33:55.278020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.14892","created_at":"2026-07-05T11:33:55.278020+00:00"},{"alias_kind":"pith_short_12","alias_value":"WNWVN642NDOK","created_at":"2026-07-05T11:33:55.278020+00:00"},{"alias_kind":"pith_short_16","alias_value":"WNWVN642NDOK4XTM","created_at":"2026-07-05T11:33:55.278020+00:00"},{"alias_kind":"pith_short_8","alias_value":"WNWVN642","created_at":"2026-07-05T11:33:55.278020+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2402.17148","citing_title":"Time series generation for option pricing on quantum computers using tensor network","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2410.02332","citing_title":"Polynomial time constructive decision algorithm for multivariable quantum signal processing","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2410.04435","citing_title":"QKAN: quantum Kolmogorov-Arnold networks with applications in machine learning and multivariate state preparation","ref_index":83,"is_internal_anchor":false},{"citing_arxiv_id":"2604.22996","citing_title":"Accelerating quantum Gibbs sampling without quantum walks","ref_index":47,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05881","citing_title":"Hybrid Quantum-Classical Algorithm for Hamiltonian Simulation","ref_index":54,"is_internal_anchor":false},{"citing_arxiv_id":"2604.19688","citing_title":"Quantum Eigenvalue Transformations for Arbitrary Matrices","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK","json":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK.json","graph_json":"https://pith.science/api/pith-number/WNWVN642NDOK4XTMCMJCU74AEK/graph.json","events_json":"https://pith.science/api/pith-number/WNWVN642NDOK4XTMCMJCU74AEK/events.json","paper":"https://pith.science/paper/WNWVN642"},"agent_actions":{"view_html":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK","download_json":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK.json","view_paper":"https://pith.science/paper/WNWVN642","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.14892&json=true","fetch_graph":"https://pith.science/api/pith-number/WNWVN642NDOK4XTMCMJCU74AEK/graph.json","fetch_events":"https://pith.science/api/pith-number/WNWVN642NDOK4XTMCMJCU74AEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK/action/storage_attestation","attest_author":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK/action/author_attestation","sign_citation":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK/action/citation_signature","submit_replication":"https://pith.science/pith/WNWVN642NDOK4XTMCMJCU74AEK/action/replication_record"}},"created_at":"2026-07-05T11:33:55.278020+00:00","updated_at":"2026-07-05T11:33:55.278020+00:00"}