Probabilistically Perfect Cloning of Two Pure States: A Geometric Approach
classification
🪐 quant-ph
cs.ITmath.IT
keywords
cloningstatesclonesdiscriminationformulationgeometricknownperfect
read the original abstract
We solve the long-standing problem of making n perfect clones from m copies of one of two known pure states with minimum failure probability in the general case where the known states have arbitrary a priori probabilities. The solution emerges from a geometric formulation of the problem. This formulation also reveals a deeper connection between cloning and state discrimination. The convergence of cloning to state discrimination as the number of clones goes to infinity exhibits a phenomenon analogous to a second order symmetry breaking phase transition.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.