In this project, quantum cloning machines are analyzed that take in N quantum systems in the same unknown pure state and output M quantum systems with M > N, such that the output best resembles the ideal, but impossible output of an M-fold tensor product of the pure input state. The proof of Keyl and Werner is reviewed in which a unique optimal solution is constructed, both in the case where the quality of the cloning is determined by the entire output, and in the case where the quality is determined by measurements on a single clone. Furthermore, it is shown that previous work on qubit cloning machines is a special case of the presented optimal solution.
We construct a unique optimal quantum device for turning a finite number of
d-level quantum systems in the same unknown pure state \ensuremath{\sigma} into
M systems of the same kind, in an approximation of the
M-fold tensor product of the state \ensuremath{\sigma}.
We consider quantum devices for turning a finite number N of d-level quantum systems in the same unknown pure state σ into M>N systems of the same kind, in an approximation of the M-fold tensor product of the state σ. In a previous paper it was shown that this problem has a unique optimal solution, when the quality of the output is judged by arbitrary measurements, involving also the correlations between the clones. We show in this paper, that if the quality judgment is based solely on measurements of single output clones, there is again a unique optimal cloning device, which coincides with the one found previously.
We consider the problem of approximate cloning of quantum states: given
n copies of an unknown state
ρ∈Cd×d, prepare an
(n+k)-copy state with high fidelity to
ρ⊗(n+k). Werner's pure state cloner is the optimal channel for the pure state case, and shows that
n=Θ(kd/ε) copies are necessary and sufficient to clone
k additional copies of an unknown pure state to fidelity
1−ε. The random purification channel gives a straightforward extension of Werner's cloner to mixed state inputs: given
n 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/ε) copies to clone rank-
r states. Can one do any better? We show that the answer is no: one must use
n=Ω(krd/ε) 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/r, where
P is a rank-
r 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
ρ⊗n to a
k-copy state with high fidelity to
(ρT)⊗k. Here, we again show
n=Θ(krd/ε) copies are necessary and sufficient for this task.
We study the problem of universal quantum cloning – taking several identical copies of a pure but unknown quantum state and producing further copies. While it is well known that it is impossible to perfectly reproduce the state, how well the copies can be cloned can be quantified using the fidelity. We examine how individual fidelities can be traded against each other, and how different fidelity measures can be incorporated. The broadly applicable formalism into which we transform the cloning problem is described as a series of quadratic constraints which are amenable to mathematical and computational scrutiny. As such, we reproduce all known results on optimal universal cloning, and push the recent results on asymmetric cloning much further, giving new trade-off relations between fidelities for broad classes of optimal cloning machines. We also provide substantial evidence that motivates why other parameter ranges (number of input copies) have not, and will not, yield to similar analysis.
Quantum state cloning is the task of approximately producing additional copies of an unknown quantum state from a finite number of input copies. The optimal cloning fidelity is known exactly for pure states, but no comparable characterization is known for general mixed states. We determine the optimal asymptotic copy complexity for
d-dimensional states of rank at most
r: producing
M additional copies with worst-case fidelity at least
1−ε requires and is achievable with
N=Θ(Mrd/ε) input copies. Remarkably, the lower bound already holds for a family of states with a fixed flat spectrum, while the matching upper bound is achieved by random purification followed by optimal pure-state cloning. For
M=1, we further show that high-fidelity tomography can be coherently converted into cloning with comparable error, revealing an operational origin of the matching cloning and tomography complexities.