{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CR6NOR6BBVOHI4752YGU44UP3J","short_pith_number":"pith:CR6NOR6B","schema_version":"1.0","canonical_sha256":"147cd747c10d5c7473fdd60d4e728fda5e9023899117efae33b994a1e13ac692","source":{"kind":"arxiv","id":"1709.01866","version":3},"attestation_state":"computed","paper":{"title":"Protecting quantum memories using coherent parity check codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Headley, Dominic Horsman, Joschka Roffe, Nicholas Chancellor, Viv Kendon","submitted_at":"2017-09-06T15:52:33Z","abstract_excerpt":"Coherent parity check (CPC) codes are a new framework for the construction of quantum error correction codes that encode multiple qubits per logical block. CPC codes have a canonical structure involving successive rounds of bit and phase parity checks, supplemented by cross-checks to fix the code distance. In this paper, we provide a detailed introduction to CPC codes using conventional quantum circuit notation. We demonstrate the implementation of a CPC code on real hardware, by designing a [[4,2,2]] detection code for the IBM 5Q superconducting qubit device. Whilst the individual gate-error "},"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":"1709.01866","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-09-06T15:52:33Z","cross_cats_sorted":[],"title_canon_sha256":"a2919ff85d816236b0d2c87517a46627ff428ed57a0c9c7b5d4a1a3061f42add","abstract_canon_sha256":"8109379e9f8511b6e31dd9edc338e41826d04cd14297f876b4c4ca278e583114"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:00.907108Z","signature_b64":"Jo0jlPTki0C3Aym111aWHrOT+yVctFOOtr4VNK+jqPWcbfYrwAoaZjsv8SmL+Lo18dXvcIIvBFgLVN3rwOzsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"147cd747c10d5c7473fdd60d4e728fda5e9023899117efae33b994a1e13ac692","last_reissued_at":"2026-05-18T00:14:00.906459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:00.906459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Protecting quantum memories using coherent parity check codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Headley, Dominic Horsman, Joschka Roffe, Nicholas Chancellor, Viv Kendon","submitted_at":"2017-09-06T15:52:33Z","abstract_excerpt":"Coherent parity check (CPC) codes are a new framework for the construction of quantum error correction codes that encode multiple qubits per logical block. CPC codes have a canonical structure involving successive rounds of bit and phase parity checks, supplemented by cross-checks to fix the code distance. In this paper, we provide a detailed introduction to CPC codes using conventional quantum circuit notation. We demonstrate the implementation of a CPC code on real hardware, by designing a [[4,2,2]] detection code for the IBM 5Q superconducting qubit device. Whilst the individual gate-error "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01866","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1709.01866","created_at":"2026-05-18T00:14:00.906562+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01866v3","created_at":"2026-05-18T00:14:00.906562+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01866","created_at":"2026-05-18T00:14:00.906562+00:00"},{"alias_kind":"pith_short_12","alias_value":"CR6NOR6BBVOH","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CR6NOR6BBVOHI475","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CR6NOR6B","created_at":"2026-05-18T12:31:10.602751+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/CR6NOR6BBVOHI4752YGU44UP3J","json":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J.json","graph_json":"https://pith.science/api/pith-number/CR6NOR6BBVOHI4752YGU44UP3J/graph.json","events_json":"https://pith.science/api/pith-number/CR6NOR6BBVOHI4752YGU44UP3J/events.json","paper":"https://pith.science/paper/CR6NOR6B"},"agent_actions":{"view_html":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J","download_json":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J.json","view_paper":"https://pith.science/paper/CR6NOR6B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01866&json=true","fetch_graph":"https://pith.science/api/pith-number/CR6NOR6BBVOHI4752YGU44UP3J/graph.json","fetch_events":"https://pith.science/api/pith-number/CR6NOR6BBVOHI4752YGU44UP3J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J/action/storage_attestation","attest_author":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J/action/author_attestation","sign_citation":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J/action/citation_signature","submit_replication":"https://pith.science/pith/CR6NOR6BBVOHI4752YGU44UP3J/action/replication_record"}},"created_at":"2026-05-18T00:14:00.906562+00:00","updated_at":"2026-05-18T00:14:00.906562+00:00"}