Abstract
It is difficult to establish an analytical criterion to identify the boundaries of quantum correlations, even for the simplest Bell scenario. Here, we briefly reviewed the plausible analytical criterion, and we found a way to confirm the extremal conditions from another direction. For that purpose, we analyzed the Navascués-Pironio-Acín (NPA) hierarchy to study the algebraic structure and found that the problem could not be simplified using the level. However, considering the plausible criterion, the and second levels for correlations were equal, and the extremal condition in the simplest Bell scenario was replaced by that in the level. Thus, the correctness of the plausible criterion was verified, and the results demonstrated that the plausible criterion held, thereby explaining its simplicity. It seemed plausible, but now it becomes more certain.
PACS:
03.65.Ud; 03.65.Ta; 03.67.Hk; 03.67.Dd
1. Introduction
In 1964, Bell showed that nonlocal correlations predicted by quantum mechanics were inconsistent with local realism [1]. Although the non-local correlations did not contradict the no signaling principle, the strength of the quantum correlations was more restricted than that allowed by the no-signaling principle [2,3]. Since then, fundamental principles have been investigated to address this discrepancy [4,5,6]. Furthermore, the origin of fundamental principles, such as uncertainty and nonlocality, has been investigated [7,8]. However, in these studies, clarifying the boundaries of quantum correlations was difficult. Indeed, an analytical criterion for identifying the boundaries has not yet been established, even for the simplest Bell scenario.
In the simplest Bell scenario, Tsirelson showed that the Bell inequality of the Clauser–Horne–Shimony–Holt (CHSH) type [9] is violated up to by quantum correlations [2]. The correlation that attains the Tsirelson bound is an extremal point in a convex set of quantum correlations. When the marginal probabilities of obtaining the measurement results are unbiased (zero-marginal case), the boundaries are identified using the analytical criterion Tsirelson–Landau–Masanes (TLM) [10,11,12]. Recent studies have shown that there are many characteristics of the boundaries in a quantum set [13].
In the general case where the marginals may be biased (full-marginal case), obtaining the analytical criterion is a long-standing open problem. In fact, only a few examples of analytical solutions are known [8,14,15,16,17]. The geometry of a quantum set exhibits rich counterintuitive features [17]. We propose a plausible analytical criterion to identify all extremal points (a point is an extremal point if and only if the equalities Equations (12) and (13) are simultaneously satisfied) [18]. Recently, some quantum states have been discussed, and it has been shown that the plausible criterion is a strong indication, which, however, remains unproven [19].
The plausible criterion proposed in [18] is simpler than expected. Therefore, we analyze the Navascués–Pironio-Acín (NPA) hierarchy [20,21,22] to study the algebraic structure. Specifically, the sets of correlations are denoted as , , , ⋯ (it is also called the correlation levels between the first, , second, and others correspondingly). By definition, the inclusion relation generally is , where Q is the set of correlations in the simplest Bell scenario and all the extremal points are conjectured by the plausible criterion. If a phenomenon (in a Bell inequality) is explained up to the level, then holds true. This becomes clear upon examining the inclusion relationship between the and second levels (at this time the following condition is automatically satisfied by a rank loop: [21]). In the NPA analysis, the simplicity of the plausible criterion is persuasive, especially when the and second levels are equal (just as the TLM criterion is explained by the first and second levels). Otherwise, in this study, we say nothing exceptional about the level.
In this paper, we briefly review the plausible criterion for convenience, and we find a way to confirm the extremal conditions from another direction. For that purpose, we analyze the NPA hierarchy to study the algebraic structure, and the results show that the level is not exceptional. After all, the problem cannot be simplified using the level. However, as far as the plausible criterion is concerned, the and second levels for correlations are equal, and the extremal condition in the simplest Bell scenario is replaced by that in the level. Thus, the correctness of the plausible criterion is clarified, and the results demonstrate that it holds true, which explains its simplicity.
2. Plausible Criterion
We now clarify the plausible criterion obtained in the two parity Alice and Bob system; the projective measurements of Rank 1 are performed in a two-qubit entangled state. Specifically, without loss of generality, the observables are
where are the Pauli matrices, and the two-qubit entangled state is
Based on this parameterization, we obtain
The plausible criterion is classified into two categories. The first is based on the limitations of entangled states. Based on the analysis presented in Ref. [18], the usage of the entanglements are specified by the eight parameters , which obey the following correlations:
Here, for each x and y, or always holds true. If a two-qubit realization cannot be guaranteed for Equation (3), the condition
is necessary; see the Supplemental Material of Ref. [18]. The maximum use of the entanglements is .
The second category is the cryptographic quantum bound [23]. The TLM inequality becomes an equality whose correlation is divided guessing probability. The scaled TLM inequality is expressed as
where and . The guessing probabilities are as follows:
where and . The NPA inequality is also extended to include and (see Equation (B4) in Ref. [23]). However, it is not used because full-rank is necessary and a two-qubit pure state does not satisfy the equality. Therefore, it is not an appropriate extremal condition.
Thus, our plausible criterion is as follows:
A point is an extremal point if and only if the five equalities are simultaneously satisfied. The scaled TLM condition must be satisfied in both and , and there are two equalities.
3. NPA Hierarchy and Simplest Bell Scenario
We now analyze the NPA hierarchy and use explicit examples to determine whether the level is exceptional in the simplest Bell scenario. Table 1 lists the correlations of the quantum bounds and , which are obtained using the quantifier elimination algorithm [16]. is discussed in relation to the plausible criterion [19]. In the table, the measures for and for are maximized, and the quantum values (theoretical values) are provided in the figure caption [16]. The calculated NPA and 2nd levels are also listed, where a highly accurate multiple-precision semidefinite programming solver is used [24], and the same measures as the quantum values are maximized. In , the calculations are consistent with the quantum values (within the limits of numerical accuracy). In , the calculations deviate from the quantum values of approximately . Here, the endpoint is the classical regime according to the TLM criterion, but is influenced by the quantum regime with instability. Specifically, the deviation rapidly converges and remains within (figure is not shown); seems accurate throughout corresponding to the non-deviate correlation. Thus, we conclude that deviate and non-deviate correlations coexist, and that there is nothing exceptional about the level. The certificate is with .
Table 1.
Correlations of and , obtained using the quantifier elimination algorithm in Ref. [16]. The superscript denotes a fully-marginal 8D case to distinguish the zero-marginal 4D case. The quantum values (theoretical values) for are and, for , are () and (), respectively. The calculated NPA and 2nd levels are also listed.
Another semidefinite program demonstrated an inclusion relationship between the NPA and second levels. It determines the maximum of such that ( is nonlocal), where is the certificate matrix [21]. Here, random initial points , which are included in , are common for the and second levels. However, the maximum calculated using the and second levels denotes and , respectively. Figure 1a,b shows the results of (y-axis) and (x-axis). Because , is the same as or shifted up. When and are on a straight line, the and second levels are always equal, and the correlations can be explained up to the level. However, in the figure, approximately 30% of the data points deviate from the straight line (indicated in red), and deviated and non-deviated correlations coexist. Similarly, nothing exceptional is observed about the level. How many orders of magnitude do we need to consider? Figure 1c shows the data of (y-axis) and (x-axis). At the levels equal to or greater than this, the two data are on a straight line, and two levels such as and are always equal. Thus, the second level is not enough (figure is not shown), and the third level is required.
Figure 1.
Maximum of , where at NPA 1 + AB level (vertical axis) and 2nd level (horizontal axis), obtained using the semidefinite programming solver [24]. (a) Plotted area near the origin and (b) full scale. The deviations from the straight line are indicated in red. (c) With data at 3rd (vertical) and 4th (horizontal) levels, for the levels equal to or greater than this, the two data are on a straight line. The number of data points are 500 to distinguish each data point.
Two maximization problems exist: maximizing the quantum value (which depends on the state to be maximized) and maximizing such that . Both yield the same results, and no exceptional results are observed for the level. Thus, using the level is unlikely to simplify the problem. However, maximizing such that is an interesting feature, which is revealed by selecting a fixed initial point in Figure 1. Specifically, two-qubit realizations are randomly specified as the initial points (pure states Equations (2)–(4) are specified considering Equation (8)). Thus, mixed states are exclusively removed; however, this does not change significantly from Figure 1. Thus, Equation (12) is additionally specified as the initial points. Figure 2a shows the results where none of the data points deviate from the straight line. Therefore, because it is a pure state and satisfies Equation (12), the and second levels are equal. This will further equalize the correlations of the simplest Bell scenario, because a rank loop is established at the third level, as shown in Figure 1c, but for these initial points, the and third levels are equal (figure is not shown). (Because is a pure state and satisfies Equation (12), the and second levels are equal ( satisfies Equation (13) [19], because is a solution to the plausible criterion). However, in in Table 1, these levels are unequal, apparently because what is maximized is obviously different. Thus, even the relationship between the correlations varies depending on what is maximized.) Thus, when it is a pure state and Equation (12) is satisfied, the and second levels are equal to those in the simplest Bell scenario.
Figure 2.
Two-qubit realizations and Equation (12) are randomly specified as initial points. These graphs are similar to Figure 1; however, they are selected by initial points. (a) Plots showing the area near the origin and (b) full scale. All the data points do not deviate from the straight line, and the NPA and 2nd levels are always equal. (c) The plausible criteria (Equations (12) and (13)) are fully specified, and all the data points converge to a single point (0,0).
We now consider what happens if the remaining plausible criteria are added to Equation (13). Figure 2c shows the results where all the data points (,) converge to a single point (0,0). This convergence is explained as follows. First, the and second levels are equal to the correlations of the simplest Bell scenario because they satisfy Equation (12). Consequently, the extremal condition in the simplest Bell scenario is replaced by that in the level. Second, because and are already optimal solutions of , we obtain (,) = (0,0). Therefore, after slight consideration, we find that the plausible criterion must be extremal points of the level to ensure that (,) converges to (0,0). Conversely, if the plausible criterion is incorrect and not a flat boundary point, convergence to (0,0) does not occur. Thus, the correctness of the plausible criterion is verified, although we are unsure of the existence of unnecessary flat boundary points. The convergence to a single point proves that the plausible criterion holds. Furthermore, the plausible criterion is simple because the simplest Bell scenario is explained by the level. However, the method described is suitable for obtaining predictions; if predictions cannot be obtained, the method is unsuitable. In such cases, the Monte Carlo method may be used. However, an event is unlikely to survive hundreds of thousands of Monte Carlo trials. Our calculations do not reveal any exceptions to Equations (12) and (13) [18].
4. Summary
In summary, we analyzed the NPA hierarchy to study the algebraic structure in the simplest Bell scenario. The result is that the problem could not be simplified using the level. However, when the problem is limited to the plausible criterion, the and second levels for correlations are equal, and the extremal condition in the simplest Bell scenario is replaced by that in the level. Although the existence of unnecessary flat boundary points remains unknown, the correctness of the plausible criterion is ascertained, and the results numerically demonstrate that the plausible criterion becomes more certain. Furthermore, this explains the simplicity of the plausible criterion.
Funding
This work was supported by JSPS KAKENHI Grants No. 21K03389, 22K03452.
Data Availability Statement
The original contributions presented in this study are included in the article. Further inquiries can be directed to the author.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Bell, J. On the Einstein Podolsky Rosen paradox. Physics 1964, 1, 195. [Google Scholar] [CrossRef]
- Cirel’son, B.S. Quantum generalizations of Bell’s inequality. Lett. Math. Phys. 1980, 4, 93. [Google Scholar] [CrossRef]
- Popescu, S.; Rohrlich, D. Quantum nonlocality as an axiom. Found Phys. 1994, 24, 379–385. [Google Scholar] [CrossRef]
- Brunner, N.; Cavalcanti, D.; Pironio, S.; Scarani, V.; Wehner, S. Bell nonlocality. Rev. Mod. Phys. 2014, 86, 419. [Google Scholar] [CrossRef]
- Popescu, S. Bounds on quantum correlations in Bell-inequality experiments. Nat. Phys. 2014, 10, 264. [Google Scholar] [CrossRef]
- Oas, G.; de Barros, J.A. Contextuality from Quantum Physics to Psychology; World Scientific: Singapore, 2016; Chapter 15; pp. 335–366. [Google Scholar]
- Oppenheim, J.; Wehner, S. The Uncertainty Principle Determines the Nonlocality of Quantum Mechanics. Science 2010, 330, 1072. [Google Scholar] [CrossRef]
- Ramanathan, R.; Goyeneche, D.; Muhammad, S.; Mironowicz, P.; Grünfeld, M.; Bourennane, M.; Horodecki, P. Steering is an essential feature of non-locality in quantum theory. Nat. Commun. 2018, 9, 4244. [Google Scholar] [CrossRef] [PubMed]
- Clauser, J.F.; Horne, M.A.; Shimony, A.; Holt, R.A. Proposed Experiment to Test Local Hidden-Variable Theories. Phys. Rev. Lett. 1969, 23, 880. [Google Scholar] [CrossRef]
- Tsirelson, B.S. Quantum analogues of the Bell inequalities. The case of two spatially separated domains. J. Sov. Math. 1987, 36, 557. [Google Scholar] [CrossRef]
- Landau, L.J. Empirical Two-Point Correlation Functions. Found. Phys. 1988, 18, 449. [Google Scholar] [CrossRef]
- Masanes, L. Necessary and sufficient condition for quantum-generated correlations. arXiv 2003, arXiv:quant-ph/0309137. [Google Scholar]
- Le, T.P.; Meroni, C.; Sturmfels, B.; Wernet, R.F.; Ziegler, T. Quantum Correlations in the Minimal Scenario. Quantum 2023, 7, 947. [Google Scholar] [CrossRef]
- Acín, A.; Massar, S.; Pironio, S. Randomness versus Nonlocality and Entanglement. Phys. Rev. Lett. 2012, 108, 100402. [Google Scholar] [CrossRef] [PubMed]
- Rabelo, R.; Zhi, L.Y.; Scarani, V. Device-Independent Bounds for Hardy’s Experiment. Phys. Rev. Lett. 2012, 109, 180401. [Google Scholar] [CrossRef] [PubMed]
- Wolfe, E.; Yelin, S.F. Quantum bounds for inequalities involving marginal expectation values. Phys. Rev. A 2012, 86, 012123. [Google Scholar] [CrossRef]
- Goh, K.T.; Kaniewski, J.m.k.; Wolfe, E.; Vértesi, T.; Wu, X.; Cai, Y.; Liang, Y.C.; Scarani, V. Geometry of the set of quantum correlations. Phys. Rev. A 2018, 97, 022104. [Google Scholar] [CrossRef]
- Ishizaka, S. Necessary and sufficient criterion for extremal quantum correlations in the simplest Bell scenario. Phys. Rev. A 2018, 97, 050102, Erratum in Phys. Rev. A 2024, 109, 059903. [Google Scholar] [CrossRef]
- Mikos-Nuszkiewicz, A.; Kaniewski, J. Extremal points of the quantum set in the Clauser-Horne-Shimony-Holt scenario: Conjectured analytical solution. Phys. Rev. A 2023, 108, 012212. [Google Scholar] [CrossRef]
- Navascués, M.; Pironio, S.; Acín, A. Bounding the Set of Quantum Correlations. Phys. Rev. Lett. 2007, 98, 010401. [Google Scholar] [CrossRef]
- Navascués, M.; Pironio, S.; Acín, A. A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations. New J. Phys. 2008, 10, 073013. [Google Scholar] [CrossRef]
- Navascués, M.; Vétesi, T. Bounding the set of finite dimensional quantum correlations. Phys. Rev. Lett. 2015, 115, 020501. [Google Scholar] [CrossRef] [PubMed]
- Ishizaka, S. Cryptographic quantum bound on nonlocality. Phys. Rev. A 2017, 95, 022108. [Google Scholar] [CrossRef]
- Yamashita, M.; Fujisawa, K.; Nakata, K.; Nakata, M.; Fukuda, M.; Kobayashi, K.; Goto, K. A High-Performance Software Package for Semidefinite Programs: SDPA 7; Research Report No. B-460; Department of Mathematical and Computing Science, Tokyo Institute of Technology: Tokyo, Japan, 2010. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).