{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:S3FVT6IEMVKCE7CSJXO5CJZND6","short_pith_number":"pith:S3FVT6IE","schema_version":"1.0","canonical_sha256":"96cb59f9046554227c524dddd1272d1f97d914cc900cd5a0ff093ca64c747ea5","source":{"kind":"arxiv","id":"2205.05836","version":1},"attestation_state":"computed","paper":{"title":"Cutting Quantum Circuits to Run on Quantum and Classical Platforms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Margaret Martonosi, Wei Tang","submitted_at":"2022-05-12T02:09:38Z","abstract_excerpt":"Quantum computing (QC) offers a new computing paradigm that has the potential to provide significant speedups over classical computing. Each additional qubit doubles the size of the computational state space available to a quantum algorithm. Such exponentially expanding reach underlies QC's power, but at the same time puts demanding requirements on the quantum processing units (QPU) hardware. On the other hand, purely classical simulations of quantum circuits on either central processing unit (CPU) or graphics processing unit (GPU) scale poorly as they quickly become bottlenecked by runtime an"},"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":"2205.05836","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-05-12T02:09:38Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"ff7f4eab2b80035a87ad34d1c23a79a7de75880d9e4aec1d23d0a78ad1f4603d","abstract_canon_sha256":"847823204dbf13b45c9ff20d3765ddf2534ce329e0af089dd750114e0a466e92"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:22:42.589408Z","signature_b64":"SIlO0XKcSd5S6TRXhZjNZfXL4xw5PxChUrYSrDx/xFyhII12dXQcfr6HVrwdSGWKXjm7cpTdcH10ro9mrPdrBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96cb59f9046554227c524dddd1272d1f97d914cc900cd5a0ff093ca64c747ea5","last_reissued_at":"2026-07-05T04:22:42.589026Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:22:42.589026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cutting Quantum Circuits to Run on Quantum and Classical Platforms","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Margaret Martonosi, Wei Tang","submitted_at":"2022-05-12T02:09:38Z","abstract_excerpt":"Quantum computing (QC) offers a new computing paradigm that has the potential to provide significant speedups over classical computing. Each additional qubit doubles the size of the computational state space available to a quantum algorithm. Such exponentially expanding reach underlies QC's power, but at the same time puts demanding requirements on the quantum processing units (QPU) hardware. On the other hand, purely classical simulations of quantum circuits on either central processing unit (CPU) or graphics processing unit (GPU) scale poorly as they quickly become bottlenecked by runtime an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.05836","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/2205.05836/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":"2205.05836","created_at":"2026-07-05T04:22:42.589081+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.05836v1","created_at":"2026-07-05T04:22:42.589081+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.05836","created_at":"2026-07-05T04:22:42.589081+00:00"},{"alias_kind":"pith_short_12","alias_value":"S3FVT6IEMVKC","created_at":"2026-07-05T04:22:42.589081+00:00"},{"alias_kind":"pith_short_16","alias_value":"S3FVT6IEMVKCE7CS","created_at":"2026-07-05T04:22:42.589081+00:00"},{"alias_kind":"pith_short_8","alias_value":"S3FVT6IE","created_at":"2026-07-05T04:22:42.589081+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.02749","citing_title":"Graph-VQE: A CUDA-Q Multi-QPU Simulation Framework for Hamiltonian-Aware Protein-Folding VQE","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6","json":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6.json","graph_json":"https://pith.science/api/pith-number/S3FVT6IEMVKCE7CSJXO5CJZND6/graph.json","events_json":"https://pith.science/api/pith-number/S3FVT6IEMVKCE7CSJXO5CJZND6/events.json","paper":"https://pith.science/paper/S3FVT6IE"},"agent_actions":{"view_html":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6","download_json":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6.json","view_paper":"https://pith.science/paper/S3FVT6IE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.05836&json=true","fetch_graph":"https://pith.science/api/pith-number/S3FVT6IEMVKCE7CSJXO5CJZND6/graph.json","fetch_events":"https://pith.science/api/pith-number/S3FVT6IEMVKCE7CSJXO5CJZND6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6/action/storage_attestation","attest_author":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6/action/author_attestation","sign_citation":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6/action/citation_signature","submit_replication":"https://pith.science/pith/S3FVT6IEMVKCE7CSJXO5CJZND6/action/replication_record"}},"created_at":"2026-07-05T04:22:42.589081+00:00","updated_at":"2026-07-05T04:22:42.589081+00:00"}