{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:UN76EPQI6UQOD7UTGLRQ7A5LLB","short_pith_number":"pith:UN76EPQI","schema_version":"1.0","canonical_sha256":"a37fe23e08f520e1fe9332e30f83ab585c2ce51f89450347953d35322da2792a","source":{"kind":"arxiv","id":"2407.06583","version":1},"attestation_state":"computed","paper":{"title":"Low-cost noise reduction for Clifford circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Edwin Tham, Nicolas Delfosse","submitted_at":"2024-07-09T06:30:07Z","abstract_excerpt":"We propose a Clifford noise reduction (CliNR) scheme that provides a reduction of the logical error rate of Clifford circuit with lower overhead than error correction and without the exponential sampling overhead of error mitigation. CliNR implements Clifford circuits by splitting them into sub-circuits that are performed using gate teleportation. A few random stabilizer measurements are used to detect errors in the resources states consumed by the gate teleportation. This can be seen as a teleported version of the CPC scheme, with offline fault-detection making it scalable. We prove that CliN"},"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":"2407.06583","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-09T06:30:07Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"74aa7e4b4adf442104893e54f6ec8ba9ac11d89e63c2cf96c4d328318d5b7100","abstract_canon_sha256":"b682a8dad565f70e4ebfba43a539783ca709a66eb95da99078c97e2d211f1413"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:41:50.529528Z","signature_b64":"H5RYbM50bolcOL2miJhIJP5k/2quSdlPjMcM9+KbWheYatJrSb5n4tsCak7QDSp2FOKNKqz60fBP49xmjqsHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a37fe23e08f520e1fe9332e30f83ab585c2ce51f89450347953d35322da2792a","last_reissued_at":"2026-07-05T08:41:50.529105Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:41:50.529105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-cost noise reduction for Clifford circuits","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Edwin Tham, Nicolas Delfosse","submitted_at":"2024-07-09T06:30:07Z","abstract_excerpt":"We propose a Clifford noise reduction (CliNR) scheme that provides a reduction of the logical error rate of Clifford circuit with lower overhead than error correction and without the exponential sampling overhead of error mitigation. CliNR implements Clifford circuits by splitting them into sub-circuits that are performed using gate teleportation. A few random stabilizer measurements are used to detect errors in the resources states consumed by the gate teleportation. This can be seen as a teleported version of the CPC scheme, with offline fault-detection making it scalable. We prove that CliN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.06583","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/2407.06583/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":"2407.06583","created_at":"2026-07-05T08:41:50.529168+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.06583v1","created_at":"2026-07-05T08:41:50.529168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.06583","created_at":"2026-07-05T08:41:50.529168+00:00"},{"alias_kind":"pith_short_12","alias_value":"UN76EPQI6UQO","created_at":"2026-07-05T08:41:50.529168+00:00"},{"alias_kind":"pith_short_16","alias_value":"UN76EPQI6UQOD7UT","created_at":"2026-07-05T08:41:50.529168+00:00"},{"alias_kind":"pith_short_8","alias_value":"UN76EPQI","created_at":"2026-07-05T08:41:50.529168+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2408.14828","citing_title":"Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB","json":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB.json","graph_json":"https://pith.science/api/pith-number/UN76EPQI6UQOD7UTGLRQ7A5LLB/graph.json","events_json":"https://pith.science/api/pith-number/UN76EPQI6UQOD7UTGLRQ7A5LLB/events.json","paper":"https://pith.science/paper/UN76EPQI"},"agent_actions":{"view_html":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB","download_json":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB.json","view_paper":"https://pith.science/paper/UN76EPQI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.06583&json=true","fetch_graph":"https://pith.science/api/pith-number/UN76EPQI6UQOD7UTGLRQ7A5LLB/graph.json","fetch_events":"https://pith.science/api/pith-number/UN76EPQI6UQOD7UTGLRQ7A5LLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB/action/storage_attestation","attest_author":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB/action/author_attestation","sign_citation":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB/action/citation_signature","submit_replication":"https://pith.science/pith/UN76EPQI6UQOD7UTGLRQ7A5LLB/action/replication_record"}},"created_at":"2026-07-05T08:41:50.529168+00:00","updated_at":"2026-07-05T08:41:50.529168+00:00"}