{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:NQETI5WED3PBGJHZFSZ75DEJKO","short_pith_number":"pith:NQETI5WE","schema_version":"1.0","canonical_sha256":"6c093476c41ede1324f92cb3fe8c8953bf665a96287a88d6dfe5a8da7808e995","source":{"kind":"arxiv","id":"2204.07109","version":2},"attestation_state":"computed","paper":{"title":"Improving the efficiency of learning-based error mitigation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew T. Sornborger, Lukasz Cincio, Michael McKerns, Piotr Czarnik","submitted_at":"2022-04-14T16:58:51Z","abstract_excerpt":"Error mitigation will play an important role in practical applications of near-term noisy quantum computers. Current error mitigation methods typically concentrate on correction quality at the expense of frugality (as measured by the number of additional calls to quantum hardware). To fill the need for highly accurate, yet inexpensive techniques, we introduce an error mitigation scheme that builds on Clifford data regression (CDR). The scheme improves the frugality by carefully choosing the training data and exploiting the symmetries of the problem. We test our approach by correcting long rang"},"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":"2204.07109","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-04-14T16:58:51Z","cross_cats_sorted":[],"title_canon_sha256":"1ceaa5b8e4e83df5fa51353bad90b8a58d7b506d3048b9d57fab891cfa6a613c","abstract_canon_sha256":"dbb37163cfdc1ded1a085fa24ca7b9452699487c2d5f55750294dfe2b218b8d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:59:45.194680Z","signature_b64":"NySKEMJ3bNR2fgbeh6sFyYa3ptsWG+J6v6szFrYExSfYyN5pRErd3O0lQTflqjwTHZ0DMXo6ld0l19/HI/BuBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c093476c41ede1324f92cb3fe8c8953bf665a96287a88d6dfe5a8da7808e995","last_reissued_at":"2026-07-05T10:59:45.194175Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:59:45.194175Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving the efficiency of learning-based error mitigation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew T. Sornborger, Lukasz Cincio, Michael McKerns, Piotr Czarnik","submitted_at":"2022-04-14T16:58:51Z","abstract_excerpt":"Error mitigation will play an important role in practical applications of near-term noisy quantum computers. Current error mitigation methods typically concentrate on correction quality at the expense of frugality (as measured by the number of additional calls to quantum hardware). To fill the need for highly accurate, yet inexpensive techniques, we introduce an error mitigation scheme that builds on Clifford data regression (CDR). The scheme improves the frugality by carefully choosing the training data and exploiting the symmetries of the problem. We test our approach by correcting long rang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.07109","kind":"arxiv","version":2},"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/2204.07109/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":"2204.07109","created_at":"2026-07-05T10:59:45.194233+00:00"},{"alias_kind":"arxiv_version","alias_value":"2204.07109v2","created_at":"2026-07-05T10:59:45.194233+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.07109","created_at":"2026-07-05T10:59:45.194233+00:00"},{"alias_kind":"pith_short_12","alias_value":"NQETI5WED3PB","created_at":"2026-07-05T10:59:45.194233+00:00"},{"alias_kind":"pith_short_16","alias_value":"NQETI5WED3PBGJHZ","created_at":"2026-07-05T10:59:45.194233+00:00"},{"alias_kind":"pith_short_8","alias_value":"NQETI5WE","created_at":"2026-07-05T10:59:45.194233+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.31195","citing_title":"Pauli Weight Hamiltonian Term Selection for Optimized Machine Learning Based Quantum Error Mitigation","ref_index":42,"is_internal_anchor":false},{"citing_arxiv_id":"2307.05302","citing_title":"Robust design under uncertainty in quantum error mitigation","ref_index":68,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO","json":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO.json","graph_json":"https://pith.science/api/pith-number/NQETI5WED3PBGJHZFSZ75DEJKO/graph.json","events_json":"https://pith.science/api/pith-number/NQETI5WED3PBGJHZFSZ75DEJKO/events.json","paper":"https://pith.science/paper/NQETI5WE"},"agent_actions":{"view_html":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO","download_json":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO.json","view_paper":"https://pith.science/paper/NQETI5WE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2204.07109&json=true","fetch_graph":"https://pith.science/api/pith-number/NQETI5WED3PBGJHZFSZ75DEJKO/graph.json","fetch_events":"https://pith.science/api/pith-number/NQETI5WED3PBGJHZFSZ75DEJKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO/action/storage_attestation","attest_author":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO/action/author_attestation","sign_citation":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO/action/citation_signature","submit_replication":"https://pith.science/pith/NQETI5WED3PBGJHZFSZ75DEJKO/action/replication_record"}},"created_at":"2026-07-05T10:59:45.194233+00:00","updated_at":"2026-07-05T10:59:45.194233+00:00"}