arXiv:2609.28241
Beyond Maximal Entanglement: Exact Resources for Multiparty Encrypted Quantum Cloning
Pritam Roy, Shashank Gupta
Abstract
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.
AI Summary
The paper asks which pure multipartite resources support exact encrypted quantum cloning: an unknown $k$-qubit input is recoverable from any one of $m$ disjoint $k$-qubit signals together with a common quantum key, while each signal individually conceals the input. It fixes a sector-wise encoder built from two global Pauli rotations, leaves the key untouched, and allows arbitrary CPTP decoders. For $m\ge2$, it gives a necessary-and-sufficient condition on the resource’s signal marginal. Even $m$ requires $\rho_S=I/2^{mk}$, hence maximal signal–key entanglement. For odd $m$, nonmaximal entanglement is allowed precisely when $\rho_S$ lies in the commuting algebra generated by complete-sector operators $R^{\otimes m}$, where $R$ is the Pauli axis complementary to the encoding axes. The proof combines exact recovery–decoupling equivalence with Clifford Pauli propagation and a no-cancellation argument. For arbitrary unitary encoders on input and signals, exact recovery from every authorized subsystem implies individually maximally mixed signals, at least $(m-1)k$ ebits of resource entanglement, and signal-marginal eigenvalue multiplicities divisible by $2^{(m-1)k}$. For graph resources, validity becomes a binary cut-kernel inclusion test; stabilizer cleaning constructs Clifford decoders. A three-signal, single-input-qubit example achieves the two-ebit lower bound. The entire Dicke family, including $W$ states, is excluded for the fixed encoder. The classification is encoder-specific. General-encoder entropy and spectral constraints are only necessary; graph-level certification retains an exponential cut search. Concealment is individual, not joint. Mixed resources, approximate recovery, and qudit extensions remain outside the characterization.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 17 pages (double column) + 28 pages (single column), 7 figure; Comments are welcome