{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:BUYBSXAYSHSHA27IH6D74LAKG5","short_pith_number":"pith:BUYBSXAY","schema_version":"1.0","canonical_sha256":"0d30195c1891e4706be83f87fe2c0a37406a7acb3631315e30f86fd5c3473d39","source":{"kind":"arxiv","id":"2210.08039","version":1},"attestation_state":"computed","paper":{"title":"Qubit-reuse compilation with mid-circuit measurement and reset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eli Chertkov, Matthew DeCross, Megan Kohagen, Michael Foss-Feig","submitted_at":"2022-10-14T18:11:43Z","abstract_excerpt":"A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit. In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qu"},"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":"2210.08039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-10-14T18:11:43Z","cross_cats_sorted":[],"title_canon_sha256":"3bf3f54f1c7f8be63b84feadc25c47fdf04479e690d5669c3273c608b4c28ff9","abstract_canon_sha256":"5fe16ced7f2a962c3891134e3166ff1a0829498f490c1af6fb4a079dce68a2d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:07:06.170567Z","signature_b64":"ZZrYbkffk7oY5200OALfePZh3VHQ0AzQnOoOyV0hLZgw4FT3aOKoIz+hPn1w95ZX/qh115H5USGBTKee5IR4CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d30195c1891e4706be83f87fe2c0a37406a7acb3631315e30f86fd5c3473d39","last_reissued_at":"2026-07-05T05:07:06.170144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:07:06.170144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qubit-reuse compilation with mid-circuit measurement and reset","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Eli Chertkov, Matthew DeCross, Megan Kohagen, Michael Foss-Feig","submitted_at":"2022-10-14T18:11:43Z","abstract_excerpt":"A number of commercially available quantum computers, such as those based on trapped-ion or superconducting qubits, can now perform mid-circuit measurements and resets. In addition to being crucial for quantum error correction, this capability can help reduce the number of qubits needed to execute many types of quantum algorithms by measuring qubits as early as possible, resetting them, and reusing them elsewhere in the circuit. In this work, we introduce the idea of qubit-reuse compilation, which takes as input a quantum circuit and produces as output a compiled circuit that requires fewer qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.08039","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/2210.08039/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":"2210.08039","created_at":"2026-07-05T05:07:06.170202+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.08039v1","created_at":"2026-07-05T05:07:06.170202+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.08039","created_at":"2026-07-05T05:07:06.170202+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUYBSXAYSHSH","created_at":"2026-07-05T05:07:06.170202+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUYBSXAYSHSHA27I","created_at":"2026-07-05T05:07:06.170202+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUYBSXAY","created_at":"2026-07-05T05:07:06.170202+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.29962","citing_title":"BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis","ref_index":25,"is_internal_anchor":false},{"citing_arxiv_id":"2209.12889","citing_title":"Characterizing a non-equilibrium phase transition on a quantum computer","ref_index":27,"is_internal_anchor":false},{"citing_arxiv_id":"2602.19556","citing_title":"Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2509.25326","citing_title":"Error detection without post-selection in adaptive quantum circuits","ref_index":74,"is_internal_anchor":false},{"citing_arxiv_id":"2509.26574","citing_title":"Probing the Critical Point (CritPt) of AI Reasoning: a Frontier Physics Research Benchmark","ref_index":195,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5","json":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5.json","graph_json":"https://pith.science/api/pith-number/BUYBSXAYSHSHA27IH6D74LAKG5/graph.json","events_json":"https://pith.science/api/pith-number/BUYBSXAYSHSHA27IH6D74LAKG5/events.json","paper":"https://pith.science/paper/BUYBSXAY"},"agent_actions":{"view_html":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5","download_json":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5.json","view_paper":"https://pith.science/paper/BUYBSXAY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.08039&json=true","fetch_graph":"https://pith.science/api/pith-number/BUYBSXAYSHSHA27IH6D74LAKG5/graph.json","fetch_events":"https://pith.science/api/pith-number/BUYBSXAYSHSHA27IH6D74LAKG5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5/action/storage_attestation","attest_author":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5/action/author_attestation","sign_citation":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5/action/citation_signature","submit_replication":"https://pith.science/pith/BUYBSXAYSHSHA27IH6D74LAKG5/action/replication_record"}},"created_at":"2026-07-05T05:07:06.170202+00:00","updated_at":"2026-07-05T05:07:06.170202+00:00"}