{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:RJONFUM3QUG33WBSTLNVESHUSD","short_pith_number":"pith:RJONFUM3","schema_version":"1.0","canonical_sha256":"8a5cd2d19b850dbdd8329adb5248f490caee14ac933fe764c627550e11a16b52","source":{"kind":"arxiv","id":"2305.01816","version":3},"attestation_state":"computed","paper":{"title":"Numerical circuit synthesis and compilation for multi-state preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aaron Szasz, Ed Younis, Wibe de Jong","submitted_at":"2023-05-02T22:54:11Z","abstract_excerpt":"Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called \"state preparation\"; and circuits to implement a given unitary operation, for example by \"unitary synthesis\". In this paper we solve a more general problem: the transformation of a set of $m$ states to another set of $m$ states, which we call \"multi-state preparation\". State preparation and unitary synthesis are special"},"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":"2305.01816","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-02T22:54:11Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"56940c8b2eaa2b4690d13f74d05d48a1eb278352af4b591ff6d1f377dbe125f6","abstract_canon_sha256":"1ce812159a02aa1bd1eed5775bc1619717dd6aebbb261d09c2e72dd0cad76058"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:37.303870Z","signature_b64":"MjEcSmHMn42ty+OLEZJD+7ugdF1NJYrx0ipXHscHSXGDwcInisI++aQmZwYBKf43FxDlkD7UnfiQyJszfc91DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a5cd2d19b850dbdd8329adb5248f490caee14ac933fe764c627550e11a16b52","last_reissued_at":"2026-07-05T07:26:37.303393Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:37.303393Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Numerical circuit synthesis and compilation for multi-state preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aaron Szasz, Ed Younis, Wibe de Jong","submitted_at":"2023-05-02T22:54:11Z","abstract_excerpt":"Near-term quantum computers have significant error rates and short coherence times, so compilation of circuits to be as short as possible is essential. Two types of compilation problems are typically considered: circuits to prepare a given state from a fixed input state, called \"state preparation\"; and circuits to implement a given unitary operation, for example by \"unitary synthesis\". In this paper we solve a more general problem: the transformation of a set of $m$ states to another set of $m$ states, which we call \"multi-state preparation\". State preparation and unitary synthesis are special"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.01816","kind":"arxiv","version":3},"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/2305.01816/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":"2305.01816","created_at":"2026-07-05T07:26:37.303453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.01816v3","created_at":"2026-07-05T07:26:37.303453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.01816","created_at":"2026-07-05T07:26:37.303453+00:00"},{"alias_kind":"pith_short_12","alias_value":"RJONFUM3QUG3","created_at":"2026-07-05T07:26:37.303453+00:00"},{"alias_kind":"pith_short_16","alias_value":"RJONFUM3QUG33WBS","created_at":"2026-07-05T07:26:37.303453+00:00"},{"alias_kind":"pith_short_8","alias_value":"RJONFUM3","created_at":"2026-07-05T07:26:37.303453+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/RJONFUM3QUG33WBSTLNVESHUSD","json":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD.json","graph_json":"https://pith.science/api/pith-number/RJONFUM3QUG33WBSTLNVESHUSD/graph.json","events_json":"https://pith.science/api/pith-number/RJONFUM3QUG33WBSTLNVESHUSD/events.json","paper":"https://pith.science/paper/RJONFUM3"},"agent_actions":{"view_html":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD","download_json":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD.json","view_paper":"https://pith.science/paper/RJONFUM3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.01816&json=true","fetch_graph":"https://pith.science/api/pith-number/RJONFUM3QUG33WBSTLNVESHUSD/graph.json","fetch_events":"https://pith.science/api/pith-number/RJONFUM3QUG33WBSTLNVESHUSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD/action/storage_attestation","attest_author":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD/action/author_attestation","sign_citation":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD/action/citation_signature","submit_replication":"https://pith.science/pith/RJONFUM3QUG33WBSTLNVESHUSD/action/replication_record"}},"created_at":"2026-07-05T07:26:37.303453+00:00","updated_at":"2026-07-05T07:26:37.303453+00:00"}