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.
A geometric Fano--Procrustes framework for purification-based distances and quantum channels analysis
Instituto de Física Enrique Gaviola (IFEG-UNC-CONICET), Universidad Nacional de Córdoba(恩里克·加维亚多物理研究所(IFEG-UNC-CONICET),科尔多瓦国立大学);Universidad Nacional de Córdoba. Facultad de Matemática, Astronomía, Física y Computación(科尔多瓦国立大学。数学、天文学、物理与计算学院)
No-go theorems for quantum resource purification II: new approach and channel theory
最近已经表明,从噪声资源状态到纯资源状态的转换的准确性和效率存在普遍的基本限制(例如,~蒸馏)在任何表现良好的量子资源理论中[Fang/Liu,Phys. Rev. Lett. 125,060405(2020)]。在这里,我们开发了一种新的和强大的方法来分析量子资源纯化的限制,这不仅导致改进的边界,排除了更广泛的噪声状态的精确纯化,并在某些情况下是紧的,但也使我们能够建立一个强大的量子信道(动态)资源不纯化理论。更具体地说,我们采用新的方法来获得通用的边界上的错误和成本的转换通用噪声信道(其中多个实例可以自适应地使用,与状态理论相比),一些单一的资源信道下的任何自由信道到信道映射。我们解决几个案件的实际利益更具体的条款,并讨论了我们的一般结果蒸馏,量子纠错,量子香农理论和量子线路合成的连接和应用。
Error-mitigated quantum metrology via enhanced virtual purification
The Chinese University of Hong Kong(香港中文大学);The Hong Kong Institute of Quantum Information Science and Technology, The Chinese University of Hong Kong(香港量子信息科学与技术研究院,香港中文大学);State Key Laboratory of Quantum Information Technologies and Materials, The Chinese University of Hong Kong(量子信息技术与材料国家重点实验室,香港中文大学);College of Computer and Data Science, Fuzhou University(福州大学计算机与数据科学学院)
Random purification channel for passive Gaussian bosons
Scuola Normale Superiore(高等师范学校);California Institute of Technology(加州理工学院);Inria, Télécom Paris – LTCI, Institut Polytechnique de Paris(法国国家信息与自动化研究所,巴黎电信学院–通信与电子学实验室,巴黎理工学院)
Degradable Quantum Channels Using Pure to Product of Pure States Isometries
我们考虑一个家庭的量子信道的特点是,某些(一般非正交)纯态在通道入口映射到(张量)产品的纯态(PPP,因此“pcubed”)在互补的输出(主输出和“环境”)的通道。Pcubed构造是M. M Wolf和D. Perez-Garcia,[Phys. Rev. A 75,012303(2007)]可用于产生一大类可降解的量子信道;可降解信道之所以令人感兴趣,是因为它们的量子容量很容易计算。几种已知类型的可降解信道是pcubed信道,或子信道(采用信道入口的子空间),或pcubed信道的连续限制。pcubed结构还产生既不可降解也不可抗降解的通道(即,可降解信道的补充);详细研究了这种类型的Qutrit信道的特定示例。确定一个pcubed通道是可降解的还是不可降解的,或者两者都不是,这是非常简单的,因为通道的特征是纯输入和输出状态。共轭可降解立方通道总是可降解的。
Capacity-Achieving Entanglement Purification Protocol for Pauli Dephasing Channel
The Australian National University(澳大利亚国立大学);University of Queensland(昆士兰大学);Commonwealth Scientific and Industrial Research Organisation(联邦科学与工业研究组织);Agency for Science, Technology and Research (A*STAR)(科学技术研究局)
Efficient High-Dimensional Quantum Circuit Synthesis: From Multi-Controlled Gates to Isometries and Quantum Channels
Institute for Advanced Study in Mathematics, Harbin Institute of Technology(哈尔滨工业大学高等研究院);School of Mathematics, Harbin Institute of Technology(哈尔滨工业大学数学学院)
Tsinghua University(清华大学);Freie Universität Berlin(柏林自由大学);Helmholtz-Zentrum Berlin für Materialien und Energie(柏林亥姆霍兹材料与能源中心);University of Oxford(牛津大学)