跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2409.12566 · v4

Quantum Channel Testing in Average-Case Distance

平均情形距离下的量子信道测试

首次提交 2024-09-19 16:39
版本更新 2026-11-14 01:30
雷达观测 2026-11-16 13:44
arXiv ↗PDF ↗

摘要

We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel N:Cdin×din→Cdout×dout\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}}} \to \mathbb C^{d_{\mathrm{out}} \times d_{\mathrm{out}}} in diamond norm distance requires Ω(din/ε)Ω(\sqrt{d_{\mathrm{in}}} / \varepsilon) queries, even in the strongest algorithmic model that admits ancillae, coherence, and adaptivity. This is due to the worst-case nature of the distance induced by the diamond norm. Motivated by this limitation and other theoretical and practical applications, we introduce an average-case analogue of the diamond norm, which we call the average-case imitation diamond (ACID) norm. In the weakest algorithmic model without ancillae, coherence, or adaptivity, we prove that testing identity to certain types of channels in ACID distance can be done with complexity independent of the dimensions of the channel, while for other types of channels the complexity depends on both the input and output dimensions. Building on previous work, we also show that identity to any fixed channel can be tested with O~(dindout3/2/ε2)\tilde O(d_{\mathrm{in}} d_{\mathrm{out}}^{3/2} / \varepsilon^2) queries in ACID distance and O~(din2dout3/2/ε2)\tilde O(d_{\mathrm{in}}^2 d_{\mathrm{out}}^{3/2} / \varepsilon^2) queries in diamond distance in this model. Finally, we prove tight bounds on the complexity of channel tomography in ACID distance.

AI 论文解读

基于摘要 · 非全文审阅

论文研究量子信道性质测试的复杂度,提出平均情形模仿钻石(ACID)范数,并给出恒等测试与信道层析在ACID距离下的查询复杂度上下界。

正在读取账号与研究记录…

版本差异

本站首次收录为 v4,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v4 · 2026-11-14 01:30 · 最新观测版本

Quantum Channel Testing in Average-Case Distance

We study the complexity of testing properties of quantum channels. First, we show that testing identity to any channel N:Cdin×din→Cdout×dout\mathcal N: \mathbb C^{d_{\mathrm{in}} \times d_{\mathrm{in}}} \to \mathbb C^{d_{\mathrm{out}} \times d_{\mathrm{out}}} in diamond norm distance requires Ω(din/ε)Ω(\sqrt{d_{\mathrm{in}}} / \varepsilon) queries, even in the strongest algorithmic model that admits ancillae, coherence, and adaptivity. This is due to the worst-case nature of the distance induced by the diamond norm. Motivated by this limitation and other theoretical and practical applications, we introduce an average-case analogue of the diamond norm, which we call the average-case imitation diamond (ACID) norm. In the weakest algorithmic model without ancillae, coherence, or adaptivity, we prove that testing identity to certain types of channels in ACID distance can be done with complexity independent of the dimensions of the channel, while for other types of channels the complexity depends on both the input and output dimensions. Building on previous work, we also show that identity to any fixed channel can be tested with O~(dindout3/2/ε2)\tilde O(d_{\mathrm{in}} d_{\mathrm{out}}^{3/2} / \varepsilon^2) queries in ACID distance and O~(din2dout3/2/ε2)\tilde O(d_{\mathrm{in}}^2 d_{\mathrm{out}}^{3/2} / \varepsilon^2) queries in diamond distance in this model. Finally, we prove tight bounds on the complexity of channel tomography in ACID distance.

查看此版本解读 →查看此版本原文 ↗