[论文解读] Semidefinite Programming for Quantum Channel Learning

Mikhail Gennadievich Belov, Victor V. Dubov+4 more|arXiv (Cornell University)|Jan 18, 2026

Quantum Information and Cryptography被引用 0

一句话总结

论文表明从经典数据重构量子信道可以表述为凸半正定规划问题，从而能够对多种信道类型进行精确恢复，通常较低的 Kraus 等级就足以描述数据。

ABSTRACT

The problem of reconstructing a quantum channel from a sample of classical data is considered. When the total fidelity can be represented as a ratio of two quadratic forms (e.g., in the case of mapping a mixed state to a pure state, projective operators, unitary learning, and others), Semidefinite Programming (SDP) can be applied to solve the fidelity optimization problem with respect to the Choi matrix. A remarkable feature of SDP is that the optimization is convex, which allows the problem to be efficiently solved by a variety of numerical algorithms. We have tested several commercially available SDP solvers, all of which allowed for the reconstruction of quantum channels of different forms. A notable feature is that the Kraus rank of the obtained quantum channel typically comprises less than a few percent of its maximal possible value. This suggests that a relatively small Kraus rank quantum channel is typically sufficient to describe experimentally observed classical data. The theory was also applied to the problem of reconstructing projective operators from data. Finally, we discuss a classical computational model based on quantum channel transformation, performed and calculated on a classical computer, possibly hardware-optimized.

研究动机与目标

• 将从经典数据学习量子信道作为量子信息与机器学习/人工智能中的一个反问题来动机化。
• 将量子信道重建表述为在 Kraus 算子或 Choi 矩阵上的受约束优化问题。
• Demonstrate that the full-rank quantum channel recovery is a convex SDP problem under a quadratic fidelity form.
• Show practical reconstruction results using SDP solvers across unitary and higher Kraus-rank channels.
• Discuss implications for a density-matrix-network computational model and scalability.

提出的方法

• 用 Kraus 算子 B_s 或 Choi 矩阵 J 表示待学习的量子信道。
• 将保真度表达为映射算子中两个二次形式的比率，以实现 SDP 形式化。
• 在 Kraus 形式下施加 CPTP 约束，或在 Choi 形式下施加线性迹保持/单位矩阵保持的线性约束，得到在满秩时成为 SDP 的 QCQP。
• 将目标改写为最大化 Tr(J S) 且满足 J ⪰ 0 以及由迹保持或单位矩阵保持导出的线性约束。
• 用内点法求解得到的 SDP，并与特征结构基础方法（附录 A）进行比较。
• 可选时使用 Choi 矩阵表示来线性化保真度和约束以便就绪 SDP。

Figure 1: The rank of the Choi matrix $\mathcal{J}$ ( 16 ) (red), obtained as a solution to the optimization problem ( 22 ) for unitary mapping ( 25 ) data, is shown. This plot demonstrates a perfect reconstruction of the unitary operator from the data for the dimension range $1\leq D=n\leq 30$ . We

实验结果

研究问题

• RQ1 是否可以通过 SDP 从经典输入/输出数据中精确重构满秩量子信道？
• RQ2 Kraus 等级如何影响通过 SDP 与非凸方法学习量子信道的难度与成功率？
• RQ3 在基于 SDP 的信道学习中，Kraus 算子参数化与 Choi 矩阵参数化的表现对比如何？
• RQ4 在 SDP 框架内，单位学习在多大程度上可以被视为一个特例？
• RQ5 在现实问题规模下，基于 SDP 的量子信道重建的实际限制与计算资源需求是什么？

主要发现

• 当保真度为二次形式时，量子信道重建可以被视为凸的 SDP，从而实现全局优化。
• SDP 方法可以从信息完备数据中精确重构单位信道，得到秩为一的 Choi 矩阵。
• 即使对于较高 Kraus 等级的信道，基于 SDP 的方法也表现良好，数值实验显示成功恢复。
• 恢复的信道 Kraus 等级通常只是最大可能等级的一小部分，表明观测数据足以支持紧凑表示。
• Choi 矩阵形式导致目标函数和约束线性，且带半正定约束，便于鲁棒优化。
• 密度矩阵网络视角支持将大信道分解为更小、可处理的网络组件。

Figure 2: The rank of the Choi matrix $\mathcal{J}$ ( 16 ) (red) obtained as a solution to the optimization problem for a random $\psi\to\phi$ mapping ( 6 ): (a) The case $1\leq D=n\leq 30$ . The rank grows slowly with the increase of $n$ ; the rank value typically comprises less than 1.5% of the ma