2000 character limit reached
Probabilistically Perfect Cloning of Two Pure States: A Geometric Approach
Published 26 May 2015 in quant-ph, cs.IT, and math.IT | (1505.06979v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.