{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LNNZ5QDHVKCAOSHUGXXXX4OBOO","short_pith_number":"pith:LNNZ5QDH","schema_version":"1.0","canonical_sha256":"5b5b9ec067aa840748f435ef7bf1c173af41e980015c9a5a30ccb8d0191d5bc5","source":{"kind":"arxiv","id":"2207.06850","version":1},"attestation_state":"computed","paper":{"title":"Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Callison, Nicholas Chancellor","submitted_at":"2022-07-14T12:09:19Z","abstract_excerpt":"Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction/representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classica"},"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":"2207.06850","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-07-14T12:09:19Z","cross_cats_sorted":[],"title_canon_sha256":"7de0b46be774b078fa700e5b97b7887f67c7c7b6b977fe971bdffd610abbfd3d","abstract_canon_sha256":"7526a61e01e9417b138017ce72e00ebe1544cc36abbc93d8e71862b855526a55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:40:17.884177Z","signature_b64":"DHMaf1LjrxdobPlzkDlAOFA8geJ2fJZJt5o+KHJyECqfztzBHoI4VnOI+CgpcVXN6U6ipzXdXjWQ1UUcUsqXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b5b9ec067aa840748f435ef7bf1c173af41e980015c9a5a30ccb8d0191d5bc5","last_reissued_at":"2026-07-05T04:40:17.883720Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:40:17.883720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Callison, Nicholas Chancellor","submitted_at":"2022-07-14T12:09:19Z","abstract_excerpt":"Hybrid quantum-classical algorithms are central to much of the current research in quantum computing, particularly when considering the noisy intermediate-scale quantum (NISQ) era, with a number of experimental demonstrations having already been performed. In this perspective, we discuss in a very broad sense what it means for an algorithm to be hybrid quantum-classical. We first explore this concept very directly, by building a definition based on previous work in abstraction/representation theory, arguing that what makes an algorithm hybrid is not directly how it is run (or how many classica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.06850","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/2207.06850/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":"2207.06850","created_at":"2026-07-05T04:40:17.883783+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.06850v1","created_at":"2026-07-05T04:40:17.883783+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.06850","created_at":"2026-07-05T04:40:17.883783+00:00"},{"alias_kind":"pith_short_12","alias_value":"LNNZ5QDHVKCA","created_at":"2026-07-05T04:40:17.883783+00:00"},{"alias_kind":"pith_short_16","alias_value":"LNNZ5QDHVKCAOSHU","created_at":"2026-07-05T04:40:17.883783+00:00"},{"alias_kind":"pith_short_8","alias_value":"LNNZ5QDH","created_at":"2026-07-05T04:40:17.883783+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.05627","citing_title":"Loss-aware state space geometry for quantum variational algorithms","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO","json":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO.json","graph_json":"https://pith.science/api/pith-number/LNNZ5QDHVKCAOSHUGXXXX4OBOO/graph.json","events_json":"https://pith.science/api/pith-number/LNNZ5QDHVKCAOSHUGXXXX4OBOO/events.json","paper":"https://pith.science/paper/LNNZ5QDH"},"agent_actions":{"view_html":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO","download_json":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO.json","view_paper":"https://pith.science/paper/LNNZ5QDH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.06850&json=true","fetch_graph":"https://pith.science/api/pith-number/LNNZ5QDHVKCAOSHUGXXXX4OBOO/graph.json","fetch_events":"https://pith.science/api/pith-number/LNNZ5QDHVKCAOSHUGXXXX4OBOO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO/action/storage_attestation","attest_author":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO/action/author_attestation","sign_citation":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO/action/citation_signature","submit_replication":"https://pith.science/pith/LNNZ5QDHVKCAOSHUGXXXX4OBOO/action/replication_record"}},"created_at":"2026-07-05T04:40:17.883783+00:00","updated_at":"2026-07-05T04:40:17.883783+00:00"}