{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:NHYM4FLOXR6NEPLZ4UP7TXC3JH","short_pith_number":"pith:NHYM4FLO","schema_version":"1.0","canonical_sha256":"69f0ce156ebc7cd23d79e51ff9dc5b49da4ea7e92c54b929a9dc788e9422bf69","source":{"kind":"arxiv","id":"2508.17197","version":2},"attestation_state":"computed","paper":{"title":"Optimal Circuit Size for Fixed-Hamming-Weight Quantum States Preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jingquan Luo, Lvzhou Li","submitted_at":"2025-08-24T03:18:29Z","abstract_excerpt":"We study the problem of efficiently preparing fixed-Hamming-weight (HW-$k$) quantum states, which are superpositions of $n$-qubit computational basis states with exactly $k$ ones. We present a quantum circuit construction that prepares any $n$-qubit HW-$k$ state with a circuit size of $O(\\binom{n}{k})$ using at most $\\max\\{0, n-3\\}$ ancillary qubits. This is the first construction that achieves the theoretical lower bound on circuit size while using only a small number of ancillary qubits. We believe that the techniques presented in this work can be extended to other quantum state preparation "},"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.17197","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-08-24T03:18:29Z","cross_cats_sorted":[],"title_canon_sha256":"e7f8105aa4e225d8ce1b6cf4250109b800688e727017d75bacc98b03efaaa265","abstract_canon_sha256":"bdc1b34ff70b8636a1c029e3edfdf765ad63792e704820329c6d9597ee223e8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:59:20.878407Z","signature_b64":"NYiQ5NNfiLLn2sUVx7tYHZn3l6nlDmWIOhRF903qj8Jqe2QQ5DvI5Ye5InKRmMjvcUzvq2mXJWVWkDX5YoXBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69f0ce156ebc7cd23d79e51ff9dc5b49da4ea7e92c54b929a9dc788e9422bf69","last_reissued_at":"2026-07-05T11:59:20.877893Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:59:20.877893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Circuit Size for Fixed-Hamming-Weight Quantum States Preparation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jingquan Luo, Lvzhou Li","submitted_at":"2025-08-24T03:18:29Z","abstract_excerpt":"We study the problem of efficiently preparing fixed-Hamming-weight (HW-$k$) quantum states, which are superpositions of $n$-qubit computational basis states with exactly $k$ ones. We present a quantum circuit construction that prepares any $n$-qubit HW-$k$ state with a circuit size of $O(\\binom{n}{k})$ using at most $\\max\\{0, n-3\\}$ ancillary qubits. This is the first construction that achieves the theoretical lower bound on circuit size while using only a small number of ancillary qubits. We believe that the techniques presented in this work can be extended to other quantum state preparation "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.17197","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/2508.17197/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.17197","created_at":"2026-07-05T11:59:20.877952+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.17197v2","created_at":"2026-07-05T11:59:20.877952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.17197","created_at":"2026-07-05T11:59:20.877952+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHYM4FLOXR6N","created_at":"2026-07-05T11:59:20.877952+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHYM4FLOXR6NEPLZ","created_at":"2026-07-05T11:59:20.877952+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHYM4FLO","created_at":"2026-07-05T11:59:20.877952+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07942","citing_title":"A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling","ref_index":40,"is_internal_anchor":true},{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2606.24659","citing_title":"Preparing multi-qudit states in a definite-weight subspace","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH","json":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH.json","graph_json":"https://pith.science/api/pith-number/NHYM4FLOXR6NEPLZ4UP7TXC3JH/graph.json","events_json":"https://pith.science/api/pith-number/NHYM4FLOXR6NEPLZ4UP7TXC3JH/events.json","paper":"https://pith.science/paper/NHYM4FLO"},"agent_actions":{"view_html":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH","download_json":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH.json","view_paper":"https://pith.science/paper/NHYM4FLO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.17197&json=true","fetch_graph":"https://pith.science/api/pith-number/NHYM4FLOXR6NEPLZ4UP7TXC3JH/graph.json","fetch_events":"https://pith.science/api/pith-number/NHYM4FLOXR6NEPLZ4UP7TXC3JH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH/action/storage_attestation","attest_author":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH/action/author_attestation","sign_citation":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH/action/citation_signature","submit_replication":"https://pith.science/pith/NHYM4FLOXR6NEPLZ4UP7TXC3JH/action/replication_record"}},"created_at":"2026-07-05T11:59:20.877952+00:00","updated_at":"2026-07-05T11:59:20.877952+00:00"}