Encrypted Quantum Cloning Beyond Maximal Entanglement: Exact Classification of Multipartite Resources
Encrypted quantum cloning distributes an unknown $k$-qubit state among $m$ individually concealed signals, each permitting exact recovery when combined with a common quantum key. While canonical constructions rely on maximally entangled resources, they do not establish which multipartite states are necessary or sufficient for this task. Here we derive necessary and sufficient conditions characterizing all pure resources compatible with a prescribed sector-wise two-Pauli encoder for $m\geq 2$, with necessity holding for arbitrary completely positive trace-preserving recovery maps. The classification reveals a sharp parity dependence: even $m$ requires maximal signal--key entanglement, whereas odd $m$ admits nonmaximally entangled resources when their residual signal correlations belong to an encoder-selected commuting algebra. Beyond this architecture, we show that exact recovery from every authorized subsystem under arbitrary unitary encoders acting on the input and signals while leaving the key untouched necessarily implies perfect individual concealment, requires at least $(m-1)k$ ebits of signal--key entanglement, and imposes spectral constraints on the resource. For graph states, the classification reduces to an exact cut-kernel criterion, enabling binary certification and constructive Clifford recovery. In particular, a rank-deficient three-output resource in the YZ/ZY branch attains the general entanglement lower bound with two ebits rather than three. We also exclude the entire Dicke family, including $W$ states, within the two-Pauli architecture. Together, these results distinguish fundamental entanglement requirements from encoder-dependent correlation constraints, providing an exact characterization of resource admissibility and a constructive recovery framework for graph states.