{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4KUH63CU7VADAB6VNF7BB67N3R","short_pith_number":"pith:4KUH63CU","schema_version":"1.0","canonical_sha256":"e2a87f6c54fd403007d5697e10fbeddc738d430eafb46c4c37bd1d7ae5e04a09","source":{"kind":"arxiv","id":"2003.04941","version":1},"attestation_state":"computed","paper":{"title":"Resource Efficient Zero Noise Extrapolation with Identity Insertions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andre He, Benjamin Nachman, Christian W. Bauer, Wibe A. de Jong","submitted_at":"2020-03-10T19:31:18Z","abstract_excerpt":"In addition to readout errors, two-qubit gate noise is the main challenge for complex quantum algorithms on noisy intermediate-scale quantum (NISQ) computers. These errors are a significant challenge for making accurate calculations for quantum chemistry, nuclear physics, high energy physics, and other emerging scientific and industrial applications. There are two proposals for mitigating two-qubit gate errors: error-correcting codes and zero-noise extrapolation. This paper focuses on the latter, studying it in detail and proposing modifications to existing approaches. In particular, we propos"},"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":"2003.04941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-03-10T19:31:18Z","cross_cats_sorted":[],"title_canon_sha256":"a6cce1ff59929922f891a3b7a0fb440f359d3c9d6795f93370c2202ca82e1d51","abstract_canon_sha256":"98d17c0c387e08d8b35e615ae2a7353313f20e550626c0f34c4f0ea9c222af8f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:24:32.293792Z","signature_b64":"uQxBYFPwFS9iQS+Lud/Q2+idfy8e8Av8AxOGXc0oTiDktzLNNVro5tnHWZoBg904A7sVWZXEHYHS7Aubb2YZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2a87f6c54fd403007d5697e10fbeddc738d430eafb46c4c37bd1d7ae5e04a09","last_reissued_at":"2026-07-05T01:24:32.292889Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:24:32.292889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Efficient Zero Noise Extrapolation with Identity Insertions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andre He, Benjamin Nachman, Christian W. Bauer, Wibe A. de Jong","submitted_at":"2020-03-10T19:31:18Z","abstract_excerpt":"In addition to readout errors, two-qubit gate noise is the main challenge for complex quantum algorithms on noisy intermediate-scale quantum (NISQ) computers. These errors are a significant challenge for making accurate calculations for quantum chemistry, nuclear physics, high energy physics, and other emerging scientific and industrial applications. There are two proposals for mitigating two-qubit gate errors: error-correcting codes and zero-noise extrapolation. This paper focuses on the latter, studying it in detail and proposing modifications to existing approaches. In particular, we propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.04941","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/2003.04941/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":"2003.04941","created_at":"2026-07-05T01:24:32.292949+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.04941v1","created_at":"2026-07-05T01:24:32.292949+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.04941","created_at":"2026-07-05T01:24:32.292949+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KUH63CU7VAD","created_at":"2026-07-05T01:24:32.292949+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KUH63CU7VADAB6V","created_at":"2026-07-05T01:24:32.292949+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KUH63CU","created_at":"2026-07-05T01:24:32.292949+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.26497","citing_title":"Certification and Classification of Linear Quantum Error Mitigation Methods","ref_index":44,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R","json":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R.json","graph_json":"https://pith.science/api/pith-number/4KUH63CU7VADAB6VNF7BB67N3R/graph.json","events_json":"https://pith.science/api/pith-number/4KUH63CU7VADAB6VNF7BB67N3R/events.json","paper":"https://pith.science/paper/4KUH63CU"},"agent_actions":{"view_html":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R","download_json":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R.json","view_paper":"https://pith.science/paper/4KUH63CU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.04941&json=true","fetch_graph":"https://pith.science/api/pith-number/4KUH63CU7VADAB6VNF7BB67N3R/graph.json","fetch_events":"https://pith.science/api/pith-number/4KUH63CU7VADAB6VNF7BB67N3R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R/action/storage_attestation","attest_author":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R/action/author_attestation","sign_citation":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R/action/citation_signature","submit_replication":"https://pith.science/pith/4KUH63CU7VADAB6VNF7BB67N3R/action/replication_record"}},"created_at":"2026-07-05T01:24:32.292949+00:00","updated_at":"2026-07-05T01:24:32.292949+00:00"}