{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BEQSFYXVSF74ZBXOUV2OV3NBHV","short_pith_number":"pith:BEQSFYXV","schema_version":"1.0","canonical_sha256":"092122e2f5917fcc86eea574eaeda13d628949fff5d5d405baa67e6be07abed8","source":{"kind":"arxiv","id":"2303.13422","version":1},"attestation_state":"computed","paper":{"title":"All this for one qubit? Bounds on local circuit cutting schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jordi Tura, Simon C. Marshall, Vedran Dunjko","submitted_at":"2023-03-23T16:44:38Z","abstract_excerpt":"Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller computations. While this work is sometimes called circuit knitting or divide and quantum we generically refer to it as circuit cutting (CC). Much of the existing work has focused on the development of more efficient circuit cutting schemes, leaving open questions on the limits of what theoretically optimal schemes can achieve. We develop bounds by breaking up pos"},"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":"2303.13422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-03-23T16:44:38Z","cross_cats_sorted":[],"title_canon_sha256":"b984893be8aec202a42d416758252827bf6a3ed0283f3f9e73125d5653cc5f37","abstract_canon_sha256":"9fb7552a58093ecefe25ba9aa9a57d767d421e2a2716ebecde6e1814a59bbfb8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:54:01.943823Z","signature_b64":"JddZIwTkeXhdyyCllMp7PsCK28uxQr4bHp9RscyD7F8kbc34xqUlKw4m694JMXBnmFbnOSj3CRo694uypaO5BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"092122e2f5917fcc86eea574eaeda13d628949fff5d5d405baa67e6be07abed8","last_reissued_at":"2026-07-05T05:54:01.943433Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:54:01.943433Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"All this for one qubit? Bounds on local circuit cutting schemes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jordi Tura, Simon C. Marshall, Vedran Dunjko","submitted_at":"2023-03-23T16:44:38Z","abstract_excerpt":"Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller computations. While this work is sometimes called circuit knitting or divide and quantum we generically refer to it as circuit cutting (CC). Much of the existing work has focused on the development of more efficient circuit cutting schemes, leaving open questions on the limits of what theoretically optimal schemes can achieve. We develop bounds by breaking up pos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.13422","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/2303.13422/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":"2303.13422","created_at":"2026-07-05T05:54:01.943490+00:00"},{"alias_kind":"arxiv_version","alias_value":"2303.13422v1","created_at":"2026-07-05T05:54:01.943490+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.13422","created_at":"2026-07-05T05:54:01.943490+00:00"},{"alias_kind":"pith_short_12","alias_value":"BEQSFYXVSF74","created_at":"2026-07-05T05:54:01.943490+00:00"},{"alias_kind":"pith_short_16","alias_value":"BEQSFYXVSF74ZBXO","created_at":"2026-07-05T05:54:01.943490+00:00"},{"alias_kind":"pith_short_8","alias_value":"BEQSFYXV","created_at":"2026-07-05T05:54:01.943490+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.17756","citing_title":"Understanding the Scalability of Circuit Cutting Techniques for Practical Quantum Applications","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV","json":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV.json","graph_json":"https://pith.science/api/pith-number/BEQSFYXVSF74ZBXOUV2OV3NBHV/graph.json","events_json":"https://pith.science/api/pith-number/BEQSFYXVSF74ZBXOUV2OV3NBHV/events.json","paper":"https://pith.science/paper/BEQSFYXV"},"agent_actions":{"view_html":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV","download_json":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV.json","view_paper":"https://pith.science/paper/BEQSFYXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2303.13422&json=true","fetch_graph":"https://pith.science/api/pith-number/BEQSFYXVSF74ZBXOUV2OV3NBHV/graph.json","fetch_events":"https://pith.science/api/pith-number/BEQSFYXVSF74ZBXOUV2OV3NBHV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV/action/storage_attestation","attest_author":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV/action/author_attestation","sign_citation":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV/action/citation_signature","submit_replication":"https://pith.science/pith/BEQSFYXVSF74ZBXOUV2OV3NBHV/action/replication_record"}},"created_at":"2026-07-05T05:54:01.943490+00:00","updated_at":"2026-07-05T05:54:01.943490+00:00"}