{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ILLQQUIQQA77F3UTE5LJRGY444","short_pith_number":"pith:ILLQQUIQ","schema_version":"1.0","canonical_sha256":"42d7085110803ff2ee932756989b1ce73339acad2453a933922c785f481b8355","source":{"kind":"arxiv","id":"1405.7479","version":2},"attestation_state":"computed","paper":{"title":"A quantum algorithm for Viterbi decoding of classical convolutional codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David A. Meyer, Jon R. Grice","submitted_at":"2014-05-29T07:09:57Z","abstract_excerpt":"We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper the proposed algorithm is applied to decoding classical convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$. Other applications of the classical Viterbi algorithm where $Q$ is large (e.g. speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm. The tensor-pr"},"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":"1405.7479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-29T07:09:57Z","cross_cats_sorted":[],"title_canon_sha256":"4cc8dcd4cdbb10317c2132cde12a90ddcf69201de2a6fc39cbc81322b97995f1","abstract_canon_sha256":"2f739025ac7e7df2e6eeeb5e809ebf347257811c1867c49e6c2b2dfd1d6c1f9f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:58.110024Z","signature_b64":"X/8R1qDh/XJGTjacjNAShjgSIoWk8CzblaOfx49gvorSnEIL/GRbGAvYbcQhgF2wLEKg/mqms2RalT/EDKlIDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42d7085110803ff2ee932756989b1ce73339acad2453a933922c785f481b8355","last_reissued_at":"2026-05-18T01:41:58.109494Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:58.109494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum algorithm for Viterbi decoding of classical convolutional codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"David A. Meyer, Jon R. Grice","submitted_at":"2014-05-29T07:09:57Z","abstract_excerpt":"We present a quantum Viterbi algorithm (QVA) with better than classical performance under certain conditions. In this paper the proposed algorithm is applied to decoding classical convolutional codes, for instance; large constraint length $Q$ and short decode frames $N$. Other applications of the classical Viterbi algorithm where $Q$ is large (e.g. speech processing) could experience significant speedup with the QVA. The QVA exploits the fact that the decoding trellis is similar to the butterfly diagram of the fast Fourier transform, with its corresponding fast quantum algorithm. The tensor-pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.7479","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":"1405.7479","created_at":"2026-05-18T01:41:58.109589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.7479v2","created_at":"2026-05-18T01:41:58.109589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.7479","created_at":"2026-05-18T01:41:58.109589+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILLQQUIQQA77","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILLQQUIQQA77F3UT","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILLQQUIQ","created_at":"2026-05-18T12:28:33.132498+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/ILLQQUIQQA77F3UTE5LJRGY444","json":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444.json","graph_json":"https://pith.science/api/pith-number/ILLQQUIQQA77F3UTE5LJRGY444/graph.json","events_json":"https://pith.science/api/pith-number/ILLQQUIQQA77F3UTE5LJRGY444/events.json","paper":"https://pith.science/paper/ILLQQUIQ"},"agent_actions":{"view_html":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444","download_json":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444.json","view_paper":"https://pith.science/paper/ILLQQUIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.7479&json=true","fetch_graph":"https://pith.science/api/pith-number/ILLQQUIQQA77F3UTE5LJRGY444/graph.json","fetch_events":"https://pith.science/api/pith-number/ILLQQUIQQA77F3UTE5LJRGY444/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444/action/storage_attestation","attest_author":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444/action/author_attestation","sign_citation":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444/action/citation_signature","submit_replication":"https://pith.science/pith/ILLQQUIQQA77F3UTE5LJRGY444/action/replication_record"}},"created_at":"2026-05-18T01:41:58.109589+00:00","updated_at":"2026-05-18T01:41:58.109589+00:00"}