arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2611.04573quant-ph
收藏

等距变换与量子信道的随机纯化

On Random Purifications of Isometries and Channels

Princeton University(普林斯顿大学)

Eli Goldin

AI总结:

本文研究等距变换与量子信道的随机纯化,给出高效模拟器并证明其误差界,构造反例排除随机信道扩张的高效模拟,还改进了量子开关相关结果并推广了受控访问去控制的结论。

摘要:

Acorn技巧可将弱量子资源转化为更强的“随机化”资源,近期的一个例子是随机纯化信道,它能将t个混合态拷贝转化为t个随机纯化拷贝。本文探究类似技术能否将对等距变换的查询转化为对随机酉完备化的查询,或将对量子信道的查询转化为对随机等距扩张的查询。对于从N维到M维的等距变换,本文给出了一个高效的有状态模拟器,用于模拟对固定Haar随机酉完备化的T次顺序前向查询,该模拟器每次模拟调用最多使用1次前向等距变换查询,总迹距离误差为O(T√(N/(M-T)))。这一结果将等距变换查询下界提升至任意酉完备化,将拷贝复杂度下界提升至对态制备酉的前向访问,且该维度相关损失对多数应用可任意小。反之,本文构造了两种量子信道分布,它们可通过对任意扩张的两次查询精确区分,但对非可忽略优势而言需要指数级多的信道查询,这排除了随机信道扩张的高效模拟。本文技术还表明,将量子开关近似到低于1/2的任意恒定误差需要指数级多的信道查询,即使是相同信道也如此,这为不定因果顺序提供了指数级查询优势,并改进了Bavaresco等人(2025)的结果。最后,本文展示了如何“去控制”对等距变换的受控前向访问:任何对随机相位φ的φV进行受控查询的算法,都可转化为使用相同数量对V的非受控前向查询的算法,推广了酉的类似结果。

英文摘要:

Acorn tricks turn weak quantum resources into stronger "randomized" ones. A recent example is the random purification channel, which turns $t$ copies of a mixed state into $t$ copies of a random purification. We ask whether analogous techniques can turn queries to an isometry into queries to a random unitary completion, or queries to a quantum channel into queries to a random isometry dilation. For an isometry from dimension $N$ to dimension $M$, we give an efficient, stateful simulator for $T$ sequential, forward queries to a fixed Haar random unitary completion. It uses at most one forward isometry query per simulated call, with total trace-distance error $O(T\sqrt{N/(M-T)})$. This lifts isometry query lower bounds to arbitrary unitary completions, and copy complexity lower bounds to forward access to state preparation unitaries, with dimension-dependent loss that can be made arbitrarily small for most applications. Conversely, we construct two distributions on quantum channels distinguishable exactly with two queries to an arbitrary dilation, but requiring exponentially many channel queries for nonnegligible advantage. This rules out efficient simulation of random channel dilations. Our technique also shows that approximating the quantum switch to any constant error below $1/2$ requires exponentially many channel queries, even for identical channels, giving an exponential query advantage for indefinite causal order and improving on Bavaresco et al. (2025). Finally, we show how to "decontrol" controlled forward access to an isometry: any algorithm making controlled queries to $ϕV$ for a random phase $ϕ$ can be transformed into one using the same number of uncontrolled forward queries to $V$, generalizing the analogous result for unitaries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑