• DocumentCode
    1241247
  • Title

    Information rates achievable with algebraic codes on quantum discrete memoryless channels

  • Author

    Hamada, Mitsuru

  • Author_Institution
    Tamagawa Univ. Res. Inst., Tokyo
  • Volume
    51
  • Issue
    12
  • fYear
    2005
  • Firstpage
    4263
  • Lastpage
    4277
  • Abstract
    The highest information rate at which quantum error-correction schemes work reliably on a channel is called the quantum capacity. Here this is proven to be lower-bounded by the limit of coherent information maximized over the set of input density operators which are proportional to the projections onto the code spaces of symplectic stabilizer codes. The quantum channels to be considered are those subject to independent errors and modeled as tensor products of copies of a completely positive linear map on a Hilbert space of finite dimension. The codes that are proven to have the desired performance are symplectic stabilizer codes. On the depolarizing channel, the bound proven here is actually the highest possible rate at which symplectic stabilizer codes work reliably
  • Keywords
    algebraic geometric codes; channel capacity; channel coding; discrete systems; error correction codes; memoryless systems; Hilbert space; algebraic code; density operator; depolarizing channel; discrete memoryless channel; error-correction scheme; positive linear map; quantum channel capacity; symplectic stabilizer code; Code standards; Concatenated codes; Conferences; Error correction codes; Information rates; Information theory; Memoryless systems; Quantum computing; Quantum mechanics; Upper bound; Completely positive (CP) linear maps; fidelity; quantum capacity; quantum error-correcting codes; symplectic geometry; the method of types;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2005.860824
  • Filename
    1542417