{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WGHZO46C36SAULMWAO4XLT4IAR","short_pith_number":"pith:WGHZO46C","schema_version":"1.0","canonical_sha256":"b18f9773c2dfa40a2d9603b975cf88045e98099779aeba8e3a01c5c8b3df7cfa","source":{"kind":"arxiv","id":"2310.05958","version":3},"attestation_state":"computed","paper":{"title":"Optimising quantum circuits is generally hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"John van de Wetering, Matt Amy","submitted_at":"2023-09-12T09:35:23Z","abstract_excerpt":"In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we find that many gate optimisation problems for approximately universal quantum circuits are NP-hard. In particular, we show that optimising the T-count or T-depth in Clifford+T circuits, which are important metrics for the computational cost of executing fault-tolerant quantum computations, is NP-hard by reducing the problem to Boolean satisfiability. With a similar argument we show that optimising the number of CNOT ga"},"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":"2310.05958","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-12T09:35:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e4509004c27e63680840fcbbe4e994cd1b6a4cc00cf3fdf78934c7fb48fdceeb","abstract_canon_sha256":"d23dac0db0854fa72e9d5b019cd6c3ea9138b895162897a03d44f35aa4abeb30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:54:04.336395Z","signature_b64":"kQfles4k0PGC7VxCsqXT8nEDMxqcdHll3iPBTllbjVg7YKSlCG6yvst+BGelM/L8Qq+CJorz2yC338C8fYMJAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b18f9773c2dfa40a2d9603b975cf88045e98099779aeba8e3a01c5c8b3df7cfa","last_reissued_at":"2026-07-05T08:54:04.335875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:54:04.335875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimising quantum circuits is generally hard","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"John van de Wetering, Matt Amy","submitted_at":"2023-09-12T09:35:23Z","abstract_excerpt":"In order for quantum computations to be done as efficiently as possible it is important to optimise the number of gates used in the underlying quantum circuits. In this paper we find that many gate optimisation problems for approximately universal quantum circuits are NP-hard. In particular, we show that optimising the T-count or T-depth in Clifford+T circuits, which are important metrics for the computational cost of executing fault-tolerant quantum computations, is NP-hard by reducing the problem to Boolean satisfiability. With a similar argument we show that optimising the number of CNOT ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.05958","kind":"arxiv","version":3},"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/2310.05958/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":"2310.05958","created_at":"2026-07-05T08:54:04.335944+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.05958v3","created_at":"2026-07-05T08:54:04.335944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05958","created_at":"2026-07-05T08:54:04.335944+00:00"},{"alias_kind":"pith_short_12","alias_value":"WGHZO46C36SA","created_at":"2026-07-05T08:54:04.335944+00:00"},{"alias_kind":"pith_short_16","alias_value":"WGHZO46C36SAULMW","created_at":"2026-07-05T08:54:04.335944+00:00"},{"alias_kind":"pith_short_8","alias_value":"WGHZO46C","created_at":"2026-07-05T08:54:04.335944+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.00433","citing_title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","ref_index":44,"is_internal_anchor":false},{"citing_arxiv_id":"2605.13929","citing_title":"Linear-Time T-Gate Optimization via Random Abstraction","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02727","citing_title":"Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings","ref_index":4,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02727","citing_title":"Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR","json":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR.json","graph_json":"https://pith.science/api/pith-number/WGHZO46C36SAULMWAO4XLT4IAR/graph.json","events_json":"https://pith.science/api/pith-number/WGHZO46C36SAULMWAO4XLT4IAR/events.json","paper":"https://pith.science/paper/WGHZO46C"},"agent_actions":{"view_html":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR","download_json":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR.json","view_paper":"https://pith.science/paper/WGHZO46C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.05958&json=true","fetch_graph":"https://pith.science/api/pith-number/WGHZO46C36SAULMWAO4XLT4IAR/graph.json","fetch_events":"https://pith.science/api/pith-number/WGHZO46C36SAULMWAO4XLT4IAR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/action/storage_attestation","attest_author":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/action/author_attestation","sign_citation":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/action/citation_signature","submit_replication":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/action/replication_record"}},"created_at":"2026-07-05T08:54:04.335944+00:00","updated_at":"2026-07-05T08:54:04.335944+00:00"}