{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7NPXTRW7LRQQE4V3S7DYUEI7ZP","short_pith_number":"pith:7NPXTRW7","schema_version":"1.0","canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","source":{"kind":"arxiv","id":"1306.5173","version":2},"attestation_state":"computed","paper":{"title":"On the Hardnesses of Several Quantum Decoding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Chung-Chin Lu, Kao-Yueh Kuo","submitted_at":"2013-06-21T15:32:32Z","abstract_excerpt":"We classify the time complexities of three important decoding problems for quantum stabilizer codes. First, regardless of the channel model, quantum bounded distance decoding is shown to be NP-hard, like what Berlekamp, McEliece and Tilborg did for classical binary linear codes in 1978. Then over the depolarizing channel, the decoding problems for finding a most likely error and for minimizing the decoding error probability are also shown to be NP-hard. Our results indicate that finding a polynomial-time decoding algorithm for general stabilizer codes may be impossible, but this, on the other "},"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":"1306.5173","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-06-21T15:32:32Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"51f95b5f352f5460288b05189b6bb60fa64d291fa2ae9b5029892132a198d79f","abstract_canon_sha256":"82f0d0bc343b50913021d9213e0da23393fb3cb49e949efc138f64c954835b7f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:42.025374Z","signature_b64":"Svv+qczU85JhTUQgcK1QqiIEqmoCowF0+34pKGkCSkRmznaKu9lOvFyQtKs3qAFU66rfBY8YTOZFUiGn4k2FDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb5f79c6df5c610272bb97c78a111fcbfcec1785116fb5297867acd881eb7128","last_reissued_at":"2026-05-18T03:18:42.024603Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:42.024603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Hardnesses of Several Quantum Decoding Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Chung-Chin Lu, Kao-Yueh Kuo","submitted_at":"2013-06-21T15:32:32Z","abstract_excerpt":"We classify the time complexities of three important decoding problems for quantum stabilizer codes. First, regardless of the channel model, quantum bounded distance decoding is shown to be NP-hard, like what Berlekamp, McEliece and Tilborg did for classical binary linear codes in 1978. Then over the depolarizing channel, the decoding problems for finding a most likely error and for minimizing the decoding error probability are also shown to be NP-hard. Our results indicate that finding a polynomial-time decoding algorithm for general stabilizer codes may be impossible, but this, on the other "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5173","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":""},"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":"1306.5173","created_at":"2026-05-18T03:18:42.024734+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5173v2","created_at":"2026-05-18T03:18:42.024734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5173","created_at":"2026-05-18T03:18:42.024734+00:00"},{"alias_kind":"pith_short_12","alias_value":"7NPXTRW7LRQQ","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7NPXTRW7LRQQE4V3","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7NPXTRW7","created_at":"2026-05-18T12:27:36.564083+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/7NPXTRW7LRQQE4V3S7DYUEI7ZP","json":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP.json","graph_json":"https://pith.science/api/pith-number/7NPXTRW7LRQQE4V3S7DYUEI7ZP/graph.json","events_json":"https://pith.science/api/pith-number/7NPXTRW7LRQQE4V3S7DYUEI7ZP/events.json","paper":"https://pith.science/paper/7NPXTRW7"},"agent_actions":{"view_html":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP","download_json":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP.json","view_paper":"https://pith.science/paper/7NPXTRW7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5173&json=true","fetch_graph":"https://pith.science/api/pith-number/7NPXTRW7LRQQE4V3S7DYUEI7ZP/graph.json","fetch_events":"https://pith.science/api/pith-number/7NPXTRW7LRQQE4V3S7DYUEI7ZP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/action/storage_attestation","attest_author":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/action/author_attestation","sign_citation":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/action/citation_signature","submit_replication":"https://pith.science/pith/7NPXTRW7LRQQE4V3S7DYUEI7ZP/action/replication_record"}},"created_at":"2026-05-18T03:18:42.024734+00:00","updated_at":"2026-05-18T03:18:42.024734+00:00"}