اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProbabilistic exact cloning and probabilistic no-signalling
92
0
0.0
(
0
)
تأليف
Arun Kumar Pati
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show that non-local resources cannot be used for probabilistic signalling even if one can produce exact clones with the help of a probabilistic quantum cloning machine (PQCM). We show that PQCM cannot help to distinguish two statistical mixtures at a remote location. Thus quantum theory rules out the possibility of sending superluminal signals not only deterministically but also probabilistically. We give a bound on the success probability of producing multiple clones in an entangled system.
قيم البحث
اقرأ أيضاً
The method of quantum cloning is divided into two main categories: approximate and probabilistic quantum cloning. The former method is used to approximate an unknown quantum state deterministically, and the latter can be used to faithfully copy the s
tate probabilistically. So far, many approximate cloning machines have been experimentally demonstrated, but probabilistic cloning remains an experimental challenge, as it requires more complicated networks and a higher level of precision control. In this work, we designed an efficient quantum network with a limited amount of resources, and performed the first experimental demonstration of probabilistic quantum cloning in an NMR quantum computer. In our experiment, the optimal cloning efficiency proposed by Duan and Guo [Phys. Rev. Lett. textbf{80}, 4999 (1998)] is achieved.
We propose a probabilistic quantum cloning scheme using Greenberger-Horne-Zeilinger states, Bell basis measurements, single-qubit unitary operations and generalized measurements, all of which are within the reach of current technology. Compared to an
other possible scheme via Tele-CNOT gate [D. Gottesman and I. L. Chuang, Nature 402, 390 (1999)], the present scheme may be used in experiment to clone the states of one particle to those of two different particles with higher probability and less GHZ resources.
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 of the uni
tary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a $k$-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.
Steering is a physical phenomenon which is not restricted to quantum theory, it is also present in more general, no-signalling theories. Here, we study steering from the point of view of no-signalling theories. First, we show that quantum steering in
volves a collection of different aspects, which need to be separated when considering steering in no-signalling theories. By deconstructing quantum steering, we learn more about the nature of the steering phenomenon itself. Second, we introduce a new concept, that we call blind steering, which can be seen as the most basic form of steering, present both in quantum mechanics and no-signalling theories.
The impossibility of superluminal communication is a fundamental principle of physics. Here we show that this principle underpins the performance of several fundamental tasks in quantum information processing and quantum metrology. In particular, we
derive tight no-signaling bounds for probabilistic cloning and super-replication that coincide with the corresponding optimal achievable fidelities and rates known. In the context of quantum metrology, we derive the Heisenberg limit from the no-signaling principle for certain scenarios including reference frame alignment and maximum likelihood state estimation. We elaborate on the equivalence of assymptotic phase-covariant cloning and phase estimation for different figures of merit.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
