{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FJV5MCMJ2JX344TFCQMXLQVCVC","short_pith_number":"pith:FJV5MCMJ","schema_version":"1.0","canonical_sha256":"2a6bd60989d26fbe7265141975c2a2a8aafa166026d9f2d742b6b0e962fd0a51","source":{"kind":"arxiv","id":"2101.04125","version":3},"attestation_state":"computed","paper":{"title":"General tensor network decoding of 2D Pauli codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher T. Chubb","submitted_at":"2021-01-11T19:00:03Z","abstract_excerpt":"In this work we develop a general tensor network decoder for 2D codes. Specifically, we propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. For a code consisting of $n$ qubits our decoder has a runtime of $O(n\\log n+n\\chi^3)$, where $\\chi$ is an approximation parameter. We numerically demonstrate the power of this decoder by studying four classes of codes under three noise models, namely regular surface codes, irregular surface codes, subsystem surface codes and colour codes, under bit-flip, phase-flip and depolarising"},"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":"2101.04125","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-01-11T19:00:03Z","cross_cats_sorted":[],"title_canon_sha256":"24cb0520a9788786b9194036c9eaa5b48d0739a2610e28015a4ff06c1c6d1591","abstract_canon_sha256":"c6f2113fe08b5dc5051d08006a8d7a1ac8f2cf4ead73b34a9d5808595986d35e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:20.683834Z","signature_b64":"fs2JpS5M8T+Mucc/5Rpq0s3hUdzqMeDw0TT+uYtZgQCps2S5Rg5kj+seISUnXw9KYhoCyrBgJ9OowCaO/VRKDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6bd60989d26fbe7265141975c2a2a8aafa166026d9f2d742b6b0e962fd0a51","last_reissued_at":"2026-07-05T03:22:20.683436Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:20.683436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General tensor network decoding of 2D Pauli codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christopher T. Chubb","submitted_at":"2021-01-11T19:00:03Z","abstract_excerpt":"In this work we develop a general tensor network decoder for 2D codes. Specifically, we propose a decoder that approximates maximally likelihood decoding for 2D stabiliser and subsystem codes subject to Pauli noise. For a code consisting of $n$ qubits our decoder has a runtime of $O(n\\log n+n\\chi^3)$, where $\\chi$ is an approximation parameter. We numerically demonstrate the power of this decoder by studying four classes of codes under three noise models, namely regular surface codes, irregular surface codes, subsystem surface codes and colour codes, under bit-flip, phase-flip and depolarising"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2101.04125","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2101.04125/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":"2101.04125","created_at":"2026-07-05T03:22:20.683493+00:00"},{"alias_kind":"arxiv_version","alias_value":"2101.04125v3","created_at":"2026-07-05T03:22:20.683493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2101.04125","created_at":"2026-07-05T03:22:20.683493+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJV5MCMJ2JX3","created_at":"2026-07-05T03:22:20.683493+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJV5MCMJ2JX344TF","created_at":"2026-07-05T03:22:20.683493+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJV5MCMJ","created_at":"2026-07-05T03:22:20.683493+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":6,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25974","citing_title":"Tensor network characterization and mitigation of readout errors","ref_index":49,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20513","citing_title":"Approximating optimal decoding of quantum LDPC codes with narrow frontiers","ref_index":37,"is_internal_anchor":false},{"citing_arxiv_id":"2411.05785","citing_title":"Phases of decodability in the surface code with unitary errors","ref_index":16,"is_internal_anchor":false},{"citing_arxiv_id":"2505.10693","citing_title":"Distributed Realization of Color Codes for Quantum Error Correction","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2605.17230","citing_title":"Maximum Likelihood Decoding of Quantum Error Correction Codes","ref_index":80,"is_internal_anchor":false},{"citing_arxiv_id":"2603.25665","citing_title":"Non-linear Sigma Model for the Surface Code with Coherent Errors","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC","json":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC.json","graph_json":"https://pith.science/api/pith-number/FJV5MCMJ2JX344TFCQMXLQVCVC/graph.json","events_json":"https://pith.science/api/pith-number/FJV5MCMJ2JX344TFCQMXLQVCVC/events.json","paper":"https://pith.science/paper/FJV5MCMJ"},"agent_actions":{"view_html":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC","download_json":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC.json","view_paper":"https://pith.science/paper/FJV5MCMJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2101.04125&json=true","fetch_graph":"https://pith.science/api/pith-number/FJV5MCMJ2JX344TFCQMXLQVCVC/graph.json","fetch_events":"https://pith.science/api/pith-number/FJV5MCMJ2JX344TFCQMXLQVCVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC/action/storage_attestation","attest_author":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC/action/author_attestation","sign_citation":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC/action/citation_signature","submit_replication":"https://pith.science/pith/FJV5MCMJ2JX344TFCQMXLQVCVC/action/replication_record"}},"created_at":"2026-07-05T03:22:20.683493+00:00","updated_at":"2026-07-05T03:22:20.683493+00:00"}