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...
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 theory fundamentally forbids the perfect copying of an arbitrary unknown quantum state, according to a principle known as the no-cloning theorem. Nevertheless, it is possible to construct a deterministic quantum map that produces multiple approximate copies of an unknown quantum state. This task is referred to as universal quantum cloning, further facilitating numerous quantum technologies such as quantum cryptography and quantum communication. In this work, we theoretically verify that the universal quantum cloning cannot be realized within a noncontextual theory, highlighting its intrinsically nonclassical nature. Our verification first {focuses on revealing that} 1→2 cloning scenario {is fully contextual}, and {further covers general examples to observe the contextual behavior of} N→M scenario. We believe that our results regarding quantum cloning serve a key role for understanding both quantum foundation and application.
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.
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.
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.