Optimal Cloning Machine Research Articles

Asymmetric broadcasting of quantum correlations

In this work, we exhaustively investigate $1 \rightarrow 2$ local and nonlocal broadcasting of entanglement as well as correlations beyond entanglement (geometric discord) using asymmetric Pauli cloners with most general two qubit state as the resource. We exemplify asymmetric broadcasting of entanglement using Maximally Entangled Mixed States. We demonstrate the variation of broadcasting range with the amount of entanglement present in the resource state as well as with the asymmetry in the cloner. We show that it is impossible to optimally broadcast geometric discord with the help of these asymmetric Pauli cloning machines. We also study the problem of $1 \rightarrow 3$ broadcasting of entanglement using non-maximally entangled state (NME) as the resource. For this task, we introduce a method we call successive broadcasting which involves application of $1 \rightarrow 2$ optimal cloning machines multiple times. We compare and contrast the performance of this method with the application of direct $1 \rightarrow 3$ optimal cloning machines. We show that $1 \rightarrow 3$ optimal cloner does a better job at broadcasting than the successive application of $1 \rightarrow 2$ cloners and the successive method can be beneficial in the absence of $1 \rightarrow 3$ cloners. We also bring out the fundamental difference between the tasks of cloning and broadcasting in the final part of the manuscript. We create examples to show that there exist local unitaries which can be employed to give a better range for broadcasting. Such unitary operations are not only economical, but also surpass the best possible range obtained using existing cloning machines enabling broadcasting of lesser entangled states. This result opens up a new direction in exploration of methods to facilitate broadcasting which may outperform the standard strategies implemented through cloning transformations.

Optimal universal quantum cloning: asymmetries and fidelity measures

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.

Designing the optimal quantum cloning machine for qubit case

According to the Fiuras?ek's optimal condition, where the average fidelity works as the figure of merit of quantum cloning machines (QCMs), the optimal cloning machine should maximize a convex mixture of the average fidelity. Based on this condition, we shall develop a general protocol of designing optimal QCMs for qubit system. With a series of examples, where the known optimal fidelities introduced in previous works are recovered with present scheme, we show that our protocol represents a general solution for the problem of cloning in qubit case. The unitary transformations for realizing the various kinds of optimal QCMS, are also given in a systematic way.

Cloning of qubits with both the cloned state and the state orthogonal to it as inputs

A universal cloning machine is derived. The machine produces $c$ clones of an unknown qubit from $s$ identical replicas of qubit and $k$ identical replicas of its orthogonal qubit. For the standard cloning machine, i.e., $k=0$, the universal-not machine, $s=0$, and some other cases, the optimum machine is well known. The universal cloning machine derived in this paper gives clones whose fidelity is the same value as that for the optimum machine. In the case of sufficiently large $c$, we show that the clone fidelity generated by the cloning machine from $s\ensuremath{\ne}0$ replicas and $k\ensuremath{\ne}0$ orthogonal replicas is higher than that generated by the optimal cloning machine from $s+k$ replicas in case $s+k\ensuremath{\le}300$.

Teleportation of qubit states through dissipative channels: Conditions for surpassing the no-cloning limit

We investigate quantum teleportation through dissipative channels and calculate teleportation fidelity as a function of damping rates. It is found that the average fidelity of teleportation and the range of states to be teleported depend on the type and rate of the damping in the channel. Using the fully entangled fraction, we derive two bounds on the damping rates of the channels: one is to beat the classical limit and the second is to guarantee the nonexistence of any other copy with better fidelity. The effect of the initially distributed maximally entangled state on the process is presented; the concurrence and the fully entangled fraction of the shared states are discussed. We intend to show that prior information on the dissipative channel and the range of qubit states to be teleported is helpful for the evaluation of the success of teleportation, where success is defined as surpassing the fidelity limit imposed by the fidelity of the 1-to-2 optimal cloning machine for the specific range of qubits.

Security bound of two-basis quantum-key-distribution protocols using qudits

We investigate the security bounds of quantum-cryptographic protocols using $d$-level systems. In particular, we focus on schemes that use two mutually unbiased bases, thus extending the Bennett-Brassard 1984 quantum-key-distribution scheme to higher dimensions. Under the assumption of general coherent attacks, we derive an analytic expression for the ultimate upper security bound of such quantum-cryptography schemes. This bound is well below the predictions of optimal cloning machines. The possibility of extraction of a secret key beyond entanglement distillation is discussed. In the case of qutrits we argue that any eavesdropping strategy is equivalent to a symmetric one. For higher dimensions such an equivalence is generally no longer valid.

QUANTUM FEEDBACK CONTROL USING QUANTUM CLONING AND STATE RECOGNITION

A scheme of quantum feedback control with an optimal cloning machine is proposed. The design of quantum feedback control algorithms is separated into a state recognition strategy, which gives “on-off” signal to the actuator through recognizing some copies from cloning machine, and a feedback (control) strategy through feeding back the another copies of cloning machine. Precise feedback is abandoned and a compromise between information acquisition and measurement disturbance is established. The recognition process involves measurement and is destructive, however, the feedback step without measurement is preserving quantum coherence, so the scheme can perform some quantum control tasks with coherent feedback.

Cloning the entanglement of a pair of quantum bits

It is shown that any quantum operation that perfectly clones the entanglement of all maximally-entangled qubit pairs cannot preserve separability. This ``entanglement no-cloning'' principle naturally suggests that some approximate cloning of entanglement is nevertheless allowed by quantum mechanics. We investigate a separability-preserving optimal cloning machine that duplicates all maximally-entangled states of two qubits, resulting in 0.285 bits of entanglement per clone, while a local cloning machine only yields 0.060 bits of entanglement per clone.