{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PLT6LC4QIBYPDJEIE4C3N63IQR","short_pith_number":"pith:PLT6LC4Q","schema_version":"1.0","canonical_sha256":"7ae7e58b904070f1a4882705b6fb6884603d2737f116b9d8fa7e4ff5b20eedda","source":{"kind":"arxiv","id":"2507.06649","version":1},"attestation_state":"computed","paper":{"title":"Optimized Circuit Cutting for QAOA Sampling Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christian Ufrecht, Daniel D. Scherer, Friedrich Wagner, Martin Braun","submitted_at":"2025-07-09T08:27:38Z","abstract_excerpt":"Circuit cutting was originally designed to retrieve the expectation value of an observable with respect to a large quantum circuit by executing smaller circuit fragments. In this work, however, we demonstrate the application of circuit cutting to a pure sampling task. In particular, we sample solutions to an optimization problem from a trained QAOA circuit. Here, circuit cutting leads to a broadening and shift of the bitstring distribution towards suboptimal values compared to the uncut case. To reduce this effect, we minimize the number of required cuts via integer programming methods. On the"},"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":"2507.06649","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-09T08:27:38Z","cross_cats_sorted":[],"title_canon_sha256":"fac32749a2ab1f74def9f32795161b60fc6be1d47c02c1aaa746d1c47d6f7a96","abstract_canon_sha256":"712a43073c355faf494924c6e7ff16e6c62a2f38119571c0547d37729ae453bc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:34:20.283817Z","signature_b64":"ZnhOI49RP+iUlCRfSR9iysFyiEV1ifLyYhNMBfka5No02RbupEBCau0csY5Xs+zEgz/BnSU3kWkZdkLcbK4GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ae7e58b904070f1a4882705b6fb6884603d2737f116b9d8fa7e4ff5b20eedda","last_reissued_at":"2026-07-05T11:34:20.283277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:34:20.283277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimized Circuit Cutting for QAOA Sampling Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christian Ufrecht, Daniel D. Scherer, Friedrich Wagner, Martin Braun","submitted_at":"2025-07-09T08:27:38Z","abstract_excerpt":"Circuit cutting was originally designed to retrieve the expectation value of an observable with respect to a large quantum circuit by executing smaller circuit fragments. In this work, however, we demonstrate the application of circuit cutting to a pure sampling task. In particular, we sample solutions to an optimization problem from a trained QAOA circuit. Here, circuit cutting leads to a broadening and shift of the bitstring distribution towards suboptimal values compared to the uncut case. To reduce this effect, we minimize the number of required cuts via integer programming methods. On the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.06649","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/2507.06649/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":"2507.06649","created_at":"2026-07-05T11:34:20.283353+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.06649v1","created_at":"2026-07-05T11:34:20.283353+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.06649","created_at":"2026-07-05T11:34:20.283353+00:00"},{"alias_kind":"pith_short_12","alias_value":"PLT6LC4QIBYP","created_at":"2026-07-05T11:34:20.283353+00:00"},{"alias_kind":"pith_short_16","alias_value":"PLT6LC4QIBYPDJEI","created_at":"2026-07-05T11:34:20.283353+00:00"},{"alias_kind":"pith_short_8","alias_value":"PLT6LC4Q","created_at":"2026-07-05T11:34:20.283353+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/PLT6LC4QIBYPDJEIE4C3N63IQR","json":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR.json","graph_json":"https://pith.science/api/pith-number/PLT6LC4QIBYPDJEIE4C3N63IQR/graph.json","events_json":"https://pith.science/api/pith-number/PLT6LC4QIBYPDJEIE4C3N63IQR/events.json","paper":"https://pith.science/paper/PLT6LC4Q"},"agent_actions":{"view_html":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR","download_json":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR.json","view_paper":"https://pith.science/paper/PLT6LC4Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.06649&json=true","fetch_graph":"https://pith.science/api/pith-number/PLT6LC4QIBYPDJEIE4C3N63IQR/graph.json","fetch_events":"https://pith.science/api/pith-number/PLT6LC4QIBYPDJEIE4C3N63IQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR/action/storage_attestation","attest_author":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR/action/author_attestation","sign_citation":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR/action/citation_signature","submit_replication":"https://pith.science/pith/PLT6LC4QIBYPDJEIE4C3N63IQR/action/replication_record"}},"created_at":"2026-07-05T11:34:20.283353+00:00","updated_at":"2026-07-05T11:34:20.283353+00:00"}