Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal cloning of mixed states

Published 27 Aug 2026 in quant-ph | (2608.27298v1)

Abstract: We consider the problem of approximate cloning of quantum states: given nn copies of an unknown state ρC<sup>d</sup>×dρ\in \mathbb{C}<sup>{d</sup> \times d}, prepare an (n+k)(n+k)-copy state with high fidelity to ρ<sup></sup>(n+k)ρ<sup>{\otimes</sup> (n+k)}. Werner's pure state cloner is the optimal channel for the pure state case, and shows that n=Θ(kd/ε)n = Θ(kd/\varepsilon) copies are necessary and sufficient to clone kk additional copies of an unknown pure state to fidelity 1ε1-\varepsilon. The random purification channel gives a straightforward extension of Werner's cloner to mixed state inputs: given nn copies of a mixed state, randomly purify your input, apply Werner's channel in the larger Hilbert space, and then trace out the auxiliary registers. This gives a mixed state cloner using n=O(krd/ε)n = O(krd/\varepsilon) copies to clone rank-rr states. Can one do any better? We show that the answer is no: one must use n=Ω(krd/ε)n = Ω(krd/\varepsilon) copies. We prove our lower bound by studying the special case of projector cloning, in which the input state ρρ is promised to be of the form P/rP/r, where PP is a rank-rr orthogonal projector. As a further application of our techniques, we consider the closely related problem of approximate transposition of quantum states, where one seeks to convert ρ<sup></sup>nρ<sup>{\otimes</sup> n} to a kk-copy state with high fidelity to (ρ<sup>T)<sup></sup></sup>k(ρ<sup>T)<sup>{\otimes</sup></sup> k}. Here, we again show n=Θ(krd/ε)n = Θ(krd/\varepsilon) copies are necessary and sufficient for this task.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 2 tweets with 4 likes about this paper.