{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:WGHZO46C36SAULMWAO4XLT4IAR","short_pith_number":"pith:WGHZO46C","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"},"canonical_sha256":"b18f9773c2dfa40a2d9603b975cf88045e98099779aeba8e3a01c5c8b3df7cfa","source":{"kind":"arxiv","id":"2310.05958","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.05958","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"2310.05958v3","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05958","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"WGHZO46C36SA","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"pith_short_16","alias_value":"WGHZO46C36SAULMW","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"pith_short_8","alias_value":"WGHZO46C","created_at":"2026-07-05T08:54:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:WGHZO46C36SAULMWAO4XLT4IAR","target":"record","payload":{"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"},"canonical_sha256":"b18f9773c2dfa40a2d9603b975cf88045e98099779aeba8e3a01c5c8b3df7cfa","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"},"source_kind":"arxiv","source_id":"2310.05958","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qn7gJmkSbPqrUDclvOAXfVLxAL8k5LN5/q55z8XErS3pszGSwybqd+RWrCbfMNZ1QPkkT7bQAvgU/Gsc3EyZBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:07:55.034809Z"},"content_sha256":"57a9a7b2d0ae66617f2925c21162737e7c01904987fcacfb0e2225d1d56e3b13","schema_version":"1.0","event_id":"sha256:57a9a7b2d0ae66617f2925c21162737e7c01904987fcacfb0e2225d1d56e3b13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:WGHZO46C36SAULMWAO4XLT4IAR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:54:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ERiAj6SDKOwXYNeuucPieCOzToMhxWBReYcdYQ0alwVj32qPpR+z3esOsjemDHRk5gpCZzi1k2J9PqaNEEkyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T13:07:55.035486Z"},"content_sha256":"af143737cbfcc27d8fd0e443128a265ca546550a826c0ed8967388ac26c99f65","schema_version":"1.0","event_id":"sha256:af143737cbfcc27d8fd0e443128a265ca546550a826c0ed8967388ac26c99f65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/bundle.json","state_url":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WGHZO46C36SAULMWAO4XLT4IAR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-06T13:07:55Z","links":{"resolver":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR","bundle":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/bundle.json","state":"https://pith.science/pith/WGHZO46C36SAULMWAO4XLT4IAR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WGHZO46C36SAULMWAO4XLT4IAR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:WGHZO46C36SAULMWAO4XLT4IAR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d23dac0db0854fa72e9d5b019cd6c3ea9138b895162897a03d44f35aa4abeb30","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-12T09:35:23Z","title_canon_sha256":"e4509004c27e63680840fcbbe4e994cd1b6a4cc00cf3fdf78934c7fb48fdceeb"},"schema_version":"1.0","source":{"id":"2310.05958","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.05958","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"arxiv_version","alias_value":"2310.05958v3","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.05958","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"pith_short_12","alias_value":"WGHZO46C36SA","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"pith_short_16","alias_value":"WGHZO46C36SAULMW","created_at":"2026-07-05T08:54:04Z"},{"alias_kind":"pith_short_8","alias_value":"WGHZO46C","created_at":"2026-07-05T08:54:04Z"}],"graph_snapshots":[{"event_id":"sha256:af143737cbfcc27d8fd0e443128a265ca546550a826c0ed8967388ac26c99f65","target":"graph","created_at":"2026-07-05T08:54:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.05958/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"John van de Wetering, Matt Amy","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-12T09:35:23Z","title":"Optimising quantum circuits is generally hard"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.05958","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:57a9a7b2d0ae66617f2925c21162737e7c01904987fcacfb0e2225d1d56e3b13","target":"record","created_at":"2026-07-05T08:54:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d23dac0db0854fa72e9d5b019cd6c3ea9138b895162897a03d44f35aa4abeb30","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-09-12T09:35:23Z","title_canon_sha256":"e4509004c27e63680840fcbbe4e994cd1b6a4cc00cf3fdf78934c7fb48fdceeb"},"schema_version":"1.0","source":{"id":"2310.05958","kind":"arxiv","version":3}},"canonical_sha256":"b18f9773c2dfa40a2d9603b975cf88045e98099779aeba8e3a01c5c8b3df7cfa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b18f9773c2dfa40a2d9603b975cf88045e98099779aeba8e3a01c5c8b3df7cfa","first_computed_at":"2026-07-05T08:54:04.335875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:54:04.335875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kQfles4k0PGC7VxCsqXT8nEDMxqcdHll3iPBTllbjVg7YKSlCG6yvst+BGelM/L8Qq+CJorz2yC338C8fYMJAA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:54:04.336395Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.05958","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:57a9a7b2d0ae66617f2925c21162737e7c01904987fcacfb0e2225d1d56e3b13","sha256:af143737cbfcc27d8fd0e443128a265ca546550a826c0ed8967388ac26c99f65"],"state_sha256":"4b86edf4dddcd181fe56bde85bd2dca92d7da3dde7ae0b7b1785b7883752ac2e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kCpd5xyg9lxpK1gJ38b3eotSdKsvzey004EFJTjJaipoVKjdrbre4nJHtFF8upgI+HUKsdmKfWzKPxMXCo6zBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T13:07:55.041838Z","bundle_sha256":"3c2d522b4b4791fd2506ad293cec5056b0532248888f3940b1a887774f05ce65"}}