Unified quantum no-go theorems and transforming of quantum states in a restricted set
Ming-Xing Luo, Hui-Ran Li, Hong Lai, Xiaojun Wang

TL;DR
This paper unifies various quantum no-go theorems through a general framework based on the superposition principle, establishing forbidden transformations, and providing a scheme for perfect and imperfect quantum tasks with success bounds.
Contribution
It introduces a unified approach to quantum no-go theorems, including a no-encoding theorem, and presents a scheme for quantum tasks with success probability bounds.
Findings
Proves a no-encoding theorem forbidding superposition of unknown and fixed states.
Provides a unified scheme for quantum cloning and deleting tasks.
Derives upper bounds for success probabilities in quantum state transformations.
Abstract
The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. It remains an open problem of finding general forbidden principles to unify these results. In this paper, we investigate general quantum transformations forbidden or permitted by the superposition principle for various goals. First, we prove a no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed state in Hilbert space of finite dimension. Two general forms include the no-cloning theorem, the no-deleting theorem, and the no-superposing theorem as special cases. Second, we provide a unified scheme for presenting perfect and imperfect quantum tasks (cloning and deleting) in a one-shot manner. This scheme may yield to fruitful results that are completely characterized with…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Unified quantum no-go theorems and transforming of quantum states in a restricted set
Ming-Xing Luo1,2, Hui-Ran Li2, Hong Lai3, Xiaojun Wang4
1 Information Security and National Computing Grid Laboratory, Southwest Jiaotong University, Chengdu 610031, China
2 Department of Physics, University of Michigan, Ann Arbor, MI 48109, USA
3 School of Computer and Information Science, Southwest University, Chongqing 400715, China
4 School of Electronic Engineering, Dublin City University, Dublin 9, Ireland
Abstract
The linear superposition principle in quantum mechanics is essential for several no-go theorems such as the no-cloning theorem, the no-deleting theorem and the no-superposing theorem. It remains an open problem of finding general forbidden principles to unify these results. In this paper, we investigate general quantum transformations forbidden or permitted by the superposition principle for various goals. First, we prove a no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed state in Hilbert space of a finite dimension. Two general forms include the no-cloning theorem, the no-deleting theorem, and the no-superposing theorem as special cases. Second, we provide a unified scheme for presenting perfect and imperfect quantum tasks (cloning and deleting) in a one-shot manner. This scheme may lead to fruitful results that are completely characterized with the linear independence of the input pure states. The generalized upper bounds for the success probability are proved. Third, we generalize a recent superposing of unknown states with fixed overlaps when multiple copies of the input states are available.
pacs:
03.67.-a,03.65.Ta,03.67.Hk
I Introduction
In quantum mechanics, the no-cloning theorem as a well-known fact asserts that an arbitrary unknown pure state 1 or noncommuting mixed state Barn cannot be perfectly created using a universal quantum transformation. This non-trivial exception is derived from the superposition principle of quantum states and may be implied by the no-communication theorem which forbids the classical information transmission using only quantum entanglement. Although the no-cloning theorem prevents several important extensions of classical results such as classical error corrections shor ; stean , it plays a key role in various quantum applications, especially in quantum secure communication. The no-cloning theorem plays a key role in certifying the unconditional security of quantum cryptography 2 ; Shor1 ; Lo ; CBK ; CS . A universal cloning machine will violate the no-teleportation theorem that forbids converting a quantum state into classical bits. Unitary cloning also implies the possibility of deleting quantum information which is impossible. In fact, with the quantum superposition principle, unknown quantum states of a finite dimension cannot be unitarily transformed into a fixed state, i.e., the quantum no-deleting theorem 3 . In general, the no-cloning theorem has no relationship to the no-deleting theorem because the post-selection permitted in the cloning task is forbidden in the deleting task.
The key of the no-cloning theorem and the no-deleting theorem is the superposition principle of quantum states 4 . It is also essential for nontrivial quantum applications including Shor’s factoring algorithm 5 , Grover’s search algorithm 6 , quantum cryptography 7 , quantum metrology 8 , and Boson sampling 9 . However, this principle is unsuitable for the task of superposing unknown states. A recent theorem 10 ; 11 shows that it is impossible to create a superposition state of unknown states using a universal quantum transformation 10 . This no-go theorem is different from the no-cloning theorem 1 , the no-deleting theorem 3 or the special no-superposing theorem that forbids superposing an unknown state and its orthogonal complement 12 . It remains a challenge to explore intrinsic connections among these no-go theorems.
In comparison to recovering perfect resultant, Bužek and Hillery provided a universal quantum transformation for imperfect cloning 18 . The partial trace on each copy of their resultant is a mixed state with the optimal fidelity Gis ; Bru ; Bru2 ; Kang . Their scheme had triggered lots of investigations on quantum cloning tasks that include cloning of qubits Gis , -dimensional universal cloning BH ; Wer ; Zav ; Wang , asymmetric cloning NG ; Cerf ; Buzek ; Ibl ; Cwi , mixed-state cloning Barn ; Dari ; Chen ; Dang , experimental cloning De ; Lin ; Du ; Zhao ; Naga ; Haw ; WD ; Zhu , and relative discussions and applications 19 ; Fan . The cloning fidelities of these imperfect schemes may be improved to unit if input states are chosen from a finite set of the whole space. In particular, the linear independence of input pure states has been proved to be a sufficient and necessary condition for perfect cloning with a unitary and post-selection process 13 ; 14 . The optimal success probability is the same as that of state discriminations CB ; 7b ; CJW ; MW . The linear independence has also been used for the task of superposing multiple copies of input states 15 . Similar results hold for perfect deleting. These perfect schemes may be unified in a one-shot manner using multiple copies of input states 16 .
Recently, a constructive scheme 10 shows that a universal superposing transformation exists for unknown states chosen from two sets where all the states of each set have a fixed overlap with a known state. The scheme shows a new insight of the linear independence, i.e., a superposing scheme exists for a collection (generally uncountable) of finite sets consisting of linearly independent states. This is a great improvement for the quantum tasks defined on a finite set of quantum states. It should be interesting to investigate whether or not similar generalizations hold for other tasks of cloning or deleting 13 ; 14 ; 15 ; 16 .
In this paper, our motivation is to generalize the no-cloning theorem 1 , no-deleting theorem 3 and no-superposing theorem 10 . Although they are different in general and have no explicit relationships among them, we hope to present a unified form which may provide new insights of these no-go theorems. Moreover, new constructions will be proposed to generate different desired states using the linear independence of input states that belong to restricted sets. The main contributions of this paper are listed as follows:
- (1)
We present new no-go theorems. The first one is the no-encoding theorem that forbids linearly superposing of an unknown pure state and a fixed state (known or unknown) in the same space of a finite dimension from a universal quantum transformation. Its generalizations include the no-cloning theorem, the no-deleting theorem and the no-superposing theorem as special cases.
- (2)
We present several schemes to unify the perfect and imperfect tasks of cloning and deleting for pure states in a finite set. All the schemes are completely characterized by the linear independence of input states. Generalized upper bounds are proved using the matrix norm and state metric, respectively.
- (3)
We propose a scheme to superpose pure states in a finite set. We also present some generalized superposing schemes when multiple copies of input states are available.
The rest of the paper is organized as follows. In Sec. II, we present new no-go theorems. The first one is the no-encoding theorem. Namely, an arbitrary unknown state and a fixed state in the same space of a finite dimension cannot be linearly superposed using a universal quantum transformation with a nontrivial probability. This theorem will be further extended for multiple copies of the pure states. In Sec. III, several quantum transformations will be presented to unify imperfect and perfect tasks of cloning and deleting with controllable errors. The generalized bounds of the success probability will be proved using the matrix norm and state metric, respectively. Sec. IV contributes new superposing schemes that create the linear superposition of unknown pure states chosen from a finite set, or a restricted subspace when multiple copies of the input states are available. The last section concludes this paper.
II Unified no-go theorems
In this section, we explore general forms of the no-cloning theorem, the no-deleting theorem and the no-superposing theorem.
II.1 No-encoding theorem
In what follows we only consider pure states. In quantum mechanics, a pure state provides a probability distribution for the value of each observable. In the mathematical formulation, from Riesz representation theorem ries each pure state corresponds to a ray in a Hilbert space while each observable quantity is associated with a self-adjoint (or Hermitian) and positive semi-definite operator. In this paper, we only consider the normalized pure states. Thus each pure state is uniquely denoted by a density matrix on Hilbert space with the dimension , where is its vector representative up to a global phase factor , i.e, . Denote the vector if , i.e., up to a global phase.
Let be the set of completely positive (CP) maps which transform pure states on Hilbert space into pure states on Hilbert space . All the unitary maps, which are denoted as , are CP maps that preserve the inner product of the Hilbert space. In particular, from Stinespring’s Theorem Stin , each may be realized by a unitary map and a projection map , where is an ancillary space and is another ancillary space (named as probe space for simplicity) used for defining projectors. For each map with Hilbert spaces and , denote for on and on as its detailed mapping of .
Theorem 1
Let be nonzero complex constants satisfying , and be a fixed pure state (known or unknown) on Hilbert space with . There does not exist CP map for all pure states on such that
[TABLE]
where the vector representative of is given by and is a normalization constant dependent of and .
The result in Theorem 1 holds for a fixed pure state which may be known or unknown (randomly chosen from ). This theorem shows that one cannot use a fixed pure state to linearly superpose (or linearly encode) with an unknown state, which may be randomly chosen from according to the Haar measure. It is also a general no-superposing theorem that forbids the creation of the linear superposition of an unknown state and a fixed state in the same space. Theorem 1 is not a corollary of the non-superposing Theorem 10 while it is conversely true.
Proof of Theorem 1. Note that each quantum operation can be represented by a unitary operation and post-selection of projective measurements 14 . Thus a CP map is represented by a unitary transformation and the post-selection of projective measurements on a joint system consisting of the input states and ancillary states. Assume that there exists a CP map satisfying Eq.(1). From Stinespring’s Theorem Stin , there exist two pure states (including the pure state as its subsystem) and on ancillary Hilbert space , one probe state on probe space , a unitary map and a projective map such that holds for all the states on . In the following, we only need to prove the nonexistence of the unitary map .
Now, assume there exists a unitary map for all the states on such that
[TABLE]
where the vector representative of is given by and is a normalization constant. In Eq.(2), is the vector representative of ancillary state that may be dependent of , and . and are the respective vector representative of orthogonal pure states and on probe space . is the success probability of recovering a superposition state with the vector representative that is dependent on , and satisfies and . is the vector representative of a general failure state , that will be annihilated by the projector , i.e, .
Here, we only consider the special case of . The proof of the general state is shown in Appendix A. In this case, Eq.(2) may be rewritten into
[TABLE]
where is the matrix representative of the unitary mapping and the vector representative of is defined by .
For simplicity, we only consider . A similar result may be proved using a generally fixed state , which will be discussed in the next subsection. Since Hilbert space of qubit states is a subspace of general Hilbert space with , it is sufficient to prove the nonexistence of Eq.(3) for the qubit space. For the basis states on (qubit space) as input states, Eq.(3) leads to
[TABLE]
where the vector representative is defined by . In these equations, and are the respective success probability of transforming pure state and . and are the respective vector representative of the failure states and that should be annihilated by the projector , i.e, .
For any pure state with the vector representative with , from Eq.(3), we can obtain
[TABLE]
where the vector representative is defined by and is a normalization constant. is the vector representative of the failure state that should be annihilated by the projector , i.e., , and is the success probability of recovering pure state .
Moreover, using the linearity of quantum operations, it follows from Eqs.(4) and (5) that
[TABLE]
where the vector is given by . From Eqs.(6) and (7), we get with . This leads to the fixed values of and from , where , and are some fixed constants. This is a contradiction to the assumption of .
II.2 Unified no-go theorems
Theorem 1 presents the nonexistence of linear superposing of an unknown state and a fixed state in Hilbert space of a finite dimension. Similar results hold for different input states and output states.
Theorem 2
Let be complex constants satisfying and , be an integer, and be a fixed pure state (known or unknown) on Hilbert space with . Then, there does not exist CP map for all the states on such that
[TABLE]
if , and satisfy one of the following conditions:
- (i)
* and ;*
- (ii)
* and ;*
- (iii)
, , the output state is restricted to , and is restricted to the unitary map;
where the vector representative of is given by and is a normalization constant.
Theorem 3
Let be nonzero complex constants satisfying and , and be a fixed state (known or unknown) on Hilbert space with . Then there dose not exist CP map for all the states on such that
[TABLE]
if , and satisfy one of the following conditions:
- (i)
* and ;*
- (ii)
* and ;*
- (iii)
, , the output state is restricted to , and is restricted to unitary map;
where the vector representative of is given by and is a normalization constant.
Theorem 2 may be viewed as no-superposing of the product state and a fixed state while Theorem 3 may be viewed as the combination of the no-cloning and the no-encoding of an unknown pure state and a fixed state. Moreover, Theorem 2 may be viewed as the no-cloning of with a fixed error term while Theorem 3 may be viewed as the no-cloning of with a fixed error term . Theorems 2 and 3 are different except the special case of , which leads to the no-cloning theorem 1 () or the no-deleting theorem 3 (). The relationships among Theorems 2 and 3 and previous no-go theorems 1 ; 3 ; 10 are schematically shown in Fig.1. From this Figure, the set defined by respective Theorem 2 and 3 includes the no-cloning theorem 1 , the no-deleting theorem 3 , Theorem 1, or the no-superposition theorem 10 as a special case. Formally, we obtain the implications as follows:
[TABLE]
Proof of Theorem 2. Since Theorem 1 is a special case of this Theorem, the proof of Theorem 1 for a general fixed state is included in the following proof.
When and is restricted to the unitary map, Theorem 2 reduces to the no-deleting theorem. When , Theorem 2 reduces to the no-cloning theorem for . In the following, we only need to prove the result for .
The proof of Theorem 1 suggests a method to prove this theorem. Now, we present another proof with simple evaluations. Assume that there exists a unitary map with the matrix representative for all the states on such that
[TABLE]
where the vector representative of is given by and is a normalization constant. is the vector representative of an ancillary state on Hilbert space with , and are the respective vector representative of orthogonal states and on probe space with . is the vector representative of the failure state that should be annihilated by the projector , i.e., .
For any state with the vector representative , it follows from Eq.(10) that
[TABLE]
where the vector representative of is given by and is a normalization constant. is the vector representative of a general failure state that should be annihilated by the projector .
Note that , i.e, the pure state is physically undiscriminating from the pure state . From Eq.(10) we obtain
[TABLE]
From Eqs.(11) and (12) we obtain which is a contradiction to the assumption of .
The proof of Theorem 3 is shown in Appendix B.
III Quantum transformation of pure states in a finite set
Although the no-cloning theorem forbids perfectly cloning unknown states, Bužek and Hillery 18 provided a cloning transformation for unknown qubit states such that the partial traces on the original qubit and on the cloned qubit have the same density matrix as with the optimal fidelity . Here, is the orthogonal state of the input state . The cloning transformation of Bužek-Hillery triggered lots of investigations on the imperfect quantum cloning, see reviews 19 ; Fan .
Similar results hold for cloning pure states in a finite set. In fact, let , where is on Hilbert space with . There exists a CP map 13 ; 14 for all the states in such that if the vector representatives of are linearly independent, where is an ancillary state on Hilbert space with . Note that a CP map may be represented by a unitary evolution and post-selection of projective measurement. So, the cloning transformation may be viewed as an imperfect cloning before performing the projective measurement. This scheme has been extended to probabilistically recover , , , for a large integer from the input states , 15 . Moreover, combined with the quantum deleting machine, i.e., , Feng et al. 16 proved that there exists a CP map for the same goal using the input states , . These optimal schemes are related to the quantum state discrimination CB ; 7b ; CJW ; MW . In comparison to the imperfect cloning scheme 18 , the error terms induced by these CP maps on a finite set are not restricted to the orthogonal states of the input states. The general transformation of the pure states in a finite set depends on the linear independence of the input states. The success probability is determined by a proper metric inequality 14 ; 15 ; 16 .
In this section, our goal is to present the general transformations of a finite set of the pure states beyond previous probabilistic cloning or deleting 13 ; 14 ; 15 ; 16 .
III.1 Hadamard product of matrices
For completeness, some necessary definition and propositions of Hadamard product (Shur product) of matrices are firstly presented as follows 17 .
Definition 1
Let and be matrices in matrix space . The Hadamard product of and is defined as .
Proposition 1
The Hadamard product of matrices is commutative, associative and distributive.
Proposition 2
The Hadamard product of two symmetric (Hermite) matrices is symmetric (Hermite).
These Propositions may easily follow from their definitions. Moreover, the Hadamard product maintains the positive semidefinite property as the following theorem.
Theorem 4** (Schur Product Theorem)**
17 . The Hadamard product of two positive-semidefinite matrices (or positive-definite) is also positive-semidefinite (or positive-definite).
Lemma 1
Let be a positive definite matrix in matrix space and be a Hermite matrix in the same space. Then is positive definite if
[TABLE]
where is the induced norm from the Euclidean metric.
Proof of Lemma 1. For a positive definite matrix 17 , all the eigenvalues are positive constants. From the definition of the induced norm, we have and where denotes the inverse matrix of . For a Hermite matrix , all the eigenvalues are nonnegative and satisfy . If is negative semi-definite, there exists a nonzero vector such that . It means that
[TABLE]
which contradicts the inequality of (13).
III.2 General quantum transformation of finite set
In this section, the imperfect and perfect transformation of the pure states in a finite set will be unified. In detail, let be a finite set defined by , where and is a positive integer.
Theorem 5
Let and be complex constants satisfying and , and be a known pure state on Hilbert space , then there exists a CP map for all the states on such that
[TABLE]
iff the vector representatives of are linearly independent, where the vector representative of is given by and is a normalization constant, ; , and is a positive integer.
In Theorem 5, the CP maps exist for when the vector representatives of are linearly independent. If is known, a CP map 7 exists for recovering the states in from a new set . Hence, our condition will be replaced by the linear independence of the vectors for a large . This is because that the vector representatives of should be linearly independent when is large using the Gershgorin circle theorem Gers for its Gram matrix .
Before we present the proof, some useful results may be firstly followed from Theorem 5. When for all and , the general map in Eq.(14) reduces to the unified cloning 16 . If holds for all and with , Theorem 5 reduces to a simultaneous perfect and imperfect cloning as follows.
Corollary 1
Let be complex constants satisfying and , be an integer satisfying , and be a known pure state on Hilbert space , then there exists a CP map for all the states in such that
[TABLE]
iff the vector representatives of are linearly independent, where the vector representative of is given by and is a normalization constant, ; , and is a positive integer.
From Eq.(15), one may simultaneously produce perfect copies and imperfect copies of when . Moreover, one may delete copies and clone imperfect copies of when . The imperfect terms () are independent of the input states. When , one may keep copies of being unchanged and perform a CP map on the remained copies from Theorem 5.
Note that for arbitrary complex constants satisfying , and normalized vectors with , there exist complex constants and a normalized vector such that with . From similar proof, this fact may be generally reformed as follows.
Corollary 2
Let be complex constants satisfying and , be an integer satisfying , and be a known pure state on , then there exists a CP map for all the states in such that
[TABLE]
iff the vector representatives of , , are linearly independent, where the vector representative of is defined by and is a normalization constant, , and .
The no-superposing theorem 12 forbids superposing an unknown state and its orthogonal state in Hilbert space of a finite dimension. However, Corollary 2 suggests a perfect superposing for unknown states in a finite set. If we choose complex constants and a normalized vector with such that which is the orthogonal to , the Corollary 2 leads to the following result with similar proof.
Corollary 3
Let be a known pure state on , then there exists a CP map for all the states in such that
[TABLE]
iff the vector representatives of , , are linearly independent, where ; , and is a positive integer.
Proof of Theorem 5. The proof consists of two parts. First, we prove that if there exists a CP map satisfying Eq.(14), then the vector representatives of are linearly independent. These CP maps will be presented in a unified form with a nontrivial probability in the following. In fact, from Stinespring’s Theorem Stin , assume that there exists a unitary map with matrix representative , an ancillary state with the vector representative on , orthogonal states with the vector representatives on such that
[TABLE]
where be an ancillary Hilbert space with , and be a probe space with . is the vector representative of normalized state that is independent of the input states, . is the success probability of producing imperfect copies of . is the vector representative of a general failure state on with the probability that satisfies , , and . Each CP map is defined by , .
Assume that there exist a vector and constants such that . From Eq.(18) we have
[TABLE]
where the vector representative of is given by and the vector . Moreover, from the linearity of quantum operations, we obtain that
[TABLE]
Note that Eqs.(19) and (20) must be equal to each other for all the states (up to a phase factor), . It follows that for all the integers satisfying . These equalities imply that and for because the vector is independent of input states. So, the vector representatives of are linearly independent.
Now, we need to prove the existence of the unitary map satisfying Eq.(18). For the input states and , taking the inner product of the representative vectors of the output states 56 , from Eq.(18) we have
[TABLE]
where and . Briefly, we obtain a matrix equation using Definition 1 as follows:
[TABLE]
where denotes the -fold Hadamard power of matrix , , , and diagonal matrices and .
From Lemma 1 14 , it is sufficient to prove Eq.(22) with physically available matrices , for the existence of the unitary map in Eq.(18). The matrix is positive definite from Theorem 4 because the vectors , , are linearly independent. The matrices and are Hermite. From Lemma 1, when the efficiency matrices satisfy the following inequality
[TABLE]
the matrix is positive definite, where . So, the Hermite matrix can be diagonalized by a unitary matrix as follows:
[TABLE]
where denote all the eigenvalues of and , . Define where is nonnegative and satisfies , . Hence, the matrices , , are positive definite from Theorem 4 and then physically realizable.
Before completing the proof, we need to prove the inequality (23). Using the triangle inequality, it easily follows that . So, there exist nonzero matrices () satisfying Eq.(23) when they satisfy the following inequality
[TABLE]
which is easily guaranteed. This completes the proof.
The inequality (23) or its weak form (25) has presented an implicit bound of the efficiency in terms of the matrix norm. An entry-pair inequality is obtained from Eq.(22) using the state metric 12 as follows
[TABLE]
where , , , , and with or . The proof is shown in Appendix C. This inequality has generalized the bound of the probabilistic cloning 7 or the state discrimination CB . It also reduces to the bound of the probabilistic cloning in a unified form 12 ; 14 ; 15 ; 16 for special constants of , and .
Remark. From the cloning scheme 14 , the final states belong to a finite set of , where . Similar results hold for 16 . Moreover, from Theorem 5, the final states belong to a new set , where denotes an infinite vector set with fixed vectors . In geometry, each subset may be viewed as a “compressed unit sphere” with two axes of and , see a schematic example shown in Fig.2.
IV Superposition of pure states in restricted sets
Recent schemes show that one may superpose unknown states with a fixed projector onto a known state 10 . Our goal in this section is to propose new superposing schemes for the input states in different restricted sets.
IV.1 Pure states in a finite set
In this subsection, we investigate the superposed states belonging to a finite set with . Note that the linear independence of the input states is a special case of the fixed overlap 10 ; Form . Unfortunately, the scheme proposed by Oszmaniec et al 10 is only sufficient. New schemes present the necessity of the superposition scheme when the input states belong to a finite set.
Theorem 6
Let be nonzero complex constants satisfying , then there exists a CP map for all the states in such that
[TABLE]
iff the vector representatives of are linearly independent, where the vector representative of is defined by and is a normalization constant, .
Proof of Theorem 6. Note that the vector representatives , , are linearly dependent iff the vectors are linearly dependent. Similar to the proof of Theorem 5, the necessity is easily followed from the linearity of quantum operations. Now we need to prove the existence of the CP map. Assume there exists a CP map satisfying Eq.(27). From Stinespring’s Theorem Stin , there exists a unitary map with the matrix representative , an ancillary state with vector representative on Hilbert space with , orthogonal states with the vector representatives on such that
[TABLE]
Here, is the success probability of recovering a superposed state with the vector representative , and satisfies which corresponds to the swapping of the input states. is the vector representative of a normalized failure state on with the probability that satisfies , .
For the input states and , taking the inner product of the vector representatives of the output states from Eq.(28), we can obtain
[TABLE]
where , , and . It may be briefly described as a matrix equation as follows
[TABLE]
where the matrices are respectively defined by
[TABLE]
and the rows or columns of the matrices are represented by two-bit series and , respectively.
It is sufficient to prove Eq.(30) with physically realizable matrix for the existence of the unitary map in Eq.(28). is positive definite and is Hermite. From Lemma 1, is positive definite when satisfies
[TABLE]
Therefore, there exists a unitary matrix such that
[TABLE]
where denote all the eigenvalues of and are positive. Denote , . So, is positive from Theorem 4 and then physically realizable. This completes the proof.
The bound of the efficiency may be proved from Eq.(29) as follows
[TABLE]
where , and . This is a new bound of the average efficiency in comparison to the bound in Eq.(26) because Theorem 6 cannot be proved from Theorem 5.
Combined with the probabilistic cloning or deleting of Theorem 5, we obtain a general theorem as follows:
Theorem 7
Let be nonzero complex constants satisfying , then there exists a CP map for all the states in such that
[TABLE]
iff the vector representatives of are linearly independent, where the vector representative of is defined by and is a normalization constant, ; and is an integer.
The proof is shown in Appendix E.
IV.2 Pure states in a restricted set
In this subsection, we generalize a previous overlap condition 10 and obtain new superposing schemes of unknown states when multiple copies of the input states are available.
Theorem 8
Let be nonzero complex constants satisfying , be a known pure state in Hilbert space with , and be an unknown qubit state with vector representative .
- (i)
There exists a CP map for all the states on satisfying the following inequalities
[TABLE]
such that
[TABLE]
where the vector representative of is defined by with and and is a normalization constant.
- (ii)
There exists a CP map for all the states in satisfying
[TABLE]
such that
[TABLE]
where the vector representative of is defined by with and and is a normalization constant.
Before proving this theorem, we want to present comparisons of the condition in Eq.(36) to the fixed overlap condition of Theorem 2 10 . It can be easily shown that the new condition in Eq.(36) holds for the fixed overlap condition 10 . However, the converse is not true. In particular, taking as an example, we obtain that and , where and , . An evaluated example is shown in Fig.3. There exist superposed states that satisfy Eq.(36) with the fixed state while they do not satisfy the condition of Theorem 2 10 with the fixed state . It is because that there are two different values of for some .
Proof of Theorem 8. The proof procedure is similar to that of the superposing scheme 10 . Define an auxiliary normalized vector , where is a normalization constant. Let , where
[TABLE]
where
[TABLE]
Here, , , denotes the identity operator, denotes the swapping operator of two pure states in the -th and -the subsystems, and is the partial trace over all the factors except the second. Its schematic circuit is shown in Fig.4, where one swapping operation is firstly used to obtain from . is completely positive and trace nonincreasing. The final state may be evaluated forward. The uniqueness is similar to that in Ref.10 except some different constructions, see Appendix E. The success probability is given by
[TABLE]
The map cannot be rescaled to increase the success probability because of operator inequality . If coefficients and are fixed, one may construct a new CP map with a higher probability, see Appendix F.
It is possible to generalize the superposing map for copies of the superposed states. The fixed state is defined in Hilbert space . For convenience, we make use of the permutation group consisting of all the permutation operations on a finite set with elements. For each permutation , there exists a general swapping operation induced by the permutation such that . In particular, let be a permutation operated on the index set . For each state (where subscripts denote the indexes of subsystems), then we define
[TABLE]
where denotes the permutation of index pairs according to the permutation operator . Let and .
Theorem 9
Let be nonzero complex constants satisfying , be a known pure state in Hilbert space with , and be an unknown qubit state on with vector representative . For . Then there exists a CP map for all pure states in satisfying
[TABLE]
such that
[TABLE]
where the vector representative of is defined by with and and is a normalization constant.
In Theorem 9, is the vector representative of the pure state , and is the vector representative of the pure state . The proof of this theorem is similar to that of Theorem 9, see Appendix G.
In general, we can superpose independent states as follows. Let , where is an integer satisfying for and for .
Corollary 4
Let be a known pure state on Hilbert space with , and be an unknown state in with vector representative . For any permutations , there exists a CP map for all pure states in satisfying
[TABLE]
such that
[TABLE]
where the vector representative of is defined by with and is a normalization constant.
In this corollary, is the vector representative of the pure state , . The proof is similar to that of Theorem 8, see Appendix H.
V Conclusions
We have firstly presented one theorem that may extend the no-superposing theorem to forbid superposing of an unknown state and a fixed state. This theorem has been generalized for multiple copies of the input states. The new no-go theorems include the no-cloning theorem, no-deleting theorem and no-superposing theorem as special cases. And then, we presented unified schemes of imperfect and perfect transforming (cloning and deleting) of the pure states in a finite set. Similar to the unambiguous state discriminations, all the schemes are completely characterized with the linear independence of the input states. Finally, new schemes are constructed to superpose unknown states. These superposing schemes are completed when some permutations of input states have fixed overlaps with a fixed state.
Acknowledgements
We thank the comments of reviewers. We thank the helps of Luming Duan and M. Orgun. This work was supported by the National Natural Science Foundation of China (No. 61303039), Sichuan Youth Science and Technique Foundation (No.2017JQ0048), Fundamental Research Funds for the Central Universities (Nos.2682014CX095, XDJK2016C043), Chuying Fellowship, CSC Scholarship, and EU ICT COST CryptoAction (No.IC1306).
Appendix A. Completing Proof of the Theorem 1
Assume that there exists a unitary map with the matrix representative satisfying Eq.(3) for all the unknown states on . For two basis states and , it follows that
[TABLE]
where the vector representative of is defined by . and are the output states of the ancillary system, and generally depend on the input states.
For each pure state with the vector representative satisfying , we obtain
[TABLE]
where the vector representative of is defined by and is a normalization constant, and is the output state of the ancillary system. Moreover, from the linearity of quantum operations and Eqs.(48) and (49), we obtain
[TABLE]
where the vector . Let with , . From Eqs.(50) and (51), we get , which is a contradiction to the assumption of .
Appendix B. Proof of Theorem 3
Similar to the proof of Theorem 2, we only need to prove the result for . Assume that there exists a unitary map with the matrix representative for all the states in such that
[TABLE]
where the vector representative of is defined by and is a normalization constant. is the vector representative of an ancillary state on Hilbert space with . and are the respective vector representative of orthogonal states and on probe space with . Let be a new state. From Eq.(52) it follows that
[TABLE]
where the vector representative of is defined by and is a normalization constant. Note that , i.e., the pure state is physically undiscriminating from the pure state . From Eq.(52) it follows that
[TABLE]
Eqs. (53) and (54) lead to , which is a contradiction to the assumption of .
Appendix C. The proof of inequality (26)
From Eq.(22) and the triangle inequality, we obtain
[TABLE]
Note that for all the complex constants with , we have , and from the equalities . Hence, from the arithmetic-geometric average inequality, Eq.(55) reduces to
[TABLE]
where , , and , and we have taken use of the equalities , . Denote with or . Since for , Eq.(56) yields to inequality (26).
Appendix D. The proof of inequality (34)
From Eq.(29) we obtain
[TABLE]
where the second inequality is derived from the inequality for , and the last equality is derived from the equalities , . By using the arithmetic inequality for and , Eq.(57) yields to inequality (34).
Appendix E. Proof of Theorem 7
Note that the vector representatives , , are linearly dependent if and only if the vectors are linearly dependent. Similar to the proof of Theorem 5, the necessity is easily followed from the linearity of quantum operations and the superposition principle. Now, we prove that these CP maps will be presented in a unified form with a nontrivial probability in the following. In fact, from Stinespring’s Theorem Stin , assume that there exists a unitary map with matrix representative such that
[TABLE]
Here, is the vector representative of an ancillary state on Hilbert space with . is the success probability of producing . are the vector representatives of orthogonal states on probe space with . is the vector representative of a normalized failure state on with the probability which satisfies , . Each CP map is defined by , .
For the input states and , taking the inner product of the vector representatives of the output states, it follows that
[TABLE]
where , , and for all integers and . Eq.(59) may be briefly represented by a matrix equation:
[TABLE]
where
[TABLE]
Here, the rows or columns of these matrices are represented by two-bit series or , respectively. It is sufficient to prove Eq.(60) with physical realizable matrices , . In fact, is positive definite from Theorem 4 because is positive definite from the linear independence of the vector representatives . The matrix is Hermite. From Lemma 1, the matrix is positive definite when matrices satisfy the following inequality
[TABLE]
Therefore, there exists a unitary matrix such that
[TABLE]
where are all the eigenvalues of , and satisfy . Define , , where , are positive constants and satisfy . So, is positive definite and then physically realizable, . This completes the proof.
In the following, the bound of the success probability is proved in terms of the state metric 14 . In detail, from Eq.(59) we obtain
[TABLE]
where the second inequality is derived from the inequality for , and the last equality is derived from the equalities for any integers and .
By using the arithmetic inequality for and , and the equality for all , Eq.(63) leads to
[TABLE]
where , and . The inequality has generalized the bound in Eq.(34).
Appendix F. Proof of the uniqueness of Theorem 8
In this appendix, we complete the proof of Theorem 8 according to the proof 10 . Let be an ancillary vector and and be states on , satisfy the conditions
[TABLE]
Let be a CP map satisfying
[TABLE]
where the vector representative is given by
[TABLE]
and is a normalization constant dependent of and , and . Let , form the Kraus decomposition of . Using the analogous procedure to Theorem 1 10 , we get
[TABLE]
up to a global normalization factor. Now consider the single Kraus operator . It follows that
[TABLE]
for all vectors , satisfying the condition in Eq.(65) and a constant which is dependent of and . This definition is unique up to a global factor. In detail, from the linearity of the left side of Eq. (68), is independent of and . Moreover, from the linearity of and Eq.(68), it follows that
[TABLE]
for arbitrary phases . Hence, we can assume the following form
[TABLE]
where is the vector representative of the state and , and are normalized orthogonal complements of . From Eq.(68) we obtain
[TABLE]
where the vectors , and . For normalized vectors and , the function
[TABLE]
is a smooth function on , where denotes the complex circle on . By inserting and in Eq.(73), from the Fourier transformation and the linearity of , it follows that
[TABLE]
Moreover, we obtain
[TABLE]
From Eqs.(77) and (78), should be independent of vectors and . It means that is a constant. Similar proof may be followed for the conditions and . This completes the proof.
The present proof also holds for and satisfying and , where . The superpositions are then generated with a probability . From the uniqueness result, it is impossible to generate superpositions for all input states with a nonzero overlap with .
We now present an explicit protocol to generate the superposition with a higher success probability 10 . Let , for a linear mapping defined by , where
[TABLE]
denotes the swapping operation of the -th and -th state in and is the vector representative of . The action of on the tensor of is given
[TABLE]
for all . With forward evaluations, we can obtain
[TABLE]
which shows that up a global factor. is trace non-increasing if and only if , i.e,
[TABLE]
The maximal eigenvalue of is given by
[TABLE]
The largest satisfying being non-increasing is . The success probability is
[TABLE]
Hence, if and only if
[TABLE]
for and .
Appendix G. Proof of Theorem 9
Define , where is a normalization constant. Given two permutations , for all the states satisfying and the states satisfying , we can define a CP map such that
[TABLE]
where vector representative with and and is a normalized constant, and the vector is given by . Let
[TABLE]
where , , and
[TABLE]
where denotes the identity operator on , denotes the identity operator on , is a swapping operator induced by the permutation in and performed on the last subsystems, . It is easy to get the result by forward evaluations from the input states .
Appendix H: Proof of Corollary 5
Define an ancillary vector
[TABLE]
where is a normalization constant. Let
[TABLE]
where , , and
[TABLE]
where denotes the identity operator on Hilbert space , denotes the identity operator on , is a swapping operator induced by the permutation in and performed on the last subsystems, . is used to change the vector into . is used to change the vector into , where with integers satisfying for and for . From forward evaluations, we can prove the results using the followed measurements induced by the operators and 10 .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) W. K. Wootters, and W. H. Zurek, Nature 299, 802(1982).
- 2(2) H. Barnum, C. M. Caves, C. A. Fuchs, R. Jozsa, and B. Schumacher, Phys. Rev. Lett. 76, 2818 (1996).
- 3(3) P. W. Shor, Phys. Rev. A 52, R 2493(R) (1995).
- 4(4) A. Steane, Proc. Roy. Soc. Lond. A 452, 2551 (1996).
- 5(5) C. H. Bennett, and G. Brassard, in Proceedings IEEE Int. Conf. on Computers, Systems and Signal Processing, Bangalore, India (IEEE, New Nork), p. 175, 1984.
- 6(6) P. W. Shor and J. Preskill, Phys. Rev. Lett. 85, 441 (2000).
- 7(7) H.-K. Lo and H. F. Chau, Science 283, 2050-2056(1999).
- 8(8) N. J. Cerf, M. Bourennane, A. Karlsson, and N. Gisin, Phys. Rev. Lett. 88(12), 127902 (2002).
