Ting Gao, Fengli Yan, Zhixi Wang
We construct efficient quantum logic network for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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…
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.
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 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.
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…
This paper discusses the no-cloning theorem in a logico-algebraic approach. In this approach, an orthoalgebra is considered as a general structure for propositions in a physical theory. We proved that an orthoalgebra admits cloning operation if and only if it is a Boolean algebra. That is, only classical theory admits the cloning of states. If unsharp propositions are to be included in the theory, then a notion of effect algebra is considered. We proved that an atomic Archimedean effect algebra admitting cloning operation is a Boolean algebra. This paper also presents a partial result indicati…
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.
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…
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 …
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 …
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…
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…
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…
The quantum mechanical no-cloning theorem for pure states is generalized and transfered to the quantum logics with a conditional probability calculus in a rather abstract, though simple and basic fashion without relying on a tensor product construction or finite dimension as required in other generalizations.
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.
Fundamental limits on quantum cloning from the no-signalling principle
本文基于无信号原理和远程态制备，在统一框架中重新推导了概率性与确定性量子克隆机最大保真度的上界，并将其应用于量子密码学中若干重要状态子集。
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.
A common way of stating the non-cloning theorem -- one of distinguishing characteristics of quantum theory -- is that one cannot make a copy of an arbitrary unknown quantum state. Even though this theorem is an important part of the ongoing discussion of the nature of a quantum state, the role of the theorem in the logical-algebraic approach to quantum theory has not yet been systematically studied. According to the standard point of view (which is in line with the logical tradition), quantum cloning amounts to two classical rules of inference, namely, monotonicity and idempotency of entailmen…
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.
Here we report an experimental realization of optimal phase-covariant quantum cloning machine with a single electron spin in solid state system at room temperature. The involved three states of two logic qubits are encoded physically in three levels of a single electron spin with two Zeeman sub-levels at a nitrogen-vacancy defect center in diamond. The preparation of input state and the phase-covariant quantum cloning transformation are controlled by two independent microwave fields. The average experimental fidelity reaches 85.2% which is very close to theoretical optimal fidelity 85.4% and i…
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…
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 review our recent work on the universal (i.e. input state independent) optimal quantum copying (cloning) of qubits. We present unitary transformations which describe the optimal cloning of a qubit and we present the corresponding quantum logical network. We also present network for an optimal quantum copying ``machine'' (transformation) which produces N+1 identical copies from the original qubit. Here again the quality (fidelity) of the copies does not depend on the state of the original and is only a function of the number of copies, N. In addition, we present the machine which universaly …
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-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.
Recently, the author and Bob Coecke have introduced a categorical formulation of Quantum Mechanics. In the present paper, we shall use it to open up a novel perspective on No-Cloning. What we shall find, quite unexpectedly, is a link to some fundamental issues in logic, computation, and the foundations of mathematics. A striking feature of our results is that they are visibly in the same genre as a well-known result by Joyal in categorical logic showing that a `Boolean cartesian closed category' trivializes, which provides a major road-block to the computational interpretation of classical log…
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…
A simplification scheme of probabilistic teleportation of two-particle state of general form is given. By means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations, we construct an efficient quantum logical network for implementing the new scheme of probabilistic teleportation of a two-particle state of general form.
The scheme for probabilistic teleportation of an N-particle state of general form is proposed. As the special cases we construct efficient quantum logic networks for implementing probabilistic teleportation of a two-particle state, a three-particle state and a four-particle state of general form, built from single qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations.
We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one-particle and two-particle and construct efficient quantum logic networks for implementing the new schemes by means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations. In these schemes the teleportation are not always successful but with certain probability.
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 investigate an entangled deformation of the deterministic quantum cloning process, called enscription, that can be applied to (certain) sets of distinct quantum states which are not necessarily orthogonal, called texts. Some basic theorems on enscribable texts are given, and a relationship to probabilistic quantum cloning is demonstrated.
A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective measurements made on a given quantum state. Simultaneous measurements are assumed to imply that the underlying observables are compatible. A sound and weakly complete axiomatization is provided relying on the decidable first-order theory of real closed ordered fields. The proposed logic is proved to be a conservative extension of classical propositional logic.
On Probabilistic $ω$-Pushdown Systems, and $ω$-Probabilistic Computational Tree Logic
本文定义了概率ω-堆栈自动机，并从计算复杂性角度研究其对ω-概率计算树逻辑的模型检查问题，证明了无状态概率ω-堆栈系统对ω-PCTL的模型检查问题一般不可判定，同时证明了对ω-bPCTL的模型检查问题可判定且NP难。
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。