{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:3RLYC64EYCYHCPK3IB7XSCLJLL","short_pith_number":"pith:3RLYC64E","schema_version":"1.0","canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","source":{"kind":"arxiv","id":"2608.03825","version":1},"attestation_state":"computed","paper":{"title":"CNOT-Distance is NP-complete under all-to-all connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Antonio Acuaviva, Arturo Acuaviva, Pablo Acuaviva","submitted_at":"2026-08-04T15:34:26Z","abstract_excerpt":"Given $A\\in\\operatorname{GL}(N,2)$ and an integer $K$, we ask whether $A$ can be implemented by at most $K$ CNOT gates on fixed labelled wires with all-to-all connectivity. We prove that this problem is NP-complete. From a finite simple graph $G=(V,E)$, we construct an upper-unitriangular matrix $A_G\\in\\operatorname{GL}(2|V|+|E|+1,2)$ satisfying $\\ell_{\\mathrm{CNOT}}(A_G)=2|V|+2|E|+\\tau(G)$, where $\\tau(G)$ is the minimum vertex-cover size. Each target matrix has $O(N)$ nonzero entries and row Hamming weight at most four. The lower bound unfolds an arbitrary CNOT circuit into an XOR directed a"},"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":"2608.03825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-08-04T15:34:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"253e543c6d8f4f90d4202d9ce28597a90a84eb25156ff920d96b00222f954706","abstract_canon_sha256":"dbca944398b2f3b063bd1067f09ad0c8115ba04c5457690c30784a4e2e1b8aeb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-05T01:37:12.654031Z","signature_b64":"naEWDIqNJ/69uQ3OXjDO6/rm1/1htUMPPjS1Im4vTEN+fc99Fcl13qDMkZkcqAblOsz/+4nyS2dOh5+2kxGnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc57817b84c0b0713d5b407f7909695ac6a633939c75ad9005683aa66c4d62e4","last_reissued_at":"2026-08-05T01:37:12.652098Z","signature_status":"signed_v1","first_computed_at":"2026-08-05T01:37:12.652098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CNOT-Distance is NP-complete under all-to-all connectivity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Antonio Acuaviva, Arturo Acuaviva, Pablo Acuaviva","submitted_at":"2026-08-04T15:34:26Z","abstract_excerpt":"Given $A\\in\\operatorname{GL}(N,2)$ and an integer $K$, we ask whether $A$ can be implemented by at most $K$ CNOT gates on fixed labelled wires with all-to-all connectivity. We prove that this problem is NP-complete. From a finite simple graph $G=(V,E)$, we construct an upper-unitriangular matrix $A_G\\in\\operatorname{GL}(2|V|+|E|+1,2)$ satisfying $\\ell_{\\mathrm{CNOT}}(A_G)=2|V|+2|E|+\\tau(G)$, where $\\tau(G)$ is the minimum vertex-cover size. Each target matrix has $O(N)$ nonzero entries and row Hamming weight at most four. The lower bound unfolds an arbitrary CNOT circuit into an XOR directed a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.03825","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/2608.03825/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":"2608.03825","created_at":"2026-08-05T01:37:12.652764+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.03825v1","created_at":"2026-08-05T01:37:12.652764+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.03825","created_at":"2026-08-05T01:37:12.652764+00:00"},{"alias_kind":"pith_short_12","alias_value":"3RLYC64EYCYH","created_at":"2026-08-05T01:37:12.652764+00:00"},{"alias_kind":"pith_short_16","alias_value":"3RLYC64EYCYHCPK3","created_at":"2026-08-05T01:37:12.652764+00:00"},{"alias_kind":"pith_short_8","alias_value":"3RLYC64E","created_at":"2026-08-05T01:37:12.652764+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03825","citing_title":"CNOT-Distance is NP-complete under all-to-all connectivity","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL","json":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL.json","graph_json":"https://pith.science/api/pith-number/3RLYC64EYCYHCPK3IB7XSCLJLL/graph.json","events_json":"https://pith.science/api/pith-number/3RLYC64EYCYHCPK3IB7XSCLJLL/events.json","paper":"https://pith.science/paper/3RLYC64E"},"agent_actions":{"view_html":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL","download_json":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL.json","view_paper":"https://pith.science/paper/3RLYC64E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.03825&json=true","fetch_graph":"https://pith.science/api/pith-number/3RLYC64EYCYHCPK3IB7XSCLJLL/graph.json","fetch_events":"https://pith.science/api/pith-number/3RLYC64EYCYHCPK3IB7XSCLJLL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/action/storage_attestation","attest_author":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/action/author_attestation","sign_citation":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/action/citation_signature","submit_replication":"https://pith.science/pith/3RLYC64EYCYHCPK3IB7XSCLJLL/action/replication_record"}},"created_at":"2026-08-05T01:37:12.652764+00:00","updated_at":"2026-08-05T01:37:12.652764+00:00"}