{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:FUCCBZQC26BNAJYDWB2IDRXG47","short_pith_number":"pith:FUCCBZQC","schema_version":"1.0","canonical_sha256":"2d0420e602d782d02703b07481c6e6e7dbe746f6d5632524a4978f7017df92e7","source":{"kind":"arxiv","id":"2212.07500","version":1},"attestation_state":"computed","paper":{"title":"Concepts and conditions for error suppression through randomized compiling","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Winick, Dar Dahlen, Egor Ospadov, Ian Hincks, Joel J. Wallman, Joseph Emerson","submitted_at":"2022-12-14T20:45:28Z","abstract_excerpt":"Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling also tailors non-Markovian errors into local stochastic Pauli noise and investigate the technique's limitations. We show through analysis and numerical results that randomized compiling alters errors in three distinct helpful ways. First, it prevents the coherent accumulation of errors (including hard to remove crosstalk effects) across gate cycles by destroying intercycle coherent correlations. Second, it converts "},"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":"2212.07500","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2022-12-14T20:45:28Z","cross_cats_sorted":[],"title_canon_sha256":"359e54576eff3fda64c2587913d0e12528599b60f201dc57fc079e2fad9d28e5","abstract_canon_sha256":"f5e05b5a5aae46991d5e964f56d307ca73c322427f589c8d79a0ac1d29efce9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:25:33.613465Z","signature_b64":"wDwJXnfuytV5b6DfEstQnSfKUybeU+QzUbZ2rdMQIAkqwpRAKm7yyd0gWthQpJNeIWhNvNruLhrAm/41RTKdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d0420e602d782d02703b07481c6e6e7dbe746f6d5632524a4978f7017df92e7","last_reissued_at":"2026-07-05T05:25:33.613039Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:25:33.613039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Concepts and conditions for error suppression through randomized compiling","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Winick, Dar Dahlen, Egor Ospadov, Ian Hincks, Joel J. Wallman, Joseph Emerson","submitted_at":"2022-12-14T20:45:28Z","abstract_excerpt":"Randomized compiling reduces the effects of errors on quantum computers by tailoring arbitrary Markovian errors into stochastic Pauli noise. Here we prove that randomized compiling also tailors non-Markovian errors into local stochastic Pauli noise and investigate the technique's limitations. We show through analysis and numerical results that randomized compiling alters errors in three distinct helpful ways. First, it prevents the coherent accumulation of errors (including hard to remove crosstalk effects) across gate cycles by destroying intercycle coherent correlations. Second, it converts "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2212.07500","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/2212.07500/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":"2212.07500","created_at":"2026-07-05T05:25:33.613091+00:00"},{"alias_kind":"arxiv_version","alias_value":"2212.07500v1","created_at":"2026-07-05T05:25:33.613091+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2212.07500","created_at":"2026-07-05T05:25:33.613091+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUCCBZQC26BN","created_at":"2026-07-05T05:25:33.613091+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUCCBZQC26BNAJYD","created_at":"2026-07-05T05:25:33.613091+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUCCBZQC","created_at":"2026-07-05T05:25:33.613091+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2603.12054","citing_title":"Noise Correlations as a Resource in Pauli-Twirled Circuits","ref_index":17,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04025","citing_title":"Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47","json":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47.json","graph_json":"https://pith.science/api/pith-number/FUCCBZQC26BNAJYDWB2IDRXG47/graph.json","events_json":"https://pith.science/api/pith-number/FUCCBZQC26BNAJYDWB2IDRXG47/events.json","paper":"https://pith.science/paper/FUCCBZQC"},"agent_actions":{"view_html":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47","download_json":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47.json","view_paper":"https://pith.science/paper/FUCCBZQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2212.07500&json=true","fetch_graph":"https://pith.science/api/pith-number/FUCCBZQC26BNAJYDWB2IDRXG47/graph.json","fetch_events":"https://pith.science/api/pith-number/FUCCBZQC26BNAJYDWB2IDRXG47/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47/action/storage_attestation","attest_author":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47/action/author_attestation","sign_citation":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47/action/citation_signature","submit_replication":"https://pith.science/pith/FUCCBZQC26BNAJYDWB2IDRXG47/action/replication_record"}},"created_at":"2026-07-05T05:25:33.613091+00:00","updated_at":"2026-07-05T05:25:33.613091+00:00"}