Next Article in Journal
Lattice Distortions in the FeCoNiCrMn High Entropy Alloy Studied by Theory and Experiment
Next Article in Special Issue
Enhanced Energy Distribution for Quantum Information Heat Engines
Previous Article in Journal
Entropy-Based Modeling of Velocity Lag in Sediment-Laden Open Channel Turbulent Flow
Previous Article in Special Issue
Novel Criteria for Deterministic Remote State Preparation via the Entangled Six-Qubit State
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Generalized Robustness of Contextuality

1
School of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China
2
School of Ethnic Nationalities Education, Shaanxi Normal University, Xi’an 710062, China
*
Author to whom correspondence should be addressed.
Entropy 2016, 18(9), 297; https://doi.org/10.3390/e18090297
Submission received: 16 May 2016 / Revised: 4 August 2016 / Accepted: 9 August 2016 / Published: 1 September 2016
(This article belongs to the Special Issue Quantum Information 2016)

Abstract

:
Motivated by the importance of contextuality and a work on the robustness of the entanglement of mixed quantum states, the robustness of contextuality (RoC) R C ( e ) of an empirical model e against non-contextual noises was introduced and discussed in Science China Physics, Mechanics and Astronomy (59(4) and 59(9), 2016). Because noises are not always non-contextual, this paper introduces and discusses the generalized robustness of contextuality (GRoC) R g ( e ) of an empirical model e against general noises. It is proven that R g ( e ) = 0 if and only if e is non-contextual. This means that the quantity R g can be used to distinguish contextual empirical models from non-contextual ones. It is also shown that the function R g is convex on the set of all empirical models and continuous on the set of all no-signaling empirical models. For any two empirical models e and f such that the generalized relative robustness of e with respect to f is finite, a fascinating relationship between the GRoCs of e and f is proven, which reads R g ( e ) R g ( f ) 1 . Lastly, for any n-cycle contextual box e, a relationship between the GRoC R g ( e ) and the extent Δ e of violating the non-contextual inequalities is established.

1. Introduction

Contextuality is one of the most interesting manifestations of the quantumness of physical systems and manifests itself in the famous Kochen–Specker theorem [1], which states that for every quantum system belonging to a Hilbert space of dimension greater than two, irrespective of its actual state, there exists a finite set of measurements whose results cannot be assigned in a context-independent manner. It exhibits the strength of correlations that comes out of a quantum state when measured by compatible measurements and plays a central role in quantum communication and quantum computation. For example, quantum contextuality is related to quantum error correction [2], random access codes [3], quantum key distribution [4] and one-location quantum games [5]. The work in [6] proved that contextuality can supply the “magic” for quantum computation by establishing a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via magic state distillation. An important and interesting question is how to quantify quantum contextuality. A huge effort is being put into quantifying quantum contextuality by the mutual information of contextuality, the relative entropy of contextuality and the cost of contextuality [7].
Contextuality is a basic and amazing quantum property, as well as entanglement [8,9]. Moreover, contextuality has been formulated in terms of “empirical models”, i.e., families of probability distributions [10]. Due to the importance of contextuality and motivated by a work on the robustness of entanglement of mixed quantum states against noise and jamming [11], we proposed and discussed recently in [12,13] the robustness of contextuality (RoC) R C ( e ) and the contextuality cost C ( e ) of an empirical model e, where R C ( e ) denotes the minimal amount of contextuality-free mixing needed to wipe out all contextuality of e and C ( e ) denotes the minimal amount of contextuality mixing needed to prepare e. The following conclusions have been proven: (i) an empirical model e is contextual if and only if R C ( e ) > 0 ; (ii) the robustness of contextuality (RoC) is convex and un-increasing under a non-contextuality-preserving affine mapping; (iii) RoC is bounded and continuous on the set of all no-signaling empirical models; (iv) e is non-contextual if and only if C ( e ) = 0 ; and (v) e is strongly contextual if and only if C ( e ) = 1 . Furthermore, a relationship between R C ( e ) and C ( e ) has been obtained. Lastly, we have computed and compared the RoCs of three empirical models. This means that the quantities R C ( e ) and C ( e ) are measures for the contextuality of an empirical model e. However, noises are not always non-contextual. Motivated by a work on the generalized robustness of the entanglement of mixed quantum states against noise and jamming [14], in this paper, we consider the generalized robustness of contextuality (GRoC) R g ( e ) , which characterizes the minimal amount of mixing with general noises (i.e., both non-contextual empirical models and contextual empirical models), which washes out all contextuality of e.
For any measurement scenarios, the problem of separating non-contextual from contextual correlations has been solved in [10,15]. In particular, Reference [16] provided the complete characterization of the non-contextual correlations for the case of n 4 dichotomic observables X 0 , , X n - 1 , where each consecutive pair C i = { X i , X i + 1 } , sum mod n, is jointly measurable. This generalizes both the Clauser–Horne–Shimony–Holt and the Klyachko–Can–Binicioglu–Shumovsky scenarios [17,18,19,20,21], which are the simplest ones for locality and non-contextuality, respectively. Such correlations can be formulated by an n-cycle box e [16], which is a family of probability distributions { e C i } i = 0 n - 1 , where e C i is a probability distribution on all possible outcomes of measurement C i . The contextuality of e can be completely characterized by the extent of violating the non-contextual inequalities in [16]. The work in [13] established the relationship between RoC and the violating of non-contextual inequalities for n-cycle boxes. Does there exist a relationship between the quantities R g ( e ) and the extent of violating the non-contextual inequalities in [16]? In this paper, we will establish such a relationship.
This paper is organized as follows. In Section 2, we recall definitions and relevant results with respect to the contextuality of empirical models and the robustness of contextuality of empirical models and then introduce and observe the generalized robustness of contextuality (GRoC) R g ( e ) , which characterizes the minimal amount of mixing with general noises (i.e., both non-contextual empirical models and contextual empirical models), which washes out all contextuality of e. Many properties of GRoC are proven, such as faithfulness, boundedness and continuity. It is worth noting that, for any two empirical models e and f, R g ( e ) R g ( f ) 1 provided that the generalized relative robustness of e with respect to f is finite, i.e., there exists a finite non-negative number x, such that 1 1 + x e + x 1 + x f is non-contextual. In Section 3, by introducing a quantity Δ e representing the extent of violating the non-contextual inequalities in [16], we obtain the GRoC of any n-cycle boxes ( n 4 ) and can compare the robustness of contextuality against any noise for any n-cycle box and m-cycle one with m , n 4 .

2. Generalized Robustness of the Contextuality of Empirical Models

In [10], a measurement cover M over a nonempty finite set X is defined as a family of nonempty subsets of X, such that C M C = X and C , C M , C C C = C . If in addition, O is a nonempty finite set, then the triple ( X , M , O ) is said to be a measurement scenario (MS). In this case, the elements of X are called measurements; the ones of M are called measurement contexts; and ones of O are called the outcomes of the measurements in X. The elements of the set E ( C ) consisting of all mappings s : C O are referred to as the events. Furthermore, we use D ( E ( C ) ) to denote the set of all probability distributions over E ( C ) .
Definition 1 
([10]). Let ( X , M , O ) be an MS. If e C D ( E ( C ) ) for all C M , then the family e : = { e C } C M is said to be an empirical model on ( X , M , O ) .
Figure 1 is used to illustrate an empirical model: each context C k has a joint probability distribution e C k under a measurement, such that e C k ( s ) is the probability that the event s with s ( A j ( k ) ) = x j ( k ) ( 1 j n k ) occurs.
Definition 2 
([10]). An empirical model e = { e C } C M on an MS ( X , M , O ) is said to be a no-signaling empirical model if e C | C C ( t ) = e C | C C ( t ) for all t E ( C C ) whenever C , C M with C C , where:
e C | C C ( t ) = { e C ( s ) : s E ( C ) , s | C C = t } ,
e C | C C ( t ) = e C ( s ) : s E ( C ) , s | C C = t .
For each event t : C C O , the value of e C | C C at t is defined as the sum of all values e C ( s ) with s E ( C ) , such that s | C C = t . Similarly, the value of e C | C C at t is defined as the sum of all values e C ( s ) with s E ( C ) , such that s | C C = t . See Figure 2.
Let ( X , M , O ) be an MS. Put:
E ( X ) = { s : s : X O is a mapping } ,
D ( E ( X ) ) = { p : p is a probability distribution over E ( X ) } .
For any p D ( E ( X ) ) and C M , we define:
p | C ( s ) = { p ( s ) : s E ( X ) , s | C = s } , s E ( C ) ,
and obtain p | C D ( E ( C ) ) , i.e., p | C is a probability distribution for the measurements in context C.
Figure 3 illustrates the value of p | C at s E ( C ) , i.e., it is defined as the sum of all values p ( s ) with s E ( X ) such that the restriction of s on C is equal to s: s | C = s .
Definition 3 
([10]). An empirical model e = { e C } C M on an MS ( X , M , O ) is said to be non-contextual if there exists p D ( E ( X ) ) such that p | C = e C for all C M . Otherwise, it is said to be contextual.
Remark 1. 
It is easy to check that every non-contextual empirical model is no-signaling.
In the following, we use E M , N S E M , N C E M and C E M to denote the sets of all empirical models, no-signaling empirical models, non-contextual empirical models and contextual empirical models on an MS ( X , M , O ) , respectively.
For any MS ( X , M , O ) , put m = | M | (the cardinality of the set M ), = j = 1 m | E ( C i ) | and = | E ( X ) | . Without loss of generality, we can write:
M = { C 1 , C 2 , , C m } , i = 1 m E ( C i ) = { s 1 , s 2 , , s } , E ( X ) = { t 1 , t 2 , , t } .
Definition 4 
([10]). The incidence matrix associated with an MS ( X , M , O ) given by (1) is defined as the by the matrix M = [ M i , j ] , where M i , j = 1 if s i E ( C k ) and t j | C k = s i ; and M i , j = 0 otherwise.
Definition 5 
([10]). The incidence vector V e associated with empirical model e = { e C k } C k M on an MS ( X , M , O ) given by Equation (1) is defined as the -dimensional column vector:
V e = ( V e [ 1 ] , V e [ 2 ] , , V e [ ] ) T ,
where V e [ i ] = e C k ( s i ) if s i E ( C k ) .
With these notations, the following theorems were proven in [10] (Proposition 4.1 and Theorem 5.5).
Theorem 1 
([10]). e E M is non-contextual if and only if the equation MX = V e has a non-negative real solution X = ( X [ 1 ] , X [ 2 ] , , X [ ] ) T such that j X [ j ] = 1 .
Theorem 2 
([10]). For each e N S E M , the linear system MX = V e has a real solution X = ( X [ 1 ] , X [ 2 ] , , X [ ] ) T such that j X [ j ] = 1 .
By looking carefully at the incidence matrix, we obtain the following theorem, which improves Theorem 1.
Theorem 3. 
e E M is non-contextual if and only if the equation MX = V e has a non-negative real solution.
Proof. 
Let e E M be non-contextual. Then, we see from Theorem 1 that the equation MX = V e has a non-negative real solution.
Let e E M and the equation MX = V e have a nonnegative real solution X . Then:
i = 1 ( MX ) [ i ] = i = 1 V e [ i ] = i = 1 m s C i e C i ( s ) = m .
By directly computing, we obtain that:
i = 1 ( MX ) [ i ] = i = 1 j = 1 M [ i , j ] X [ j ] = j = 1 i = 1 M [ i , j ] X [ j ] = j = 1 m X [ j ] ,
where the last equality holds since any entry of M is either one or zero and the number of ones in every column of M is m. Combining with Equation (3), we have j = 1 X [ j ] = 1 . Therefore, the non-negative real solution X to MX = V e satisfies that j = 1 X [ j ] = 1 . By Theorem 1, we obtain that e is non-contextual.   □
By Theorem 3, only if the equation MX = V e has a non-negative real solution, then e is non-contextual.
For given e , e E M , put:
γ e , e ( x ) = 1 1 + x e + x 1 + x e , x [ 0 , + ) , γ e , e ( + ) = e .
Due to the importance of contextuality and motivated by a work on the robustness of entanglement of mixed quantum states against noise and jamming [11], we have proposed and discussed the robustness of contextuality (RoC) R C ( e ) of an empirical model e in [12,13] to quantify the amount of contextuality with respect to non-contextual mixing by asking about the minimal amount of contextuality-free mixing needed to wipe out all contextuality of e. The mathematical definition is as follows.
Definition 6 
([12]). Let e E M and e N C E M . The relative robustness of contextuality of e with respect to e is defined as:
R C e | | e = min x [ 0 , + ] : γ e , e ( x ) N C E M ,
and the robustness of contextuality (RoC) of e is defined as:
R C ( e ) = min R C e | | e : e N C E M .
Contextual empirical model e is the object in which we are interested, and it is contextuality that supplies the “magic” for quantum computation. Although e is contextual, when it is mixed with a non-contextual empirical model e , the mixture γ e , e ( x ) = 1 1 + x e + x 1 + x e with x [ 0 , + ) may be non-contextual, and so, the contextuality of e is wiped out by e . In this sense, we say that e is noise or jamming. However, noises are not always non-contextual. Motivated by the generalized robustness [14] of entanglement, we investigate the generalized robustness of contextuality R g ( e ) , which characterizes the minimal amount of mixing with general noises (i.e., both non-contextual empirical models and contextual ones), which washes out all contextuality of e.
Definition 7. 
e , e E M . The generalized relative robustness of contextuality of e with respect to e is defined as:
R g e | | e = min x [ 0 , + ] : γ e , e ( x ) N C E M , γ e , e ( x ) N C E M for some x [ 0 , + ) + , otherwise ,
and the generalized robustness of contextuality (GRoC) of e is defined as:
R g ( e ) = min R g e | | e : e E M .
Considering that the minimums above are taken over compact sets and the functions to be optimized are continuous, we have that Equations (7) and (8) are well defined.
Figure 4 and Figure 5 are given for more intuition about R g e | | e and R g ( e ) .
Figure 4 shows that 0 < R g e | | e < + implies that γ e , e ( x ) is contextual for all x [ 0 , R g e | | e ) , and γ e , e ( R g e | | e ) is non-contextual. In the case where e N C E M , γ e , e ( x ) is non-contextual if and only if x [ R g e | | e , + ] . Figure 5 shows that R g ( e ) is finite, and the smallest radius of the circles containing non-contextual empirical models is R g ( e ) . Moreover, the circle with radius r ( R g ( e ) , + ] contains non-contextual empirical models, and the circle with radius r [ 0 , R g ( e ) ) contains only contextual empirical models.
Remark 2. 
By the definitions of RoC and GRoC of an empirical model e, we see that R g ( e ) R C ( e ) . For any e N S E M , if R g ( e ) = R g e | | e = x ( 0 , ) , then γ e , e ( x ) is non-contextual, and so, γ e , e ( x ) N S E M by Remark 1. Thus, e is the no-signaling since e N S E M and γ e , e ( x ) = 1 1 + x e + x 1 + x e N S E M .
Using the norm-distance of E M in [12], a sequence { e n } n = 1 in E M is convergent to e if and only if e C i n ( s ) e C i ( s ) as n for all C i M , s E ( C i ) . We see from [22] (Section 0.4.6) that there exist invertible matrices A and B and identity matrix I such that:
M = A I 0 0 0 B .
For any positive integer n and X R n , we denote:
X 1 = j = 1 n | X [ j ] | , A - 1 = sup { A - 1 X 1 : X R , X 1 1 } B - 1 = sup { B - 1 X 1 : X R , X 1 1 } .
Based on the above notations, the boundedness and continuity of GRoC on the set N S E M are proven in the following theorem. Moreover, the following theorem says that GRoC can be used to distinguish non-contextual empirical models from contextual ones.
Theorem 4. 
(i) Let X 0 = 1 ( 1 , 1 , , 1 ) T D ( E ( X ) ) and X 0 be the empirical model { X 0 | C i } C i M , i.e., the totally mixed non-contextual empirical model. For any e N S E M , it holds that:
0 R g ( e ) m A - 1 · B - 1 < + .
(ii) R g ( e ) is finite for any empirical model e; R g ( e ) = 0 if and only if e is non-contextual.
(iii) For any e C E M , it holds that:
R g ( e ) = sup x [ 0 , + ) : γ e , e ( x ) C E M , e E M .
(iv) The GRoC function R g is convex on E M , i.e., if e 1 , e 2 E M , then:
R g ( λ e 1 + ( 1 - λ ) e 2 ) λ R g ( e 1 ) + ( 1 - λ ) R g ( e 2 ) , λ ( 0 , 1 ) .
(v) R g ( e ) R g ( f ) 1 for all e , f E M with R g ( e f ) < + ; moreover, for any e E M , there exists an empirical model f such that R g ( e ) R g ( f ) 1 .
(vi) R g as a function on N S E M is continuous, that is lim n R g ( e n ) = R g ( e ) provided that e n N S E M ( n = 1 , 2 , ) such that lim n e n = e .
Proof. 
(i) Let e N S E M . Theorem 2 implies that MX = V e has a real solution X = X . Put:
Z e = Z e 1 Z e 2 = A - 1 V e , Y 1 Y 2 = BX ,
then:
I 0 0 0 Y 1 Y 2 = Z e 1 Z e 2 .
Therefore, Z e 2 = 0 . Put X 1 : = B - 1 Z e 1 0 , then MX 1 = V e and so X = X 1 is a solution to MX = V e with:
X 1 1 B - 1 · Z e 1 1 = B - 1 · Z e 1 B - 1 · A - 1 · V e 1 = m B - 1 · A - 1 : = B .
Let X 0 = 1 ( 1 , 1 , , 1 ) T D ( E ( X ) ) and X 0 be the empirical model { X 0 | C i } i = 1 m . By directly computing, we obtain that M X 0 = V X 0 . By Equation (14), we see that X 1 1 B , and then:
( X 1 + B X 0 ) [ j ] = X 1 [ j ] + B X 0 [ j ] - B + B = 0 , 1 j .
Hence, X = 1 1 + B ( X 1 + B X 0 ) is a non-negative solution to MX = 1 1 + B V e + B V X 0 . Using Theorem 3, we obtain that 1 1 + B ( e + B X 0 ) is non-contextual. By Equation (7), we get that R g ( e X 0 ) B . Thus, we obtain by Equations (8) and (14) that Equation (11) holds.
(ii) First, let us prove that R g ( e ) is finite for any empirical model e. To do this, we take an empirical model e and let f = X 0 given in (i). Note that f C i = X 0 | C i > 0 for all i = 1 , 2 , , m , we can choose a small ε > 0 such that g : = ( 1 + ε ) f + ( - ε ) e is an empirical model. Then, f = γ g , e ( ε ) , and so, γ e , g ( 1 / ε ) = f N C E M . This shows that R g ( e ) R g ( e | | g ) 1 / ε < + . Thus, R g ( e ) is finite, even though it may be very large.
By the definitions of R g and R C , it is easy to know that 0 R g ( e ) R C ( e ) for any e E M . Since e is non-contextual if and only if R C ( e ) = 0 , we obtain that R g ( e ) = 0 for non-contextual e E M . If R g ( e ) = 0 , then there exists e E M such that 1 1 + 0 e + 0 1 + 0 e N C E M by Equations (7) and (8). Thus, e N C E M .
(iii) Since e is contextual, we can assume that R g ( e ) ( 0 , + ) in the following. Put:
Y ( e ) = x [ 0 , + ) : γ e , e ( x ) C E M , e E M .
Then, 0 Y ( e ) , and so, Y ( e ) is not empty.
At first, we shall show that R g ( e ) is an upper bound of the set Y ( e ) . Suppose that there exists an x 0 Y ( e ) such that x 0 > R g ( e ) . Let R g ( e ) = R g ( e e ) for some e E M such that γ e , e ( y ) N C E M where y = R g ( e e ) . For any f N C E M , we see from the convexity of N C E M [12] that:
g : = 1 + y 1 + x 0 γ e , e ( y ) + x 0 - y 1 + x 0 f N C E M .
Set e = y x 0 e + x 0 - y x 0 f E M . Then:
γ e , e ( x 0 ) = 1 1 + x 0 e + x 0 1 + x 0 y x 0 e + x 0 - y x 0 f = g N C E M ,
which contradicts the property of x 0 . This shows that R g ( e ) is an upper bound of the set Y ( e ) .
Then, we shall prove that R g ( e ) is the supremum of the set Y ( e ) . Since e is contextual, we obtain from (ii) that R g ( e ) > 0 . For any ε ( 0 , R g ( e ) ) , take x = R g ( e ) - ε 2 . Then, x ( 0 , + ) and R g ( e ) - ε < x < R g ( e ) . If there exists an e E M such that γ e , e ( x ) N C E M , then R g ( e ) R g ( e e ) x < R g ( e ) , a contradiction. Hence, γ e , e ( x ) C E M for all e E M , and so, x Y ( e ) with R g ( e ) - ε < x . Therefore, R g ( e ) = sup Y ( e ) , i.e., (12) holds.
(iv) Let:
e 1 , e 2 E M , R g ( e 1 ) = x 1 , R g ( e 2 ) = x 2
and e = λ e 1 + ( 1 - λ ) e 2 ( λ ( 0 , 1 ) ) . Then by (ii) we see that both x 1 and x 2 are finite. Put x = λ x 1 + ( 1 - λ ) x 2 . Thus, there exist e 1 , e 2 E M such that γ e 1 , e 1 ( x 1 ) , γ e 2 , e 2 ( x 2 ) N C E M and:
R g ( e 1 ) = R g ( e 1 | | e 1 ) , R g ( e 2 ) = R g ( e 2 | | e 2 ) .
Since λ x 1 x , ( 1 - λ ) x 2 x 0 and λ x 1 x + ( 1 - λ ) x 2 x = 1 , we get e : = λ x 1 x e 1 + ( 1 - λ ) x 2 x e 2 E M , and:
γ e , e ( x ) = 1 1 + x e + x 1 + x e = 1 1 + x ( λ e 1 + ( 1 - λ ) e 2 ) + x 1 + x λ x 1 x e 1 + ( 1 - λ ) x 2 x e 2 = λ ( 1 + x 1 ) 1 + x 1 1 + x 1 e 1 + x 1 1 + x 1 e 1 + ( 1 - λ ) ( 1 + x 2 ) 1 + x 1 1 + x 2 e 2 + x 2 1 + x 2 e 2 = λ ( 1 + x 1 ) 1 + x γ e 1 , e 1 ( x 1 ) + ( 1 - λ ) ( 1 + x 2 ) 1 + x γ e 2 , e 2 ( x 2 ) .
Observing that:
λ ( 1 + x 1 ) 1 + x , ( 1 - λ ) ( 1 + x 2 ) 1 + x 0 , λ ( 1 + x 1 ) 1 + x + ( 1 - λ ) ( 1 + x 2 ) 1 + x = 1 ,
we see that γ e , e ( x ) N C E M . Consequently,
R g ( λ e 1 + ( 1 - λ ) e 2 ) = R g ( e ) R g ( e | | e ) x = λ R g ( e 1 ) + ( 1 - λ ) R g ( e 2 ) .
(v) Assume that x = R g ( e f ) < + . Clearly, if x = 0 , then R g ( e ) = 0 by Equation (8). We see from (ii) that R g ( f ) < + , and so, R g ( e ) R g ( f ) = 0 < 1 . Next, we assume that x > 0 . Then, γ e , f ( x ) = e + x f 1 + x N C E M . Since:
γ f , e ( 1 x ) = f + 1 x e 1 + 1 x = γ e , f ( x ) N C E M ,
we obtain that R g ( f e ) 1 x and then:
R g ( e ) R g ( f ) R g ( e f ) R g ( f e ) x × 1 x = 1 .
For any e E M , we see from Equation (8) that there exists an empirical model f such that R g ( e f ) = R g ( e ) . The first conclusion of (ii) yields that R g ( e f ) < , and then, the first conclusion implies that R g ( e ) R g ( f ) 1 .
(vi) Assume that e n N S E M ( n = 1 , 2 , ) such that lim n e n = e . By the closedness of N S E M ([12], Theorem 2.2), we obtain that e N S E M .
Claim 1. 
R g ( e ) lim ̲ n R g ( e n ) .
Put x = lim ̲ n R g ( e n ) . Then, x = lim k R g ( e n k ) for some subsequence { e n k } k = 1 . For each k = 1 , 2 , , there exists f k N S E M such that R g ( e n k ) = R g ( e n k | | f k ) : = x k [ 0 , ) . The compactness of N S E M ([12], Theorem 2.2) yields that there exists a subsequence { f k j } k = 1 + satisfying f k j f N S E M as j . Since
1 1 + x k j e n k j + x k j 1 + x k j f k j N C E M
and N C E M is closed, we have:
1 1 + x k j e n k j + x k j 1 + x k j f k j 1 1 + x e + x 1 + x f N C E M .
By Equation (7) and (8), we know that R g ( e ) R g ( e | | f ) x = lim ̲ n R g ( e n ) .
Claim 2. 
lim ¯ n R g ( e n ) R g ( e ) .
Assume that lim ¯ n R g ( e n ) = lim k R g ( e n k ) .
When the set { k : e n k e } is finite, then we obtain that lim ¯ n R g ( e n ) = lim k R g ( e n k ) = R g ( e ) .
When the set { k : e n k e } is infinite, there exists subsequence { e n k j } j = 1 of { e n k } k = 1 such that e n k j e for any j. For any C i M , take:
F C i = { s E ( C i ) : e C i ( s ) = 0 } , G C i = { s E ( C i ) : e C i ( s ) 0 } .
Then:
F C i G C i = and F C i G C i = E ( C i ) .
Since s E ( C i ) e C i ( s ) = 1 and e C i ( s ) 0 for any s E ( C i ) , we get that G C i . For any s G C i , since e C i ( s ) > 0 and e C i n k j ( s ) e C i ( s ) as j goes to infinity, we obtain that there exists positive integer J C i , s such that:
e C i n k j ( s ) > 1 2 e C i ( s ) > 0 , j > J C i , s .
Take:
J = max { J C i , s : C i M , s G C i } .
Then, we have that e C i n k j ( s ) > 0 for any j > J , C i M and s G C i . For any j > J , take:
ε j = max C i M , s G C i max 0 , e C i ( s ) e C i n k j ( s ) - 1 max C i M , s G C i e C i ( s ) e C i n k j ( s ) - 1 .
Thus, ε j is convergent to zero since e n k j converges to e and ε j > 0 for any j. Otherwise, when ε j = 0 for some j, we have e C i ( s ) e C i n k j ( s ) for any C i M and s E ( C i ) . Since:
1 = s E ( C i ) e C i ( s ) = s G C i e C i ( s ) s G C i e C i n k j ( s ) s E ( C i ) e C i n k j ( s ) = 1 ,
we obtain that e C i n k j ( s ) = e C i ( s ) for any C i M , s E ( C i ) , and then, e n k j = e , which contradicts the fact that e n k j e for all j. Thus, we obtain a sequence of positive numbers ε j with limit zero. Take:
f C i j ( s ) = 1 1 - 1 1 + ε j e C i n k j ( s ) , s F C i e C i n k j ( s ) - 1 1 + ε j e C i ( s ) 1 - 1 1 + ε j , s G C i ,
for any C i M , s E ( C i ) . Since ε j e C i ( s ) e C i n k j ( s ) - 1 for any C i M and s G C i , we have:
1 + ε j e C i ( s ) e C i n k j ( s ) > 0 , for any C i M , s G C i .
Hence,
e C i n k j ( s ) - 1 1 + ε j e C i ( s ) e C i n k j ( s ) - e C i n k j ( s ) e C i ( s ) e C i ( s ) = 0 , C i M , s G C i
and so, for any C i M , we have that f C i j ( s ) 0 for all s E ( C i ) . By directly computing, we obtain that s E ( C i ) f C i j ( s ) = 1 for any C i M and then f j E M . Since:
e n k j = 1 - 1 1 + ε j f j + 1 1 + ε j e ,
R g is convex (by (iv)) and R g ( f j ) m A - 1 · B - 1 for any j (by (i)), we obtain that for any j,
R g ( e n k j ) = R g 1 - 1 1 + ε j f j + 1 1 + ε j e 1 - 1 1 + ε j R g ( f j ) + 1 1 + ε j R g ( e ) 1 - 1 1 + ε j m A - 1 · B - 1 + 1 1 + ε j R g ( e ) R g ( e ) .
Therefore,
lim ¯ n R g ( e n ) = lim j R g ( e n k j ) R g ( e ) .
Combining Claim 1 with Claim 2, we see that:
R g ( e ) lim ̲ n R g ( e n ) lim ¯ n R g ( e n ) R g ( e )
and then lim n R g ( e n ) = R g ( e ) .   □
By Equation (13), we observe that:
R g ( λ e 1 + ( 1 - λ ) e 2 ) max { R g ( e 1 ) , R g ( e 2 ) } , λ ( 0 , 1 ) .
This means that there does not exist a parameter λ ( 0 , 1 ) such that:
R g ( λ e 1 + ( 1 - λ ) e 2 ) > R g ( e 1 ) and R g ( λ e 1 + ( 1 - λ ) e 2 ) > R g ( e 2 ) .
In other words, mixing of two empirical models does not increase simultaneously the GRoC of the mixed empirical models. Theorem 4. (v) says that R g ( e ) and R g ( f ) cannot be large simultaneously whenever e , f E M and R g ( e f ) < + . By the compactness of E M ([12], Theorem 2.2), we obtain that Claim 1 also holds for e n E M ( n = 1 , 2 , ) such that lim n e n = e , i.e. for any e 0 E M and any ε > 0 , there exists δ > 0 such that R g ( e 0 ) - ε < R g ( e ) provided that e E M with e - e 0 < δ .
Definition 8 
([10]). An empirical model e = { e C i } C i M is said to be strongly contextual if for any s E ( X ) there exists C i M such that e C i ( s | C i ) = 0 .
Definition 9 
([12]). The quantity:
C ( e ) = inf p [ 0 , 1 ] : e = p e + ( 1 - p ) e , e E M , e N C E M
is called the contextuality cost of e E M .
Corollary 1. 
There exists a strongly contextual e 0 N S E M such that:
R g ( e 0 ) = max { R g ( e ) : e N S E M } .
Proof. 
Since R g is continuous on N S E M and N S E M is a compact set, we obtain that R g has a maximal value on N S E M . For any e C E M N S E M , if e is not strongly contextual, then the cost of contextuality C ( e ) of e is strictly less than one ([12], Theorem 4.1), and there exist strongly contextual f N S E M and non-contextual h E M such that e = C ( e ) f + ( 1 - C ( e ) ) h ([12], Corollary 4.1). Since h is non-contextual, we see from Theorem 4 that R g ( h ) = 0 . It follows from the convexity of R g (Theorem 4) that:
R g ( e ) C ( e ) R g ( f ) + ( 1 - C ( e ) ) R g ( h ) = C ( e ) R g ( f ) < R g ( f ) .
This shows that the maximal value of R g over N S E M must be attained at some strongly contextual and no-signaling empirical model.   □

3. The GRoC of n -Cycle Boxes

In this section, we consider n dichotomic observables X 0 , , X n - 1 , where each consecutive pair { X i , X i + 1 } , sum mod n, is jointly measurable and take:
X = { X i } i = 0 n - 1 , O = { 0 , 1 } , and M = { C i } i = 0 n - 1 with C i = { X i , X i + 1 } .
Then, ( X , M , O ) is an MS. The no-signaling empirical models on MS ( X , M , O ) are said to be n-cycle boxes. To compute the GRoC of n-cycle boxes, the following notations and lemmas are needed. Denote events on measurement context C i as:
s 00 i : C i O with s 00 i ( X i ) = s 00 i ( X i + 1 ) = 0 ; s 01 i : C i O with s 01 i ( X i ) = 0 , s 01 i ( X i + 1 ) = 1 ;
s 10 i : C i O with s 10 i ( X i ) = 1 , s 10 i ( X i + 1 ) = 0 ; s 11 i : C i O with s 11 i ( X i ) = s 11 i ( X i + 1 ) = 1 ,
where the sum is mod n. Thus, E ( C i ) = { s 00 i , s 01 i , s 10 i , s 11 i } for any C i . For any n-cycle box e = { e C i } C i M , take:
E i e = e C i ( s 00 i ) + e C i ( s 11 i ) - e C i ( s 01 i ) - e C i ( s 10 i ) .
Put:
Γ = { { γ i } i = 0 n - 1 : γ i { - 1 , 1 } , | { i : γ i = - 1 } | is odd } .
In the following, we assume that n 4 unless otherwise stated and compute R g ( e ) .
Lemma 1 
([16]). An n-cycle box e is non-contextual if and only if all 2 n - 1 tight non-contextuality inequalities hold, i.e.,
Ω e , { γ i } i = 0 n - 1 = i = 0 n - 1 γ i E i e n - 2 , { γ i } i = 0 n - 1 Γ .
For an n-cycle box e, take:
e = max Ω e , { γ i } i = 0 n - 1 : { γ i } i = 0 n - 1 Γ - ( n - 2 ) .
Then, e quantifies the extent of violating the non-contextual inequalities in Lemma 1. By Lemma 1 and Equation (17), we see that e is non-contextual if and only if e 0 .
Lemma 2. 
For every contextual n-cycle box e, there exists one and only one non-contextuality inequality of all 2 n - 1 tight non-contextuality inequalities that is violated. That is, for an n-cycle box e, if there exists { γ i } i = 0 n - 1 Γ such that Ω e , { γ i } i = 0 n - 1 > n - 2 , then:
Ω e , { β i } i = 0 n - 1 < n - 2 , { β i } i = 0 n - 1 Γ \ { { γ i } i = 0 n - 1 } .
Proof. 
Assume that { γ i } i = 0 n - 1 Γ such that Ω e , { γ i } i = 0 n - 1 > n - 2 . Let { β i } i = 0 n - 1 Γ \ { { γ i } i = 0 n - 1 } . Then, we obtain by Equation (16) that γ i , β i { - 1 , 1 } ; both | { i : γ i = - 1 } | and | { i : β i = - 1 } | are odd numbers and { β i } i = 0 n - 1 { γ i } i = 0 n - 1 . Therefore, there exist 0 j k n - 1 such that β j = - γ j and β k = - γ k . Since e C i D ( E ( C i ) ) , we obtain that | E i e | 1 by Equation (15). Moreover, ( n - 2 ) - i j , k γ i E i e < γ j E j e + γ k E k e since Ω e , { γ i } i = 0 n - 1 > n - 2 . Thus,
Ω e , { β i } i = 0 n - 1 = i = 0 n - 1 β i E i e = i j , k β i E i e - γ j E j e - γ k E k e < i j , k β i E i e - ( n - 2 ) - i j , k γ i E i e 2 i j , k | E i e | - ( n - 2 ) 2 ( n - 2 ) - ( n - 2 ) = n - 2 .
   □
With these lemmas, we can prove the following theorem.
Theorem 5. 
For any n-cycle box e, it holds that:
R g ( e ) = max { e , 0 } 2 n - 2 .
Proof. 
  • Case (i): If e is non-contextual, then we have that R g ( e ) = 0 by Theorem 4 (ii) and Ω e , { γ i } i = 0 n - 1 n - 2 for any { γ i } i = 0 n - 1 Γ by Lemma 1. By Equation (17), we see that e 0 , and so, (18) holds.
  • Case (ii): If e is contextual, then there exists one and only one { γ i } i = 0 n - 1 Γ such that Ω e , { γ i } i = 0 n - 1 > n - 2 , and so:
    Ω e , { β i } i = 0 n - 1 = i = 0 n - 1 β i E i e < n - 2 , { β i } i = 0 n - 1 Γ \ { { γ i } i = 0 n - 1 } .
    Take
    x 0 = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) 2 n - 2 .
    Then, x 0 = e 2 n - 2 = max { e , 0 } 2 n - 2 . Clearly, there exists n-cycle box f such that:
    E i f = 1 , if γ i = - 1 ; - 1 , if γ i = 1 .
  • Case (ii a ): If n is an even number, then we obtain that { - γ i } i = 0 n - 1 Γ and Ω f , { - γ i } i = 0 n - 1 = n . By Lemma 2, we have that:
    Ω f , { β i } i = 0 n - 1 = i = 0 n - 1 β i E i f < n - 2 , { β i } i = 0 n - 1 Γ \ { { - γ i } i = 0 n - 1 } .
Claim 3. 
R g ( e | | f ) = x 0 .
By Lemma 1 and Inequalities (19) and (20), we obtain that 1 1 + x e + x 1 + x f is non-contextual if and only if:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω f , { γ i } i = 0 n - 1 = 1 1 + x Ω e , { γ i } i = 0 n - 1 - n x 1 + x n - 2
and:
1 1 + x Ω e , { - γ i } i = 0 n - 1 + x 1 + x Ω f , { - γ i } i = 0 n - 1 = - 1 1 + x Ω e , { γ i } i = 0 n - 1 + n x 1 + x n - 2 ,
i.e.,
x 0 = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) 2 n - 2 x Ω e , { γ i } i = 0 n - 1 + ( n - 2 ) 2 .
By Equation (7), we obtain that R g ( e | | f ) = x 0 .
Claim 4. 
R g ( e ) = x 0 .
By Claim 3 and Equation (8), we have R g ( e ) x 0 . Take:
E M 1 = { h E M : Ω h , { γ i } i = 0 n - 1 > n - 2 } ,
E M 2 = { h E M : - n Ω h , { γ i } i = 0 n - 1 < - ( n - 2 ) }
and:
E M 3 = { h E M : - ( n - 2 ) Ω h , { γ i } i = 0 n - 1 n - 2 } .
Then, E M 1 E M 2 E M 3 = E M .
For h E M 1 , we have:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω h , { γ i } i = 0 n - 1 > n - 2 , x [ 0 , + ] .
Hence, we have from Lemma 1 that 1 1 + x e + x 1 + x h is contextual for any x [ 0 , + ] , and so, R g ( e | | h ) = + > x 0 by Equation (7).
For h E M 2 , we have that Ω h , { - γ i } i = 0 n - 1 > n - 2 , and so:
Ω h , { β i } i = 0 n - 1 = i = 0 n - 1 β i E i h < n - 2 , { β i } i = 0 n - 1 Γ \ { { - γ i } i = 0 n - 1 } .
By Lemma 1 and Inequalities (19) and (21), we obtain that 1 1 + x e + x 1 + x h is non-contextual if and only if:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω h , { γ i } i = 0 n - 1 n - 2
and:
1 1 + x Ω e , { - γ i } i = 0 n - 1 + x 1 + x Ω h , { - γ i } i = 0 n - 1 n - 2 ,
i.e.,
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x and x Ω e , { γ i } i = 0 n - 1 + ( n - 2 ) Ω h , { - γ i } i = 0 n - 1 - ( n - 2 ) .
Since:
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 2 n - 2 1 n - 2 2 Ω e , { γ i } i = 0 n - 1 + ( n - 2 ) Ω h , { - γ i } i = 0 n - 1 - ( n - 2 )
for n 4 , we obtain that 1 1 + x e + x 1 + x h is non-contextual if and only if:
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x Ω e , { γ i } i = 0 n - 1 + ( n - 2 ) Ω h , { - γ i } i = 0 n - 1 - ( n - 2 ) .
By Equation (7), we get that R g ( e | | h ) = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 . Since Ω h , { γ i } i = 0 n - 1 - n , we see that R g ( e | | h ) x 0 .
When h E M 3 N C E M , we know that:
Ω h , { β i } i = 0 n - 1 = i = 0 n - 1 β i E i h n - 2 , { β i } i = 0 n - 1 Γ .
Combining Lemma 1 and Inequalities (19) and (23), we get that 1 1 + x e + x 1 + x h is non-contextual if and only if:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω h , { γ i } i = 0 n - 1 n - 2 .
If Ω h , { γ i } i = 0 n - 1 = n - 2 , then for any x [ 0 , + ) , Inequality (24) is always violated, and so, 1 1 + x e + x 1 + x h is contextual. By Equation (7), we obtain from inequality (24) that R g ( e | | h ) = + x 0 . If Ω h , { γ i } i = 0 n - 1 < n - 2 , we obtain that 1 1 + x e + x 1 + x h is non-contextual if and only if:
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x .
By Equation (7), we see that:
R g ( e | | h ) = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 .
Since Ω h , { γ i } i = 0 n - 1 > - n , we obtain that R g ( e | | h ) > x 0 .
When h E M 3 C E M , there exists { β i } i = 0 n - 1 Γ \ { { γ i } i = 0 n - 1 , { - γ i } i = 0 n - 1 } such that Ω h , { β i } i = 0 n - 1 > n - 2 , and then:
Ω h , { α i } i = 0 n - 1 < n - 2 , { α i } i = 0 n - 1 Γ \ { { β i } i = 0 n - 1 } .
By Lemma 1 and Inequalities (19) and (25), we have that 1 1 + x e + x 1 + x h is non-contextual if and only if:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω h , { γ i } i = 0 n - 1 n - 2
and:
1 1 + x Ω e , { β i } i = 0 n - 1 + x 1 + x Ω h , { β i } i = 0 n - 1 n - 2 ,
i.e.,
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x and x Ω e , { β i } i = 0 n - 1 + ( n - 2 ) Ω h , { β i } i = 0 n - 1 - ( n - 2 ) .
Hence,
R g ( e | | h ) = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 , if Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 Ω e , { β i } i = 0 n - 1 + ( n - 2 ) Ω h , { β i } i = 0 n - 1 - ( n - 2 ) ; + , otherwise.
Thus,
R g ( e | | h ) Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 .
Since Ω h , { γ i } i = 0 n - 1 > - n , we obtain that R g ( e | | h ) > x 0 .
In a word, we obtain that R g ( e | | h ) x 0 for any h E M and R g ( e | | f ) = x 0 . Therefore, we have from Equation (8) that R g ( e ) = x 0 .
  • Case (ii b ): If n is an odd number, then it is easy to find that:
    Ω f , { β i } i = 0 n - 1 = i = 0 n - 1 β i E i f = i = 0 n - 1 ( - β i γ i ) n - 2 , { β i } i = 0 n - 1 Γ .
Claim 5. 
R g ( e | | f ) = x 0 .
From Lemma 1 and Inequalities (19) and (26), we get that 1 1 + x e + x 1 + x f is non-contextual if and only if
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω f , { γ i } i = 0 n - 1 n - 2
i.e.,
x 0 = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) 2 n - 2 x .
Therefore, R g ( e | | f ) = x 0 .
Claim 6. 
R g ( e ) = x 0 .
By Claim 5 and Equation (8), we have R g ( e ) x 0 . Take:
E M 1 = { h E M : Ω h , { γ i } i = 0 n - 1 n - 2 } , E M 2 = { h E M : Ω h , { γ i } i = 0 n - 1 < ( n - 2 ) } .
For h E M 1 , it is easy to check that R g ( e | | h ) = + x 0 .
For h E M 2 N C E M , we see from Lemma 1 and Inequality (18) that 1 1 + x e + x 1 + x h is non-contextual if and only if:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω h , { γ i } i = 0 n - 1 n - 2 ,
i.e.,
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x
Hence,
R g ( e | | h ) = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x 0 .
For h E M 2 C E M , there exists { β i } i = 0 n - 1 Γ \ { { γ i } i = 0 n - 1 } such that Ω h , { β i } i = 0 n - 1 > n - 2 , and so:
Ω h , { α i } i = 0 n - 1 < n - 2 , { α i } i = 0 n - 1 Γ \ { { β i } i = 0 n - 1 } .
By Lemma 1 and Inequalities (19) and (27), we obtain that 1 1 + x e + x 1 + x h is non-contextual if and only if:
1 1 + x Ω e , { γ i } i = 0 n - 1 + x 1 + x Ω h , { γ i } i = 0 n - 1 n - 2
and:
1 1 + x Ω e , { β i } i = 0 n - 1 + s 1 + x Ω h , { β i } i = 0 n - 1 n - 2 ,
i.e.,
Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x and x n - 2 - Ω e , { β i } i = 0 n - 1 Ω h , { β i } i = 0 n - 1 - ( n - 2 ) .
Hence,
R g ( e | | h ) = Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 , if n - 2 - Ω e , { β i } i = 0 n - 1 Ω h , { β i } i = 0 n - 1 - ( n - 2 ) Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 ; + , otherwise.
Therefore,
R g ( e | | h ) Ω e , { γ i } i = 0 n - 1 - ( n - 2 ) n - 2 - Ω h , { γ i } i = 0 n - 1 x 0 .
Now, we have shown that R g ( e | | h ) x 0 = R g ( e | | f ) for any h E M . Therefore, R g ( e ) = x 0 . This shows that Equation (18) holds.   □
Remark 3. 
In [13], we have computed the robustness of contextuality of an n-cycle box e and obtained that:
R C ( e ) = max { e , 0 } 2 n - 4 , n is even; max { e , 0 } 2 n - 2 , n is odd.
Hence, R g ( e ) = R C ( e ) for even n and R g ( e ) < R C ( e ) for odd n.
Example 1. 
For any n-cycle box f, we have E i f 1 for any i, and so, Ω f , { γ i } i = 0 n - 1 n for any { γ i } i = 0 n - 1 Γ . Hence, Δ f 2 by Equation (17), and then, Equation (18) implies that R g ( f ) 1 n - 1 .
Let us consider the n-chain box e = C H n in [7], which is given by:
e C i ( s 00 i ) = e C i ( s 11 i ) = 1 2 , e C i ( s 01 i ) = e C i ( s 10 i ) = 0 ( i = 0 , 1 , , n - 2 ) ,
e C n - 1 ( s 00 n - 1 ) = e C n - 1 ( s 11 n - 1 ) = 0 , e C n - 1 ( s 01 n - 1 ) = e C n - 1 ( s 10 n - 1 ) = 1 2 .
By taking γ 0 = γ 1 = = γ n - 2 = 1 and γ n - 1 = - 1 , we obtain that { γ i } i = 0 n - 1 Γ and Ω e , { γ i } i = 0 n - 1 = n . Thus, Δ e = 2 by Equation (17), and then, Equation (18) implies that R g ( e ) = 1 n - 1 . This shows that:
max { R g ( e ) : e is   an n - cycle box } = R g ( C H n ) = 1 n - 1 .

4. Conclusions

Because noises are not always non-contextual, we have introduced and discussed the generalized robustness of contextuality (GRoC) R g ( e ) of an empirical model e against general noises. We also have proven that R g ( e ) = 0 if and only if e is non-contextual. This means that the quantity R g can be used to distinguish non-contextual empirical models from contextual ones. For any two empirical models e and f with R g ( e f ) < , it has been proven R g ( e ) R g ( f ) 1 , which reveals a fascinating relationship between the GRoCs of e and f. A relationship between GRoC and the extent of violating the non-contextual inequalities for n-cycle ( n 4 ) boxes has also been established, which reads R g ( e ) = max { Δ e , 0 } 2 n - 2 . Thus, for any n-cycle boxes e and f, when Δ e Δ f , we have R g ( e ) R g ( f ) ; when e and f are contextual, we have Δ e Δ f if and only if R g ( e ) R g ( f ) . This means that R g ( e ) can be used to quantify the contextuality of n-cycle boxes. Moreover, we have proven that the maximal value of R g over N S E M must be attained at some strongly contextual model. This shows that to some extent, R g ( e ) contains the quantity of contextuality of e.

Acknowledgments

This work was supported by the National Natural Science Foundation of China (Grant Nos. 11371012, 11401359, 11471200, 11571211 and 11571213), the Fundamental Research Funds for the Central Universities (Grant No. GK201604001) and the Innovation Fund Project for Graduate Program of Shaanxi Normal University (Grant No. 2016CBY005).

Author Contributions

Wenhua Wang proved that the faithfulness of R g and Theorem 4(iii). Yajing Fan showed the convexity of R g . Liang Chen helped to depict the figures. The rest work of this paper was accomplished by Huaixin Cao and Huixian Meng, and discussed by the team of authors. All the authors have revised the paper carefully and approved the research contents that were written in the final manuscript. All authors have read and approved the final manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kochen, S.; Specker, E.P. The Problem of Hidden Variables in Quantum Mechanics. J. Math. Mech. 1967, 17, 59–87. [Google Scholar] [CrossRef]
  2. DiVincenzo, D.P.; Peres, A. Quantum code words contradict local realism. Phys. Rev. A 1997, 55, 4089–4092. [Google Scholar] [CrossRef]
  3. Galvão, E.F. Foundations of quantum theory and quantum information applications. Ph.D. Thesis, Oxford University, Oxford, UK, 2002. [Google Scholar]
  4. Nagata, K. Kochen-Specker theorem as a precondition for secure quantum key distribution. Phys. Rev. A 2005, 72, 012325. [Google Scholar] [CrossRef]
  5. Aharon, N.; Vaidman, L. Quantum advantages in classically defined tasks. Phys. Rev. A 2008, 77, 052310. [Google Scholar] [CrossRef]
  6. Howard, M.; Wallman, M.J.; Veitch, V.; Emerson, J. Contextuality supplies the “magic” for quantum computation. Nature 2014, 510, 351–355. [Google Scholar] [CrossRef] [PubMed]
  7. Grudka, A.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Horodecki, R.; Joshi, P.; Klus, W.; Wocik, A. Quantifying contextuality. Phys. Rev. Lett. 2014, 112, 1204011. [Google Scholar] [CrossRef] [PubMed]
  8. Einstein, A.; Podolski, B.; Rosen, N. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 1935, 47, 777. [Google Scholar] [CrossRef]
  9. Bell, J. Speakable and Unspeakable in Quantum Mechanics: Collected Papers on Quantum Philosophy; Cambridge University Press: Cambridge, UK, 1987. [Google Scholar]
  10. Abramsky, S.; Brandenburger, A. The Sheaf-theoretic structure of non-locality and contextuality. New J. Phys. 2011, 13, 113036. [Google Scholar] [CrossRef]
  11. Vidal, G.; Tarrach, R. Robustness of entanglement. Phys. Rev. A. 1999, 59, 141–155. [Google Scholar] [CrossRef] [Green Version]
  12. Meng, H.X.; Cao, H.X.; Wang, W.H. The robustness of contextuality and the contextuality cost of empirical models. Sci. China Phys. Mech. Astron. 2016, 59, 640303. [Google Scholar] [CrossRef]
  13. Meng, H.X.; Cao, H.X.; Wang, W.H.; Chen, L.; Fan, Y.J. Continuity of the robustness of contextuality of empirical models. Sci. China Phys. Mech. Astron. 2016, 59, 100311. [Google Scholar] [CrossRef]
  14. Steiner, M. Generalized robustness of entanglement. Phys. Rev. A. 2003, 67, 054305. [Google Scholar] [CrossRef]
  15. Abramsky, S.; Hardy, L. Logical Bell inequalities. Phys. Rev. A. 2012, 85, 062114. [Google Scholar] [CrossRef]
  16. Araújo, M.; Quintino, M.T.; Budroni, C.; Cunha, M.T.; Cabello, A. All non-contextuality inequalities for the n-cycle scenario. Phys. Rev. A. 2013, 88, 022118. [Google Scholar]
  17. 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]
  18. Cabello, A. Experimentally testable state-independent quantum contextuality. Phys. Rev. Lett. 2008, 101, 210401. [Google Scholar] [CrossRef] [PubMed]
  19. Kirchmair, G.; Zahringer, F.; Gerritsma, R.; Kleinmann, M.; Guhne, O.; Cabello, A.; Blatt, R.; Roos, C.F. State-independent experimental test of quantum contextuality. Nature 2009, 460, 494–497. [Google Scholar] [CrossRef]
  20. Amselem, E.; Radmark, M.; Bourennane, M.; Cabello, A. State-independent quantum contextuality with single photons. Phys. Rev. Lett. 2009, 103, 160405. [Google Scholar] [CrossRef] [PubMed]
  21. Lapkiewicz, R.; Li, P.; Schaeff, C.; Langford, N.K.; Ramelow, S.; Wiesniak, M.; Zeilinger, A. An experimental proposal for revealing contextuality in almost all qutrit states. Sci. Rep. 2013, 3, 2706. [Google Scholar] [CrossRef]
  22. Horn, R.A.; Johnson, C.R. Matrix Analysis; Cambridge Univerisity Press: Cambridge, UK, 1985. [Google Scholar]
Figure 1. An illustration of an empirical model.
Figure 1. An illustration of an empirical model.
Entropy 18 00297 g001
Figure 2. An illustration of s | C C = t and s | C C = t .
Figure 2. An illustration of s | C C = t and s | C C = t .
Entropy 18 00297 g002
Figure 3. An illustration of p | C .
Figure 3. An illustration of p | C .
Entropy 18 00297 g003
Figure 4. An illustration of R g ( e f ) .
Figure 4. An illustration of R g ( e f ) .
Entropy 18 00297 g004
Figure 5. An illustration of the GRoC of an empirical model e.
Figure 5. An illustration of the GRoC of an empirical model e.
Entropy 18 00297 g005

Share and Cite

MDPI and ACS Style

Meng, H.; Cao, H.; Wang, W.; Fan, Y.; Chen, L. Generalized Robustness of Contextuality. Entropy 2016, 18, 297. https://doi.org/10.3390/e18090297

AMA Style

Meng H, Cao H, Wang W, Fan Y, Chen L. Generalized Robustness of Contextuality. Entropy. 2016; 18(9):297. https://doi.org/10.3390/e18090297

Chicago/Turabian Style

Meng, Huixian, Huaixin Cao, Wenhua Wang, Yajing Fan, and Liang Chen. 2016. "Generalized Robustness of Contextuality" Entropy 18, no. 9: 297. https://doi.org/10.3390/e18090297

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop