Nonlocality via multiqubit orthogonal product bases
Abstract
We investigate the quantum nonlocality via the discrimination on two, three and four-qubit orthogonal product bases (OPBs). We show that every two-qubit, and some three and four-qubit OPBs can be locally distinguished. It turns out that the remaining three and four-qubit OPBs cannot be locally distinguished, and thus they show the quantum nonlocality without entanglement. We also distinguish them by merging some systems using quantum teleportation with assisted Bell states.
PACS numbers: 03.65.Ud, 03.67.Mn
keywords: orthogonal product basis, multiqubit, teleportation
I INTRODUCTION
Quantum entanglement manifests quantum nonlocality, and plays a key role in quantum cryptography, computing and operations bennett1992communication ; barenco1995elementary ; paraiso2021photonic ; Schaetz2004quantum ; chen2005probabilistic ; mattle1996dense . In contrast, multipartite product states can be prepared under local operations and classical communications (LOCC) and are a kind of free resource in practice. They are closely related to the separability problem hhh96 , entanglement theory bds96 and resource theory faithful2022 . Nevertheless, a set of orthogonal product states such as unextendible product basis (UPB) may show quantum applications including the local indistinguishability BDF+99 ; AL01 and strong nonlocality quantum2021 , as well as unextendible product operator basis upob2022 . A special UPB, namely the so-called orthogonal product basis (OPB), spans the whole space containing the OPB. For example, every multiqubit space is spanned by a multiqubit OPB. So it is a physically operational to investigate the multiqubit space in terms of OPBs. Technically, one can construct infinitely many OPBs. The investigation on the construction and local distinguishability of some OPBs, as well as the connection to other notions like uncompletable product basis has been carried out in recent years dms03 ; Feng2009Characterizing ; cdjpa2017 ; Shi2022 , though a more complete picture is far from satisfaction yet. As far as we know, the local distinguishability of few qubit OPBs is incomplete.
On the other hand, quantum teleportation is a prominent application in quantum information bbc93 . Plenty of theoretical and experimental study has been devoted to the realization of teleportation in the past decades yeo2006teleportation ; agrawal2006perfect ; fiaschi2021optomechanical ; fonseca2019highdim ; graham2015superdense ; harris2021qt ; pirandola2017fundamental ; ren2017ground ; luo2019qt . Teleportation requires a Bell state as the necessary and sufficient quantum resource under LOCC. Teleportation can gather information of distributed systems at the cost of quantum entanglement. It indicates that teleportation may help distinguish OPBs of distributed systems.
In this paper, we locally distinguish -qubit OPBs when and . They have been fully classified in the paper cdjpa2017 . We investigate them in Theorems 5, 6 and 7, respectively. For this purpose, we present the notion of irreducible OPBs and their properties in Lemmas 3 and 4. Such OPBs show the quantum nonlocality without entanglement. Then we merge two systems of four-qubit OPBs by teleportation at the cost of one ebit, and are able to locally distinguish the resulting and OPBs. They are presented in Theorems 8 and 9, respectively. Our results show that the entanglement cost for local distinguishability of multiqubit OPBs might be constant in spite of the increase of qubit number.
The rest of this paper is organized as follows. In Sec. II we introduce the preliminary definitions and facts. In Sec. III, we show the local distinguishability of two-qubit, and some three and four-qubit OPBs. We also present the general condition. In Sec. IV, we investigate the local distinguishability of three and four-qubit OPBs by teleportation. Finally we conclude in Sec. V.
II PRELIMINARIES
We work with the -qubit system in , for and . We refer to the systems as and , respectively. They are practically short for Alice, Bob, Charlie and Daniel, respectively. We also refer to as a bipartite product state. One can similarly define a tripartite state and so on. An orthogonal product basis (OPB) in the -partite space is a set of orthogonal product states spanning the space. Evidently, every space has the trivial OPB . To efficiently classify OPBs, we say that two sets of -partite states and are equivalent when up to the system permutation there is a product unitary matrix such that, every vector satisfies that is proportional to a state in . Hence, every set equivalent to an OPB is still an OPB. Because unitary gates are realizable with certainty, the following observation is clear.
Lemma 1
Two equivalent OPBs are locally distinguishable at the same time.
As a result, we only need to distinguish one OPB out of a family of OPBs equivalent to the . In the following, we list a few examples of two and three-qubit OPBs.
(1) |
and
(2) |
Here, the star means shorthand for the submatrix , and so on. In other words, the stars in a matrix represent distinct submatrices. The first row of refers to the product state , and the matrix in (1) represents the two-qubit OPB consisting of and . The symbols refer to a qubit orthonormal basis , and we shall also refer to as a vector variable for simplicity. For convenience we may refer to as the orthogonal product matrix (OPM) of the two-qubit OPB. One can similarly refer to the OPM as the three-qubit OPB consisting of .
Actually, it has been proven that every two-qubit and three-qubit OPB is equivalent to an OPB of one of the OPMs in (1) and (2) in cdjpa2017 . The same reference has also classified four-qubit OPBs, while it is not easy to further classify -qubit OPBs with . We list the four-qubit OPBs as follows, because we will use them in the next sections.
Lemma 2
There are totally 33 four-qubit OPBs which are pairwise not equivalent. We list them as follows, namely matrices .
(27) | |||
(52) |
(71) |
(88) | |||
(105) |
(124) | |||
(143) |
(171) |
(190) |
(211) |
(232) |
(253) |
(282) |
(316) |
To conclude this section, we shall refer to an -partite OPB as an -reducible OPB when up to equivalence, the OPB consists of and , such that there is an integer , and for any and any , and is a set of -partite orthogonal product states for every . We shall say that is reducible when it is -reducible for some . If is not reducible, then we say that is irreducible. Then the following observation is clear.
Lemma 3
Every reducible OPB is the union of a few irreducible OPBs. Each irreducible OPB can be obtained by a local projection on the reducible OPB.
By definition, one can see that the irreducible OPBs are pairwise orthogonal. Each irreducible OPB span a subspace and .
Next we present the following fact.
Lemma 4
Suppose is an irreducible -partite OPB in . Then
(i) every state in the set has multiplicity at most ;
(ii) Counting multiplicity, a nonzero vector in is orthogonal to at most states in the set .
Proof.
(i) Because every two states in are orthogonal, the multiplicity of is at most . Suppose some has multiplicity exactly . Because every two states in are orthogonal, we obtain that is orthogonal to the remaining states in the set . So is reducible. It is a contradiction with the fact that is irreducible. Hence, has multiplicity at most .
(ii) Let be a nonzero vector in and . Suppose is orthogonal to states in the set . Up to a subscript permutation, we may assume that they are . Because are orthogonal product states, they span a subspace , where . Because the subspace is orthogonal to , we obtain that . Hence, is -reducible. It is a contradiction with the hypothesis that is irreducible. Hence, is orthogonal to at most states in the set .
Based on above-mentioned facts, in the next two sections we locally distinguish some OPBs including two, three and four-qubit OPBs. We shall also show the indistinguishability of more OPBs without entanglement.
III Local distinguishability of two-qubit, and some three and four-qubit OPBs
In this section, we shall not spend quantum entanglement in any discrimination protocols. We show that every two-qubit OPB is locally distinguishable in Theorem 5. We further investigate the distinguishability of three-qubit OPBs in Theorem 6. We also investigate the local distinguishability of four-qubit OPBs in Theorem 7.
Theorem 5
Every two-qubit OPB is locally distinguishable.
Proof.
Using Lemma 1, it suffices to distinguish the OPB with first OPM in (1). As the first step, Alice performs the POVM on her particle. If the measurement result is , then she informs Bob of the result, so that Bob measures his particle by the POVM . Similarly, if the measurement result is , then Alice informs Bob of the result, so that Bob measures his particle by the POVM . In both case, Bob can obtain the final result, and thus finishes the discrimination task.
The result is heavily based on the simple classification of two-qubit OPBs. The case becomes more complex for three-qubit OPBs, as we show below.
Theorem 6
(i) The three-qubit OPB equivalent to in (1) is locally indistinguishable when none of the vector variables are in .
(ii) The three-qubit OPB equivalent to in (1) is locally distinguishable when one of is in .
(iii) The three-qubit OPBs equivalent to and in (2) are locally distinguishable.
Proof.
(i), (ii) First of all, we show that in (1) is locally indistinguishable when none of the vector variables are in . One can show that, if we switch the columns of the second OPM in (1), then by switching and by a local unitary gate , the OPM is unchanged. Hence, it suffices to show that, cannot be locally distinguished by starting with Alice. Suppose Alice performs the POVM on , such that . Then the resulting states become To make the resulting states of system distinguishable, they should be pairwise orthogonal. Hence the order-two positive semidefinite matrix is diagonal. Next, the orthogonality between and implies that is a scalar matrix. Hence, it is impossible to distinguish under LOCC.
On the other hand, if one of is in , then evidently becomes or . We shall show that they are both locally distinguishable below.
(iii) Next we distinguish the three-qubit OPB . Suppose Alice performs the POVM . If the measurement result is then (2) implies that system are in a state of the two-qubit OPB . It is distinguishable in terms of Lemma 1. On the other hand if the measurement result is , then (2) implies that system are in a state of the two-qubit OPB . It is distinguishable in terms of Lemma 1. We have shown that the three-qubit OPB in (2) is distinguishable. One can similarly show that the three-qubit OPB in (2) is distinguishable. We have proven the assertion.
The fact shows that due to the increasing complexity of three-qubit system, one cannot locally distinguish all three-qubit OPBs. So the nonlocality without entanglement can be manifested by the three-qubit OPBs in (1). This observation can also be extended to four-qubit OPBs in (27)-(316) by a more involved argument, as we show below.
Theorem 7
Proof.
(i) One can verify that, each of the six OPBs can be written as with equivalent to or in (2). They are locally distinguishable by Theorem 6 (iii).
(ii) When the system performs the POVM , the remaining three systems may be in a state from the OPB or . It follows from Theorem 6 that and are both locally distinguishable. So the assertion holds.
(iii) Let be one of the OPBs . We use the POVM such that for every . Note that is non-unitary, otherwise it is meaningless to perform . If does not kill and , then one can see that any one of the resulting set has more than eight product states. So it is impossible for Bob, Charlie and Daniel to distinguish the resulting set. On the other hand, if kills or , then the resulting set also has more than eight product states. So it is impossible for Bob, Charlie and Daniel to distinguish the resulting set.
So far, we have constructed some locally non-distinguishable three and four-qubit OPBs, and thus we have derived the nonlocality from them. They can be distinguished only by using quantum protocols assisted by entanglement, such as teleportation. We shall proceed with this idea in the next section.
IV Local distinguishability of three and four-qubit OPBs assisted by quantum teleportation
In this section, we locally distinguish three and four-qubit OPBs using one ebit. It is known that every OPB is reducible and locally distinguishable BDF+99 . By teleportation, one can merge two systems. So we have the following fact.
Theorem 8
Every three-qubit OPB in (1) is locally distinguishable by using one ebit.
In the following we distinguish four-qubit OPBs in (71)-(316) assisted by entanglement. Evidently, two ebits are sufficient, because they can be used to teleport the qubits and to system at the same time. Nevertheless, two ebits may be not necessary for some four-qubit OPBs in (71)-(316). For example, we only need merge system in the four-qubit OPB and in (71), by using one ebit via quantum teleportation. In the following, we investigate the local distinguishability of OPBs in (88)-(316).
Theorem 9
Proof.
We prove the assertion for only, and one can similarly prove the assertion for . Suppose Alice obtains the qubit of Bob by teleportation. So Alice can measure both of the first two qubits, by using the POVM . If the measurement result is then C and D can distinguish the remain state from . On the other hand, if the measurement result is then Charlie measures the remaining 12 states using the POVM . They respectively result in two sets of six orthogonal tripartite product states, which can be locally distinguished. We have finished the proof for the assertion with .
V CONCLUSIONS
In this paper, using the existing two, three and four-qubit OPBs, we have classified them into OPBs of local distinguishability and non-distinguishability. We have also managed to distinguish every three and four-qubit OPBs using teleportation assisted by Bell states. Some problems arise from this paper. One need distinguish five-qubit OPBs, though they are not fully classified in literature yet as far as we know. Besides, the connection between some OPBs and quantum security may be further studied based on their local non-distinguishability. Further, evaluating the necessary cost of quantum entanglement in system merge of multiqubit OPBs remains an involved problem. Another open problem is whether every irreducible OPB is locally indistinguishable.
Acknowledgments
LC was supported by the NNSF of China (Grant No. 11871089), and the Fundamental Research Funds for the Central Universities (Grant Nos. KG12040501, ZG216S1810 and ZG226S18C1).
Conflict of interest statement
On behalf of all authors, the corresponding author states that there is no conflict of interest.
Data availability statement
All data, models, and code generated or used during the study appear in the submitted article.
References
- [1] Bennett and Wiesner. Communication via one- and two-particle operators on einstein-podolsky-rosen states. Physical Review Letters, 69(20):2881–2884, 1992.
- [2] Barenco, Bennett, Cleve, et al. Elementary gates for quantum computation. Physical Review. A, 52(5):3457–3467, 1995.
- [3] Taofiq K. Paraiso, Thomas Roger, Davide G. Marangon, et al. A photonic integrated quantum secure communication system. Nature Photonics, 15(11):850–856, 2021.
- [4] T. Schaetz, M. D. Barrett, D. Leibfried, et al. Quantum dense coding with atomic qubits. Physical Review Letters, 93(4), 2004.
- [5] Lin Chen and Yi-Xin Chen. Probabilistic implementation of a nonlocal operation using a nonmaximally entangled state. Physical Review A, 71:054302, 2005.
- [6] Klaus Mattle, Harald Weinfurter, Paul G. Kwiat, and Anton Zeilinger. Dense coding in experimental quantum communication. Physical Review Letter, 76:4656–4659, Jun 1996.
- [7] M. Horodecki, P. Horodecki, and R. Horodecki. Separability of mixed states: necessary and sufficient conditions. Physics Letters A, 223:1–8, February 1996.
- [8] C. H. Bennett, D. P. Divincenzo, J. A. Smolin, and W. K. Wootters. Mixed-state entanglement and quantum error correction. Phys. Rev. A, 54:3824–3851, November 1996.
- [9] Jun Li and Lin Chen. Faithful coherent states. Phys. Rev. A, 106:032412, Sep 2022.
- [10] Charles H. Bennett, David P. DiVincenzo, Christopher A. Fuchs, Mor Tal, Rains Eric, Peter W. Shor, John A. Smolin, and William K. Wootters. Quantum nonlocality without entanglement. Physical Review A, 59:1070–1091, Feb 1999.
- [11] Noga Alon and László Lovász. Unextendible product bases. Journal of Combinatorial Theory, Series A, 95(1):169–179, 2001.
- [12] Fei Shi, Mao-Sheng Li, Mengyao Hu, Lin Chen, Man-Hong Yung, Yan-Ling Wang, and Xiande Zhang. Strongly nonlocal unextendible product bases do exist. QUANTUM, 6, JAN 5 2022.
- [13] Mengyao Hu, Lin Chen, Fei Shi, Xiande Zhang, and Jordi Tura. Unextendible product operator basis. Journal of Mathematical Physics, 63(12):122202, 2022.
- [14] D. P. DiVincenzo, T. Mor, P. W. Shor, J. A. Smolin, and B. M. Terhal. Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement. Communications in Mathematical Physics, 238:379–410, 2003.
- [15] Feng, Yuan, Shi, and Yaoyun. Characterizing locally indistinguishable orthogonal product states. IEEE Trans. Inform. Theory, 55(6):2799–2806, 2009.
- [16] Lin Chen and Dragomir Z Djokovic. Orthogonal product bases of four qubits. Journal of Physics A: Mathematical and Theoretical, 50(39):395301, 2017.
- [17] Fei Shi, Mao-Sheng Li, Xiande Zhang, and Qi Zhao. Unextendible and uncompletable product bases in every bipartition. New Journal of Physics, 24(11):113025, nov 2022.
- [18] Charles H. Bennett, Gilles Brassard, Claude Crépeau, Richard Jozsa, Asher Peres, and William K. Wootters. Teleporting an unknown quantum state via dual classical and einstein-podolsky-rosen channels. Phys. Rev. Lett., 70:1895–1899, Mar 1993.
- [19] Y. Yeo and W. K. Chua. Teleportation and dense coding with genuine multipartite entanglement. Physical Review Letters, 96(6), 2006.
- [20] Pankaj Agrawal and Arun Pati. Perfect teleportation and superdense coding with w states. Physical Review A, 74(6), 2006.
- [21] Niccolo Fiaschi, Bas Hensen, Andreas Wallucks, et al. Optomechanical quantum teleportation. Nature Photonics, 15(11):817–821, 2021.
- [22] Alejandro Fonseca. High-dimensional quantum teleportation under noisy environments. Physical Review A, 100(6), 2019.
- [23] Trent M. Graham, Herbert J. Bernstein, Tzu-Chieh Wei, et al. Superdense teleportation using hyperentangled photons. Nature Communications, 6, 2015.
- [24] Glen I. Harris and Warwick P. Bowen. Quantum teleportation from light to motion. Nature Photonics, 15(11):792–793, 2021.
- [25] Stefano Pirandola, Riccardo Laurenza, Carlo Ottaviani, et al. Fundamental limits of repeaterless quantum communications. Nature Communications, 8, 2017.
- [26] Ji-Gang Ren, Ping Xu, Hai-Lin Yong, et al. Ground-to-satellite quantum teleportation. Nature, 549(7670):70–73, 2017.
- [27] Yi-Han Luo, Han-Sen Zhong, Manuel Erhard, et al. Quantum teleportation in high dimensions. Physical Review Letters, 123:070505, Aug 2019.