Scholarlink

<p>Quantum relative entropy serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science. Despite its importance, efficiently estimating quantum relative entropy between two quantum states on quantum computers remains a significant challenge. In this work, we propose a quantum algorithm for directly estimating quantum relative entropy and Petz Rényi divergence from two unknown quantum states on quantum computers. The circuit size of our algorithm is at most 2<i>n</i>&#xa0;+&#xa0;1 with <i>n</i> being the number of qubits in the quantum states and it is directly applicable to distributed scenarios, where quantum states to be compared are hosted on cross-platform devices. We validate the effectiveness of our method through numerical experiments and observe the absence of the barren plateau phenomenon. As an application, we employ our algorithm to investigate the superadditivity of quantum channel capacity. Numerical simulations reveal new examples of qubit channels exhibiting strict superadditivity of coherent information, highlighting the potential of quantum machine learning to address quantum-native problems.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Estimating quantum relative entropies on quantum computers

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月6日

查看全文
  • Yuchen Lu,
  • Kun Fang

摘要

Quantum relative entropy serves as a fundamental measure of the distinguishability between quantum states and plays a pivotal role in quantum information science. Despite its importance, efficiently estimating quantum relative entropy between two quantum states on quantum computers remains a significant challenge. In this work, we propose a quantum algorithm for directly estimating quantum relative entropy and Petz Rényi divergence from two unknown quantum states on quantum computers. The circuit size of our algorithm is at most 2n + 1 with n being the number of qubits in the quantum states and it is directly applicable to distributed scenarios, where quantum states to be compared are hosted on cross-platform devices. We validate the effectiveness of our method through numerical experiments and observe the absence of the barren plateau phenomenon. As an application, we employ our algorithm to investigate the superadditivity of quantum channel capacity. Numerical simulations reveal new examples of qubit channels exhibiting strict superadditivity of coherent information, highlighting the potential of quantum machine learning to address quantum-native problems.