{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7R4MJZ3SRJHJHMRJ65ADSLJ344","short_pith_number":"pith:7R4MJZ3S","schema_version":"1.0","canonical_sha256":"fc78c4e7728a4e93b229f740392d3be7344f5a1f41546ab3c9e7f848cb8d19f2","source":{"kind":"arxiv","id":"2103.06309","version":2},"attestation_state":"computed","paper":{"title":"Quantum Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jens Niklas Eberhardt, Nikolas P. Breuckmann","submitted_at":"2021-03-10T19:19:37Z","abstract_excerpt":"Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes. The codes we discuss are alternatives to the surface code, which is the currently leading candidate to implement quantum fault-tolerance. We introduce the zoo of LDPC quantum codes and discuss their potential for making quantum computers robust against noise. In particular, we explain recent advances in the theory of LDPC quantum codes related to certain product constructions and discuss "},"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":"2103.06309","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-03-10T19:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"3a243966d5894e5ca83eb7518cd6e0aea282115205a86f35bb8706e8638db3ba","abstract_canon_sha256":"082a3535cb84f6731ad4980f9cd98dc0cd78086dc189071e2820c2bf2245cef5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:12.696750Z","signature_b64":"scumPXJTHHf5WnpnuitMOR/Z3U6VujnUUTnU83uqo2opaDIPQkeqNWe/qoub6qQQEkkhqd5+iMemVNB06W9XAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc78c4e7728a4e93b229f740392d3be7344f5a1f41546ab3c9e7f848cb8d19f2","last_reissued_at":"2026-07-05T03:25:12.696280Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:12.696280Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Low-Density Parity-Check Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Jens Niklas Eberhardt, Nikolas P. Breuckmann","submitted_at":"2021-03-10T19:19:37Z","abstract_excerpt":"Quantum error correction is an indispensable ingredient for scalable quantum computing. In this Perspective we discuss a particular class of quantum codes called low-density parity-check (LDPC) quantum codes. The codes we discuss are alternatives to the surface code, which is the currently leading candidate to implement quantum fault-tolerance. We introduce the zoo of LDPC quantum codes and discuss their potential for making quantum computers robust against noise. In particular, we explain recent advances in the theory of LDPC quantum codes related to certain product constructions and discuss "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.06309","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/2103.06309/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":"2103.06309","created_at":"2026-07-05T03:25:12.696347+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.06309v2","created_at":"2026-07-05T03:25:12.696347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.06309","created_at":"2026-07-05T03:25:12.696347+00:00"},{"alias_kind":"pith_short_12","alias_value":"7R4MJZ3SRJHJ","created_at":"2026-07-05T03:25:12.696347+00:00"},{"alias_kind":"pith_short_16","alias_value":"7R4MJZ3SRJHJHMRJ","created_at":"2026-07-05T03:25:12.696347+00:00"},{"alias_kind":"pith_short_8","alias_value":"7R4MJZ3S","created_at":"2026-07-05T03:25:12.696347+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25011","citing_title":"Fast and Parallel High-Rate STAR Architecture for Megaquop Quantum Simulation","ref_index":18,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2301.05687","citing_title":"Mixed-state topological order and the errorfield double formulation of decoherence-induced transitions","ref_index":63,"is_internal_anchor":false},{"citing_arxiv_id":"2410.02213","citing_title":"Low-overhead fault-tolerant quantum computation by gauging logical operators","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05126","citing_title":"In-Situ Simultaneous Magic State Injection on Arbitrary CSS qLDPC Codes","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2602.11457","citing_title":"The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344","json":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344.json","graph_json":"https://pith.science/api/pith-number/7R4MJZ3SRJHJHMRJ65ADSLJ344/graph.json","events_json":"https://pith.science/api/pith-number/7R4MJZ3SRJHJHMRJ65ADSLJ344/events.json","paper":"https://pith.science/paper/7R4MJZ3S"},"agent_actions":{"view_html":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344","download_json":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344.json","view_paper":"https://pith.science/paper/7R4MJZ3S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.06309&json=true","fetch_graph":"https://pith.science/api/pith-number/7R4MJZ3SRJHJHMRJ65ADSLJ344/graph.json","fetch_events":"https://pith.science/api/pith-number/7R4MJZ3SRJHJHMRJ65ADSLJ344/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344/action/storage_attestation","attest_author":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344/action/author_attestation","sign_citation":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344/action/citation_signature","submit_replication":"https://pith.science/pith/7R4MJZ3SRJHJHMRJ65ADSLJ344/action/replication_record"}},"created_at":"2026-07-05T03:25:12.696347+00:00","updated_at":"2026-07-05T03:25:12.696347+00:00"}