Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1603.07036

Part probabilistic cloning of linearly dependent states

Pinshu Rui, Zhang, Wen, Yan-Lin Liao, Ziyun Zhang

Published Mar 23, 2016• 1 citation
arXivHTMLPDF

Abstract

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 states in the set. The optimal possible cloning efficiencies are also investigated.

DOI
10.48550/arxiv.1603.07036

Related papers

Probabilistic Cloning and Identification of Linearly Independent Quantum States

L.-M. Duan, Guang‐Can Guo

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 $S\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}{|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},|{\ensuremath{\Psi}}_{n}〉}$ can be probabilistically cloned if and only if $|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},\mathrm{and}|{\ensuremath{\Psi}}_{n}〉$ are linearly independent. We derive the best possible cloning efficiencies. Probabilistic cloning has a close connection with the problem of identification of a set of states, which is a type of $n+1$ outcome measurement on $n$ linearly independent states. The optimal efficiencies for this type of measurement are obtained.

arXiv:quant-ph/9804064•Physical Review Letters•Jun 1, 1998•474 citations

Maximum confidence measurements via probabilistic quantum cloning

张文海, 余龙宝, 曹卓良 +1 more

Probabilistic quantum cloning(PQC) cannot copy a set of linearly dependent quantum states.In this paper,we show that if incorrect copies are allowed to be produced,linearly dependent quantum states may also be cloned by the PQC.By exploiting this kind of PQC to clone a special set of three linearly dependent quantum states,we derive the upper bound of the maximum confidence measure of a set.An explicit transformation of the maximum confidence measure is presented.

中国物理B：英文版•Jan 1, 2013•0 citations

Maximum confidence measurements via probabilistic quantum cloning

Wen‐Hai Zhang, Long-Bao Yu, Zhuo‐Liang Cao +1 more

Probabilistic quantum cloning (PQC) cannot copy a set of linearly dependent quantum states. In this paper, we show that if incorrect copies are allowed to be produced, linearly dependent quantum states may also be cloned by the PQC. By exploiting this kind of PQC to clone a special set of three linearly dependent quantum states, we derive the upper bound of the maximum confidence measure of a set. An explicit transformation of the maximum confidence measure is presented.

Chinese Physics B•Mar 1, 2013•3 citations

Linearly-Independent Quantum States Can Be Cloned by a Unitary-Reduct ion Operation

Duan Lu-ming, Guo Guang-Can

The famous quantum no-cloning theorem [Nature 299(1952)802] forbids replication of an arbitrary unknown quantum state. But it leaves open the following question: If the state is not completely arbitrary, but secretly chosen from a certain set , whether is the cloning possible? It is proved that the states from the set can be faithfully cloned by a general unitary-reduction operation in a probabilistic fashion if and only if and are linearly-independent.

Communications in Theoretical Physics•Mar 15, 1999•11 citations

Linearly-independent quantum states can be cloned

L.-M. Duan, Guang‐Can Guo

A fundamental question in quantum mechanics is, whether it is possible to replicate an arbitrary unknown quantum state. Then famous quantum no-cloning theorem [Nature 299, 802 (1982)] says no to the question. But it leaves open the following question: If the state is not arbitrary, but secretly chosen from a certain set $\$={ | Ψ_1> ,| Ψ_2> ,... ,| Ψ_n> } $, whether is the cloning possible? This question is of great practical significance because of its applications in quantum information theory. If the states $| Ψ_1>, | Ψ_2>,...$ and $| Ψ_n> $ are linearly-dependent, similar to the proof of the no-cloning theorem, the linearity of quantum mechanics forbids such replication. In this paper, we show that, if the states $| Ψ_1>, | Ψ_2>, ...$ and $| Ψ_n> $ are linearly-independent, they do can be cloned by a unitary-reduction process.

arXiv:quant-ph/9705018•May 12, 1997•2 citations

Quantum Superposition of Multiple Clones and the Novel Cloning Machine

Arun Kumar Pati

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 can exist in a superposition of composite states independent of the input state. We prove that unknown nonorthogonal states chosen from a set $S$ can evolve into a linear superposition of multiple clones and failure branches 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 deterministic and probabilistic clonings are special cases of our novel cloning machine.

arXiv:quant-ph/9903038•Physical Review Letters•Oct 4, 1999•74 citations
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 states in the set. The optimal possible cloning efficiencies are also investigated.
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 $S\phantom{\rule{0ex}{0ex}}=\phantom{\rule{0ex}{0ex}}{|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},|{\ensuremath{\Psi}}_{n}〉}$ can be probabilistically cloned if and only if $|{\ensuremath{\Psi}}_{1}〉,|{\ensuremath{\Psi}}_{2}〉,\dots{},\mathrm{and}|{\ensuremath{\Psi}}_{n}〉$ are linearly independent. We derive the best possible cloning efficiencies. Probabilistic cloning has a close connection with the problem of identification of a set of states, which is a type of n+1n+1n+1 outcome measurement on nnn linearly independent states. The optimal efficiencies for this type of measurement are obtained.
A fundamental question in quantum mechanics is, whether it is possible to replicate an arbitrary unknown quantum state. Then famous quantum no-cloning theorem [Nature 299, 802 (1982)] says no to the question. But it leaves open the following question: If the state is not arbitrary, but secretly chosen from a certain set $$={ | Ψ_1> ,| Ψ_2> ,... ,| Ψ_n> } $, whether is the cloning possible? This question is of great practical significance because of its applications in quantum information theory. If the states ∣Ψ1>,∣Ψ2>,...| Ψ_1>, | Ψ_2>,...∣Ψ1​>,∣Ψ2​>,... and $| Ψ_n> $ are linearly-dependent, similar to the proof of the no-cloning theorem, the linearity of quantum mechanics forbids such replication. In this paper, we show that, if the states ∣Ψ1>,∣Ψ2>,...| Ψ_1>, | Ψ_2>, ...∣Ψ1​>,∣Ψ2​>,... and $| Ψ_n> $ are linearly-independent, they do can be cloned by a unitary-reduction process.
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 can exist in a superposition of composite states independent of the input state. We prove that unknown nonorthogonal states chosen from a set SSS can evolve into a linear superposition of multiple clones and failure branches 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 deterministic and probabilistic clonings are special cases of our novel cloning machine.