Maximum relative entropy of coherence for quantum channels

被引:0
|
作者
ZhiXiang Jin [1 ,2 ]
LongMei Yang [3 ]
ShaoMing Fei [4 ,2 ]
Xianqing LiJost [2 ]
ZhiXi Wang [4 ]
GuiLu Long [3 ,5 ,6 ,7 ]
CongFeng Qiao [1 ,8 ]
机构
[1] School of Physics, University of Chinese Academy of Sciences
[2] Max-Planck-Institute for Mathematics in the Sciences
[3] State Key Laboratory of Low-Dimensional Quantum Physics and Department of Physics, Tsinghua University
[4] School of Mathematical Sciences, Capital Normal University
[5] Frontier Science Center for Quantum Information
[6] Beijing National Research Center for Information Science and Technology
[7] Beijing Academy of Quantum Information Sciences
[8] CAS Center for Excellence in Particle
关键词
D O I
暂无
中图分类号
O413 [量子论];
学科分类号
摘要
Based on the resource theory for quantifying the coherence of quantum channels, we introduce a new coherence quantifier for quantum channels via maximum relative entropy. We prove that the maximum relative entropy for coherence of quantum channels is directly related to the maximally coherent channels under a particular class of superoperations, which results in an operational interpretation of the maximum relative entropy for coherence of quantum channels. We also introduce the conception of subsuperchannels and sub-superchannel discrimination. For any quantum channels, we show that the advantage of quantum channels in sub-superchannel discrimination can be exactly characterized by the maximum relative entropy of coherence for quantum channels. Similar to the maximum relative entropy of coherence for channels, the robustness of coherence for quantum channels has also been investigated. We show that the maximum relative entropy of coherence for channels provides new operational interpretations of robustness of coherence for quantum channels and illustrates the equivalence of the dephasing-covariant superchannels,incoherent superchannels, and strictly incoherent superchannels in these two operational tasks.
引用
收藏
页码:5 / 10
页数:6
相关论文
共 50 条
  • [1] Maximum relative entropy of coherence for quantum channels
    Zhi-Xiang Jin
    Long-Mei Yang
    Shao-Ming Fei
    Xianqing Li-Jost
    Zhi-Xi Wang
    Gui-Lu Long
    Cong-Feng Qiao
    Science China Physics, Mechanics & Astronomy, 2021, 64
  • [2] Maximum relative entropy of coherence for quantum channels
    Jin, Zhi-Xiang
    Yang, Long-Mei
    Fei, Shao-Ming
    Li-Jost, Xianqing
    Wang, Zhi-Xi
    Long, Gui-Lu
    Qiao, Cong-Feng
    SCIENCE CHINA-PHYSICS MECHANICS & ASTRONOMY, 2021, 64 (08)
  • [3] Maximum relative entropy of coherence for quantum channels
    Zhi-Xiang Jin
    Long-Mei Yang
    Shao-Ming Fei
    Xianqing Li-Jost
    Zhi-Xi Wang
    Gui-Lu Long
    Cong-Feng Qiao
    Science China(Physics,Mechanics & Astronomy), 2021, 64 (08) : 5 - 10
  • [4] Maximum Relative Entropy of Coherence: An Operational Coherence Measure
    Bu, Kaifeng
    Singh, Uttam
    Fei, Shao-Ming
    Pati, Arun Kumar
    Wu, Junde
    PHYSICAL REVIEW LETTERS, 2017, 119 (15)
  • [5] Discriminating quantum channels with relative entropy
    Qin, Tao
    Zhao, Meisheng
    Zhang, Yongde
    MODERN PHYSICS LETTERS B, 2008, 22 (05): : 313 - 322
  • [6] Quantifying coherence of quantum channels based on the generalized α-z-relative Renyi entropy
    Fan, Jiaorui
    Wu, Zhaoqi
    Fei, Shao-Ming
    QUANTUM INFORMATION PROCESSING, 2024, 23 (03)
  • [7] Dynamics of relative entropy of coherence under Markovian channels
    Haozhen Situ
    Xueyuan Hu
    Quantum Information Processing, 2016, 15 : 4649 - 4661
  • [8] Dynamics of relative entropy of coherence under Markovian channels
    Situ, Haozhen
    Hu, Xueyuan
    QUANTUM INFORMATION PROCESSING, 2016, 15 (11) : 4649 - 4661
  • [9] Quantum maximum entropy closure for small flavor coherence
    Froustey, Julien
    Kneller, James P.
    McLaughlin, Gail C.
    PHYSICAL REVIEW D, 2025, 111 (06)
  • [10] Quantum Coherence Quantifiers Based on Renyi α-Relative Entropy
    Shao, Lian-He
    Li, Yong-Ming
    Luo, Yu
    Xi, Zheng-Jun
    COMMUNICATIONS IN THEORETICAL PHYSICS, 2017, 67 (06) : 631 - 636