{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:ATTEIWD374BDUMBJILIUGADVB3","short_pith_number":"pith:ATTEIWD3","schema_version":"1.0","canonical_sha256":"04e644587bff023a302942d14300750ee69b34c8b50d8769c724ed586d908403","source":{"kind":"arxiv","id":"2102.06056","version":2},"attestation_state":"computed","paper":{"title":"Qubit-efficient exponential suppression of errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Arrasmith, Lukasz Cincio, Patrick J. Coles, Piotr Czarnik","submitted_at":"2021-02-11T15:01:32Z","abstract_excerpt":"Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to "},"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":"2102.06056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-02-11T15:01:32Z","cross_cats_sorted":[],"title_canon_sha256":"33cfd3e2ec1ecbd737b3a13b42980112ac88e51b970fe11993f5895ceb23740b","abstract_canon_sha256":"5f67d3ffcbd391920707ad554e15f82a2ab163eef77a7700bfe6a3cf33d59e75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:26:17.794968Z","signature_b64":"Di52WTayiXsXB8YJ43i8J9bhTFOy/QaEP2yNkF2U64f4Nd80c11kdyroyJh1ViKqCCJBHRdkGaBSAMQL60p0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04e644587bff023a302942d14300750ee69b34c8b50d8769c724ed586d908403","last_reissued_at":"2026-07-05T02:26:17.794403Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:26:17.794403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Qubit-efficient exponential suppression of errors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andrew Arrasmith, Lukasz Cincio, Patrick J. Coles, Piotr Czarnik","submitted_at":"2021-02-11T15:01:32Z","abstract_excerpt":"Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of exponentially suppressing errors by preparing multiple noisy copies of a state and virtually distilling a more purified version. Here we present an alternative method, the Resource-Efficient Quantum Error Suppression Technique (REQUEST), that adapts this breakthrough to much fewer qubits by making use of active qubit resets, a feature now available on commercial platforms. Our approach exploits a space/time trade-off to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06056","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/2102.06056/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":"2102.06056","created_at":"2026-07-05T02:26:17.794472+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.06056v2","created_at":"2026-07-05T02:26:17.794472+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06056","created_at":"2026-07-05T02:26:17.794472+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATTEIWD374BD","created_at":"2026-07-05T02:26:17.794472+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATTEIWD374BDUMBJ","created_at":"2026-07-05T02:26:17.794472+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATTEIWD3","created_at":"2026-07-05T02:26:17.794472+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2307.05302","citing_title":"Robust design under uncertainty in quantum error mitigation","ref_index":34,"is_internal_anchor":false},{"citing_arxiv_id":"2503.11785","citing_title":"Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation","ref_index":72,"is_internal_anchor":false},{"citing_arxiv_id":"2510.26497","citing_title":"Certification and Classification of Linear Quantum Error Mitigation Methods","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3","json":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3.json","graph_json":"https://pith.science/api/pith-number/ATTEIWD374BDUMBJILIUGADVB3/graph.json","events_json":"https://pith.science/api/pith-number/ATTEIWD374BDUMBJILIUGADVB3/events.json","paper":"https://pith.science/paper/ATTEIWD3"},"agent_actions":{"view_html":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3","download_json":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3.json","view_paper":"https://pith.science/paper/ATTEIWD3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.06056&json=true","fetch_graph":"https://pith.science/api/pith-number/ATTEIWD374BDUMBJILIUGADVB3/graph.json","fetch_events":"https://pith.science/api/pith-number/ATTEIWD374BDUMBJILIUGADVB3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3/action/storage_attestation","attest_author":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3/action/author_attestation","sign_citation":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3/action/citation_signature","submit_replication":"https://pith.science/pith/ATTEIWD374BDUMBJILIUGADVB3/action/replication_record"}},"created_at":"2026-07-05T02:26:17.794472+00:00","updated_at":"2026-07-05T02:26:17.794472+00:00"}