Simpler criteria for finite-copy implementability
Develop simpler necessary or sufficient conditions to decide whether a given positive map Λ admits a completely positive N-copy extension Λ_N for some finite N, beyond the eigenvalue-based characterization via the symmetrized Choi operator and the specific sufficient and necessary conditions provided in the paper.
References
The existence of any simpler necessary or sufficient condition for finite-copy implementability remains open.
— Implementing positive maps with multiple copies of an input state
(1808.05788 - Dong et al., 2018) in Conclusion
It remains open whether correlated program memories or more general many-copy post-processing can improve finite-copy trade-offs.
— Exact Virtual Channel Programming with Vanishing Excess Overhead
(2609.01419 - Jing et al., 1 Sep 2026) in Concluding remarks