IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4615-5923-8_7.html
   My bibliography  Save this book chapter

Relation between Channel Capacity and Quantum Minimax Decision in Quantum Information Theory

In: Quantum Communication, Computing, and Measurement

Author

Listed:
  • Kentaro Kato

    (Tamagawa University, Research Center for Quantum Communications)

  • Masao Osaki

    (Tamagawa University, Research Center for Quantum Communications)

  • Tomohiro Suzuki

    (Tamagawa University, Research Center for Quantum Communications)

  • Masashi Ban

    (Hitachi, Ltd., Advanced Research Laboratory)

  • Osamu Hirota

    (Tamagawa University, Research Center for Quantum Communications)

Abstract

Derivation of the optimum detection operators for the mutual information is one of the most important topics to establish the quantum information theory. For information-optimum detection, Holevo has shown a necessary condition of the information-optimum detection operators [1]. However, the explicit representation of the information-optimum detection operators has not been given except for a few cases [24]. So far there were researches about the upper or lower bound of the accessible information which is the optimum (maximum) mutual information for given signal quantum states with coding theory. In the general case, the upper bound is given by Holevo, called “Holevo’s bound” [5] and the lower bound is the “subentropy” defined by Jozsa [6]. In some cases of specified signal quantum states and detection process, Ban and Schumacher showed tighter upper bounds, respectively [7, 8].

Suggested Citation

  • Kentaro Kato & Masao Osaki & Tomohiro Suzuki & Masashi Ban & Osamu Hirota, 1997. "Relation between Channel Capacity and Quantum Minimax Decision in Quantum Information Theory," Springer Books, in: O. Hirota & A. S. Holevo & C. M. Caves (ed.), Quantum Communication, Computing, and Measurement, pages 63-71, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4615-5923-8_7
    DOI: 10.1007/978-1-4615-5923-8_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4615-5923-8_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.