超越最大纠缠：多方加密量子克隆的精确资源
Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning
- S. N. Bose National Centre for Basic Sciences（S.N. 玻色基础科学国家中心）
- Centre for Interdisciplinary Areas in Quantum Computing, Indian Institute of Technology Indore（印度印多尔理工学院量子计算跨学科领域中心）
- Department of Physics, Indian Institute of Technology Indore（印度印多尔理工学院物理系）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
本文研究了多方加密量子克隆的精确资源，完全刻画了扇区式双泡利编码器下的纯态条件，并证明恢复依赖于关联结构而非仅纠缠量。
AI中文摘要：
加密量子克隆将未知的$k$量子比特态分布在$m$个加密克隆中，使得任何单个克隆都无法揭示输入信息，但该态可以从任意一个克隆连同共享的量子密钥一起恢复。我们提出相反的问题：对于固定的编码架构，哪些多体纯态可以作为此任务的精确资源？对于$m\ge2$，我们完全刻画了与扇区式双泡利编码器兼容的纯资源，其必要性对任意完全正迹保持（CPTP）恢复映射均成立。对于偶数$m$，精确恢复要求信号-噪声切割上具有最大纠缠。对于奇数$m$，较少的纠缠可能足够，前提是存活的信号关联具有编码器选择的结构。我们进一步证明，在不固定编码器的情况下，从每个授权子系统的精确恢复已经意味着每个单独信号的完美隐藏，并且要求至少$(m-1)k$个纠缠比特（ebits）的信号-噪声纠缠。对于图态，资源分类简化为信号-噪声切割矩阵核上的精确条件，导致二进制认证和构造性克利福德恢复。我们识别出达到架构无关纠缠界的秩亏图资源，并证明整个Dicke族（包括$W$态）被排除在每个扇区式双泡利编码器之外。我们的结果表明，加密恢复不仅取决于资源包含多少纠缠，还取决于其关联相对于编码器的组织方式。
英文摘要：
Encrypted quantum cloning distributes an unknown $k$-qubit state among $m$ encrypted clones so that no individual clone reveals the input, yet the state can be recovered from any one clone together with a common quantum key. We ask the inverse question: for a fixed encoding architecture, which multipartite pure states can serve as exact resources for this task? For $m\ge2$, we completely characterize the pure resources compatible with a sector-wise two-Pauli encoder, with necessity holding for arbitrary completely positive trace-preserving (CPTP) recovery maps. For even $m$, exact recovery requires maximal entanglement across the signal--noise cut. For odd $m$, less entanglement can suffice, provided that the surviving signal correlations have the structure selected by the encoder. We further show, without fixing the encoder, that exact recovery from every authorized subsystem already implies perfect concealment of each individual signal and requires at least $(m-1)k$ ebits of signal--noise entanglement. For graph states, the resource classification reduces to an exact condition on the kernel of the signal--noise cut matrix, leading to binary certification and constructive Clifford recovery. We identify rank-deficient graph resources that attain the architecture-independent entanglement bound and prove that the entire Dicke family, including $W$ states, is excluded for every sector-wise two-Pauli encoder. Our results show that encrypted recovery depends not only on how much entanglement a resource contains, but also on how its correlations are organized relative to the encoder.
