{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:6JU5LXAJE732N47J3GI7P7CBEQ","short_pith_number":"pith:6JU5LXAJ","schema_version":"1.0","canonical_sha256":"f269d5dc0927f7a6f3e9d991f7fc41240e94e433d3810306ff7a98b5b64f4480","source":{"kind":"arxiv","id":"2301.00720","version":1},"attestation_state":"computed","paper":{"title":"Quantum Circuit Resizing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Mahmut Taylan Kandemir, Movahhed Sadeghi, Soheil Khadirsharbiyani","submitted_at":"2022-12-30T11:37:15Z","abstract_excerpt":"Existing quantum systems provide very limited physical qubit counts, trying to execute a quantum algorithm/circuit on them that have a higher number of logical qubits than physically available lead to a compile-time error. Given that it is unrealistic to expect existing quantum systems to provide, in near future, sufficient number of qubits that can accommodate large circuit, there is a pressing need to explore strategies that can somehow execute large circuits on small systems. In this paper, first, we perform an analysis to identify the qubits that are most suitable for circuit resizing. Our"},"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":"2301.00720","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.ET","submitted_at":"2022-12-30T11:37:15Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"86559d05bf9aa9b043e838767577a6d3b79f0a98cb453e4cf2fac6a3fb9343dc","abstract_canon_sha256":"9389040fefbd9a90f61197c13def8e67647bbdc60ae9db4ef337007db8175fa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:29:49.736754Z","signature_b64":"2kYsltY/zLBn4Vmomvigkoyg0eg6Y2yC8dqbQ8hhhbhJdnOJ0Ij5AjU3qPy02Os+Zn7nv0Ees0dK8OVynRITDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f269d5dc0927f7a6f3e9d991f7fc41240e94e433d3810306ff7a98b5b64f4480","last_reissued_at":"2026-07-05T05:29:49.736300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:29:49.736300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuit Resizing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.ET","authors_text":"Mahmut Taylan Kandemir, Movahhed Sadeghi, Soheil Khadirsharbiyani","submitted_at":"2022-12-30T11:37:15Z","abstract_excerpt":"Existing quantum systems provide very limited physical qubit counts, trying to execute a quantum algorithm/circuit on them that have a higher number of logical qubits than physically available lead to a compile-time error. Given that it is unrealistic to expect existing quantum systems to provide, in near future, sufficient number of qubits that can accommodate large circuit, there is a pressing need to explore strategies that can somehow execute large circuits on small systems. In this paper, first, we perform an analysis to identify the qubits that are most suitable for circuit resizing. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.00720","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/2301.00720/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":"2301.00720","created_at":"2026-07-05T05:29:49.736371+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.00720v1","created_at":"2026-07-05T05:29:49.736371+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.00720","created_at":"2026-07-05T05:29:49.736371+00:00"},{"alias_kind":"pith_short_12","alias_value":"6JU5LXAJE732","created_at":"2026-07-05T05:29:49.736371+00:00"},{"alias_kind":"pith_short_16","alias_value":"6JU5LXAJE732N47J","created_at":"2026-07-05T05:29:49.736371+00:00"},{"alias_kind":"pith_short_8","alias_value":"6JU5LXAJ","created_at":"2026-07-05T05:29:49.736371+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.09578","citing_title":"Quantum Uncomputation of Clean and Dirty Ancilla Qubits","ref_index":47,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ","json":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ.json","graph_json":"https://pith.science/api/pith-number/6JU5LXAJE732N47J3GI7P7CBEQ/graph.json","events_json":"https://pith.science/api/pith-number/6JU5LXAJE732N47J3GI7P7CBEQ/events.json","paper":"https://pith.science/paper/6JU5LXAJ"},"agent_actions":{"view_html":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ","download_json":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ.json","view_paper":"https://pith.science/paper/6JU5LXAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.00720&json=true","fetch_graph":"https://pith.science/api/pith-number/6JU5LXAJE732N47J3GI7P7CBEQ/graph.json","fetch_events":"https://pith.science/api/pith-number/6JU5LXAJE732N47J3GI7P7CBEQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ/action/storage_attestation","attest_author":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ/action/author_attestation","sign_citation":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ/action/citation_signature","submit_replication":"https://pith.science/pith/6JU5LXAJE732N47J3GI7P7CBEQ/action/replication_record"}},"created_at":"2026-07-05T05:29:49.736371+00:00","updated_at":"2026-07-05T05:29:49.736371+00:00"}