{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y2UFG2M2LIRD74TAEQOLPEP2YO","short_pith_number":"pith:Y2UFG2M2","schema_version":"1.0","canonical_sha256":"c6a853699a5a223ff260241cb791fac39ffb8d61ac99df9395e058912d509503","source":{"kind":"arxiv","id":"1807.03206","version":2},"attestation_state":"computed","paper":{"title":"Black-box quantum state preparation without arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Artur Scherer, Dominic W. Berry, Guang Hao Low, Yuval R. Sanders","submitted_at":"2018-07-09T14:56:57Z","abstract_excerpt":"Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286-374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer t"},"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":"1807.03206","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-07-09T14:56:57Z","cross_cats_sorted":[],"title_canon_sha256":"33423399e317e505f44dcd628288b107be4252390e4f63b15d0a1f43cd3d8a68","abstract_canon_sha256":"395bcbdbd7078f516c9b55fee77150bb3ec996f693db687ba2e0ad7469f57ab5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:03.439758Z","signature_b64":"r4jGLwuUR5AIxwWAoNgQlLMUKsLhaGffYlPoK/jFGVIPatBEElM8wbId9aiPTYPM6XQf/kIo6xyoVOloWm1/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6a853699a5a223ff260241cb791fac39ffb8d61ac99df9395e058912d509503","last_reissued_at":"2026-05-17T23:55:03.439228Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:03.439228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Black-box quantum state preparation without arithmetic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Artur Scherer, Dominic W. Berry, Guang Hao Low, Yuval R. Sanders","submitted_at":"2018-07-09T14:56:57Z","abstract_excerpt":"Black-box quantum state preparation is an important subroutine in many quantum algorithms. The standard approach requires the quantum computer to do arithmetic, which is a key contributor to the complexity. Here we present a new algorithm that avoids arithmetic. We thereby reduce the number of gates by a factor of 286-374 over the best prior work for realistic precision; the improvement factor increases with the precision. As quantum state preparation is a crucial subroutine in many approaches to simulating physics on a quantum computer, our new method brings useful quantum simulation closer t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.03206","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":""},"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":"1807.03206","created_at":"2026-05-17T23:55:03.439327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.03206v2","created_at":"2026-05-17T23:55:03.439327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.03206","created_at":"2026-05-17T23:55:03.439327+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2UFG2M2LIRD","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2UFG2M2LIRD74TA","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2UFG2M2","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04861","citing_title":"Quantum algorithm for solving differential equations using SLAC derivatives","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO","json":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO.json","graph_json":"https://pith.science/api/pith-number/Y2UFG2M2LIRD74TAEQOLPEP2YO/graph.json","events_json":"https://pith.science/api/pith-number/Y2UFG2M2LIRD74TAEQOLPEP2YO/events.json","paper":"https://pith.science/paper/Y2UFG2M2"},"agent_actions":{"view_html":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO","download_json":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO.json","view_paper":"https://pith.science/paper/Y2UFG2M2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.03206&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2UFG2M2LIRD74TAEQOLPEP2YO/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2UFG2M2LIRD74TAEQOLPEP2YO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO/action/storage_attestation","attest_author":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO/action/author_attestation","sign_citation":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO/action/citation_signature","submit_replication":"https://pith.science/pith/Y2UFG2M2LIRD74TAEQOLPEP2YO/action/replication_record"}},"created_at":"2026-05-17T23:55:03.439327+00:00","updated_at":"2026-05-17T23:55:03.439327+00:00"}