Related papers: Achievable efficiencies for probabilistically clon…

Quantum cloning of two identical mixed qubits $\rho \otimes \rho $ is studied. We propose the quantum cloning transformations not only for the triplet (symmetric) states but also for the singlet (antisymmetric) state. We can copy these two…

We investigate the optimal distribution of quantum information over multipartite systems in asymmetric settings. We introduce cloning transformations that take $N$ identical replicas of a pure state in any dimension as input, and yield a…

Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation…

We derive the transformation for the optimal universal quantum anti-cloner which produces two anti-parallel outputs for a single input state. The fidelity is shown to be 2/3 which is same as the measurement fidelity. We consider a…

Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…

Quantum computing promises the ability to compute properties of quantum systems exponentially faster than classical computers. Quantum advantage is achieved when a practical problem is solved more efficiently on a quantum computer than on a…

Quantum computers are now on the brink of outperforming their classical counterparts. One way to demonstrate the advantage of quantum computation is through quantum random sampling performed on quantum computing devices. However, existing…

We show that the distribution of information at the output of the quantum cloner can be efficiently controlled via preparation of the quantum cloner. We present a universal cloning network with the help of which asymmetric cloning can be…

Recently Galv\~{a}o and Hardy have shown that quantum cloning can improve the performance of some quantum computation tasks. However such performance enhancement is possible only if quantum correlations survive the cloning process. We…

We realize the probabilistic cloning and identifying linear independent quantum states of multi-particles system, given prior probability, with universal quantum logic gates using the method of unitary representation. Our result is…

We investigate probabilistic transformations of quantum states from a `source' set to a `target' set of states. Such transforms have many applications. They can be used for tasks which include state-dependent cloning or quantum state…

We, in this paper, analyze the efficacy of an output as a resource from a universal quantum cloning machine in information processing tasks such as teleportation and dense coding. For this, we have considered the $3\otimes 3$ dimensional…

It has been recently shown that probabilistic protocols based on postselection boost the performances of phase estimation and the replication of quantum clocks. Here we demonstrate that the improvements in these two tasks have to match…

Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum…

We investigate the performances of a selective cloning machine based on linear optical elements and Gaussian measurements, which allows to clone at will one of the two incoming input states. This machine is a complete generalization of a 1…

Probabilistically creating n perfect clones from m copies for one of N priori known quantum states with minimum failure probability is a long-standing problem. We provide a rigorous proof for the geometric approach to this probabilistic…

Quantum computing is presently undergoing rapid development to achieve a significant speedup promised in certain applications. Nonetheless, scaling quantum computers remains a formidable engineering challenge, prompting exploration of…

In classical computation, a problem can be solved in multiple steps where calculated results of each step can be copied and used repeatedly. While in quantum computation, it is difficult to realize a similar multi-step computation process…

We have found a quantum cloning machine that optimally duplicates the entanglement of a pair of $d$-dimensional quantum systems. It maximizes the entanglement of formation contained in the two copies of any maximally-entangled input state,…

A quantum telecloning process combining quantum teleportation and optimal quantum cloning from one input to M outputs is presented. The scheme relies on the establishment of particular multiparticle entangled states, which function as…