Separability criteria via some classes of measurements
Lu Liu, Ting Gao, Fengli Yan

TL;DR
This paper develops new separability criteria for quantum systems using generalized measurements like MUMs and GSIC, which are more effective and experimentally feasible than previous methods.
Contribution
It introduces novel separability criteria based on MUMs and GSIC measurements applicable to diverse quantum systems, improving detection efficiency.
Findings
Criteria outperform previous methods in mixed-dimension systems
No full quantum state tomography needed for implementation
Effective for bipartite and multipartite multi-level systems
Abstract
Mutually unbiased bases (MUBs) and symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) are two related topics in quantum information theory. They are generalized to mutually unbiased measurements (MUMs) and general symmetric informationally complete (GSIC) measurements, respectively, that are both not necessarily rank 1. We study the quantum separability problem by using these measurements and present separability criteria for bipartite systems with arbitrary dimensions and multipartite systems of multi-level subsystems. These criteria are proved to be more effective than previous criteria especially when the dimensions of the subsystems are different. Furthermore, full quantum state tomography is not needed when these criteria are implemented in experiment.
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.
Separability criteria via some classes of measurements
Lu Liu1
Ting Gao1
Fengli Yan2
1College of Mathematics and Information Science, Hebei Normal University, Shijiazhuang 050024, China, 2College of Physics Science and Information Engineering, Hebei Normal University, Shijiazhuang 050024, China
Abstract
Mutually unbiased bases (MUBs) and symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) are two related topics in quantum information theory. They are generalized to mutually unbiased measurements (MUMs) and general symmetric informationally complete (GSIC) measurements, respectively, that are both not necessarily rank 1. We study the quantum separability problem by using these measurements and present separability criteria for bipartite systems with arbitrary dimensions and multipartite systems of multi-level subsystems. These criteria are proved to be more effective than previous criteria especially when the dimensions of the subsystems are different. Furthermore, full quantum state tomography is not needed when these criteria are implemented in experiment.
Entangled states, mutually unbiased measurements, mutually unbiased bases, general symmetric informationally complete POVMs
pacs:
03.67.Mn, 03.65.Ud
I Introduction
The concept of entanglement plays a central role in quantum physics and quantum information science, which has been investigated rapidly in recent years Horodecki09 ; Nielsen ; Guhne09 . It has numerous applications ranging from quantum cryptography PRL67.661 ; 77.2816 ; r1 ; r2 ; GYJPA05 ; r4 ; r5 , quantum teleportation PRL70.1895 ; GYEPL08 to dense coding PRL69.2881 , and other quantum information processing r3 ; r4 ; r5 ; r6 ; r7 ; r8 ; r9 ; r10 . One of the important tasks of the theory of quantum entanglement is to characterize entanglement. Although many important results have been obtained for bipartite systems PRL77.1413 ; QIC3.193 ; PRA59.4206 ; PRL99.130504 and multipartite systems PRL.113.100501 ; PRA.82.062113 ; EPJD.61.765 ; NJP.12.053002 ; QIC.10.829 ; PRL.112.180501 ; EPL.104.20007 ; PRA.93.042310 ; PRA.86.062323 , a general theory remains elusive because of the complexity of entanglement. Recently, because of its significant role in quantum information processing, much effort has been devoted to investigate various measurements that can be used for the detection of entanglement of unknown quantum states.
Mutually unbiased bases (MUBs) represent maximally non-commutative measurements. They were used for detecting entangled states in two-qudit quantum systems PRA.86.022311 . However, when is not a prime power, the maximum number of MUBs remains open 1409.3386[11] , which makes the criterion becomes less effective.
Mutually unbiased measurements (MUMs) were generalized from MUBs NJP.16.053038 and include the complete set of MUBs as a special case. The existence of MUMs does not depend on the dimension of the system, and a complete set of MUMs were constructed for arbitrary finite dimensional Hilbert space in Ref.NJP.16.053038 . They were used to construct separability criteria in bipartite finite dimensional systems PRA.89.064302 ; 1407.7333 .
The notion of symmetric informationally complete (SIC) positive operator-valued measurements (POVMs) is another related topic in quantum information theory. It was generalized to general symmetric informationally complete (GSIC) measurements, of which the complete sets were constructed in all finite dimensions without requirement that the rank of each measurement operator is one 1305.6545 . A separability criterion for -dimensional bipartite systems via GSIC-POVMs was presented in Ref.1406.7820 .
In Ref.PRA.91.012326 , three separability criteria were proposed based on , where is a bipartite density matrix in and is the reduced density matrix of the first (second) subsystem.
Most of the criteria using MUBs, MUMs, GSIC-POVMs mentioned above are for -dimensional bipartite systems, of which the subsystems should be with the same dimension. We obtained separability criteria on arbitrary high-dimensional bipartite systems of a -dimensional subsystem and a -dimensional subsystem, and multipartite systems of multi-level subsystems SR ; 1512.02853 such that the criteria for -dimensional bipartite systems in Ref.1407.7333 ; PRA.91.012326 are the special cases of ours. However, the criteria in SR ; 1512.02853 are not efficient enough because the bounds are not tight. Thus, how to use the sets of these measurements to detect entanglement more efficiently still need to be considered.
In this paper, we study the separability problem via sets of MUMs and propose more effective separability criteria for systems. Without difficulty, our method can be used to construct separability criteria via MUBs and GSIC-POVMs in systems or high-dimensional multipartite systems.
II MAIN RESULTS
For the bipartite system of subsystems with different dimensions, the complete sets of MUMs cannot be used to detect the separability of quantum states in Ref.SR . This problem will be discussed and we obtain the following conclusions.
Theorem 1. Let be a density matrix in , without loss of generality let , . () are any sets of () on () with efficiency parameter (), where , , and . Define
[TABLE]
If is separable, then
[TABLE]
Proof. It’s only needed to consider a pure separable state , since is a linear function of . We have
[TABLE]
where the inequality 1407.7333
[TABLE]
is used. This completes the proof.
Theorem 1 is more effective than Theorem 2 in Ref.SR as long as the two subsystems have different dimensions, which can be used for a wider range of application. In Theorem 1, and can be different, while in Theorem 2 in Ref.SR , they are equal. When , by Theorem 1, we obtain that if the left hand side of (2) is larger than , then is entangled, while by Theorem 2 in Ref.SR , one can derive that if the left hand side of (2) is larger than , then is entangled. That is, Theorem 1 detects states , for \begin{array}[]{ll}J(\rho)=\max\limits_{\begin{subarray}{c}\{Q_{n_{p}}^{(b_{q})}\}\subseteq\mathcal{Q}^{(b)}\end{subarray}}\sum\limits_{b=1}^{M}\sum\limits_{q=1}^{t}\sum\limits_{n=1}^{d}\sum\limits_{p=1}^{s}\mathrm{Tr}(P_{n}^{(b)}\otimes Q_{n_{p}}^{(b_{q})}\rho)\end{array}>\frac{s}{2}(\frac{M-1}{d}+\kappa_{1})+\frac{1}{2}(\frac{M-1}{d^{\prime}}+\kappa_{2}), as entangled, whereas Theorem 2 in Ref.SR detects them only for \begin{array}[]{ll}J(\rho)=\max\limits_{\begin{subarray}{c}\{Q_{n_{p}}^{(b_{q})}\}\subseteq\mathcal{Q}^{(b)}\end{subarray}}\sum\limits_{b=1}^{M}\sum\limits_{q=1}^{t}\sum\limits_{n=1}^{d}\sum\limits_{p=1}^{s}\mathrm{Tr}(P_{n}^{(b)}\otimes Q_{n_{p}}^{(b_{q})}\rho)\end{array}>\frac{s}{2}[(\frac{M-1}{d}+\kappa_{1})+(\frac{M-1}{d^{\prime}}+\kappa_{2})]. Therefore, Theorem 1 is better than Theorem 2 in Ref.SR , especially when the difference of the dimensions of two subsystems is very large. What’s more, no term is needed to be ignored by Theorem 1 when is a multiple of and is a multiple of , so that Theorem 1 is much more effective. When and , we can detect entangled states using complete sets of MUMs by Theorem 1.
With the help the Cauchy-Schwarz inequality, we can obtain stronger bound than that in Theorem 1.
Theorem 2. Let be a density matrix in , without loss of generality let , , and and be any two sets of and on and with efficiency parameters , , respectively, where , and , . If is separable, then it satisfies the following inequality
[TABLE]
Here is defined the same as in Theorem 1.
Proof. For a pure separable state , we get
[TABLE]
where the Cauchy-Schwarz inequality and the inequality (4) are used. It is easily to see that is a linear function of , so the inequality (5) holds for separable mixed states. This completes the proof.
The bound in Theorem 2 is lower than that in Theorem 1 since \sqrt{ts(\frac{M-1}{d}+\kappa_{1})}\sqrt{\frac{M^{\prime}-1}{d^{\prime}}+\kappa_{2}}\leq\frac{1}{2}\big{(}ts(\frac{M-1}{d}+\kappa_{1})+\frac{M^{\prime}-1}{d^{\prime}}+\kappa_{2}\big{)}.
With the same method, we can obtain separability criteria using MUBs and GSIC-POVMs.
Theorem 2 ′(MUBs). Let be a density matrix in , without loss of generality let , , and , be two sets of MUBs on , , respectively, where , , and . Define
[TABLE]
If is separable, then
[TABLE]
Proof. For separable state , where and are pure states in and , respectively, there is
[TABLE]
where the inequality PRA.79.022104
[TABLE]
is used. This completes the proof.
By an analogous argument as Theorem 2 and using the inequality PS89.085101
[TABLE]
we get the following result.
Theorem 2 ′′(GSIC-POVMs). Let be a density matrix in , without loss of generality let , , and , are two sets of GSIC-POVMs on , with efficiency parameters , , respectively. Define
[TABLE]
If is separable, then
[TABLE]
Inspired by the separability criteria based on the operators PRA.91.012326 ; 1512.02853
[TABLE]
where is an even number, , and () denotes that both sides of bipartite partition contain odd (even) number of parties, we deduce the next theorem.
Theorem 3. Let be a density matrix in , without loss of generality let , , and and be any two sets of and on and with efficiency parameters , , respectively, where , and , . Define
[TABLE]
The following inequality
[TABLE]
holds for separable states .
Proof. Note that for any separable state , can be written as the form of PRA.77.060301
[TABLE]
where and are the pure states density matrix acting on the first and second subsystem, respectively. There is
[TABLE]
as required.
To show that Theorem 3 is stronger than Theorem 1, we only need to prove that the inequality (2) holds if (15) holds. In fact, inequality(15) implies that
[TABLE]
Thus, the inequality (2) holds.
The separability criteria in Ref.PRA.86.022311 ; PRA.89.064302 ; 1407.7333 ; 1406.7820 are all only applied for quantum systems of subsystems with the same dimension. For that with different dimensions, we obtained separability criterion in Ref.SR , which was discussed less efficient than the criteria in this paper. In brief, the criteria we present here is more efficient and wider range of application.
Noting the significance of the study on multiparty quantum entanglement, especially in higher-dimensional systems, we generalize our criteria to high dimensional multipartite systems.
Theorem 4. Suppose that is a density matrix in , are any sets of MUMs on with the efficiency parameter , and , where , . Define
[TABLE]
where . For any fully separable state , it satisfies the following inequalities:
[TABLE]
[TABLE]
Proof. Let with , be a fully separable density matrix, where are pure states in . Note that , by using Lemma 1 of Ref.SR , we have
[TABLE]
where the inequality (4) is used. It follows that
[TABLE]
i.e. inequality (17) holds.
By the Cauchy-Schwarz inequality and the relation (4), we deduce that
[TABLE]
It implies that
[TABLE]
which completes the proof of inequality (18).
Theorem 4*′*. Suppose that is a density matrix in , be a set of MUBs on , where , and , where , . Define
[TABLE]
then any fully separable state satisfies
[TABLE]
Theorem 4*′′*. Suppose that is a density matrix in , is a set of GSIC-POVMs on , with efficiency parameter , and , where . Define
[TABLE]
then every fully separable state satisfies
[TABLE]
Using the above two bounds, not only multilevel multiparticle genuine entangled states, but also -nonseparable states can be detected with the same method detailed discussed in Ref.1512.02853 .
III Conclusion and discussions
Mutually unbiased measurements (MUMs) have been used to investigate entanglement detection and we obtained separability criteria for bipartite systems composed of a -dimensional subsystem and a -dimensional subsystem via sets of MUMs. The previous criteria are improved by taken into account more terms which were ignored before, leading to more effective bounds as we have proved. Moreover it should be noted that the method could be used to obtain some separable criteria via other measurements, such as MUBs and GSIC-POVMs as discussed. Noting the importance of the study on multiparty quantum entanglement, especially in higher-dimensional systems more than qubits, we have generalized our criteria to high dimensional multipartite systems presented in this paper, ameliorating the corresponding ones obtained previously 1512.02853 . These criteria is computationally simple and provide experimental implementation in detecting entanglement without full quantum state tomography, requiring only a few local measurements. It is worth noting that many other separability criteria may be improved with the method proposed in this paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Rev. Mod. Phys. 81 , 865 (2009).
- 2(2) M. A. Nielsen, and I. L. Chuang, Quantum Computation and Quantum Information (Academic, Cambridge, 2000).
- 3(3) O. Gühne, and G. Tóth, Phys. Rep. 474 , 1 (2009).
- 4(4) A. Ekert, Phys. Rev. Lett. 67 , 661 (1991).
- 5(5) D. Deutsch, A. Ekert, R. Jozas, C. Macchiavello, S. Popescu, and A. Sanpera, Phys. Rev. Lett. 77 , 2818 (1996).
- 6(6) M. Hillery, V. Buz̆ek, and A. Berthiaume, Phys. Rev. A 59 , 1829 (1999).
- 7(7) G. L. Long, and X. S. Liu, Phys. Rev. A 65 , 032302 (2002).
- 8(8) T. Gao, F. L. Yan, and Z. X. Wang, J. Phys. A 38 , 5761 (2005).
