Sibasish Ghosh, Guruprasad Kar, Samir Kunkri, Anirban Roy
We give a proof of impossibility of probabilistic exact $1\to 2$ cloning of any three different states of a qubit. The simplicity of the proof is due to the use of a surprising result of remote state preparation [M.-Yong Ye, Y.-Sheng Zhang and G.-Can Guo, quant-ph/0307027 (2003)]. The result is extented to higher dimentional cases for special ensemble of states.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
It is known that the stronger no-cloning theorem and the no-deleting theorem taken together provide the permanence property of quantum information. Also, it is known that the violation of the no-deletion theorem would imply signalling. Here, we show that the violation of the stronger no-cloning theorem could lead to signalling. Furthermore, we prove the stronger no-cloning theorem from the conservation of quantum information. These observations imply that the permanence property of quantum information is connected to the no-signalling and the conservation of quantum information.
We show that the condition of no faster-than-light signalling restricts the number of quantum states that can be cloned in a given Hilbert space. This condition leads to the constraints on a probabilistic quantum cloning machine (PQCM) recently found by Duan and Guo.
Assuming the condition of no superluminal signalling, we got an upper bound on the quality of all asymmetric $ 1\to 2$ cloning machines, acting on qubits whose Bloch vectors lie on a great circle. Then we constructed an $ 1\to 2$ cloning machine, which asymmetrically clone all qubits corresponding to this great circle, and this machine matches with that upper bound, and hence this is optimal one.
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.
Fundamental limits on quantum cloning from the no-signalling principle
本文基于无信号原理和远程态制备，在统一框架中重新推导了概率性与确定性量子克隆机最大保真度的上界，并将其应用于量子密码学中若干重要状态子集。
We show that nonlocality of quantum mechanics cannot lead to superluminal transmission of information, even if most general local operations are allowed, as long as they are linear and trace preserving. In particular, any quantum mechanical approximate cloning transformation does not allow signalling. On the other hand, the no-signalling constraint on its own is not sufficient to prevent a transformation from surpassing the known cloning bounds. We illustrate these concepts on the basis of some examples.
In this work we show that one cannot use non-local resources for probabilistic signalling even if one can delete a quantum state with the help of probabilistic quantum deletion machine. Here we find that probabilistic quantum deletion machine is not going to help us in identifying two statistical mixture at remote location. Also we derive the bound on deletion probability from no-signalling condition.
We construct efficient quantum logic network for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.
In probabilistic cloning with two auxiliary systems, we consider and compare three different protocols for the success probabilities of cloning. We show that, in certain circumstances, it may increase the success probability to add an auxiliary system to the probabilistic cloning machine having one auxiliary system, but we always can find another cloning machine with one auxiliary system having the same success probability as that with two auxiliary systems.
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 state 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 perform…
From Ref. [Phys. Rev. Lett. 80(1998)4999] one knows that the quantum states secretly chosen from a certain set can be probabilistically cloned with positive cloning efficiencies if and only if all the states in the set are linearly independent. In this paper, we focus on the probabilistic quantum cloning (PQC) of linearly dependent states with nonnegative cloning efficiencies. We show that a linearly independent subset of the linearly dependent quantum states can be probabilistically cloned if and only if any one state in the subset can not be expressed as the linear superposition of the other…
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 unitary 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 gen…
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for the maximal achievable average fidelity and we explictly show how to construct a probabilistic operation that achieves this fidelity. We illustrate our method on several examples such as the phase covariant cloning of qubits, cloning of coherent states, and purification of qubits transmitted via depolarizing channel and amplitude damping channel. Our exampl…
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 exactly in the macroscopic limit where the number of clones grows to infinity, preserving the equivalence between asymptotic cloning and estimation for arbitrary values of the success probability. Remarkably, the cloning fidelity depends critically on the number of rationally independent eigenvalues of the clock Hamiltonian. We also prove that probabilistic metr…
We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly chosen from a certain set $\$=\left\{\left| Ψ_1\right> ,\left| Ψ_2\right> ,... ,\left| Ψ_n\right> \right\} $ can be probabilistically cloned if and only if $% \left| Ψ_1\right>$, $\left| Ψ_2\right>$, $... ,$ and $\left| Ψ_n\right>$ are linearly-independent. We derive the best possible cloning efficiencies. Probabilistic cloning has close connection with the pro…
Non-signalling quantum channels -- relevant in, e.g., the study of Bell and Einstein-Podolsky-Rosen scenarios -- may be simulated via affine combinations of local operations in bipartite scenarios. Moreover, when these channels correspond to stochastic maps between classical variables, such simulation is possible even in multipartite scenarios. These two results have proven useful when studying the properties of these channels, such as their communication and information processing power, and even when defining measures of the non-classicality of physical phenomena (such as Bell non-classicali…
It is known that to imperfectly clone a phase-set of states uncorrelatedly is impossible due to the linearity and the hermitian-preservation of quantum operations deterministically shown by D'Ariano et al. In this paper we address uncorrelated cloning in probabilistic cases. We show that there exists a linear and hermitian-preserving probabilistic map to imperfectly clone a phase-set of states uncorrelatedly. It is pointed out that the existence of such a map is due to the difference between non-unit-trace output operators and normalized (unit-trace) output operators inherent to probabilistic …
Comment on 'The axiom of choice and the no-signalling principle'
本文反驳了arXiv:2206.08467中关于确定性无信号资源强于概率性资源的主张，指出确定性资源本质上是概率性资源，并提出可测量性假设以完善论证。
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 another 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.
We present a probabilistic cloning scheme operating independently of any phase reference. The scheme is based solely on a phase-randomized displacement and photon counting, omitting the need for non-classical resources and non-linear materials. In an experimental implementation, we employ the scheme to clone coherent states from a phase covariant alphabet and demonstrate that the cloner is capable of outperforming the hitherto best-performing deterministic scheme. An analysis of the covariances between the output states shows that uncorrelated clones can be approached asymptotically. An intrig…
Recently, the nonlocal optimal probabilistic cloning (NLOPC) of two non-orthogonal qubit states has been proposed [Phys. Rev. A 86, 052332 (2012)] by means of an experimental setup based on a pair of twin photons in a maximally entangled state. Here we study the performance of the NLOPC protocol when implemented via a partially entangled state. We show that the errors introduced by the use of partial entanglement can be undone by applying a quantum state discrimination process. Since quantum state discrimination is a probabilistic process the correction succeeds with a certain probability but …
We prove generic versions of the no-cloning and no-broadcasting theorems, applicable to essentially {\em any} non-classical finite-dimensional probabilistic model that satisfies a no-signaling criterion. This includes quantum theory as well as models supporting ``super-quantum'' correlations that violate the Bell inequalities to a larger extent than quantum theory. The proof of our no-broadcasting theorem is significantly more natural and more self-contained than others we have seen: we show that a set of states is broadcastable if, and only if, it is contained in a simplex whose vertices are …
Summoning is a task between two parties, Alice and Bob, with distributed networks of agents in space-time. Bob gives Alice a random quantum state, known to him but not her, at some point. She is required to return the state at some later point, belonging to a subset defined by communications received from Bob at other points. Many results about summoning, including the impossibility of unrestricted summoning tasks and the necessary conditions for specific types of summoning tasks to be possible, follow directly from the quantum no-cloning theorem and the relativistic no-superluminal-signalling…
We consider probabilistic cloning of a state chosen from a mutually nonorthogonal set of pure states, with the help of a party holding supplementary information in the form of pure states. When the number of states is 2, we show that the best efficiency of producing m copies is always achieved by a two-step protocol in which the helping party first attempts to produce m-1 copies from the supplementary state, and if it fails, then the original state is used to produce m copies. On the other hand, when the number of states exceeds two, the best efficiency is not always achieved by such a protoco…
The no-cloning theorem states that an unknown quantum state cannot be cloned exactly and deterministically due to the linearity of quantum mechanics. Associated with this theorem is the quantitative no-cloning limit that sets an upper bound to the quality of the generated clones. However, this limit can be circumvented by abandoning determinism and using probabilistic methods. Here, we report an experimental demonstration of probabilistic cloning of arbitrary coherent states that clearly surpasses the no-cloning limit. Our scheme is based on a hybrid linear amplifier that combines an ideal det…
Distinguishing two preparations for same pure state leads to signalling
本文证明无法区分同一量子纯态的两种制备过程，否则将导致信号传递，该结论有别于无扰动不可测量和不可克隆定理，并可扩展至混合态。
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 cloning problem when N = 2. Then, we give the general geometric form of the sufficient and necessary condition of probabilistic cloning for N known quantum states. By this general geometric approach, we realize the optimal probabilistic quantum cloning of N known quantum states with priori probabilities. The results are also applicable to the identifica…
A general multi-step N->M probabilistic optimal universal cloning protocol is presented together with the experimental realization of the (1 -> 3) and (2 -> 3) machines. Since the present method exploits the bosonic nature of the photons, it can be applied to any particle obeying to the Bose statistics. On a technological perspective, the present protocol is expected to find applications as a novel, multi-qubit symmetrizator device to be used in modern quantum information networks.
We study the relation of causal influence between input systems of a reversible evolution and its output systems, in the context of operational probabilistic theories. We analyse two different definitions that are borrowed from the literature on quantum theory -- where they are equivalent. One is the notion based on signalling, and the other one is the notion used to define the neighbourhood of a cell in a quantum cellular automaton. The latter definition, that we adopt in the general scenario, turns out to be strictly weaker than the former: it is possible for a system to have causal influenc…
We discuss the recently introduced concept of non-deterministic noiseless linear amplification, demonstrating that such an operation can only be performed perfectly with vanishing probability of success. We show that a weak measurement, which imprints the weak value of an observable of a pre-selected and post-selected system onto a probe system, can be used to approximate probabilistic noiseless amplification. This result may be applied to various tasks in continuous variable quantum information, including entanglement concentration, probabilistic cloning, and in quantum repeaters. We discuss …
We show that in a cloning process, whether deterministic inexact or probabilistic exact, one can take an arbitrary blank state while still using a fixed cloning machine.
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 universal for separate state and entanglement. We also provide the realization in the condition given $M$ initial copies for each state.
The possible existence of closed timelike curves (CTCs) draws attention to fundamental questions about what is physically possible and what is not. An example is the "no cloning theorem" in quantum mechanics, which states that no physical means exists by which an unknown arbitrary quantum state can be reproduced or copied perfectly. Using the Deutsch approach, we show here that this theorem can be circumvented in the presence of closed timelike curves, allowing the cloning of an unknown arbitrary quantum state chosen from a finite alphabet of states. Since the "no cloning theorem" has played a…
Quantum cloning transformation unlocks the potential of W class of states in a quantum secure direct communication protocol
提出一种基于三方共享W类态的控制量子安全直接通信协议，利用量子克隆机分解参数以获取秘密，并分析成功概率与克隆效率及纠缠的关系，证明低纠缠W态亦有效。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。