Lucien Hardy, David D. Song
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.
机构、总结、中文摘要均由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.
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 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.
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.
We present an example of quantum computational tasks whose performance is enhanced if we distribute quantum information using quantum cloning. Furthermore we give achievable efficiencies for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.
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…
We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which cloning offers an advantage which cannot be matched by any approach that does not resort to it. In these quantum computations, we need to distribute quantum information contained in states about which we have some partial information. To perform quantum computations, we use state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.
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 …
Attempts at cloning a quantum system result in the introduction of imperfections in the state of the copies. This is a consequence of the no-cloning theorem, which is a fundamental law of quantum physics and the backbone of security for quantum communications. Although such perfect copies are prohibited, a quantum state may be copied with maximal accuracy via various optimal cloning schemes. Optimal quantum cloning, which lies at the border of the physical limit imposed by the no-signalling theorem and the Heisenberg uncertainty principle, has been experimentally realized for low dimensional p…
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…
Quantum cloning is an essential operation in quantum information and quantum computing. Similar to the `copy' operation in classical computing, the cloning of flying bits for further processing from the solid-state quantum bits in storage is an operation frequently used in quantum information processing. Here we propose a high-fidelity and controllable quantum cloning scheme between solid bits and flying bits. In order to overcome the obstacles from the no-cloning theorem and the weak phonon-photon interaction, we introduce a hybrid optomechanical system that performs both the probabilistic cl…
Many-party correlations between measurement outcomes in general probabilistic theories are given by conditional probability distributions obeying the non-signalling condition. We show that any such distribution can be obtained from classical or quantum theory, by relaxing positivity constraints on either the mixed state shared by the parties, or the local functions which generate measurement outcomes. Our results apply to generic non-signalling correlations, but in particular they yield two distinct quasi-classical models for quantum correlations.
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…
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…
In this paper, we study the entanglement and quantum discord of the output modes in the unified $1\rightarrow 2$ state-dependent cloning and probabilistic quantum cloning. The tripartite entanglement among the output modes and the quantum cloning machine is also considered. We find that the roles of the quantum correlations including the bipartite and tripartite entanglement and quantum discord strongly depend on the quantum cloning machines as well as the cloned state. In particular, it is found that this quantum cloning scheme can be realizable even without any quantum correlation.
An optimal universal cloning transformation is derived that produces M copies of an unknown qubit from a pair of orthogonal qubits. For M>6, the corresponding cloning fidelity is higher than that of the optimal copying of a pair of identical qubits. It is shown that this cloning transformation can be implemented probabilistically via parametric down-conversion by feeding the signal and idler modes of a nonlinear crystal with orthogonally polarized photons.
We present a computational circuit which realizes contextually the Tele-UNOT gate and the universal optimal quantum cloning machine (UOQCM). We report the experimental realization of the probabilistic UOQCM with polarization encoded qubits. This is achieved by combining on a symmetric beam-splitter the input qubit with an ancilla in a fully mixed state.
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 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 probabilistic quantum anti-cloner and show quantum states can be anti-cloned exactly with non-zero probability and its efficiency is higher than the efficiency of distinguishing between the two states.
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…
A linear optical probabilistic scheme for the optimal cloning of a pair of orthogonally-polarized photons is devised, based on single- and two-photon interferences. It consists in a partial symmetrization device, realized with a modified unbalanced Mach-Zehnder interferometer, followed by two independent Hong-Ou-Mandel interferometers. This scheme has the advantage that it enables quantum cloning without the need for stimulated amplification in a nonlinear medium. It can also be modified so to make an optical two-qubit partial SWAP gate, thereby providing a potentially useful tool to linear op…
Optimal procedures play an important role in quantum information. It turns out that some naturally occurring processes like emission of light from an atom can realize optimal transformations. Here we study how arbitrary symmetric states of a number of d-level systems can be cloned using a multilevel atomic system. It is shown that optimality is always ensured even though the output number of systems is probabilistic.
we envisage a novel quantum cloning machine, which takes an input state and produces an output state whose success branch can exist in a linear superposition of multiple copies of the input state and the failure branch exist in a superposition of composite state independent of the input state. We prove that unknown non-orthogonal states chosen from a set $\cal S$ can evolve into a linear superposition of multiple clones by a unitary process if and only if the states are linearly independent. We derive a bound on the success probability of the novel cloning machine. We argue that the determinis…
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 …
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 stat…
We introduce the study of quantum protocols that probabilistically simulate quantum channels from a sender in the future to a receiver in the past. The maximum probability of simulation is determined by causality and depends on the amount and type (classical or quantum) of information that the channel can transmit. We illustrate this dependence in several examples, including ideal classical and quantum channels, measure-and-prepare channels, partial trace channels, and universal cloning channels. For the simulation of partial trace channels, we consider generalized teleportation protocols that…
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 have shown that the no-cloning theorem can be circumvented in the presence of closed timelike curves, allowing the perfect cloning of a quantum state chosen randomly from a finite alphabet of states. Further, we show that a universal …
Quantum no-cloning, the impossibility of perfectly cloning an arbitrary unknown quantum state, is one of the most fundamental limitations due to the laws of quantum mechanics, which underpin the physical security of quantum key distribution. Quantum physics does allow, however, approximate cloning with either imperfect state fidelity and/or probabilistic success. Whereas approximate quantum cloning of single-particle states has been tested previously, experimental cloning of quantum entanglement -- a highly non-classical correlation -- remained unexplored. Based on a multiphoton linear optics …
We propose a scheme to enhance the fidelity of symmetric quantum cloning machine using a weak measurement. By adjusting the intensity of weak measurement parameter $p$, we obtain the copies with different optimal fidelity. Choosing proper value of $p$, we can obtain the perfect copies for initial qubits. In this paper, we focus on $1-2$ quantum cloning for two nonorthogonal states. Sets containing more than two linear independent states are also discussed briefly. Due to weak measurements being probabilistic, we obtain high fidelity at risk of probability. If the weak measurement successes, we…
No-cloning theorem is fundamental for quantum mechanics and for quantum information science that states an unknown quantum state cannot be cloned perfectly. However, we can try to clone a quantum state approximately with the optimal fidelity, or instead, we can try to clone it perfectly with the largest probability. Thus various quantum cloning machines have been designed for different quantum information protocols. Specifically, quantum cloning machines can be designed to analyze the security of quantum key distribution protocols such as BB84 protocol, six-state protocol, B92 protocol and the…
No-Signalling is a fundamental constraint on the probabilistic predictions made by physical theories. It is usually justified in terms of the constraints imposed by special relativity. However, this justification is not as clear-cut as is usually supposed. We shall give a different perspective on this condition by showing an equivalence between No-Signalling and Lambda Independence, or "free choice of measurements", a condition on hidden-variable theories which is needed to make no-go theorems such as Bell's theorem non-trivial. More precisely, we shall show that a probability table describing…
No-cloning theorem forbids perfect cloning of an unknown quantum state. A universal quantum cloning machine (UQCM), capable of producing two copies of any input qubit with the optimal fidelity, is of fundamental interest and has applications in quantum information processing. This is enabled by delicately tailored nonclassical correlations between the input qubit and the copying qubits, which distinguish the UQCM from a classical counterpart, but whose experimental demonstrations are still lacking. We here implement the UQCM in a superconducting circuit, and investigate these correlations. The…
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…
We present a quantum probabilistic encryption algorithm for a private-key encryption scheme based on conjugate coding of the qubit string. A probabilistic encryption algorithm is generally adopted in public-key encryption protocols. Here we consider the way it increases the unicity distance of both classical and quantum private-key encryption schemes. The security of quantum probabilistic private-key encryption schemes against two kinds of attacks is analyzed. By using the no-signalling postulate, we show that the scheme can resist attack to the key. The scheme's security against plaintext att…
Quantum theory is compatible with special relativity. In particular, though measurements on entangled systems are correlated in a way that cannot be reproduced by local hidden variables, they cannot be used for superluminal signalling. As Czachor, Gisin and Polchinski pointed out, this is not true for general nonlinear modifications of the Schroedinger equation. Excluding superluminal signalling has thus been taken to rule out most nonlinear versions of quantum theory. The no superluminal signalling constraint has also been used for alternative derivations of the optimal fidelities attainable …
Perfect cloning of a known set of states with arbitrary prior probabilities is possible if we allow the cloner to sometimes fail completely. In the optimal case the probability of failure is at its minimum allowed by the laws of quantum mechanics. Here we show that it is possible to lower the failure rate below that of the perfect probabilistic cloner but the price to pay is that the clones are not perfect; the global fidelity is less than one. We determine the optimal fidelity of a cloner with a Fixed Failure Rate (FFR cloner) in the case of a pair of known states. Optimality is shown to be a…
Superluminal signalling and chaos in nonlinear quantum dynamics
本文重新审视Gisin关于非线性量子动力学导致超光速信号传递的不可行定理，研究张量积希尔伯特空间上具有混沌特征的全局非线性动力学，并证明即使放宽无限制假设，三类通信协议一般仍可实现超光速信息传递，同时给出一个例外实例。
In a previous paper, we showed that many important quantum information-theoretic phenomena, including the no-cloning and no-broadcasting theorems, are in fact generic in all non-classical probabilistic theories. An exception is teleportation, which most such theories do not support. In this paper, we investigate which probabilistic theories, and more particularly, which composite systems, {\em do} support a teleportation protocol. We isolate a natural class of composite systems that we term {\em regular}, and establish necessary and sufficient conditions for a regular tripartite system to supp…
We consider quantum-information division, which is characterized by a channel whose outputs have no correlation and are not completely randomized. We show that the quantum-information division is possible in a probabilistic manner by optimizing the average fidelity in the channel with $M$ outputs in both deterministic and probabilistic cases. Moreover, we show that the optimal fidelities drastically change depending on the condition imposed on the outputs (symmetric and asymmetric), which is quite in contrast to the case of imperfect cloning.
We discuss the possibility of creating money that is physically impossible to counterfeit. Of course, "physically impossible" is dependent on the theory that is a faithful description of nature. Currently there are several proposals for quantum money which have their security based on the validity of quantum mechanics. In this work, we examine Wiesner's money scheme in the framework of generalised probabilistic theories. This framework is broad enough to allow for essentially any potential theory of nature, provided that it admits an operational description. We prove that under a quantifiable …
In this paper we introduce the three main notions of probability used by physicists and discuss how these are to be used when invoking spacelike separated observers in a relativistic format. We discuss a standard EPRB experiment and concentrate upon problems of the interpretation of probabilities. We promote a particularly conservative interpretation of this experiment (which need not invoke an objective notion of collapse) where probabilities are, tentatively, passively Lorentz invariant. We also argue that the Heisenberg picture is preferable in relativistic situations due to a conflict betw…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。