{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:KAIALG7V6YRZHGB26ISYAOI6MR","short_pith_number":"pith:KAIALG7V","schema_version":"1.0","canonical_sha256":"5010059bf5f62393983af22580391e64713b4785c7ae66d271375257abd15a68","source":{"kind":"arxiv","id":"2505.01184","version":2},"attestation_state":"computed","paper":{"title":"Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Performance Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DC","authors_text":"Alba Cervera-Lierta, Berta Casas, Javier Conejero, Mar Tejedor, Rosa M. Badia","submitted_at":"2025-05-02T11:00:34Z","abstract_excerpt":"Most quantum computers today are constrained by hardware limitations, particularly the number of available qubits, causing significant challenges for executing large-scale quantum algorithms. Circuit cutting has emerged as a key technique to overcome these limitations by decomposing large quantum circuits into smaller subcircuits that can be executed independently and later reconstructed. In this work, we introduce Qdislib, a distributed and flexible library for quantum circuit cutting, designed to seamlessly integrate with hybrid quantum-classical high-performance computing (HPC) systems. Qdi"},"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":"2505.01184","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-02T11:00:34Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"b6db1998bca74656b89a8078593de1f9fc60f23cd7eeb207f22f37ad7e18bd0d","abstract_canon_sha256":"67c65b667bc879f21db344eae5478fef3f5d99c34600afb5e761dbea04e63857"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:58:27.683841Z","signature_b64":"vSYN1sciOnB2C3FdCfpac2RF4ChaZRTTT3C+6DhjRnklPxbDrM5MPvzq9R6OOuVcAKQ6BmEl2s1GZt1e9XvqCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5010059bf5f62393983af22580391e64713b4785c7ae66d271375257abd15a68","last_reissued_at":"2026-07-05T10:58:27.683399Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:58:27.683399Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Quantum Circuit Cutting for Hybrid Quantum-Classical High-Performance Computing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DC","authors_text":"Alba Cervera-Lierta, Berta Casas, Javier Conejero, Mar Tejedor, Rosa M. Badia","submitted_at":"2025-05-02T11:00:34Z","abstract_excerpt":"Most quantum computers today are constrained by hardware limitations, particularly the number of available qubits, causing significant challenges for executing large-scale quantum algorithms. Circuit cutting has emerged as a key technique to overcome these limitations by decomposing large quantum circuits into smaller subcircuits that can be executed independently and later reconstructed. In this work, we introduce Qdislib, a distributed and flexible library for quantum circuit cutting, designed to seamlessly integrate with hybrid quantum-classical high-performance computing (HPC) systems. Qdi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.01184","kind":"arxiv","version":2},"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/2505.01184/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":"2505.01184","created_at":"2026-07-05T10:58:27.683462+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.01184v2","created_at":"2026-07-05T10:58:27.683462+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.01184","created_at":"2026-07-05T10:58:27.683462+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAIALG7V6YRZ","created_at":"2026-07-05T10:58:27.683462+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAIALG7V6YRZHGB2","created_at":"2026-07-05T10:58:27.683462+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAIALG7V","created_at":"2026-07-05T10:58:27.683462+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.04070","citing_title":"Quantum circuit partition as a maze: emerging percolation transition via path finding","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02018","citing_title":"Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR","json":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR.json","graph_json":"https://pith.science/api/pith-number/KAIALG7V6YRZHGB26ISYAOI6MR/graph.json","events_json":"https://pith.science/api/pith-number/KAIALG7V6YRZHGB26ISYAOI6MR/events.json","paper":"https://pith.science/paper/KAIALG7V"},"agent_actions":{"view_html":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR","download_json":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR.json","view_paper":"https://pith.science/paper/KAIALG7V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.01184&json=true","fetch_graph":"https://pith.science/api/pith-number/KAIALG7V6YRZHGB26ISYAOI6MR/graph.json","fetch_events":"https://pith.science/api/pith-number/KAIALG7V6YRZHGB26ISYAOI6MR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR/action/storage_attestation","attest_author":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR/action/author_attestation","sign_citation":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR/action/citation_signature","submit_replication":"https://pith.science/pith/KAIALG7V6YRZHGB26ISYAOI6MR/action/replication_record"}},"created_at":"2026-07-05T10:58:27.683462+00:00","updated_at":"2026-07-05T10:58:27.683462+00:00"}