{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:CZRWLJ6U2LPTYMANZKWN6TXDEW","short_pith_number":"pith:CZRWLJ6U","schema_version":"1.0","canonical_sha256":"166365a7d4d2df3c300dcaacdf4ee32589f779ea19d14e5329628425bd552e98","source":{"kind":"arxiv","id":"2506.08947","version":1},"attestation_state":"computed","paper":{"title":"Scaling Portfolio Diversification with Quantum Circuit Cutting Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonio M\\'arquez Romero, Josh Kirsopp, Michal Krompiec, Vicente P. Soloviev","submitted_at":"2025-06-10T16:08:29Z","abstract_excerpt":"Quantum Approximate Optimization Algorithms (QAOA) have demonstrated a strong potential in addressing graph-based optimization problems. However, the execution of large-scale quantum circuits remains constrained by the limitations of current quantum hardware. In this work, we introduce QuantCut, an automatic framework for circuit cutting that enables efficient execution of large quantum circuits by decomposing entangling two-qubit gates into manageable sub-circuits. Specifically, we focus on gate-cutting techniques. We apply QuantCut to a 71-qubit QAOA circuit ansatz for portfolio diversificat"},"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":"2506.08947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-06-10T16:08:29Z","cross_cats_sorted":[],"title_canon_sha256":"fc529c6912e618470662baa74a4d3faa92f4a1a37b9cf90030a4acb4cd0dd7ff","abstract_canon_sha256":"ef1f121b4d4979756e75716d59f2eafc3fd27b966a1112778b543ee999577e4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:19:15.562407Z","signature_b64":"8ouTRcmD871eE/uS3Np1c7WETXz5+TNn6U4S2hH27fjn88O6TdrsE5FtMIpnnVqvSIh6Ja9qMIq2XZHfYjxIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"166365a7d4d2df3c300dcaacdf4ee32589f779ea19d14e5329628425bd552e98","last_reissued_at":"2026-07-05T11:19:15.561911Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:19:15.561911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scaling Portfolio Diversification with Quantum Circuit Cutting Techniques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Antonio M\\'arquez Romero, Josh Kirsopp, Michal Krompiec, Vicente P. Soloviev","submitted_at":"2025-06-10T16:08:29Z","abstract_excerpt":"Quantum Approximate Optimization Algorithms (QAOA) have demonstrated a strong potential in addressing graph-based optimization problems. However, the execution of large-scale quantum circuits remains constrained by the limitations of current quantum hardware. In this work, we introduce QuantCut, an automatic framework for circuit cutting that enables efficient execution of large quantum circuits by decomposing entangling two-qubit gates into manageable sub-circuits. Specifically, we focus on gate-cutting techniques. We apply QuantCut to a 71-qubit QAOA circuit ansatz for portfolio diversificat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.08947","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/2506.08947/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":"2506.08947","created_at":"2026-07-05T11:19:15.561971+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.08947v1","created_at":"2026-07-05T11:19:15.561971+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.08947","created_at":"2026-07-05T11:19:15.561971+00:00"},{"alias_kind":"pith_short_12","alias_value":"CZRWLJ6U2LPT","created_at":"2026-07-05T11:19:15.561971+00:00"},{"alias_kind":"pith_short_16","alias_value":"CZRWLJ6U2LPTYMAN","created_at":"2026-07-05T11:19:15.561971+00:00"},{"alias_kind":"pith_short_8","alias_value":"CZRWLJ6U","created_at":"2026-07-05T11:19:15.561971+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/CZRWLJ6U2LPTYMANZKWN6TXDEW","json":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW.json","graph_json":"https://pith.science/api/pith-number/CZRWLJ6U2LPTYMANZKWN6TXDEW/graph.json","events_json":"https://pith.science/api/pith-number/CZRWLJ6U2LPTYMANZKWN6TXDEW/events.json","paper":"https://pith.science/paper/CZRWLJ6U"},"agent_actions":{"view_html":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW","download_json":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW.json","view_paper":"https://pith.science/paper/CZRWLJ6U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.08947&json=true","fetch_graph":"https://pith.science/api/pith-number/CZRWLJ6U2LPTYMANZKWN6TXDEW/graph.json","fetch_events":"https://pith.science/api/pith-number/CZRWLJ6U2LPTYMANZKWN6TXDEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW/action/storage_attestation","attest_author":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW/action/author_attestation","sign_citation":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW/action/citation_signature","submit_replication":"https://pith.science/pith/CZRWLJ6U2LPTYMANZKWN6TXDEW/action/replication_record"}},"created_at":"2026-07-05T11:19:15.561971+00:00","updated_at":"2026-07-05T11:19:15.561971+00:00"}