N. Gisin, S. Massar: "Optimal quantum cloning machines", Phys.Rev.Lett. 79 (1997) 2153--2156 (quant-ph/9705046) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Quantum Information Theory - an Invitation - Werner (2001) (2 citations) (Correct)
....there are no clear cut theorems yet, partly due to the fact that it is less clear what figure of merit best describes the quality of such an estimator. Given a good estimator we can, of course, proceed to good cloning by just repeating the re preparation P as often as desired. The surprise here [8] is that if only a fixed number M of outputs is required, it is possible to get better clones by devices staying entirely in the quantum world than by going via classical estimation. Again, the problem of optimal cloning is fully understood for pure states [9] but work has only just begun to ....
N. Gisin, S. Massar: "Optimal quantum cloning machines", Phys.Rev.Lett. 79 (1997) 2153--2156 (quant-ph/9705046)
Optimal Cloning of Pure States - Werner (1998) (7 citations) (Correct)
....in this way, because the classical measuring result can be copied and used arbitrarily often. More recently, there has been a new twist to this problem coming from the observation that if only a given number of clones is needed, the procedure via a classical intermediate stage is too wasteful [GM] Indeed it has been shown [HB] that there is, in general, a tradeoff between the number of clones and their quality. Clearly, the optimal cloning machine giving a fixed number of copies from a fixed number of identically prepared systems cannot operate via an intermediate classical stage: It has ....
....the cloning device. Its (always finite) dimension will be denoted by d = dimH. Most work so far has been done on the qubit case d = 2. Also fixed will be the number N of input systems and the number M of output systems. The game is played by two physicists called Alice and Clare. If the paradigmatical eavesdropper is Eve, why should the paradigmatical cloner not be Clare ) Alice s first step is to choose a preparation for quantum systems with Hilbert space H, as described by a density matrix oe, say. She then proceeds to run her preparing procedure N times, thus producing a composite ....
[Article contains additional citation context not shown here]
N. Gisin and S. Massar: "Optimal quantum cloning machines", Report quantph /9705046
Linking Classical and Quantum Key Agreement: Is There a.. - Gisin, Renner, Wolf (2001) Self-citation (Gisin) (Correct)
No context found.
N. Gisin and S. Massar, Optimal quantum cloning machines, Phys. Rev. Lett., Vol. 79, pp. 2153-2156, 1997.
Linking Classical and Quantum Key Agreement: Is There "Bound.. - Gisin (2000) Self-citation (Gisin) (Correct)
No context found.
N. Gisin and S. Massar, Optimal quantum cloning machines, Phys. Rev. Lett., Vol. 79, pp. 2153--2156, 1997.
Quantum Information Theory - an Invitation - Werner (2001) (2 citations) (Correct)
No context found.
N. Gisin, S. Massar: "Optimal quantum cloning machines", Phys.Rev.Lett. 79 (1997) 2153--2156 (quant-ph/9705046)
Quantum Kolmogorov Complexity Based on Classical Descriptions - Vitanyi (2001) (1 citation) (Correct)
No context found.
N. Gisin and S. Massar, "Optimal quantum cloning machines," Phys. Rev. Lett., vol. 79, pp. 2153--2156, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC