{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:4K6PWUUSSY5O4KK43L33DNHIEX","short_pith_number":"pith:4K6PWUUS","schema_version":"1.0","canonical_sha256":"e2bcfb5292963aee295cdaf7b1b4e825dbe98b7cc091f5a7158129d2450d8527","source":{"kind":"arxiv","id":"quant-ph/0606126","version":2},"attestation_state":"computed","paper":{"title":"Optimal and Efficient Decoding of Concatenated Quantum Block Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Poulin","submitted_at":"2006-06-14T19:53:25Z","abstract_excerpt":"We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial \"check\" measurements on the system. In general, this problem is NP-hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message passing algorithm. We compare the performance of the message passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the 5 qubit and Steane's code on a depolarizing channel demonstrate signifi"},"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":"quant-ph/0606126","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2006-06-14T19:53:25Z","cross_cats_sorted":[],"title_canon_sha256":"48b175524b9291e375aabd6a72588f28be0c61186e7c84c829fd6cfc42af66c1","abstract_canon_sha256":"8f95da9ec88adf32fe14a1f8758bcbb7e4b83c9e0ccb8b598e69461ae1ea9363"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:03:29.461277Z","signature_b64":"5J+llfRrIOMiRUumvc5filKUlmInbpZVU5wk01LT1fL4rH0VEqMq3Ssjf7wX789IeNEbH2VY4H5SkQT8YGQLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2bcfb5292963aee295cdaf7b1b4e825dbe98b7cc091f5a7158129d2450d8527","last_reissued_at":"2026-07-04T17:03:29.460801Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:03:29.460801Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal and Efficient Decoding of Concatenated Quantum Block Codes","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David Poulin","submitted_at":"2006-06-14T19:53:25Z","abstract_excerpt":"We consider the problem of optimally decoding a quantum error correction code -- that is to find the optimal recovery procedure given the outcomes of partial \"check\" measurements on the system. In general, this problem is NP-hard. However, we demonstrate that for concatenated block codes, the optimal decoding can be efficiently computed using a message passing algorithm. We compare the performance of the message passing algorithm to that of the widespread blockwise hard decoding technique. Our Monte Carlo results using the 5 qubit and Steane's code on a depolarizing channel demonstrate signifi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0606126","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/quant-ph/0606126/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":"quant-ph/0606126","created_at":"2026-07-04T17:03:29.460856+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0606126v2","created_at":"2026-07-04T17:03:29.460856+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0606126","created_at":"2026-07-04T17:03:29.460856+00:00"},{"alias_kind":"pith_short_12","alias_value":"4K6PWUUSSY5O","created_at":"2026-07-04T17:03:29.460856+00:00"},{"alias_kind":"pith_short_16","alias_value":"4K6PWUUSSY5O4KK4","created_at":"2026-07-04T17:03:29.460856+00:00"},{"alias_kind":"pith_short_8","alias_value":"4K6PWUUS","created_at":"2026-07-04T17:03:29.460856+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/4K6PWUUSSY5O4KK43L33DNHIEX","json":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX.json","graph_json":"https://pith.science/api/pith-number/4K6PWUUSSY5O4KK43L33DNHIEX/graph.json","events_json":"https://pith.science/api/pith-number/4K6PWUUSSY5O4KK43L33DNHIEX/events.json","paper":"https://pith.science/paper/4K6PWUUS"},"agent_actions":{"view_html":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX","download_json":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX.json","view_paper":"https://pith.science/paper/4K6PWUUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0606126&json=true","fetch_graph":"https://pith.science/api/pith-number/4K6PWUUSSY5O4KK43L33DNHIEX/graph.json","fetch_events":"https://pith.science/api/pith-number/4K6PWUUSSY5O4KK43L33DNHIEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX/action/storage_attestation","attest_author":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX/action/author_attestation","sign_citation":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX/action/citation_signature","submit_replication":"https://pith.science/pith/4K6PWUUSSY5O4KK43L33DNHIEX/action/replication_record"}},"created_at":"2026-07-04T17:03:29.460856+00:00","updated_at":"2026-07-04T17:03:29.460856+00:00"}