首页/论文/quant-ph/0610245

arXiv quant-ph/06102452006-10-30quant-ph

Probabilistic cloning with supplementary information contained in the quantum states of two auxiliary systems

Lvjun Li, Daowen Qiu

备注：: 18 pages
DOI：: 10.1016/j.physleta.2006.10.009

英文摘要：

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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Novel cloning machine with supplementary information

Probabilistic cloning was first proposed by Duan and Guo. Then Pati established a novel cloning machine (NCM) for copying superposition of multiple clones simultaneously. In this paper, we deal with the novel cloning machine with supplementary information (NCMSI). For the case of cloning two states, we demonstrate that the optimal efficiency of the NCMSI in which the original party and the supplementary party can perform quantum communication equals that achieved by a two-step cloning protocol wherein classical communication is only allowed between the original and the supplementary parties. F…

2006-02-11quant-ph

Probabilistic cloning with supplementary information

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…

2005-10-05quant-ph

A stronger no-cloning theorem

It is well known that (non-orthogonal) pure states cannot be cloned so one may ask: how much or what kind of additional (quantum) information is needed to supplement one copy of a quantum state in order to be able to produce two copies of that state by a physical operation? For classical information, no supplementary information is required. However for pure quantum (non-orthogonal) states, we show that the supplementary information must always be as large as it can possibly be i.e. the clone must be able to be generated from the additional information alone, independently of the first (given)…

2002-05-08quant-ph

Cloning and Broadcasting in Generic Probabilistic Theories

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 …

2006-11-30quant-ph

Probabilistically Cloning and Quantum Computation

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.

2004-06-15quant-ph

Bounds for state-dependent quantum cloning

Due to the no-cloning theorem, the unknown quantum state can only be cloned approximately or exactly with some probability. There are two types of cloners: universal and state-dependent cloner. The optimal universal cloner has been found and could be viewed as a special state-dependent quantum cloner which has no information about the states. In this paper, we investigate the state-dependent cloning when the state-set contains more than two states. We get some bounds of the global fidelity for these processes. This method is not dependent on the number of the states contained in the state-set.…

2002-09-16quant-ph

更多相关论文收起更多论文

Cloning quantum entanglement in arbitrary dimensions

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, while preserving the separability of unentangled input states. Moreover, it cannot increase the entanglement of formation of all isotropic states. For large $d$, the entanglement of formation of each clone tends to one half the entanglement of the input state, which corresponds to a classical behavior. Finally, we investigate a local entanglement cloner, whi…

2005-03-16quant-ph

Twelve years before the quantum no-cloning theorem

The celebrated quantum no-cloning theorem establishes the impossibility of making a perfect copy of an unknown quantum state. The discovery of this important theorem for the field of quantum information is currently dated 1982. I show here that an article published in 1970 [J. L. Park, Foundations of Physics, 1, 23-33 (1970)] contained an explicit mathematical proof of the impossibility of cloning quantum states. I analyze Park's demonstration in the light of published explanations concerning the genesis of the better-known papers on no-cloning.

2018-02-22physics.hist-phquant-ph

Symmetrization, quantum images and measurement

We argue that symmetrization of an incoming microstate with similar states in a sea of microstates contained in a macroscopic detector can produce an effective image, which does not contradict the no-cloning theorem, and such a combinatorial set can then be used with first passage random walk interactions suggested in an earlier work to give the right quantum mechanical weight for measured eigenvalues.

2005-07-11quant-ph

Quantum Kolmogorov Complexity Based on Classical Descriptions

We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity coincides with the classical Kolmogorov complexity on the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated from above under certain conditions. With high probability a quantum object is incompressible. Upper- and lower bounds of the quantum complexity of multiple copies of individual pure quantum states are de…

2001-10-09cs.CCcs.ITmath.IT

量子几何机器学习

Quantum Geometric Machine Learning

该论文融合机器学习与微分几何、拓扑，构建开放量子系统数据集，并利用灰盒深度学习、Cartan分解与变分方法解决量子控制及酉综合问题。

2024-09-08quant-ph

Certifying quantumness: Benchmarks for the optimal processing of generalized coherent and squeezed states

Quantum technology promises revolutionary advantages in information processing and transmission compared to classical technology; however, determining which specific resources are needed to surpass the capabilities of classical machines often remains a nontrivial problem. To address such a problem, one first needs to establish the best classical solutions, which set benchmarks that must be beaten by any implementation claiming to harness quantum features for an enhanced performance. Here we introduce and develop a self-contained formalism to obtain the ultimate, generally probabilistic benchma…

2017-03-17cond-mat.stat-mechmath-phmath.MP