{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ANQC5P54BLWASQ6GALLZS6HRGL","short_pith_number":"pith:ANQC5P54","schema_version":"1.0","canonical_sha256":"03602ebfbc0aec0943c602d79978f132d29b51b7825b7eb5ca2ff67aaed30dc6","source":{"kind":"arxiv","id":"2312.10298","version":3},"attestation_state":"computed","paper":{"title":"QRCC: Evaluating Large Quantum Circuits on Small Quantum Computers through Integrated Qubit Reuse and Circuit Cutting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aditya Pawar, Jun Yang, Xulong Tang, Yanan Guo, Yingheng Li, Youtao Zhang, Zewei Mo","submitted_at":"2023-12-16T02:49:28Z","abstract_excerpt":"Quantum computing has recently emerged as a promising computing paradigm for many application domains. However, the size of quantum circuits that can be run with high fidelity is constrained by the limited quantity and quality of physical qubits. Recently proposed schemes, such as wire cutting and qubit reuse, mitigate the problem but produce sub-optimal results as they address the problem individually. In addition, gate cutting, an alternative circuit-cutting strategy that is suitable for circuits computing expectation values, has not been fully explored in the field.\n  In this paper, we prop"},"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":"2312.10298","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-12-16T02:49:28Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c0a6cb2425dbecee10b9f139c79de39d45c220b4d18c8e350c71c408cd46efb7","abstract_canon_sha256":"79d1d006a3e9885dabe0654c1e3a48dae649233bcedad9a95760ec7be16b8001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:51:19.651063Z","signature_b64":"o7ruTM+cTHik5/0+z+CAIdjTJMvrKxIu9tbbobXxsa4xc6a+wl3sbDIxiNGWd+bicJcfAwYnB96mxxSn1+B4AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03602ebfbc0aec0943c602d79978f132d29b51b7825b7eb5ca2ff67aaed30dc6","last_reissued_at":"2026-07-05T10:51:19.650451Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:51:19.650451Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"QRCC: Evaluating Large Quantum Circuits on Small Quantum Computers through Integrated Qubit Reuse and Circuit Cutting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Aditya Pawar, Jun Yang, Xulong Tang, Yanan Guo, Yingheng Li, Youtao Zhang, Zewei Mo","submitted_at":"2023-12-16T02:49:28Z","abstract_excerpt":"Quantum computing has recently emerged as a promising computing paradigm for many application domains. However, the size of quantum circuits that can be run with high fidelity is constrained by the limited quantity and quality of physical qubits. Recently proposed schemes, such as wire cutting and qubit reuse, mitigate the problem but produce sub-optimal results as they address the problem individually. In addition, gate cutting, an alternative circuit-cutting strategy that is suitable for circuits computing expectation values, has not been fully explored in the field.\n  In this paper, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.10298","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/2312.10298/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":"2312.10298","created_at":"2026-07-05T10:51:19.650532+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.10298v3","created_at":"2026-07-05T10:51:19.650532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.10298","created_at":"2026-07-05T10:51:19.650532+00:00"},{"alias_kind":"pith_short_12","alias_value":"ANQC5P54BLWA","created_at":"2026-07-05T10:51:19.650532+00:00"},{"alias_kind":"pith_short_16","alias_value":"ANQC5P54BLWASQ6G","created_at":"2026-07-05T10:51:19.650532+00:00"},{"alias_kind":"pith_short_8","alias_value":"ANQC5P54","created_at":"2026-07-05T10:51:19.650532+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.00811","citing_title":"MAESTROCUT: Dynamic, Noise-Adaptive, and Secure Quantum Circuit Cutting on Near-Term Hardware","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL","json":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL.json","graph_json":"https://pith.science/api/pith-number/ANQC5P54BLWASQ6GALLZS6HRGL/graph.json","events_json":"https://pith.science/api/pith-number/ANQC5P54BLWASQ6GALLZS6HRGL/events.json","paper":"https://pith.science/paper/ANQC5P54"},"agent_actions":{"view_html":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL","download_json":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL.json","view_paper":"https://pith.science/paper/ANQC5P54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.10298&json=true","fetch_graph":"https://pith.science/api/pith-number/ANQC5P54BLWASQ6GALLZS6HRGL/graph.json","fetch_events":"https://pith.science/api/pith-number/ANQC5P54BLWASQ6GALLZS6HRGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL/action/storage_attestation","attest_author":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL/action/author_attestation","sign_citation":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL/action/citation_signature","submit_replication":"https://pith.science/pith/ANQC5P54BLWASQ6GALLZS6HRGL/action/replication_record"}},"created_at":"2026-07-05T10:51:19.650532+00:00","updated_at":"2026-07-05T10:51:19.650532+00:00"}