An asymptotic theory of cloning of classical state families
Keiji Matsumoto

TL;DR
This paper develops an asymptotic theory for cloning classical probability distributions, showing that the cloning quality converges to a Gaussian-based measure independent of the original distribution family.
Contribution
It introduces a novel asymptotic framework for classical state cloning using local asymptotic normality, connecting cloning quality to Gaussian distributions.
Findings
Cloning quality converges to N(0,r1)-N(0,1) in the limit
Cloning performance is independent of the original distribution family
Uses local asymptotic normality to simplify the analysis
Abstract
Cloning, or approximate cloning, is one of basic operations in quantum information processing. In this paper, we deal with cloning of classical states, or probability distribution in asymptotic setting. We study the quality of the approximate (n,rn)-clone, with n being very large and r being constant. The result turns out to be \parallel N(0,r1)-N(0,1)\paralell_1, where N({\mu},{\Sigma}) is the Gaussian distribution with mean {\mu} and covariance {\Sigma}. Notablly, this value does not depend on the the family of porbability distributions to be cloned. The key of the argument is use of local asymptotic normality: If the curve {\theta}\rightarrow P_{{\theta}} is sufficiently smooth in {\theta}, then, the behavior of P_{{\theta}'}^{\otimes n} where {\theta}'-{\theta}=o(\surd(1/n)), is approximated by Gaussian shift. Using this, we reduce the general case to Gaussian shift model.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
