Realization of a collective decoding of code-word states

1998/01/07 by Masahide Sasaki, Tsuyoshi Sasaki-Usuda, Masayuki Izutsu +1 · 2 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Arithmetic #Code (set theory) #Computer science #Decoding methods #Mathematical economics #Mathematics #Physics #Programming language #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum mechanics #Quantum-Dot Cellular Automata #Realization (probability) #Statistical physics #Statistics #Superadditivity #Word (group theory) #quant-ph

paper · pdf · doi:10.1103/physreva.58.159

6 pages, RevTeX, 4 figures(EPS)

arxiv created 1998/01/07 · openalex publication_date 1998/07/01 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

Abstract

A physical model for the optimum collective decoding that attains the minimum average error probability in distinguishing code-word states is presented. This model is based on a cavity QED technique which is available at present. It will open a possibility for a quantum decoder that realizes the superadditivity in classical capacity of quantum channel which was demonstrated in M. Sasaki, preceeding paper, Phys. Rev. A 58, 146 (1998).

Citations

• Measurement of Conditional Phase Shifts for Quantum Logic
• Quantum detection and estimation theory
• Elementary gates for quantum computation
• Quantum Detection and Estimation Theory

Cited by

• Optimum detection for extracting maximum information from symmetric qubit sets
• Programmable and sequential Gaussian gates in a loop-based single-mode photonic quantum processor