We find that very different quantum copying machines are optimal depending on the indicator used to assess their performance. Several quantum copying machine models acting on nonorthogonal input states are investigated, and assessed according to two types of criteria: transfer of (Shannon) information encoded in the initial states to the copies, and fidelity between the copies and the initial states. Transformations that optimize information transfer for messages encoded in qubits are found for three situations: (1) when the message is decoded one state at a time; (2) with simple schemes that allow the message to be encoded using block-coding schemes; and (3) when the copier produces independent copies. If the message is decoded one symbol at a time, information is best copied by a Wootters-Zurek copier.
We find that very different quantum copying machines are optimal depending on the indicator used to assess their performance. Several quantum copying machine models acting on nonorthogonal input states are investigated, and assessed according to two types of criteria: transfer of (Shannon) information encoded in the initial states to the copies, and fidelity between the copies and the initial states. Transformations that optimize information transfer for messages encoded in qubits are found for three situations: (1) when the message is decoded one state at a time; (2) with simple schemes that allow the message to be encoded using block-coding schemes; and (3) when the copier produces independent copies. If the message is decoded one symbol at a time, information is best copied by a Wootters-Zurek copier.
Summary form only given. Copying machines in general use two approaches. One of the extreme cases is a classical copying machine, where measurements (destructive or non-destructive) are made on the original state, the results of which are then fed as parameters into some state preparation scheme which attempts to construct a copy of the original. The opposite extreme is a fully quantum copying machine which by some process that is unseen by external observers, creates a fixed number of copies, usually destroying the original in the process. Naturally in a realistic situation, noise will additionally degrade the quality of the copies, and copiers which utilise both of the processes above are obviously also possible. While quantum copying promises the possibility of many applications in the future, few specific examples of uses for a quantum copier have been considered so far. When discussing practical applications, quantum copiers have mainly been put forward as something to be defended against by quantum cryptography schemes. This talk presents a analysis of a possible application of quantum copiers: using them to improve detection efficiencies.
We analyze how information encoded in quantum systems can be optimally processed. In particular, we investigate copying (cloning) of quantum information (represented as states of 2-level quantum systems--qubits). We present unitary transformations which describe the optimal universal cloning of a qubit. Universality of the transformation guarantees that the fidelity of the cloning does not depend on the input state of the qubit, i.e. all states are cloned equally well. We present network for the optimal universal quantum cloning `machine' (transformation) which produces N + 1 copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copes, N. We also present the `machine' which universally and optimally clones states of quantum objects in arbitrary- dimensional Hilbert spaces. In particular, we discuss universal cloning of quantum registers. In addition to cloning of qubits we analyzed another universal operation-- the Universal NOT. We present the optimal transformation and the corresponding logical network which optimally complements an arbitrary input state of a qubit. We show that the fidelity of the performance of the Universal NOT operation increases as a function of the number of input qubits prepared in the same state.
Copying an unknown quantum state into many approximate copies is known to become equivalent to estimating it and re-preparing: the best measure-and-prepare copier approaches the best quantum copier as the number of copies grows. We determine how fast. For equatorial qubit states, one input copy and m output copies, judged by the global fidelity, we prove F_EB/F_coh = 1 − 1/√(2m) + O(1/m). For phase states on d levels we prove, with explicit constants, the law 1 − F_EB/F_coh = (d − 1)/√(2m) + O(1/m), confirmed by exact computations up to m = 400; for qubits with T input copies the gap is √2·σ_T/√m, proved with explicit constants for T = 2, 3 (the upper bound conditionally on the optimality of the flat seed, R0(T); the lower bound unconditionally). The measure-and-prepare copier's deficit is the ground-state energy of a harmonic oscillator, one quantum per unknown phase. The exact quantum fidelity has plateaus at m = kd and kd + 1 (m = kd + 1 is the economical point). Numerical results suggest a period-d modulation of the ratio at order 1/m; a proof of its next-order coefficient remains open. This complements the known universality of the cloning fidelity itself, which depends only on the number of free parameters: within the phase-state family, the leading gap coefficient counts the independent phase directions. The classical values rest on the flat-seed theorem of the companion Paper 5, and the several-copy quantum values on the reduced coherent dual of the companion Paper 5. Core lemmas of the qubit proof and its explicit upper-bound constants are machine-checked in Lean 4; the remaining steps are proved on paper and independently refereed.
A quantum copying machine producing two (in general nonidentical) copies of an arbitrary input state of a two-dimensional Hilbert space (quantum bit) is studied using a quality measure based on distinguishability of states, rather than fidelity. The problem of producing optimal copies is investigated with the help of a Bloch sphere representation, and shown to have a well-defined solution, including cases in which the two copies have an unequal quality, or the quality depends upon the input state (is ``anisotropic'' in Bloch sphere language), or both. A simple quantum circuit yields the optimal copying machine. With a suitable choice of parameters it becomes an optimal eavesdropping machine for some versions of quantum cryptography, or reproduces the Bu\ifmmode \check{z}\else \v{z}\fi{}ek and Hillery result for isotropic copies.
Perfect cloning of an unknown quantum state is impossible. Approximate cloning, which is optimal in various senses, has been found in many cases. Paradigmatic examples are Wootters-Zurek cloning and universal cloning. These cloning machines aim at optimal cloning of the full quantum states. However, in practice, what is important and relevant may only involve partial information in quantum states, rather than quantum states themselves. For example, signals are often encoded as parameters in quantum states, whose information content is well synthesized by quantum Fisher information. This raises the basic issue of evaluating the information transferring capability (e.g., distributing quantum Fisher information) of quantum cloning. We assess and compare Wootters-Zurek cloning and universal cloning from this perspective and show that, on average, Wootters-Zurek cloning performs better than universal cloning for the phase (as well as amplitude) parameter, although they are incomparable individually, and universal cloning has many advantages over Wootters-Zurek cloning in other contexts. Physical insights and related issues are further discussed.
An unknown quantum state cannot be copied and broadcast freely due to the no-cloning theorem. Approximate cloning schemes have been proposed to achieve the optimal cloning characterized by the maximal fidelity between the original and its copies. Here, from the perspective of quantum Fisher information (QFI), we investigate the distribution of QFI in asymmetric cloning machines which produce two nonidentical copies. As one might expect, improving the QFI of one copy results in decreasing the QFI of the other copy. It is perhaps also unsurprising that asymmetric phase-covariant cloning outperforms universal cloning in distributing QFI since a priori information of the input state has been utilized. However, interesting results appear when we compare the distributabilities of fidelity (which quantifies the full information of quantum states), and QFI (which only captures the information of relevant parameters) in asymmetric cloning machines. Unlike the results of fidelity, where the distributability of symmetric cloning is always optimal for any d-dimensional cloning, we find that any asymmetric cloning outperforms symmetric cloning on the distribution of QFI for d ≤ 18, whereas some but not all asymmetric cloning strategies could be worse than symmetric ones when d > 18.