{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KBJKYIILNXG7G6BVVX4KCXZT3J","short_pith_number":"pith:KBJKYIIL","schema_version":"1.0","canonical_sha256":"5052ac210b6dcdf37835adf8a15f33da71277166604ec5d385ad5da6fd8fd366","source":{"kind":"arxiv","id":"2508.03987","version":1},"attestation_state":"computed","paper":{"title":"A simpler Gaussian state-preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin Rempfer, Justin Elenewski, Kevin Obenland, Parker Kuklinski","submitted_at":"2025-08-06T00:40:28Z","abstract_excerpt":"The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it faces enormous resource overheads making it functionally impractical. In this paper, we present a new, more intuitive method which uses exactly $n-1$ rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\\lfloor(n-1)/2\\rfloor$ ancilla to state-prepare an $n$-qubit Gaussian state. We then apply optimizations to the circuit to render it linear in T-dept"},"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":"2508.03987","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-06T00:40:28Z","cross_cats_sorted":[],"title_canon_sha256":"91f20a5e0f8f9e044014bca190b79d5c0cc3b62398456c96fe74889befd23265","abstract_canon_sha256":"52be38435718ec5f4da27ca68884d2121407c71991372bd9e082595dfe105c10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:18.528088Z","signature_b64":"Fxx6zslhnMDyfcBSI46CL9Qqm3q0uf112trDfbAqksFZeYyLMBIvgk5eH28Fxw26DWGkQ0ePYFEhkeg4p6yNBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5052ac210b6dcdf37835adf8a15f33da71277166604ec5d385ad5da6fd8fd366","last_reissued_at":"2026-07-05T11:49:18.527572Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:18.527572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simpler Gaussian state-preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Benjamin Rempfer, Justin Elenewski, Kevin Obenland, Parker Kuklinski","submitted_at":"2025-08-06T00:40:28Z","abstract_excerpt":"The ability to efficiently state-prepare Gaussian distributions is critical to the success of numerous quantum algorithms. The most popular algorithm for this subroutine (Kitaev-Webb) has favorable polynomial resource scaling, however it faces enormous resource overheads making it functionally impractical. In this paper, we present a new, more intuitive method which uses exactly $n-1$ rotations, $(n-1)(n-2)/2$ two-qubit controlled rotations, and $\\lfloor(n-1)/2\\rfloor$ ancilla to state-prepare an $n$-qubit Gaussian state. We then apply optimizations to the circuit to render it linear in T-dept"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.03987","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/2508.03987/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":"2508.03987","created_at":"2026-07-05T11:49:18.527631+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.03987v1","created_at":"2026-07-05T11:49:18.527631+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.03987","created_at":"2026-07-05T11:49:18.527631+00:00"},{"alias_kind":"pith_short_12","alias_value":"KBJKYIILNXG7","created_at":"2026-07-05T11:49:18.527631+00:00"},{"alias_kind":"pith_short_16","alias_value":"KBJKYIILNXG7G6BV","created_at":"2026-07-05T11:49:18.527631+00:00"},{"alias_kind":"pith_short_8","alias_value":"KBJKYIIL","created_at":"2026-07-05T11:49:18.527631+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.09538","citing_title":"Explicit Block Encoding of Difference-of-Gaussian Operators on a Periodic Grid","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J","json":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J.json","graph_json":"https://pith.science/api/pith-number/KBJKYIILNXG7G6BVVX4KCXZT3J/graph.json","events_json":"https://pith.science/api/pith-number/KBJKYIILNXG7G6BVVX4KCXZT3J/events.json","paper":"https://pith.science/paper/KBJKYIIL"},"agent_actions":{"view_html":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J","download_json":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J.json","view_paper":"https://pith.science/paper/KBJKYIIL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.03987&json=true","fetch_graph":"https://pith.science/api/pith-number/KBJKYIILNXG7G6BVVX4KCXZT3J/graph.json","fetch_events":"https://pith.science/api/pith-number/KBJKYIILNXG7G6BVVX4KCXZT3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J/action/storage_attestation","attest_author":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J/action/author_attestation","sign_citation":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J/action/citation_signature","submit_replication":"https://pith.science/pith/KBJKYIILNXG7G6BVVX4KCXZT3J/action/replication_record"}},"created_at":"2026-07-05T11:49:18.527631+00:00","updated_at":"2026-07-05T11:49:18.527631+00:00"}