{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:MC5DULTFNJVBTPJNC3N5EWQBMW","short_pith_number":"pith:MC5DULTF","schema_version":"1.0","canonical_sha256":"60ba3a2e656a6a19bd2d16dbd25a01658e6c802b543c4d8c1304f8709ef52423","source":{"kind":"arxiv","id":"2603.16492","version":2},"attestation_state":"computed","paper":{"title":"Reducing C-NOT Counts for State Preparation and Block Encoding via Diagonal Matrix Migration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guofeng Zhang, Xiao-Ming Zhang, Zexian Li","submitted_at":"2026-03-17T13:20:46Z","abstract_excerpt":"Quantum state preparation and block encoding are versatile and practical input models for quantum algorithms in scientific computing. The circuit complexity of state preparation and block encoding frequently dominates the end-to-end gate complexity of quantum algorithms. We give algorithms with lower C-NOT counts for both the state preparation and block encoding. For a general $n$-qubit state, we improve the C-NOT count of the Plesch-Brukner algorithm (2011) from $\\frac{23}{24}2^n$ to $\\frac{11}{12}2^n$. For block encoding, our single-ancilla protocol for $2^{n-1}\\times 2^{n-1}$ matrices uses "},"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":"2603.16492","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-03-17T13:20:46Z","cross_cats_sorted":[],"title_canon_sha256":"4d6f36dc2b885a96b41b42a2d166bc01c27e3d54182a8754f65ad5243e2779e7","abstract_canon_sha256":"43118dc75edda920ce8642b66ee1499b62125053e83b71f94af2e86028d33d70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-29T01:14:30.325702Z","signature_b64":"M0JL450BEW6u8s6Eg1y3zXqtskVz13Qf1u7vGsKvZykK1iDoFNLObT9Jg1pd3vHKJERwss3WwQT7wTM1oRb8Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60ba3a2e656a6a19bd2d16dbd25a01658e6c802b543c4d8c1304f8709ef52423","last_reissued_at":"2026-06-29T01:14:30.325153Z","signature_status":"signed_v1","first_computed_at":"2026-06-29T01:14:30.325153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducing C-NOT Counts for State Preparation and Block Encoding via Diagonal Matrix Migration","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guofeng Zhang, Xiao-Ming Zhang, Zexian Li","submitted_at":"2026-03-17T13:20:46Z","abstract_excerpt":"Quantum state preparation and block encoding are versatile and practical input models for quantum algorithms in scientific computing. The circuit complexity of state preparation and block encoding frequently dominates the end-to-end gate complexity of quantum algorithms. We give algorithms with lower C-NOT counts for both the state preparation and block encoding. For a general $n$-qubit state, we improve the C-NOT count of the Plesch-Brukner algorithm (2011) from $\\frac{23}{24}2^n$ to $\\frac{11}{12}2^n$. For block encoding, our single-ancilla protocol for $2^{n-1}\\times 2^{n-1}$ matrices uses "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.16492","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/2603.16492/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":"2603.16492","created_at":"2026-06-29T01:14:30.325207+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.16492v2","created_at":"2026-06-29T01:14:30.325207+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.16492","created_at":"2026-06-29T01:14:30.325207+00:00"},{"alias_kind":"pith_short_12","alias_value":"MC5DULTFNJVB","created_at":"2026-06-29T01:14:30.325207+00:00"},{"alias_kind":"pith_short_16","alias_value":"MC5DULTFNJVBTPJN","created_at":"2026-06-29T01:14:30.325207+00:00"},{"alias_kind":"pith_short_8","alias_value":"MC5DULTF","created_at":"2026-06-29T01:14:30.325207+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.13457","citing_title":"Reduced basis algorithm for solving nonlinear differential equations on quantum computers","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW","json":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW.json","graph_json":"https://pith.science/api/pith-number/MC5DULTFNJVBTPJNC3N5EWQBMW/graph.json","events_json":"https://pith.science/api/pith-number/MC5DULTFNJVBTPJNC3N5EWQBMW/events.json","paper":"https://pith.science/paper/MC5DULTF"},"agent_actions":{"view_html":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW","download_json":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW.json","view_paper":"https://pith.science/paper/MC5DULTF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.16492&json=true","fetch_graph":"https://pith.science/api/pith-number/MC5DULTFNJVBTPJNC3N5EWQBMW/graph.json","fetch_events":"https://pith.science/api/pith-number/MC5DULTFNJVBTPJNC3N5EWQBMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW/action/storage_attestation","attest_author":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW/action/author_attestation","sign_citation":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW/action/citation_signature","submit_replication":"https://pith.science/pith/MC5DULTFNJVBTPJNC3N5EWQBMW/action/replication_record"}},"created_at":"2026-06-29T01:14:30.325207+00:00","updated_at":"2026-06-29T01:14:30.325207+00:00"}