{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:G4HJF4G3PTRGUPSXFSUXHBPP7K","short_pith_number":"pith:G4HJF4G3","schema_version":"1.0","canonical_sha256":"370e92f0db7ce26a3e572ca97385effa8f832098b44ec8cb8824831e0dbe0eb6","source":{"kind":"arxiv","id":"2606.02697","version":1},"attestation_state":"computed","paper":{"title":"Machine Learning-based Quantum Error Mitigation for Variational Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniil Rabinovich, Kirill Lakhmanskiy, Nikita Korolev","submitted_at":"2026-06-01T18:00:00Z","abstract_excerpt":"Machine Learning-based quantum error mitigation (ML-QEM) has emerged as a promising approach for improving the performance of noisy quantum algorithms. However, existing ML-QEM methods often have restricted applicability to variational circuits and rely on inaccessible noiseless training data. In this work, we propose a practical ML-QEM protocol tailored to variational quantum algorithms, which generates training data by simulating (near-)Clifford circuits. This data is used for model selection and training, producing a mitigation model that can correct variational circuits with arbitrary para"},"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":"2606.02697","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2026-06-01T18:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"48bceaca690b8935ad9c8374e63378afe09ff5e18df69b8f9e7cfccd75680094","abstract_canon_sha256":"b651cd6b1bc7649ae2e935284ec379549a765de7cf0a90a29a72c7d6f2173f30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T00:05:06.889168Z","signature_b64":"G91Kdo0dNUnurHLYtr4Jch7ohUAZZCcYWxnsg6AiK57tMNgTmLQ41Hq0W1UADxUIQi6Kkft8cvnStSgxJfNbCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"370e92f0db7ce26a3e572ca97385effa8f832098b44ec8cb8824831e0dbe0eb6","last_reissued_at":"2026-06-03T00:05:06.888769Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T00:05:06.888769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Machine Learning-based Quantum Error Mitigation for Variational Algorithms","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Daniil Rabinovich, Kirill Lakhmanskiy, Nikita Korolev","submitted_at":"2026-06-01T18:00:00Z","abstract_excerpt":"Machine Learning-based quantum error mitigation (ML-QEM) has emerged as a promising approach for improving the performance of noisy quantum algorithms. However, existing ML-QEM methods often have restricted applicability to variational circuits and rely on inaccessible noiseless training data. In this work, we propose a practical ML-QEM protocol tailored to variational quantum algorithms, which generates training data by simulating (near-)Clifford circuits. This data is used for model selection and training, producing a mitigation model that can correct variational circuits with arbitrary para"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02697","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/2606.02697/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":"2606.02697","created_at":"2026-06-03T00:05:06.888826+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02697v1","created_at":"2026-06-03T00:05:06.888826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02697","created_at":"2026-06-03T00:05:06.888826+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4HJF4G3PTRG","created_at":"2026-06-03T00:05:06.888826+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4HJF4G3PTRGUPSX","created_at":"2026-06-03T00:05:06.888826+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4HJF4G3","created_at":"2026-06-03T00:05:06.888826+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K","json":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K.json","graph_json":"https://pith.science/api/pith-number/G4HJF4G3PTRGUPSXFSUXHBPP7K/graph.json","events_json":"https://pith.science/api/pith-number/G4HJF4G3PTRGUPSXFSUXHBPP7K/events.json","paper":"https://pith.science/paper/G4HJF4G3"},"agent_actions":{"view_html":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K","download_json":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K.json","view_paper":"https://pith.science/paper/G4HJF4G3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02697&json=true","fetch_graph":"https://pith.science/api/pith-number/G4HJF4G3PTRGUPSXFSUXHBPP7K/graph.json","fetch_events":"https://pith.science/api/pith-number/G4HJF4G3PTRGUPSXFSUXHBPP7K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K/action/storage_attestation","attest_author":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K/action/author_attestation","sign_citation":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K/action/citation_signature","submit_replication":"https://pith.science/pith/G4HJF4G3PTRGUPSXFSUXHBPP7K/action/replication_record"}},"created_at":"2026-06-03T00:05:06.888826+00:00","updated_at":"2026-06-03T00:05:06.888826+00:00"}