{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WBGB5GNLJDUS73XLKLQKZTAH7B","short_pith_number":"pith:WBGB5GNL","schema_version":"1.0","canonical_sha256":"b04c1e99ab48e92feeeb52e0accc07f852ded68ef50ce40b9183a68b3132c4b7","source":{"kind":"arxiv","id":"2606.18201","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of the Circuit Width Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Yinchen Liu, Zhengfeng Ji, Zhe'ou Zhou","submitted_at":"2026-06-16T17:31:50Z","abstract_excerpt":"Montanaro's polynomial representation expresses amplitudes of quantum circuits over the gates $H$, $Z$, $CZ$, and $CCZ$ as normalized gaps of degree-three polynomials over $\\mathbb{F}_2$. The normalization is governed by the circuit width $w(f)$, the minimum number of qubits in any circuit realizing a polynomial $f$. Thus, efficient width minimization would give an approximate-counting route toward a combinatorial characterization of $BQP$. We study the computational complexity of this parameter. For degree-three polynomials with no constant term, deciding whether $w(f)\\le k$ is $NP$-complete,"},"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":"2606.18201","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-16T17:31:50Z","cross_cats_sorted":[],"title_canon_sha256":"6d104706b5e9ddf3155d340aa9199ea5a7ede5683096cbb5f4688ad62e47fce1","abstract_canon_sha256":"acea6d5b1daae5b9a939128025e4dfa00bac38fa6e6f0f6591f208d84e556746"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:50.787159Z","signature_b64":"bHI8aGLiyeICaeQi82KIm/VdwdaHAp+DlLx7IpcSa0+A2pgRBp0c3bEkFbE8j4IgwMhnOl+x3V7Berxt2JMKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b04c1e99ab48e92feeeb52e0accc07f852ded68ef50ce40b9183a68b3132c4b7","last_reissued_at":"2026-06-19T16:10:50.786822Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:50.786822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of the Circuit Width Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Yinchen Liu, Zhengfeng Ji, Zhe'ou Zhou","submitted_at":"2026-06-16T17:31:50Z","abstract_excerpt":"Montanaro's polynomial representation expresses amplitudes of quantum circuits over the gates $H$, $Z$, $CZ$, and $CCZ$ as normalized gaps of degree-three polynomials over $\\mathbb{F}_2$. The normalization is governed by the circuit width $w(f)$, the minimum number of qubits in any circuit realizing a polynomial $f$. Thus, efficient width minimization would give an approximate-counting route toward a combinatorial characterization of $BQP$. We study the computational complexity of this parameter. For degree-three polynomials with no constant term, deciding whether $w(f)\\le k$ is $NP$-complete,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18201","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/2606.18201/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":"2606.18201","created_at":"2026-06-19T16:10:50.786882+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18201v1","created_at":"2026-06-19T16:10:50.786882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18201","created_at":"2026-06-19T16:10:50.786882+00:00"},{"alias_kind":"pith_short_12","alias_value":"WBGB5GNLJDUS","created_at":"2026-06-19T16:10:50.786882+00:00"},{"alias_kind":"pith_short_16","alias_value":"WBGB5GNLJDUS73XL","created_at":"2026-06-19T16:10:50.786882+00:00"},{"alias_kind":"pith_short_8","alias_value":"WBGB5GNL","created_at":"2026-06-19T16:10:50.786882+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/WBGB5GNLJDUS73XLKLQKZTAH7B","json":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B.json","graph_json":"https://pith.science/api/pith-number/WBGB5GNLJDUS73XLKLQKZTAH7B/graph.json","events_json":"https://pith.science/api/pith-number/WBGB5GNLJDUS73XLKLQKZTAH7B/events.json","paper":"https://pith.science/paper/WBGB5GNL"},"agent_actions":{"view_html":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B","download_json":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B.json","view_paper":"https://pith.science/paper/WBGB5GNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18201&json=true","fetch_graph":"https://pith.science/api/pith-number/WBGB5GNLJDUS73XLKLQKZTAH7B/graph.json","fetch_events":"https://pith.science/api/pith-number/WBGB5GNLJDUS73XLKLQKZTAH7B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B/action/storage_attestation","attest_author":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B/action/author_attestation","sign_citation":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B/action/citation_signature","submit_replication":"https://pith.science/pith/WBGB5GNLJDUS73XLKLQKZTAH7B/action/replication_record"}},"created_at":"2026-06-19T16:10:50.786882+00:00","updated_at":"2026-06-19T16:10:50.786882+00:00"}