Graph-theoretic approach to dimension witnessing

A fundamental problem in quantum computation and quantum information is finding the minimum quantum dimension needed for a task. For tasks involving state preparation and measurements, this problem can be addressed using only the input-output correlations. This has been applied to Bell, prepare-and-measure, and Kochen-Specker contextuality scenarios. Here, we introduce a novel approach to quantum dimension witnessing for scenarios with one preparation and several measurements, which uses the graphs of mutual exclusivity between sets of measurement events. We present the concepts and tools needed for graph-theoretic quantum dimension witnessing and illustrate their use by identifying novel quantum dimension witnesses, including a family that can certify arbitrarily high quantum dimensions with few events.


Introduction
The dimensionality of a quantum system is crucial for its ability to perform quantum information processing tasks. For example, the security of some protocols for quantum key distribution and randomness expansion depends on the presumed dimensionality of the underlying physical system. The dimensionality also plays a crucial role in device characterisation tasks. Also, non-classical phenomena such as Kochen-Specker contextuality is known to require quantum systems of dimension at least three [KS67]. Therefore, it is of fundamental importance to have efficient tools to determine the dimensionality of the underlying Hilbert space where the measurement operators act on the physical system for any experimental setup.
There are several approaches to tackle this problem. One of them is known as self-testing [MY04]. The idea of self-testing is to identify unique equivalence class of configurations corresponding to extremal quantum violation of a Bell inequality. The members of the equivalence class are related via some fixed local isometry. The dimension of the individual quantum system can be lower bounded by identifying the equivalence class of configurations attaining the optimality [MY04]. Though initially proposed in the setting of Bell non-locality, the idea of self-testing has been extended to prepare-and-measure scenarios, contextuality, and quantum steering [TKV + 18, BRV + 19b, BRV + 19a, ŠH16,SBK20]. For a review of self-testing, we refer to [ŠB19]. It is important to stress that only extremal points of the quantum set of correlations that can be attained via finite-dimensional configurations admit self-testing [GKW + 18].
The second approach is tomography. Quantum tomography is a process via which the description of a quantum state is obtained by performing measurements on an ensemble of identical quantum states. For quantum systems of dimension d, to estimate an unknown quantum system to an error (in l 1 norm) requires Θ (d 2 −2 ) copies of a quantum state [OW16]. One drawback of this approach is that it requires a prior knowledge of the dimensionality of the system.
The third approach is dimension witnesses [BPA + 08]. This is the approach we will focus on in this paper. The goal of dimension witness is to render a lower bound on the dimensionality of the underlying physical system based on the experimental statistics. For example, a quantum dimension witness is a quantity that can be computed from the input-output correlations and whose value gives a lower bound to the dimension of the Hilbert space needed to accommodate the density matrices and the measurement operators needed to produce such correlations. Dimension witnesses have been investigated for the following types of scenarios: 1. Bell scenarios: Here, quantum dimension witnesses are based on the observation that certain bipartite Bell non-local correlations are impossible to produce with quantum systems of local dimension d (and thus global dimension d 2 ) or less, implying that the experimental observation of these correlations certifies that the quantum local dimension is at least d + 1 [BPA + 08, VP09,BNV13]. There are dimension witnesses of this type for arbitrarily high quantum local dimension d [BPA + 08], but they require preparing entangled states of dimension d 2 and conditions of spatial separation that do not occur naturally in quantum computers. This approach to dimension witnessing is related to self-testing based on Bell non-local correlations [MY04]. A Bell dimension witness certifies the minimum quantum dimension accessed by the measurement devices acting on the physical systems prepared by a single source.
2. Prepare-and-measure scenarios: These scenarios consists of p different preparation sources and m measurements acting on the physical systems emitted by those sources. Prepare-and-measure dimension witnesses require p > d + 1 preparations to certify classical or quantum dimension d [WCD08,GBHA10]. They have been used to experimentally certify in a device-independent way small classical and quantum dimensions [HGM + 12, ABCB12, DBS + 14]. A prepare-and-measure dimension witness certifies the minimum classical or quantum dimension spanned by the p preparation sources and the m measurements.
3. Kochen-Specker contextuality scenarios: They consist of a single state preparation followed by a sequence of compatible ideal measurements chosen from a fixed set. Two measurements are compatible (or jointly measurable) when there is a third measurement that works as a refinement for both of them, so each of them can be measure by coarse graining the third measurement and thus both of them can be jointly measured. A measurement is ideal when it yields the same outcome when repeated on the same physical system and does not disturb any compatible measurement. Checking experimentally that a set of measurements are ideal and have certain relations of compatibility can be done from the input-output correlations [LMZ + 18]. Correlations between the outcomes of ideal measurements are Kochen-Specker contextual when they cannot be reproduced with models in which measurements have predetermined context-independent outcomes [Cab08,KCBS08]. Quantum Kochen-Specker contextuality dimension witnesses are based on the observation that certain Kochen-Specker contextual correlations are impossible to produce with quantum systems of dimension d or less, implying that its experimental observation certifies a local quantum dimension of at least d. The problem of contextuality dimension witnesses is that they require testing in addition that the measurements are ideal and satisfy certain relations of compatibility. A state-dependent contextuality dimension witness certifies the minimum quantum dimension accessed by the measurement devices acting on the physical systems prepared by a single source. In a state-independent contextuality scenario, these measurements form a state-independent contextuality set in dimension d, defined as one for which the quantum predictions for sequences of compatible measurements for any quantum state in dimension d cannot be reproduced by non-contextual models [CKB15]. The minimum quantum dimension for contextual correlations have been studied in [GBC + 14]. A state-independent Kochen-Specker contextuality dimension witness certifies the minimum quantum dimension accessed by the measurement devices, without relating the conclusion to any particular source.
In this paper, we introduce a novel graph-theoretic approach to quantum dimension witnessing. We deal with abstract structures of measurement events produced for one preparation and several measurements, as is the case in Kochen-Specker contextuality and Bell scenarios. This means that our approach will always work in Kochen-Specker contextuality scenario and sometimes in specific Bell scenarios.
Our approach is, first, based on the observation that the problem of finding dimension witnesses can be reformulated as the problem of finding correlations for structures of exclusivity which are impossible to produce with systems of quantum dimension d or less, implying that its experimental observation certifies a quantum dimension of at least d + 1. Second, it is based on the observation that, given a set of events and their relations of mutual exclusivity, the sets of correlations allowed in quantum theory are connected to well-known and easy to characterize invariants and sets in graph theory [CSW14]. In fact, the power of the graph-theoretic approach to dimension witnessing is based on three pillars: • The connection between correlations for structures of exclusivity and easy to characterize sets in graph theory. This connection allows us to use tools and results of graph theory for quantum graph dimension witnessing.
• The observation that finding dimension witnesses in scenarios with many measurements is difficult due to the difficulty to fully characterize in these scenarios the sets of correlations that cannot be achieved with a given dimension. In contrast, the graph approach allows us to rapidly identify structures of exclusivity that have dimension witnesses, even though many of them correspond to scenarios with many measurements.
• The connection between abstract structures of exclusivity and some specific contextuality scenarios (those consisting of dichotomic measurements having a structure of compatibility isomorphic to the structure of exclusivity). This assures that any quantum dimension witness for a graph of exclusivity always admits a physical realization in some Kochen-Specker contextuality scenario. Moreover, by imposing extra constraints, we can find, in principle, those dimension witness that also admit a physical realizations in a specific Kochen-Specker contextuality or Bell scenario.
The paper is organized as follows. In Sec. 2 we introduce some standard definitions of graph theory and the graph-theoretic approach to correlations. In Sec. 3, we use this graph-theoretic approach to study quantum dimension witness. Specifically, in Subsec. 3.2, we present a heuristic technique to compute a lower bound on the d dimensional-restricted quantum value and find the corresponding d-dimensional quantum realisations. We illustrate the usefulness of this tool with some examples. In Subsec. 3.4, we introduce a family of graphs, which we call the k-Qite family, and show that their elements are relatively simple quantum dimension witness for any dimension k ≥ 3. Finally, in Sec. 4, we conclude by listing future directions for research.
Most of the notations used in the paper are self-explanatory. A graph describes relationships between several entities or vertices. We denote an edge between two vertices i and j by the symbol i ∼ j. A class of commonly studied graphs is the cycles on n vertices, which we denote by C n . The work also uses semidefinite programming where we use the symbol S n + to denote the class of positive semi-definite hermitian matrices of size n × n.

Graph theoretic approach to contextuality
Consider an experiment in the black-box setting. An outcome a and its associated measurement M , are together called a measurement event and denoted as (a|M ). Now we consider theories that assign probabilities to the events corresponding to its vertices. Concretely, a behaviour corresponding to G ex is a mapping p : [n] → [0, 1], such that p i + p j ≤ 1, for all i ∼ j, where we denote p(i) by p i . Here, the non-negative scalar p i ∈ [0, 1] encodes the probability that measurement event e i occurs. Furthermore, note that two exclusive events e i and e j implies the linear constraint 1} such that p i +p j ≤ 1 for exclusive events e i and e j . A deterministic non-contextual behaviour can be considered as a vector in R n . The polytope of non-contextual behaviours, denoted by P N C (G ex ), is the convex hull of all deterministic non-contextual behaviours. The behaviours that do not lie in P N C (G ex ) are called contextual. It is worthwhile to mention that in combinatorial optimisation, one often encounters the stable set polytope of a graph G, ST AB(G) (defined below). It is quite easy to see that stable sets of G (a subset of vertices, where no two vertices share an edge between them) and deterministic behaviours coincide.
x is a characteristic vector of a stable set of G} It thus follows from the definition that P N C (G ex ) = ST AB(G ex ). Lastly, a behaviour p : [n] → [0, 1] is called quantum if there exists a quantum state |ψ and projectors Π 1 , . . . Π n acting on a Hilbert space H such that (1) We refer to the ensemble |ψ , {Π} n i=1 as a quantum realization of the behaviour p. The convex set of all quantum behaviours is denoted by P Q (G ex ). It turns out this set too is a well studied entity in combinatorial optimisation, namely the theta body.
Definition 2.4. The theta body of a graph G = ([n], E) is defined by: The fact that P Q (G ex ) = T H(G ex ), was observed in [CSW14] and follows by taking d = |ψ and w i = Π i |ψ / ψ|Π i |ψ ∀i ∈ [n], in the following lemma.
Lemma 2.5. We have that x ∈ T H(G) iff there exist unit vectors d, w 1 , . . . , w n such that Combining these two equations we get that Conversely, let Y be the Gram matrix of d, d, w 1 w 1 , ..., d, w 1 w 1 . Note that d, w i w i is the orthogonal projection of d onto the unit vector w i . It is easy to see that Y has all the desired properties.
In the above lemma, the vectors w i , for i ∈ [n], are sometimes referred to as an orthonormal representation (OR) of G.
Definition 2.6. (orthonormal representation) An orthonormal representation of a graph G = The cost of this orthonormal representation of the graph is defined as λ max i∈[|V |] |w i w i | . Next, we turn our attention to the sum S = p 1 +p 2 +· · ·+p n , where p ∈ P N C (G ex ) is a noncontextual behaviour. The set of non-contextual behaviors forms a bounded polyhedron i.e. a polytope. The facets of the aforementioned polytope define tight non-contextuality inequalities, which correspond to half-spaces. This explains why we are interested in i p i . The maximum of S over deterministic behaviours is the same as the maximum of S over non-contextual behaviours. To see this, let p ∈ P N C (G ex ) be a maximizer of S. We can write p as a convex sum of deterministic behaviours, that is p = j λ j p (j) , where p (j) are deterministic behaviours and λ i > 0, i λ i = 1. Now, note that the optimal value of S = j λ j p (j) 1 ≤ max j p (j) 1 . This shows that there always exist a deterministic behaviour of G ex that attains the maximum of S. Therefore, the maximum of S for classical theories is the size of the largest stable set of G ex . This is exactly the independence number of G ex , denoted by α(G ex ). So we get the inequality p 1 + p 2 + · · · + p n ≤ α(G ex ).
Definition 2.7. (Independence number) Given a graph G = (V, E), Independence number is the size of the largest subset of vertices S ⊆ V such that no pair of vertices in S are connected. Independence number is denoted by α(G).
Definition 2.8. A non-contextuality inequality corresponds to a half-space that contains the set of non-contextual behaviours, that is, for all p ∈ P N C (G ex ).
Interestingly in the quantum setting, one has some additional degrees of freedom to increase this sum. Indeed, let state u 0 be a unit vector in a complex Hilbert space H. The event e i correspond to projecting u 0 to a one-dimensional subspace, spanned by a unit vector u i ∈ H; the probability that the event occurs is just the squared length of the projection. That is, p i = | u 0 |u i | 2 and p 1 + p 2 + · · · + p n = n i=1 | u 0 |u i | 2 . Now two exclusive events must correspond to projections onto orthogonal vectors, and hence u i |u j = 0, for all edges (i, j) in G ex . From Lemma 2.5, p ∈ T H(G ex ). Therefore, the optimisation problem we are interested in is In other words, find a matrix X ∈ S 1+n + , with the largest diagonal sum such that X 00 = 1, X ii = X 0i ∀i ∈ [n], X ij = 0, ∀(i, j) ∈ E . This is precisely the definition of the Lovász theta SDP (5) corresponding to G ex . The value of this SDP is the famous Lovász theta number ϑ(G ex ).

Graph-theoretic dimension witnesses
Any Bell or contextuality inequality can be associated to a graph of exclusivity [CSW14]. In this sense, all of them can be studied under the graph-theoretic framework. While in all previous works one first fixes a (Bell or contextuality) scenario and then looks for dimension witnesses, in this work we investigate the dimension witnesses for graphs (of exclusivity), without fixing a priori any scenario.

Quantum correlations with dimensional restrictions
In this section we examine from a graph-theoretic perspective the problem of quantum correlations (aka behaviours) with dimensional restrictions. We use some standard concepts of graph theory and the graph-theoretic approach to correlations introduced in Section 2.
We call a quantum realization of the behaviour p, the set |ψ , {Π i } n i=1 ∈ H d satisfying (6). We denote the set of d-quantum behaviours by P d Q (G ex ). For example, any orthonormal representation of the 3-cycle graph of exclusivity must consist of three mutually orthonormal vectors and therefore must be of dimension at least 3. Therefore, . Suppose that we are interested in the largest value of the expression i∈[n] p i , as p ranges over the set of d-quantum behaviours, that is, the following optimisation problem: Removing the dimensional constraint, the set of quantum behaviours P Q (G ex ) becomes the theta body of G ex , T H(G ex ) (see Sec. 2). As explained in Eq. (4), maximizing the 1 norm of p over the theta body is equivalently given by the Lovász theta SDP. Therefore, for all d ≥ R o (G ex ), problem in Eq (7) with the dimensional constraint is equivalently expressed by the following rank constrained version of the Lovász theta SDP: More concretely, using the same arguments as in Lemma 2.5, if p ∈ P d Q (G ex ) is optimal for (7) and {|u i u i |} n i=0 ∈ C d is a quantum realization of p ( where |u 0 u 0 | refers to the quantum state where as |u i u i | for 1 ≤ i ≤ n, refers to the n projectors), then the Gram matrix of the vectors |u 0 , u 0 |u 1 |u 1 , . . . , u 0 |u n |u n corresponds to an optimal solution for (8) of rank at most d. Conversely, for any optimal solution X = Gram(|u 0 , |u 1 , . . . , |u n ), with u i ∈ C d , of the SDP (8), the realization {|u i u i |/ |u i u i | } n i=0 is optimal for (7). The equivalence fails to hold for d < R o (G ex ), due to the inverse norm factor in the above line, since u i = 0 for at least one i. This is because otherwise {u i / u i } n i=1 is a valid orthonormal representation for G ex of dimension d < R o (G ex ), violating the definition of orthogonal rank. The quantities ϑ 1 (G ex ), ϑ 2 (G ex ), . . . , ϑ Ro(Gex)−1 (G ex ) are still well-defined but they do not seem to have any physical relevance in this context.
On the other hand, we are also interested in the minimum dimension in which the Lovász theta bound can be achieved. By definition, R L (G) ≥ R o (G). R L (G) can be sometimes much smaller than the number of vertices of G. The following lemma due to Barvinok [Bar95] gives an upper bound on R L (G).
For the Lovász theta SDP, the number of linear constraints is m = 1 + |V | + |E|. Hence R L (G) ≤ 1 2 8(|V | + |E|) + 9 − 1 . To summarise, we have the following relationships: This suggests a way to lower bound the dimension of the underlying quantum system that violates a certain dimension restricted non-contextuality inequality. More formally, a violation of the inequality i p i ≤ ϑ d (G ex ), where p ∈ P Q (G ex ), implies that the underlying quantum system must have dimension at least d + 1. We shall refer to the operator in such a dimension restricted non-contextuality inequality as a dimension witness for dimension d + 1.
Finally, we note an equivalent way to compute the dimension restricted Lovász theta, which we define as: and v i |v j = 0, i ∼ j.
Proof. (≥ direction) Let X be a solution of SDP. Let X = V V † and the rows of V be v i ∈ C d for 0 ≤ i ≤ n. Letṽ i = v i / v i . Clearly,ṽ i satisfies the constraints in (11). Now observe that be a an optimal solution of θ d (G) and let v 0 be the eigenvector of n i=1 |v i v i | corresponding to the largest eigenvalue. Now construct a (n + 1) × d matrix V , with V 0 = v 0 , the first row of V and V i = v i |v 0 v i , for all i ∈ [n]. Let X = V V † . Firstly, we note that it satisfies all the constraints of the SDP. Now observe that

Finding low rank solutions: Heuristic approach
Unfortunately, rank-constrained SDPs are NP-hard problems and hence they are computationally intractable. An easy way to see this is that the NP-hard Max-Cut problem with weight matrix W can be expressed as the following rank one restricted SDP: Because of this restriction, it seems unlikely that given a non-contextuality inequality and a dimension d, one can efficiently compute the value ϑ d (G ex ) and find a quantum realisation of dimension d that achieves the bound. Nevertheless, it is important to find such low dimensional quantum realisations which at least violate the classical bound α(G ex ). For this purpose, we provide a heuristic technique (algorithm 1) to compute a lower bound on the d dimensional restricted quantum value and find the corresponding d-dimensional quantum realisations.

end
The algorithm is adapted from an approach to solving rank constrained problems given in Chapter 4 of [Dat05]. The reference gives a heuristic algorithm for producing low rank solutions to feasibility SDP of the form: where C is a convex set. Instead of solving this non-convex problem directly, they suggest to solve a couple of SDPs (16) and (17) iteratively, until the following stopping criteria is met. After a particular iteration, let G * and W * be the optimal solution of the SDPs (16) and (17) respectively. The loop is stopped if G * , W * = 0. Let us see why. Note that the eigenvalues of W * lie in the closed interval [0, 1] and they sum up to N − d. This implies that at least N − d of its eigenvalues are non-zero, that is, rank(W * ) ≥ N − d. This, along with the fact that G * , W * = 0, implies that rank(G * ) ≤ d. Since G * is a solution of the first SDP, it must also satisfy the conditions G * ∈ C and G * ∈ S N + . Thus G * is a solution of SDP (15). However, note that there is no guarantee that the stopping criteria will be met.
In our case, the SDP (8) is more general in the sense that it also involves optimising an objective function. Thus we include the objective function of the Lovász theta SDP, tr(X), as an extra additive term to the objective function of the first SDP (16). Besides this, the main idea of Algorithm 1, is same as in the feasibility SDP case -to solve two SDPs iteratively. The first SDP tries to satisfy all the Lovász theta SDP constraints, while the second SDP tries to restrict the rank of the solution X to the desired value. The algorithm is made to run for a predefined number of iterations, k. In the end of the program, if the final X and W are such that X, W = 0, then the solution X is indeed a feasible solution to SDP (8). If not, we restart the program. We find that this heuristic works pretty well in practice and enables us to find low rank solutions to the Lovász theta SDP. Taking a Gram decomposition of the solution matrix X allows us to compute the d dimensional quantum realisations.
Note that Algorithm 1 only outputs a lower bound for ϑ d (G) and is not directly used to find dimension witnesses (which would require an upper bound). However one may expect to guess this upper bound by running this algorithm several times (by taking the maximum among all the runs). This idea allows us to find candidate graphs for which we can find dimension witnesses and prove the upper bound theoretically. In fact, in Sec. 3.4, we describe a family of graphs, which can be used as dimension witnesses, which was found precisely by the same logic using Algorithm 1.

Examples
To demonstrate the usefulness of the tools introduced, we apply them to two of graphs which are relevant in the literature on contextuality. For each graph, we report the lower bounds on the rank constrained Lovász theta values for different dimensions obtained with the algorithm introduced before 1 and discuss why the results are interesting. Figure 1: G 1 graph: The 9-vertex graph G 1 was used in [KK12] to illustrate the notion of almost state-independent contextuality.

Almost state-independent contextuality
The earliest proof of state-independent quantum contextuality by Kochen and Specker [KS67] required 117 three-dimensional real projective measurements. Since then, the number of projective measurements needed to demonstrate state-independent contextuality has been drastically reduced to thirteen over the years [CEGA96,YO12]. The paper by Yu and Oh suggested a test to reveal state-independent contextuality with only thirteen projectors [YO12]. Later, a computer-aided proof confirmed that it is impossible to demonstrate state-independent contextuality with less than thirteen measurements [CKP16]. Thus, any test of contextuality with less than thirteen projective measurements would fail to exhibit contextuality for at least a few quantum states. The 9-vertex graph G 1 in Fig. 1 is a part of the original proof of the Kochen-Specker theorem [KS67] and has been used in [KK12] to illustrate the concept of "almost state-independent" contextuality. The almost state-independent non-contextuality inequality is given by, with the events satisfying the exclusivity relation given by the graph in Fig. 1. In reference [KK12], authors showed that the non-contextuality inequality in (18) is saturated by a three dimensional maximally mixed state and violated by every other choice of three-dimensional preparation, for an appropriate choice of measurement settings. Since the non-contextuality inequality in (18) is violated for every quantum state, except maximally mixed state, it exemplifies the concept of almost state-independent contextuality. For details, refer to [KK12]. As one can see, the non-contextual bound for the aforementioned non-contextuality inequality is given by its independence number, α(G 1 ) = 3 [CSW14]. In addition, R o (G 1 ) = 3 and R L (G 1 ) ≤ 4. Our calculations lead to the following results: The authors of [KS67,KK12] used this graph to illustrate state-independent and almost stateindependent in d = 3, respectively. From numerics, we know that there exists a rank 4 solution which achieves the Lovász theta number and it would be interesting to show that R L (G 1 ) = 4. Also, numerical evidence suggests that ϑ 3 (G 1 ) ≤ 3.333, however we do not have theoretical proof. If we assume ϑ 3 (G 1 ) ≤ 3.333, it would mean that any experimental value > 3.333 will certify that the underlying dimension is greater than 3.

Mermin's Bell inequality
We discuss an n-partite Bell inequality (for odd n ≥ 3 ), known as Mermin's Bell inequality [Mer90], the interest of which is based on the fact that the Bell operator where σ (j) x is the Pauli matrix x for qubit j, has an eigenstate with eigenvalue 2 (n−1) . In contrast, for local hidden-variable (LHV) and noncontextual hidden-variable (NCHV) theories, The aforementioned inequality thus demonstrates the fact that there is no limit to the amount by which quantum theory can surpass the limitations imposed by local hidden variable theories (or non-contextual hidden variable theories). We are interested in the tripartite case, i.e. for n = 3, The tripartite inequality in (21) can be used to self-test a 3qubit GHZ state [Kan17]. One can study the aforementioned inequality via the graph approach introduced in [CSW14]. The 16vertex graph G 2 in Fig. 2 is the graph of exclusivity corresponding to the 16 events in the Bell operator of Mermin's tripartite Bell inequality [Cab12]. In this case, α(G 2 ) = 3, R o (G 2 ) = 4, and R L (G 2 ) ≤ 7. Our calculations give Further if we can show that these lower bounds are tight, then one can use these inequalities as dimension witnesses. It is also interesting to note that the Lovász theta can be achieved in d = 7, since achieving it in the three-party, two-setting, two-outcome Bell scenario requires 3 qubits and thus d = 2 3 = 8.

Quantum dimension witnesses for arbitrary dimensions : the family of Qites
It was realised [KS67] that achieving Kochen-Specker contextuality requires quantum dimension of at least 3. A simple proof of this is provided in the following Lemma.
Proof. For this proof we use the definition of the restricted Lovász theta number from (11). We need to show that, if we restrict ourselves to 2 dimensional vectors, then the restricted Lovász theta number is at most the independence number of the graph. Firstly note that if the graph has an odd cycle (> 1), then it cannot have orthonormal representation in 2 dimensions. Thus we consider only bipartite graphs. Furthermore, assume that G ex is connected. If it is not connected, apply the same arguments as follows, to each connected component and then note that the independence number of the graph is the sum of the independence number of its connected components. For a connected bipartite graph its bi-partition is unique and for G ex , let them be denoted as V and V . The key observation is that for any unit vector |v in C 2 , there exists a unique (up to a unit complex number e iθ ) vector |v ⊥ that is orthogonal to |v . This implies that if we assign a unit vector v ∈ C 2 to a vertex in V then all the vectors in V must be of the form e iθ |v , for some θ ∈ [0, 2π], whereas all vectors in V must be of the form e iθ |v ⊥ . This implies that the cost of the orthonormal representation is at most λ max i∈V |v v| + i∈V |v ⊥ v ⊥ | = max{|V |, |V |} = α(G ex ).  To look for more interesting dimension witnesses for arbitrary higher dimensions we define a family of graphs parameterised by integers k ≥ 2, called k-Qite 2 .
Note that the first member of the family, that is k = 2, is just the C 5 graph (see Fig. 3). This is one of the most well studied graphs in the field of contextuality since it is the smallest graph for which the Lovász theta number is strictly greater than the independence number. The corresponding non-contextuality inequality is the famous KCBS inequality [KCBS08]. The graph corresponding to k = 3 is shown in Fig. 4.
Lemma 3.8. The independence number of the k-Qite graph is k.
Proof. Partition the set of the vertices into three sets: S 1 = {v 1 , v 2 , . . . , v k }, S 2 = {v k+1 , v k+2 , . . . , v 2k } and S 3 = {v 2k+1 }. Firstly note that since none of the vertices in S 2 are connected to each other, the independence number is at least |S 2 | = k. Since every vertex in S 1 is connected to each other, there can be at most one vertex from S 1 in a maximal independent set. However, the inclusion of a vertex from S 1 , say v i in the maximal independent set would imply the vertex v k+i cannot be included simultaneously in the maximal independent set. Similarly inclusion of v 2k+1 implies that one cannot have any vertex of S 2 in the maximal independent set. Hence the lemma follows.
Proof. Consider the vertex partitioning as in Lemma 3.8. Since vertices in S 1 form a kcomplete graph, we have R o (k-Qite) ≥ k. Now we show that there exists an orthonormal representation in dimension k for all k-Qite graphs with k ≥ 3. Depending of the parity of k, we give an explicit construction for the orthonormal representation. When k is odd: For all the vertices in S 1 , assign the standard vectors e i in a k-dimensional Hilbert space to vertex v i , for i ∈ [k]. Assign the vector 1 √ k (1, 1, . . . , 1) to vertex v 2k+1 . Now consider the vertices v k+i in S 2 , for i ∈ [k]. For vertex v k+i to be orthogonal to vertex v i , the vector for v k+i must have 0 in the i th position. Let the magnitude of the remaining entries of the vector be 1 √ k . Since k is odd, the number of entries with non-zero (also equal) magnitude is even. Setting, half of them randomly to negative sign, makes it orthogonal to the vector v 2k+1 . Hence, in this case, all orthonormality constraints are satisfied. When k is even: Assign the vectors to all the vertices in S 1 in the same way as in the odd k case. Set the vector corresponding to vertex v 2k+1 as 1 √ k−1 (0, 1, 1, . . . , 1). Except vertex v k+1 , set all the rest of the vertex in S 2 in the same way as in the odd k case. Note that this establishes orthogonality of vertex v k+i with v 2k+1 for all 2 ≤ i ≤ k. Vertex v k+1 is then set such that its first entry is 0 (to make it orthogonal to v 1 ) and is orthogonal to v 2k+1 . There are many such vectors which would satisfy these conditions. For example, set v k+1 as 1, 1, . . . , 1, 2−k) to conclude the proof.
In order to propose dimension witnesses, we want to find upper bounds on the dimension restricted Lovász theta number corresponding to the Qite family. For k = 2, Lemma 3.6 already gives us the required bound of 2. We now generalise the Lemma for the Qite family.
Proof. We use the θ d (G) definition of rank restricted Lovász theta for the proof, see Lemma 3.5.
is a k-dimensional quantum state corresponding to the vertex v i , such that v i |v j = 0, whenever vertices v i and v j share an edge. Since, the first k vectors must form an orthogonal basis (as they form a k-complete graph), one can suppose that |v i = e i (the standard basis vector), for 1 ≤ i ≤ k, without loss of generality. This is because there will always exist a unitary U , that can rotate any orthonormal basis to the standard basis. Note that this unitary rotation on all the vertices, gives us another set of orthonormal representation of the graph with the same cost, that is, Note that setting the first k vectors to the standard basis vectors also implies that the i th component of |v k+i is 0, for 1 ≤ i ≤ k. Next, observe that |v 2k+1 is orthogonal to |v k+i k i=1 and so λ max Let M ∈ C k×k be the matrix whose i th row is |v k+i Also, observe that M has the property that it's diagonal is all zero and it's rows are all normalized to 1 in 2 -norm. We shall now bound the largest eigenvalue of M † M . We make use of Gershgorin's circle theorem which states that given a complex square matrix A ∈ C n×n , it's eigenvalues (which may be complex) lie within at least one of the n Gershgorin discs, that is a closed disk in the complex plane centered at A ii with radius given by the row where the second inequality follows from the fact that the 1 -norm of a vector v is at most dim(v) times it's 2 -norm. Finally putting everything together, On the other hand, one can verify that ϑ(k-Qite) > k, for any k > 1, by solving the Lovász theta SDP for the k-Qite graph numerically. This gives us the following corollary.
Corollary 3.11. Violating the non-contextuality inequality i p i ≤ k where p ∈ P Q (k-Qite), implies that the underlying quantum realisation must have dimension at least k + 1.

Conclusion
In this work, we have introduced a novel approach to quantum dimension witnessing in scenarios with one preparation and several measurements (examples of them are Kochen-Specker contextuality and Bell nonlocality scenarios). Our approach is based on graphs which represent the relations of exclusivity between events. Each graph can be realized in different scenarios, and there is always a (specific Kochen-Specker contextuality) scenario for which all quantum behaviours for the graph can be realized. The virtue of our approach is precisely that we do not need to fix any scenario. Instead, we explore the features of abstract graphs for dimension witnessing. Here, we have introduced all the necessary tools to identify graph-based dimension witnesses, and we have illustrated their usefulness by showing how famous exclusivity graphs in quantum theory hide some surprises when re-examined with our tools and how one can construct simple dimension witnesses for any arbitrary dimension. Arguably, however, the main interest of our results is that they can be extended in many directions, connected to multiple problems, and applied to in different ways. Here we list some of possible future lines of research: • Identifying graph-theoretic dimension witnesses for specific Bell and Kochen-Specker contextuality scenarios.
• Using previous knowledge in graph theory for finding useful quantum dimension witnesses. For example, there are graphs for which the ratio of Lovász theta number to independence number is quite large, i.e., ϑ(G) α(G) 1 [Fei97,ACC15]. This indicates situations where the quantum vs classical advantage is highly robust against imperfections. Therefore, dimension witnesses based on such graphs could be useful for certification tasks on, e.g., noisy intermediate-scale quantum devices [Pre18].
• For the purpose of noise robust dimension witnesses, one may also use a weighted version of graphs (corresponding to a weighted non-contextuality inequality). As an example, for our family of k-Qite graphs, one can consider a weight vector given by w = (1, 1, . . . , 1, k − 1), where more weight is given to the (2k + 1) th vertex of k-Qite.
Note that the weighted independence number of this weighted graph is still k. However numerically solving the weighted Lovász theta for this graph suggests ϑ(k-Qite, w) − α(k-Qite, w) > 0.26 for all k ≥ 3. For large k this difference converges to ≈ 1/3. However note that since for large k, the ratio ϑ(k-Qite,w) α(k-Qite,w) ≈ 1, this approach is still not noise robust.
• Implementing graph-theoretic quantum dimension witnesses in actual experiments.
• Obtaining the classical memory cost [KGP + 11, CGGX18] for simulating graph-theoretic dimension witnesses and identifying quantum correlations achievable with low-dimensional quantum systems but requiring very-high dimensional classical systems.
• Extending the graph-theoretic framework to classical dimension witnessing.
• Developing a general graph-theoretic framework to analyse and unify different approaches to dimension witnessing.