Optimal Verification of Two-Qubit Pure States
Kun Wang, Masahito Hayashi

TL;DR
This paper determines the optimal measurement strategies for verifying two-qubit pure states across various classes of LOCC and separable measurements, revealing two-way LOCC's equivalence to separable measurements in effectiveness.
Contribution
It provides the first complete characterization of optimal verification strategies for two-qubit pure states among LOCC and separable measurement classes.
Findings
Two-way LOCC matches separable measurements in verification efficiency.
Two-way LOCC outperforms one-way LOCC in state verification.
Optimal strategies depend on measurement class constraints.
Abstract
In a recent work [Phys. Rev. Lett. 120, 170502 (2018)], Pallister et al. proposed an optimal strategy to verify non-maximally entangled two-qubit pure states under the constraint that the accessible measurements being locally projective and non-adaptive. Their nice result leads naturally to the question: What is the optimal strategy among general LOCC measurements? In this Letter, we answer this problem completely for two-qubit pure states. To be specific, we give the optimal strategy for each of the following available classes of measurements: (i) local operations and one-way classical communication (one-way LOCC) measurements; (ii) local operations and two-way classical communication (two-way LOCC) measurements; and (iii) separable measurements. Surprisingly, our results reveal that for the two-qubit pure state verification problem, two-way LOCC measurements remarkably outperforms…
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.
Optimal Verification of Two-Qubit Pure States
Kun Wang
Department of Computer Science and Technology, State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, 210093, China
Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, China
Masahito Hayashi
Graduate School of Mathematics, Nagoya University, Nagoya, 464-8602, Japan
Shenzhen Institute for Quantum Science and Engineering, Southern University of Science and Technology, Shenzhen, 518055, China
Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, 117542, Singapore
Abstract
In a recent work [Phys. Rev. Lett. 120, 170502 (2018)], Pallister et al. proposed an optimal strategy to verify non-maximally entangled two-qubit pure states under the constraint that the accessible measurements being locally projective and non-adaptive. Their nice result leads naturally to the question: What is the optimal strategy among general LOCC measurements? In this Letter, we answer this problem completely for two-qubit pure states. To be specific, we give the optimal strategy for each of the following available classes of measurements: (i) local operations and one-way classical communication (one-way LOCC) measurements; (ii) local operations and two-way classical communication (two-way LOCC) measurements; and (iii) separable measurements. Surprisingly, our results reveal that for the two-qubit pure state verification problem, two-way LOCC measurements remarkably outperforms one-way LOCC measurements and has the same power as the separable measurements.
*Introduction.—*On the way to quantum era, quantum devices for generating particular states have been extensively studied and widely used Monz et al. (2011); Wang et al. (2016); Song et al. (2017); Friis et al. (2018). As so, it becomes necessary to verify that these devices truly work as they are specified reliably and efficiently with measurements that are accessible. A standard approach is to estimate the output states with quantum state tomography Helstrom (1976); Holevo (1982); Hayashi (1997); Gill and Massar (2000); Gross et al. (2010); Sugiyama et al. (2013); O’Donnell and Wright (2016); Haah et al. (2017). However, this method is both time-consuming and computationally difficult, even verifying a few-qubit photonic state is already experimentally challenging Häffner et al. (2005); Carolan et al. (2014). Various non-tomographic approaches have been designed for this task Tóth and Gühne (2005); Flammia and Liu (2011); da Silva et al. (2011); Hayashi and Morimae (2015); Takeuchi and Morimae (2018); Morimae et al. (2017); Takeuchi et al. ; Zhu and Hayashi , using only local measurements. Though these methods achieve considerable efficiency, no optimal method except for the maximally entangled state Hayashi et al. (2006a, b, 2008); Hayashi (2009) is known so far.
Given the intrinsic difficulty in state verification, in this Letter we focus on verifying the non-maximally entangled two-qubit pure states, in hopes of gaining deeper understanding on the verification problem. These states find wide applications in quantum information theory (Gisin, 2009, Section 3.3), making their verification important both from the theoretical and the experimental points of view. Specially, we construct optimal strategies when different classes of measurements are available: one-way LOCC measurements, two-way LOCC measurements, and separable measurements. We find that for the problem under consideration, two-way LOCC measurements achieves the same performance as that of separable measurements, while outperforms one-way LOCC measurements dramatically.
Before presenting the results, we review the notations. We denote by and the eigenstates of the Pauli operator, by and the eigenstates of the Pauli operator. When measuring a qubit with a Pauli operator, the outcome is written as where . We denote by the two-qubit composite system and by the identity operator on . We say a positive operator with a one-way LOCC (local operations and only one-way classical communication) POVM element on if the two-outcome POVM can be implemented by one-way LOCC. We also define a two-way LOCC (local operations and two-way classical communication) POVM element and a separable POVM element in the same way by using the two-way LOCC and the separable operations, respectively. Interested readers might refer to Hayashi (2016) for details on these operations. We write the set of one-way LOCC from Alice to Bob, one-way LOCC from Bob to Alice, two-way LOCC, and separable POVM elements as , , , and . These classes satisfy the relation . The condition is equivalent to the condition , where . For a positive operator on , denotes the -th eigenvalue of and denotes the -th largest eigenvalue of , where .
*Two-qubit pure state verification.—*Consider a quantum device that is designed to produce the two-qubit pure state
[TABLE]
where . However, it might work incorrectly and actually outputs states in runs. It is promised the fidelity is either or satisfies for all for some . The task is to determine which is the case. The conclusion is useful if we assume the next state has the same behavior as the previous ones.
To achieve this task, we perform two-outcome measurements from a set of accessible measurements to test the state. Each two-outcome measurement is specified by an operator , which corresponds to passing the test, and is performed with probability . We require that the target state always passes the test, that is, for all . In the bad case, the maximal probability that passes the test is given by Pallister et al. (2018); Zhu and Hayashi
[TABLE]
where is called an strategy. After runs, in the bad case can pass all tests with probability at most . Hence to achieve confidence , it suffices to take Pallister et al. (2018)
[TABLE]
The optimal strategy is obtained by minimizing the second largest eigenvalue . If there is no restriction on the accessible measurements, the optimal strategy is given by the measurement , under which , , and . This efficiency cannot be improved if collective measurements are allowed Zhu and Hayashi . However, it is difficult to perform such measurements experimentally when is entangled. It is thus meaningful to devise efficient (or even optimal) strategies based on measurements satisfying reasonable constraints. Owari and Hayashi Owari and Hayashi (2008) studied the case where the incorrect states are the maximally mixed state, with the target to minimize the trace of . They derived optimal strategies when one-way LOCC and separable measurements are available, and showed that two-way LOCC measurements remarkably improves the performance compared to one-way LOCC measurements. Recently, Pallister, Linden, and Montanaro Pallister et al. (2018) proposed an optimal strategy to verify , under the constraint that the accessible measurements must be locally projective and non-adaptive. The strategy pal has the second largest eigenvalue
[TABLE]
Note that the set of accessible measurements in Pallister et al. (2018) forms a strict subset of .
These interesting results lead to the question: What is the optimal strategy when general LOCC measurements, adaptive choices of local measurements are available? In this paper, we investigate this problem comprehensively. We derive optimal strategies for verifying when the following different classes of measurements are available: , , , and . In the following, we say a strategy is in and written if and for all , a strategy is optimal in if and for arbitrary satisfying , .
Here we discuss some general properties of arbitrary strategy . Consider the product of local unitaries , where and . Let , then are the four eigenstates of . Using this property we can simplify the form of by averaging, where the averaged strategy is defined as
[TABLE]
Since the second largest eigenvalues of and are the matrix norms of and with , we have . That is, averaging over cannot make the strategy worse. As and the vectors and of have different eigenvalues from that of and , after averaging can be expressed as
[TABLE]
for some . We also consider the fact that is invariant under qubits swapping. Using the swapping operation for the roles of Alice and Bob, the resulting strategy has performance at least as good as that of and admits the form
[TABLE]
for some . We should be careful when using the swapping invariance property, as to implement the strategy , an extra step of messaging is required.
The above discussed framework is non-adversarial in the sense that the malicious device produces incorrect states randomly and independently. One may also consider the adversarial scenario where the malicious device may produce an arbitrary state on the whole system Zhu and Hayashi . The task is then to ensure that the reduced state on one system has fidelity larger than by performing tests on other systems. We remark that minimizing the second largest eigenvalue leads the optimization of the strategy even in this scenario.
*Strategy using one-way LOCC measurements.—*First we propose a strategy in . Then we show it is optimal when only are available.
Let . Alice performs the X measurement on the target state and sends outcome to Bob. If , Bob performs measurement and accepts if the outcome is . If , Bob performs measurement and accepts if the outcome is . The corresponding POVM element (passing the test) has the form
[TABLE]
We define other two POVM elements and similarly to but with the X measurement replaced by the Y and Z measurements on Alice’s side, respectively. These two elements read
[TABLE]
where . It holds that and for .
The one-way strategy goes as follows. In each round, Alice chooses a measurement from with a prior probability to test the state, where is a free parameter. The strategy has the form
[TABLE]
Minimizing w.r.t. , we get and
[TABLE]
where and . Obviously, .
Now we show the optimality of . Let , where and . When a one-way LOCC strategy detects with certainty, the strategy is composed of Alice’s POVM with some probability distribution and Bob’s two-outcome measurements , where is the normalized vector of . Then, the strategy is written as
[TABLE]
Following the averaging argument in Eq. (4), we get , obtained from . For the analysis of , we treat the variable in Eq. (7) as the random variable subject to , and focus on the expectation under the marginal distribution . To guarantee that Alice’s measurement in is a POVM, needs to hold. In the Supplemental Material sup we show that satisfies Eq. (4) with
[TABLE]
where . As , is minimized when . Solving the equation, we get and . This concludes the optimality of .
Switching the role between Alice and Bob, we get a symmetric version of . Consider the new strategy . Minimizing the second largest eigenvalue of w.r.t. gives
[TABLE]
This two-way two-step strategy outperforms in the small regime of . More details on can be found in the Supplemental Material sup .
*Strategy using two-way LOCC measurements.—*First we describe two measurements both detecting correctly. They are inspired by the two-way LOCC test given in Owari and Hayashi (2008). Then we show an appropriate convex combination of these measurements achieves optimality even if separable measurements are available. In what follows, we assume and .
Consider the following measurement procedure:
Alice performs measurement and sends the measurement outcome to Bob. 2. 2.
Conditioning on , Bob does the following. If , Bob performs Z measurement and accepts when the outcome is [math]. If , Bob performs X measurement and sends outcome to Alice. 3. 3.
Conditioning on , Alice performs measurement to check the state she holds, where is the post-measurement state on Alice’s system when the input state is . If she detects , she accepts.
The corresponding POVM element (passing the test) has the form
[TABLE]
where , , and . Note that are not normalized. See Fig. 1 for illustration of this measurement. Note that and . The superscript of indicates that begins with Alice sending outcome to Bob. A symmetric element is obtained by switching the role between Alice and Bob. We define another POVM element analogous to but with the X measurement replaced by the Y measurement on Bob’s side, which reads
[TABLE]
where . By construction, and .
Our two-way strategy is given by the following procedure. In each round, Alice chooses a measurement from with a prior distribution to verify the state, where is defined in Eq. (6). If is chosen, Alice executes the measurement; If is chosen, Alice sends notification to Bob to ask Bob executing the measurement. The corresponding strategy is given by
[TABLE]
where
[TABLE]
By construction, and . In the Supplemental Material sup , we show how the magic values of and are chosen.
Our strategy can be implemented by two-way LOCC, using up to three step classical communication. This makes it possible for experimental implementation. When , , whose optimal strategy is provably given by the measurement . Our strategy reduces exactly to this optimal measurement when , which means our two-way strategy is globally optimal for . However, all other strategies – , , , and – do not share this property.
*Optimality of our two-way strategy.—*We show the optimality of among strategies using separable measurements. Since a two-way LOCC measurement is a separable measurement, this optimality also shows the optimality using two-way LOCC measurements. The proof is divided into two parts: first we prove all optimal strategies in are homogeneous, then we construct explicitly an optimal homogeneous strategy in .
A strategy for is homogeneous if it has the form
[TABLE]
where . As examples, the strategies and are homogeneous. Now we prove that the optimal strategies using separable measurements are always homogeneous. Following the arguments in Eq. (5), we know optimal strategies in can always be written as Eq. (5) for some . Assume on the contrary , we then construct homogeneous strategies with smaller second largest eigenvalues than that of , which in turn violates the optimality of . In (Owari and Hayashi, 2008, Theorem 1), the authors proposed a separable test of the form
[TABLE]
In case , we consider a convex combination between and such that the combination is homogeneous. The new strategy has a smaller second largest eigenvalue than that of . We can show the opposite case in the same way using defined in Eq. (6) instead of .
Now we derive an optimal homogeneous strategy in . We are actually interested in the following optimization problem:
[TABLE]
As the separability condition is equivalent to the PPT (positive partial transpose) condition for two-qubit operators Størmer (1963); Woronowicz (1976), this problem can be analytically solved. Denote by the partial transpose of on system . The eigenvalues of are
[TABLE]
As for and , the condition is then equivalent to , resulting
[TABLE]
The optimal homogeneous strategy then has the form
[TABLE]
Together with the fact that optimal strategies in are always homogeneous, we completely solve the problem of verifying using separable measurements. What’s more, as , the optimality can be achieved by two-way LOCC measurements.
*Comparison.—*In Fig. 2 we plot the second largest eigenvalues for various strategies: , , , and , as a function of , which is the Schmidt coefficient of state . One can see that our proposed strategies give remarkable improvements over , this witnesses the advantage of adaptivity in state verification: allowing conditional measurements can markedly improve the verification efficiency. Intuitively, one might expect that the more entangled the , the harder to verify it using local measurements. The two-way strategies and justify this intuition. However, the one-way strategy , though achieves optimality when is maximally entangled, has inefficient performance in small regime of , where is less entangled. This dues to that in the one-way case, the symmetric role between Alice and Bob cannot be utilized. The strict gaps among , and reveal the power of classical communication in state verification: with just an extra step of messaging, one can significantly boost the performance.
*Conclusion.—*In this Letter, we studied the two-qubit pure state verification problem in depth. We constructed optimal strategies when the following classes of measurement are accessible: (i) one-way LOCC; (ii) two-way LOCC; and (iii) separable measurements. Our proposed strategies are dramatically more efficient than all known candidates based on local measurements and are comparable to the optimal strategy when there is no restriction on the accessible measurement at all. Our results revealed that for this problem, the two-way LOCC measurements remarkably outperforms the one-way LOCC measurements and achieves the same performance as the separable measurements. In principle, the technique used here to construct strategies for verifying two-qubit pure states can be generalized to pure states of more qubits and higher dimensions. However, it might be rather difficult to get the optimal strategies.
Acknowledgements.
MH is grateful to Dr. Xiao-Dong Yu and Prof. Zhu Huangjun for helpful discussions. KW was supported by the National Natural Science Foundation of China (Grant No. 61300050) and the Program B for Outstanding PhD Candidate of Nanjing University (Grant No. 201801B047). MH was supported in part by Fund for the Promotion of Joint International Research (Fostering Joint International Research) Grant No. 15KK0007, a JSPS Grant-in-Aids for Scientific Research (B) No.16KT0017 and for Scientific Research (A) No.17H01280, and Kayamori Foundation of Information Science Advancement.
Appendix A Optimal strategy using one-way LOCC measurements
In this section we give more details on the proof that our proposed one-way LOCC strategy is optimal. As is shown in the main text, a general one-way LOCC strategy for verifying can be written as
[TABLE]
To analyze , we treat the variable in Eq. (S1) as the random variable subject to the marginal distribution ans use to denote the expectation under . The constraint that Alice’s measurement in must be a POVM induces
[TABLE]
Focusing on the diagonal terms, we have the condition . Here, we do not use the condition for the off-diagonal terms. By letting with , the condition gives the following two relations
[TABLE]
We then get from , using the averaging technique described in the main text. When expressed in the standard basis, satisfies
[TABLE]
with , , and
[TABLE]
Appendix B Strategy using two-way two-step LOCC measurements
Here we explain in detail the two-way two-step LOCC strategy , given in Eq. (8) of the main text. We first describe its construction and then prove its optimality when only two-step classical communication are allowed. Considering the symmetric role between Alice and Bob, we construct from a new strategy which outperforms in the small regime of . The strategy is implemented by Alice sending measurement outcomes to Bob and Bob performing conditional measurements. We then get a symmetric version of by switching the role between Alice and Bob. The new strategy goes as follows. In each round, Alice first tosses a fair coin, if it is heap up, they use ; If it is tail up, they use . The corresponding new strategy then has the form
[TABLE]
Minimizing the second largest eigenvalue of w.r.t. , we get and
[TABLE]
We remark that different from and , must be implemented by two-way two-step LOCC. This is due to the symmetrization technique we used to construct from and . Alice and Bob need an extra step of classical communication to agree on which strategy ( or ) is used in current round. Comparing the performance of () and , one sees the power of classical communication in verification: with just one extra bit of messaging, outperforms () significantly.
We can actually prove that the strategy is the best we can hope when only two-step classical communication is allowed. Any two-step strategy can be written as a convex combination of one-way LOCC strategies from Alice to Bob and one-way LOCC strategies from Bob to Alice. In (Owari and Hayashi, 2008, Theorem 3) it was proved that for any one-way LOCC strategy satisfying , holds. Hence, the second largest eigenvalue of is no smaller than , concluding the optimality of .
Appendix C Optimization of strategy using two-way LOCC measurements
When constructing the strategy in the main body, we prefix two magic variables and . Here we show that they are actually chosen so that the second largest eigenvalue of is minimized. From now on we assume and are two free parameters to be optimized. By construction, is given by
[TABLE]
It can be shown that admits the following spectral decomposition:
[TABLE]
where
[TABLE]
Our target is to minimize , the second largest eigenvalue of , over the free parameters and for fixed . This optimization problem then is given by
[TABLE]
is minimized for fixed when the derivatives with respect to and vanish. As is monotonically increasing with while is monotonically decreasing with in the range , and for , is minimized when . Solving this equation w.r.t. , we get
[TABLE]
where is the solution of the equation, which is also the optimal choice of . We now minimize w.r.t. . The partial derivative is given by
[TABLE]
where . Solving the equation in the range gives the optimal choice . Substituting into , we get expressed in terms of solely. Substituting in the optimal choices of and gives the following optimal strategy
[TABLE]
We are done.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Monz et al. (2011) T. Monz, P. Schindler, J. T. Barreiro, M. Chwalla, D. Nigg, W. A. Coish, M. Harlander, W. Hänsel, M. Hennrich, and R. Blatt, Phys. Rev. Lett. 106 , 130506 (2011) . · doi ↗
- 2Wang et al. (2016) X. Wang, L. Chen, W. Li, H.-L. Huang, C. Liu, C. Chen, Y. Luo, Z. Su, D. Wu, Z. Li, et al. , Phys. Rev. Lett. 117 , 210502 (2016) . · doi ↗
- 3Song et al. (2017) C. Song, K. Xu, W. Liu, C. Yang, S. Zheng, H. Deng, Q. Xie, K. Huang, Q. Guo, L. Zhang, et al. , Phys. Rev. Lett. 119 , 180511 (2017) . · doi ↗
- 4Friis et al. (2018) N. Friis, O. Marty, C. Maier, C. Hempel, M. Holzäpfel, P. Jurcevic, M. B. Plenio, M. Huber, C. Roos, R. Blatt, et al. , Phys. Rev. X 8 , 021012 (2018) . · doi ↗
- 5Helstrom (1976) C. W. Helstrom, Quantum Detection and Estimation Theory (Academic Press New York, 1976).
- 6Holevo (1982) A. S. Holevo, Probabilistic and Statistical Aspects of Quantum Theory (North-Holland, Amsterdam, 1982).
- 7Hayashi (1997) M. Hayashi, “A linear programming approach to attainable Cramér-Rao type bounds,” in Quantum Communication, Computing, and Measurement (Springer, 1997) pp. 99–108. · doi ↗
- 8Gill and Massar (2000) R. D. Gill and S. Massar, Phys. Rev. A 61 , 042312 (2000) . · doi ↗
