{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MLXGO5I2OQYCTPLISXEPEPVALH","short_pith_number":"pith:MLXGO5I2","schema_version":"1.0","canonical_sha256":"62ee67751a743029bd6895c8f23ea059d998444f825448a778407e0c6fc8e3e9","source":{"kind":"arxiv","id":"1903.02537","version":1},"attestation_state":"computed","paper":{"title":"Channel Decoding with Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Toshiaki Koike-Akino, Toshiki Matsumine, Ye Wang","submitted_at":"2019-03-06T18:16:45Z","abstract_excerpt":"Motivated by the recent advancement of quantum processors, we investigate quantum approximate optimization algorithm (QAOA) to employ quasi-maximum-likelihood (ML) decoding of classical channel codes. QAOA is a hybrid quantum-classical variational algorithm, which is advantageous for the near-term noisy intermediate-scale quantum (NISQ) devices, where the fidelity of quantum gates is limited by noise and decoherence. We first describe how to construct Ising Hamiltonian model to realize quasi-ML decoding with QAOA. For level-1 QAOA, we derive the systematic way to generate theoretical expressio"},"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":"1903.02537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-03-06T18:16:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"015474a8e9916ec58eac40b78f13cd7fd3c262e44cbded66cab0841336c5b81c","abstract_canon_sha256":"4937b7db08c7312edcf88489808f3143e702f4861ad664f55b4bba2ffebf2b17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:55.115740Z","signature_b64":"CxB8SFD207QP5E6BzJeNSUFAFh5LR1aF1757eUCsMPKSrVOBOp6c6Ned3IxaY5xWGxP774h+OBCVxTA6I4+pBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ee67751a743029bd6895c8f23ea059d998444f825448a778407e0c6fc8e3e9","last_reissued_at":"2026-05-17T23:51:55.115143Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:55.115143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Channel Decoding with Quantum Approximate Optimization Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Toshiaki Koike-Akino, Toshiki Matsumine, Ye Wang","submitted_at":"2019-03-06T18:16:45Z","abstract_excerpt":"Motivated by the recent advancement of quantum processors, we investigate quantum approximate optimization algorithm (QAOA) to employ quasi-maximum-likelihood (ML) decoding of classical channel codes. QAOA is a hybrid quantum-classical variational algorithm, which is advantageous for the near-term noisy intermediate-scale quantum (NISQ) devices, where the fidelity of quantum gates is limited by noise and decoherence. We first describe how to construct Ising Hamiltonian model to realize quasi-ML decoding with QAOA. For level-1 QAOA, we derive the systematic way to generate theoretical expressio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02537","kind":"arxiv","version":1},"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":"1903.02537","created_at":"2026-05-17T23:51:55.115231+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02537v1","created_at":"2026-05-17T23:51:55.115231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02537","created_at":"2026-05-17T23:51:55.115231+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLXGO5I2OQYC","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLXGO5I2OQYCTPLI","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLXGO5I2","created_at":"2026-05-18T12:33:21.387695+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/MLXGO5I2OQYCTPLISXEPEPVALH","json":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH.json","graph_json":"https://pith.science/api/pith-number/MLXGO5I2OQYCTPLISXEPEPVALH/graph.json","events_json":"https://pith.science/api/pith-number/MLXGO5I2OQYCTPLISXEPEPVALH/events.json","paper":"https://pith.science/paper/MLXGO5I2"},"agent_actions":{"view_html":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH","download_json":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH.json","view_paper":"https://pith.science/paper/MLXGO5I2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02537&json=true","fetch_graph":"https://pith.science/api/pith-number/MLXGO5I2OQYCTPLISXEPEPVALH/graph.json","fetch_events":"https://pith.science/api/pith-number/MLXGO5I2OQYCTPLISXEPEPVALH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH/action/storage_attestation","attest_author":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH/action/author_attestation","sign_citation":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH/action/citation_signature","submit_replication":"https://pith.science/pith/MLXGO5I2OQYCTPLISXEPEPVALH/action/replication_record"}},"created_at":"2026-05-17T23:51:55.115231+00:00","updated_at":"2026-05-17T23:51:55.115231+00:00"}