We give a definition of an asymmetric universal entangling machine which entangles a system in an unknown state to a specially prepared ancilla. The machine produces a fixed state-independent amount of entanglement in exchange for a fixed degradation of the system state fidelity. We describe explicitly such a machine for any quantum system having d levels and prove its optimality. We show that a d 2-dimensional ancilla is sufficient for reaching optimality. The introduced machine is a generalization to a number of widely investigated universal quantum devices such as the symmetric and asymmetric quantum cloners, the symmetric and antisymmetric quantum entanglers, the quantum information distributor and the universal-NOT gate.
We analyze various scenarios for entangling two initially unentangled qubits. In particular, we propose an optimal universal entangler that entangles a qubit in unknown state $|\ensuremath{\Psi}〉$ with a qubit in a reference (known) state
∣0〉. That is, our entangler generates the output state that is as close as possible to the pure (symmetrized) state $(|\ensuremath{\Psi}〉|0〉+|0〉|\ensuremath{\Psi}〉).$ The most attractive feature of this entangling machine, is that the fidelity of its performance (i.e., the distance between the output and the ideally entangled---symmetrized state) does not depend on the input and takes the constant value $\mathcal{F}=(9+3\sqrt{2})/14\ensuremath{\simeq}0.946.$ We also analyze how to optimally generate from a single qubit initially prepared in an unknown state $|\ensuremath{\Psi}〉$ a two qubit entangled system, which is as close as possible to a Bell state $(|\ensuremath{\Psi}〉|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉+|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉|\ensuremath{\Psi}〉),$ where $〈\ensuremath{\Psi}|{\ensuremath{\Psi}}^{\ensuremath{\perp}}〉=0.$
It is not possible to disentangle a qubit in an unknown state $|\ensuremath{\psi}〉$ from a set of $N\ensuremath{-}1$ ancilla qubits prepared in a specific reference state
∣0〉. That is, it is not possible to perfectly perform the transformation $(|\ensuremath{\psi},0,\dots{},0〉+|0,\ensuremath{\psi},\dots{},0〉+\ensuremath{\cdot}\ensuremath{\cdot}\ensuremath{\cdot}+|0,0,\dots{},\ensuremath{\psi}〉)\ensuremath{\rightarrow}|0,\dots{},0〉\ensuremath{\bigotimes}|\ensuremath{\psi}〉.$ The question is then how well we can do? We consider a number of different methods of extracting an unknown state from an entangled state formed from that qubit and a set of ancilla qubits in a known state. Measuring the whole system is, as expected, the least effective method. We present various quantum ``devices'' which disentangle the unknown qubit from the set of ancilla qubits. In particular, we present the optimal universal disentangler which disentangles the unknown qubit with a fidelity that does not depend on the state of the qubit, and a probabilistic disentangler which performs the perfect disentangling transformation, but with a probability less than 1.
The possibility of cloning a
d-dimensional quantum system without an ancilla is explored, extending on the economical phase-covariant cloning machine for qubits found in Phys. Rev. A 60, 2764 (1999). We prove the impossibility of constructing an economical version of the optimal universal $1\ensuremath{\rightarrow}2$ cloning machine in any dimension. We also show, using an ansatz on the generic form of cloning machines, that the
d-dimensional $1\ensuremath{\rightarrow}2$ phase-covariant cloner, which optimally clones all balanced superpositions with arbitrary phases, can be realized economically only in dimension
d=2. The used ansatz is supported by numerical evidence up to
d=7. An economical phase-covariant cloner can nevertheless be constructed for
d>2, albeit with a slightly lower fidelity than that of the optimal cloner requiring an ancilla. Finally, using again an ansatz on cloning machines, we show that an economical version of the $1\ensuremath{\rightarrow}2$ Fourier-covariant cloner, which optimally clones the computational basis and its Fourier transform, is also possible only in dimension
d=2.