Malevich’s Suprematist Composition Picture for Spin States

This paper proposes an alternative geometric representation of single qudit states based on probability simplexes to describe the quantum properties of noncomposite systems. In contrast to the known high dimension pictures, we present the planar picture of quantum states, using the elementary geometry. The approach is based on, so called, Malevich square representation of the single qubit state. It is shown that the quantum statistics of the single qudit with some spin j and observables are formally equivalent to statistics of the classical system with N2−1 random vector variables and N2−1 classical probability distributions, obeying special constrains, found in this study. We present a universal inequality, that describes the single qudits state quantumness. The inequality provides a possibility to experimentally check up entanglement of the system in terms of the classical probabilities. The simulation study for the single qutrit and ququad systems, using the Metropolis Monte-Carlo method, is obtained. The geometrical representation of the single qudit states, presented in the paper, is useful in providing a visualization of quantum states and illustrating their difference from the classical ones.


Introduction
In modern science quantum systems are powerful resource for information processing. Many physical properties and phenomena are difficult to understand, but the geometric interpretations of quantum mechanical systems deliver an elegant way of understanding and "feeling" them. That is why the geometrical picture of physical theories draw attention in a wide range of fields from classical and quantum mechanics to the general relativity (cf. [1]). The practical implementation of large scale quantum communication networks and key distribution [2], quantum cryptography [3][4][5], quantum random number generation [6] or a quantum computer, is the main goal of quantum information science. However, for today only the simplest forms of the quantum random number generators and the quantum key distribution set-ups, exposed by statistical problems in the randomness generation, are available. That is a lot due to the fact, that for the practical use, multipartite high fidelity entangled quantum states are needed, that are challenging to control technologically. Superpositions are extraordinarily fragile, making it difficult to work with multiple qubits. Nowadays the quantum computers are based on particles that serve as qubits. However, it is possible to use qudits with more than two states simultaneously instead. The quantum computer with two 32-state qudits, would be be experimentaly measured for an arbitrary system. The single qubit is identified with the set of three probability distributions of spin projections on three perpendicular directions in space. This approach is studied and illustrated by the triangle geometry of the system, using the, so called, Malevich square representation in [44][45][46]. This representation, also known as quantum suprematism approach (after the Russian painter Kazimir Malevich , founder of suprematism, an art movement focused on basic geometric figures), illustrates the single qubit state in terms of three squares on the plane, obtained, using the invertible mapping of the points in Bloch sphere onto the probability distributions. The method gives a beautiful and clear geometrical interpretation for the system of one qubit. The attempts to generalize the Malevich's geometric interpretation to the case of higher dimension quantum systems, by increasing the triples of squares with the dimension of the system are done in [46]. However, it is not clear how the tripples are related to each other, e.g., how to connect them in mosaic form reasonably? An essential difference of the presented in this paper geometric interpretation from the latter one, is an increase in the number of connected squares for the description of the higher order systems. To illustrate the quantumness in the single qudit system, we use the whole Malevich's suprematist composition. Such an approach allows to obtain the new universal probability inequality in terms of the Malevich squares areas, connecting the density matrix elements of the quantum systems of any dimension. The upper bound of the inequality for the quantum system corresponds to a pure state just as the surface of a Bloch sphere for qubits. All the mixed states are limited by the inequality from above. At the same time, the upper limit of the inequality is different for the classical system and for the quantum one. We study the single qutrit and ququad states quantumness by finding the bounds of the this inequality. Since the amount of probabilities, characterizing the density matrix, growth sufficiently with an incising of the qudit system dimension, we use the Metropolis Monte-Carlo (MMC) method to find the bounds of the inequality. MMC is efficient when one thinks about big data problems and can be used to a quite large order qudit systems.

Physical Application
The uncertainty relations for both discrete and continuous variables lie in the heart of quantum theory, especially important in the context of quantum information theory. The basic concept of the uncertainty relation was introduced by Heisenberg in [47], demonstrating the impossibility of the simultaneous precise measurement of the position and momentum of an electron. Robertson [48] and Schrödinger [49] proposed an improvement of the uncertainty relation, incorporating both commutators and anticommutators of more general observables. The Robertson-Schrödinger uncertainty relation is applied for distinguishing pure and mixed states of discrete variables. Since that time in literature appeared several variations of the uncertainty relations. The generalizations and improvements are mainly focused on the uncertainty relation that are valid for the systems with more then two observables (qutrit, qudit). Namely, the Heisenberg-type uncertainty relation for three canonical observables is introduced in [50] and for arbitrary incompatible observables in [51]. The relations for more incompatible observables can be found in [52,53]. One can see, that in practice more then two incompatible observables can appear in the measurement, it is important to study uncertainty relations for many incompatible observables. The Malevich's inequality is such uncertainty relation.
In [54,55] an experimental investigation of several Heisenberg-type uncertainty relations is reported. In our turn, we rewrite Malevich's inequalities for the single qubit and qutrit in terms of the measurable observables to obtain inequalities similar to those, verified experimentally in the articles listed. Our Malevich's inequality for the single qubit, compared with eight uncertainty relations known from the literature, showed one of the best lower bounds according to MMC simulation. Further, Malevich's inequality for the qutrit system was rewritten in experimentally measurable observables, that allows its experimental verification along with several known inequalities provided in [53,54]. Thus, Malevich's inequalities can serve as uncertainty relations for the systems of high dimensions and successfully compete with already known inequalities.
The paper is organized as follows. In Section 2 a short review on the qudit state probability description is presented. In Section 3 the quantum suprematism geometric representation of the single qubit system is given. In Section 4 we present a new polygon geometry representation of the single qudit state. The inequality on the sum of the areas of the Malevich's squares, given by the probability distribution, associated with the triangle geometry of the single qudit state, is presented. Next, in Section 5 the MMC algorith is constructed to find the aper bound of the this inequality. The efficiency of the method is illustrated by the example of the single qutrit and ququad systems. The example of the Werner state is studied in details. In Section 7 the Malevich's inequality is compared with several experimentally verified uncertainty relations. Conclusions and perspectives are presented in Section 8.

Parametrization of Density Matrices
In quantum physics states are represented by the density matrices on the complex Hilbert space H of the system. The density matrix ρ on the Hilbert space is a linear operator such that ρ ≥ 0, Tr(ρ) = 1, ρ = ρ † . As it was mentioned in [56], the simplex of classical probabilities can be described in a quantum framework. Every probability vector is associated with a coadjoint orbit of the unitary group, acting on the dual space of its Lie algebra. The probability vector (p 1 , p 2 , . . . , p N ) is rewritten as the density matrix by setting The classical simplex is quantized by considering the union over it of the corresponding coadjoint orbits, each one going through the probability vector, identified with the diagonal elements of the density matrix. The main difficulty is the positivity constraint ρ ≥ 0. This condition can not be written in polynomials for the matrices of the dimension N > 4. Despite their are different matrix parametrizations, providing the positivity condition, the common view of the high order density matrices is not yet known. In [57] a good review on the recent studies on the structure and general from of the density matrix is given. In the case of N = 2 the Block-sphere representation is commonly used (see Figure 1).

Figure 1.
Geometric interpretation of the qubit in the probanility representation. The surface of the Bloch sphere represents the pure states of the two-dimensional quantum system, whereas the interior corresponds to the mixed states. Three Pauli matrices together with the identity matrix I 2 form a basis of the complex vector space of Hermitian 2 × 2 matrices. Hence the density matrix of the single qubit state can be written as in which the coefficients x, y, z are chosen such that all the eigenvalues of ρ 2 are non-negative. The positivity condition of the eigenvalues provides the set of parameters that forms a closed unit Bloch ball in R 3 with the center at 0, e.g., x 2 + y 2 + z 2 ≤ 1, holds. Hence, the parameters x, y and z associate the qubit states with the points either on the surface of the Block sphere, that corresponds to the pure states case, or inside the sphere for the mixed states case. That provides the geometric interpretation of the qubit states in terms of the points on the Bloch sphere.
Since we want the elements of the density matrix to have the notion of probabilities, let the density matrix be rewritten as follows where p j , j = 1, 2, 3 are the probabilities of measuring the spin −1/2 projections along the x, y, z-axes, respectively. The nonnegativity of the density matrix provides the condition This inequality impose the constraint on p j , that means that there exist quantum correlation between the spin projections on the perpendicular directions x, y, z. For N ≥ 3 the following representation of density matrices is suggested where λ j are the orthogonal generators of the special unitary group SU(N) and x j ∈ R are the entries of the generalized Bloch vector. These matrices satisfy and the commutation and the anti-commutation relations hold. Here f ijk , g ijk are the structure constants of the Lie algebra SU(N). The generators λ j , j = 1, . . . , N 2 − 1 and the unit matrix I n form an orthogonal basis. From the properties of the generator matrices, every matrix ρ, given by (3), has the unit trace. The only thing is to find the matrices with the non-negative eigenvalues.
One of the possible explicit λ j construction can be given in terms of the generalized Gell Mann matrices. If N = 3 the Gell Mann matrices are They form three sets of operators which form SU(2) algebras, namely {λ 1 , λ 2 , λ 3 }, {λ 4 , λ 5 , (λ 3 + √ 3λ 8 )/2} and {λ 6 , λ 7 , (−λ 3 + √ 3λ 8 )/2}. Using these sets of operators, one can define "artificial qubit states" (see [58]). Firstly, the matrix ρ 3 is extended to two 4 × 4 density matrices as The resulting matrices can be interpreted as the density matrices for the qubit systems. Using the partial trace operation, one can define four positive semidefinite matrices ρ A , ρ B , ρ C and ρ D , that are not independent These qubit density matrices can be associated to four three level systems. In each system, the population of the one of the levels with the transition probability to another level determines different qubits. The off-diagonal components of these matrices are arranged in the sets given by the SU(2) algebras, namely A : {x 4 , x 5 }, B : {x 1 , x 2 }, C : {x 4 , x 5 } and D : {x 6 , x 7 }. Hence, these four matrices can be decomposed in terms of three probabilities, given in (1). We choose the independent qubits ρ A , ρ B and ρ D to retrieve the original 3 × 3 density matrix in the form Here p A,B,D 1,2,3 are the probabilities, satisfying (2). Let us rewrite the qutrit density matrix in our notations as where p i ∈ [0, 1], The characteristic polynomial of this matrix is λ 3 − λ 2 + bλ + c = 0, where the coefficients b, c can be easily compute. By Viete's formula the latter equality has three real roots if and R = (−2 + 9b + 27c)/54. We are interested in nonnegative roots, that brings us to the following conditions where φ = 1 3 arccos R/ Q 3 . Let us introduce the qudit state, described by the 4 × 4 density matrix This matrix can be associated with the two-qubit state with two spins j = 1/2 or with the single ququad state with the spin j = 3/2. In the first case we have two subsystems with the density matrices, defined by tracing with respect to subsystems degrees of freedom If (8) corresponds to the single ququad state, these matrices correspond to the "artificial qubit systems". To parametrize (8) we need 15 probabilities. Hence, using (1), (9) one gets the following elements However, two qubit matrices can not determine the anti diagonal elements of (8). Let hold. The positivity conditions of this matrix are rather complicated. For detailed graphical analizess of the roots of a quartic characteristic equation, corresponding to 4 × 4 matrix, see [59]. For the matrices of the dimension N > 4 one need to use the numerical methods to find the eigenvalues of the high order density matrices and check them on the positivity condition.

Malevich's Squares Probability Representation of the Qubit State
In [56] the qubit density matrix was presented in terms of the three probabilities 0 ≤ p k ≤ 1, where p 1 , p 2 and p 3 are the probabilities to have in the state ρ the spin projections m = +1/2 on the directions x, y and z, respectively. Using this probability representation, the new triangle geometrical picture for identification of the spin −1/2 states, the Triada of Malevich's squaresis is proposed.

Triangle Geometry of the Qubit State
To illustrate the proposed triangle geometry picture for the single qubit state let us start from the statistical properties of three independent classical coins, which are associated with three probability distributions (pdf). The pdf for the first coin is given by non-negative numbers p 1 and p 1 = 1 − p 1 . The probability p 1 corresponds to the result of the experiment, when the coin look "up". Similarly, for the second and the third coin, one has numbers p 2 , p 2 and p 3 , p 3 , respectively. The pairs of probabilities can be considered as the probability vector p k = (p k , p k ) T , (k = 1, 2, 3). This vector is presented on Figure 2. Its end coincides with the point A k on the line, determined by the equation p k + p k = 1, that defines the simplex with the length √ 2. These three simplex lines can be considered as the three sides of an equilateral triangle on the plane of equal sides √ 2 (see Figure 3).
The probability vector p k with the end at a point A k on the simplex. One can connect points A 1 , A 2 and A 3 , located on simplexes, by the dashed lines and get the triangle A 1 A 2 A 2 . We assume that A k are closer to the kth vertex of the equilateral triangle and have the distance d k = p k √ 2 from the kth vertex.

The Uncertainty Relation for Probabilities
The qubit state, determined by the density matrix (1), is parametrized by the three probabilities. For the latter matrix we investigate the property of the triangle A 1 A 2 A 3 . The lengths of the triangle side y k is Three squares can constructed, analogues of the Triada of Malevich's squares, with sides y k , associated with the triangle A 1 A 2 A 3 (see Figure 4). The sum of the areas of these three squares is expressed in terms of the three probabilities p k as follows For the classical coins, the numbers p 1 , p 2 , and p 3 take any values in the domain 0 ≤ p k ≤ 1 and this sum satisfies the following inequality The points in the cube (see Figure 1) correspond to the classical coin statistics. The points on the cubes longest diagonals are extremal in the sense that the distance from the quantum states (the blue point on the Bloch sphere) to the classical states (the points in the cube's angles vertexes) is the largest from all of the possible distances. For the quantum case the probabilities p j are connected by constraints, imposed by the density matrix. The detailed analysis, provided in [45,46], gives that the maximum of S is reached when the state is pure. The red points on the Bloch sphere (see Figure 1) correspond to (p 1 , p 2 , p 3 ) = {(0, 0, 1/2), (1/2, 0, 1/2), (1, 1/2, 1/2), (1/2, 1, 1/2), (1/2, 1/2, 0), (1/2, 1/2, 1)} and S ≤ 2.5, holds. The blue points correspond to the case that is the maximum value of S in the quantum case. Thus, the maximal side of an equilateral triangle, composed from the probabilities, that can be inscribed in a simplexes triangle, is equal to one, namely Figure 5). The maximally mixed state provides the lower bound 3/2 ≤ S, p j = 1/2, j = 1, 2, 3. In view of this, the area of the three Malevich's squares satisfies the inequality that is different from the classical one. Summing up, the properties of the area S, associated with the triada of the Malevich's squares, are different for the classical system and for the quantum system states, namely, for three classical coins and for the qubit states.

A 2max
A 1max A 3max with the end at a point A kmax on the simplex, S = 3.

Polygon Geometry of the Qudit States
Let us focus on the spin j system that is described by means of the Hermitian density operator ρ. For the corresponding N × N matrix ρ of the latter operator, the conditions ρ † = ρ, Trρ = 1, ρ ≥ 0, hold. In the |m basis it has the following elements where N = 2j + 1, j = 0, 1/2, 1, 3/2, · · · . That means that the density matrix can be parametrized by N 2 − 1 parameters. According to the previous section we think about N 2 − 1 independent classical coins, which are associated with N 2 − 1 pdfs. The N 2 − 1 probability vectors p k = (p k , p k ) T , (k = 1, . . . , N 2 − 1) can be considered. Following the line of the qubit example, one needs to connect N 2 − 1 simplexes to from an N 2 − 1-angle polygon with the side √ 2 and apexes marked by k = 1, . . . , N 2 − 1. If to connect every apex of the polygon with the zero point of the coordinate axes, the N 2 − 1-sectors with angle β = (1, 0, 2) = 2π/(N 2 − 1) and the angle γ = (1, 2, 3) = π − β, hold.
The polygon formed by the points A k has the sides defined as follows For example, the eight angle polygon and the Malevich's Suprematist Composition for the single qutrit are shown in Figures 6 and 7. The sum of there areas is the following where p N 2 = p 1 .  However, in the quantum case, an additional condition on the eigenvalues of the density matrix is imposed. Since it must be non-negative, the probabilities that parametrize the density matrix, are connected by additional constraints and the value of the maximum area changes, e.g., Further, we find these maxima for the single qutrit and ququad systems.

Parametrization of Unitary Matrices
To find the maximum value of (15) one has to check all the possible probability combinations, satisfying the density matrix positivity condition. Finding the eigenvalues of the matrix and checking there positivity is technically hard and is not scalable well. To solve this problem, we use the fact that the unitary transformation does not change the physics of the system, namely it transforms one description of the system to another physically equivalent description. Hence, if we use the transformation ρ [1] = Uρ[0]U † , where U is the unitary matrix, for the density matrix ρ(0), we get another density matrix with the same spectra. Changing the parameters of the unitary rotation matrix and the starting density matrix ρ(0) we can estimate the maximum of S. Using the initial density matrix, formed by the starting set of the probabilities and using the unitary rotation, it is possible to find all the possible density matrices of the desired dimension and extract the new probability vectors to find the maximum of S. Further we will discuss the algorithm in details.
The aim of this section is to present a parametization discribed in [60,61] of the unitary matrices that is used in the algorithm of the maximum searching, presented in the next section. The advantage of this parametrization method is that it is recursive. This fact allows to parametrize the N × N matrix through the parametrization of the lower dimension unitary matrices.
The unitary matrix of the dimension 2 × 2 has the following form where h ∈ (0, 1), φ 23 , φ 32 , φ 22 ∈ [0, 2π). Let ρ 2 [k] be in the form (1), depending from the probability vector p , where k is the probability configuration number. After the unitary transformation, given by U 2 , the density matrix has the following form Hence the transformed vector is In case of a 3 × 3 matrix, we use the unitary rotation matrix in the form where b, c ∈ (0, 1), φ 12 , φ 13 , φ 13 ∈ [0, 2π). Let ρ 3 [k] be in the form (6) The transformed vector is To parametrize N × N we use the procedure introduced in [61]. The matrix S is partitioned in blocks The element A is chosen as A = ae iφ 11 , a ∈ (0, 1), φ 11 ∈ [0, 2π). Then the latter matrix can be rewritten in the following form where U, V ∈ C N−1 are row and column vectors, respectively, lying on the complex unit sphere, i.e., and X, Y are the unitary matrices such that This procedure was applied in case of the unitary U(4) group in [61], but the final matrix is introduced in [60] with some misprints. The corrected matrix elements of Let ρ 4 [k] be in the form (11), depending from the probability vector p , where k is the probability configuration number. After the unitary transformation, the density matrix has the following form Hence the transformed vector is In the next section we will use this vector to find the maximum of (15) for the different qudit states.

Metropolis Monte Carlo Maximum Search
Monte-Carlo (MC) method is a general name for a variety of stochastic techniques. It is based on the use of the random numbers and the probability statistics to investigate problems in many areas like economics, nuclear physics or flow of traffic. In this paper we use the Metropolis MC (MMC) that is generally used in statistical physics to solve the Ising problem, where one searches the spin configuration that provides the minimum energy of the system. The MMC was developed in present form by Metropolis, Ulam and Neumann during their work on Manhattan project (study of neutron diffusion) (cf. [62]).
The approach that is used in MMC algorithm uses random walk in the phase space with transition probability to go from the state m to the state n. It is equal to 1 if the move decrease the energy (∆E nm < 0). If the move increase the energy (∆E nm > 0) then it is accepted with a probability, defined by the ratio of the probabilities of initial and final states P(n)/P(m).
We start from setting up a random walk through the configurational space. The "time" t is the number of iterations of the procedure (not real time). P(m, t) is the probability of being in configuration m at time t, P(n, t) the probability of being in configuration n at time t, W(m → n, t) is the probability of going from the state m to the state n per unit time (transition probability). Then we have a sufficient (but not necessary) detailed balance condition W(n → m)P(n, t) = W(m → n)P(m, t).
In this paper we want to find the probability vector that maximizes S, given by (15). To this end the following steps must be done.

•
Initialize the starting density matrix in the diagonal form and the unitary rotation matrix from the SU(N) group, for example, parametrized according to the recursive method, described above. • Perform this relaxation step until freezing of the maximum S occurs: 1.
Randomly select one of the unitary matrix parameters or one of the diagonal parameters p i of ρ diag N . Slightly change it using the random generator. It is necessary to check that the changed matrix parameters are not beyond their limits, and the elements of the diagonal density matrix satisfy 0 ≤p i ≤ 1 and does not change the sign of the density matrix.

2.
Using the changed unitary matrix or the diagonal density matrix, perform the rotation, i.e., Using the general view of the density matrix, express the new trial probabilities through the elements of the rotated matrix ρ [1]. Check that trial probabilities are 0 ≤ p tr ≤ 1, hold.

4.
Perform the Metropolis step: -Generate a uniformly distributed random number ξ.
As it is mentioned in [63] this search can get stuck in a local but not a global optimum. That is why the process is carried out several times, starting from different randomly generated matrices and saving the best result. Of course, we cannot guarantee that the optimum found is global. However, with a sufficiently slow descent and with a large number of simulations, one can hope to get good results. In case of large quantum systems, where the amount of parameters groves significantly, there are simply no other solutions. In this paper we used this algorithm, implemented on C + + language, to find the probability vectors that provide the maximum of S for the single qutrit ans the single ququad states. To this end the unitary matrix parametrization, described in the previous section, is used. The simulation was done as follows. 100 unitary rotation matrices were generated. For each matrix 10,000 MC steps were done, during which, the maximum value of S and the corresponding probability vector are found. The best probability vector that provides the "biggest maxima" among all the realisations was selected. Next, using the simulation results we guessed the exact maxima.

Polygon Geometry of the Qutrit State
Let us introduce the single qutrit state, described by the 3 × 3 density matrix. The geometric portrait of this system is an equilateral eight angle polygon of equal sides √ 2 on the plane, formed by the set of simplexes (see Figure 6). Every side of the polygon is given by (14) and eight squares are constructed, with sides y k = A k A k+1 , associated with the polygon A 1 A 2 . . . A 8 (see Figure 7). Using the MMC simulation one can estimate the maximum value of the sum (15) and the corresponding configuration of the probabilities. The computational results give that the maximal configuration iŝ S max = 16 + 8 √ 2 = 27.3126, p 0 = p 2 = p 4 = p 6 = 0, p 1 = p 3 = p 5 = p 7 = 1, (see Figure 11). However, when the conditions on the eigenvalues of the density matrix (7) hold, the probabilities p i are connected by the positivity condition. The MMC algorithm must be changed. The unitary transformation, given by (18), is used to iterate through all the possible density matrices. The probabilities are recalculated at each MC step. We performed 100 simulations of 10000 Monte-Carlo steps. For each realization the maximum and the corresponding configuration of the spins are obtained. The configuration that provides the "biggest" maximum corresponds to the pure states. However, as we concluded for the single qubit system, different pure states provide different maxima of S. For example, using one of the results of the MMC realization, one can obtain S q = 15.4748, where p 0 = 0.59503, p 1 = 0.995853, p 2 = 0.467081, p 3 = 0.468792, p 4 = 0.0871691, p 5 = 0.0871691, p 6 = 0.519888, p 7 = 0.465404. From the geometrical symmetry, we deduced the strict valueŜ q = 10 + 9/ √ 2 = 16.364, where the probability configuration is p 0 = 0, p 1 = 1, p i = 0.5, i ∈ 2, . . . , 7. The density matrix, corresponding to this configuration of probabilities, has three eigenvalues, λ = {1, 0, 0}. Hence, these parameters provide the pure state. However, from 100 simulation, one can find a global maximum pure state, where S qmax = 16.6228 and p 0 = 1, For the maximally mixed state S mmix = 13.8005, where p 0 = p 1 = 2/3, p i = 1/2, i ∈ 2, . . . , 7, hold. Similarly, the minima is S min = 9 + 4 √ 2 = 13.6569, p i = 0.5, i ∈ {0, 7}. Note, that the minima coincides both for the classical and for the quantum case.
The Malevich's squares, corresponding to the "minima" state, the maximally mixed state, the "maximum" pure state and the classical state, are shown in Figures 8-11.

Werner State in Probability Representation
One of the most important degraded Bell states is the Werner state [64]. As an example let us take the single qudit state with the spin j = 3/2 and the Werner density matrix where I 4 denotes the identity matrix, |ψ − is the singlet state of the Bell states. The Werner state is characterized by a single real parameter F, that measures the overlap of Werner state with the Bell state. If F ≤ 1/2, the state is separable. The Werner state with F > (2 + 3 √ 2)/8 violates the Clauser-Horne-Shimony-Holt inequality. In terms of (5) the Werner density matrix elements can be written as p 3 = (1 − F)/3, p 4,5 = (1 + 2F)/6, p 12 = 2(1 − F)/3, p i = 1/2, i = {0 . . . 14 \ 3, 4, 5, 12}.
These bounds can be seen in Figure 14. The maximally mixed state provides the minimum by F. The pure state, corresponding to F = 1, provides the aper bound S qmax .

Malevich's Inequality Versus Uncertainty Relations
Uncertainty relation is one of the fundamental distinguishing features of quantum theory that lies in the heart of quantum mechanics and quantum information [4,[65][66][67]. Kennard, Weyl, Robertson and Schrodinger derived several uncertainty relations, among which the most known one is the Heisenberg-Robertson relation where [A, B] = AB − BA, and the variances of observable X is defined by ∆X = Ψ|X 2 |Ψ − Ψ|X|Ψ 2 . The latter uncertainty relation states that the product of two variances of the measurement results of the incompatible observables is bounded by the expectation value of their commutator. A simple lower bound for the sum of the variances can be obtained from (22), using the fact that (∆A − ∆B) 2 ≥ 0. Thus, one can write Further we will use the notation Ψ|[A, B]|Ψ ≡ [A, B] . In case of the three observables one can generalize (22) similarly to (23), namely where ∆ 3 = (∆A) 2 + (∆B) 2 + (∆C) 2 . In [51] two uncertainty relations for triple observables were proposed. They read as The last relation is definitely stronger than (24). The Equation (25) is verified using single spin measurement in diamond (see [55]).
For the case of N incompatible observables A 1 , A 2 , . . . , A N , the following variance-based uncertainty relation hold. The second inequality was improved in [53], namely This inequality has a tighter lower bound then (27). In [52] a stronger uncertainty relation for N incompatible observables is deduced, i.e.,

Measurements in Qubit System
Let us choose three Pauli operators as an example of incompatible observables The following variance holds. Using the notations provided in [54], namely one can rewrite the uncertainty relations (24)-(30) as where The latter relations were experimentally verified in [54] using the single-photon measurement experiments. The inequalities (35), (34) and (39) have more stringent bounds than others in qubit systems.

Relation of Classical Coin Probability Distribution and the Quantum Qubit States
It is known that the matrix elements of an arbitrary matrix can be related to some probability distribution. In [68] this fact is used to introduce an interesting quantization procedure of classical statistics. Following this line, we start from the classical coin tossing game. The aim of the game is that there is a classic coin, tossing which, the players get one of the two sides with a certain probability. For the loss of each side of the coin some reward is assigned. Using the classical probability distributions that describe the coin states, one can introduce the density matrices and the state vectors in the Hilbert space. The probability distributions are mapped onto the density operators, acting on the Hilbert space, and the classical random variables, used in a game as rewards, are mapped onto Hermitian matrices, namely the Hermitian operators, acting on the Hilbert space. Using this bijective mapping, one can rewrite the relations, known from quantum mechanics in the classical-like random variables and probability distributions.
As an example, let us start from the spin −1/2 state (qubit) described in Section 2. Since this matrix can be parametrized by three random variables, our classical coin tossing game consists from three non ideal coins. Their states are identified with three probability distributions (p 1 , 1 − p 1 ), (p 2 , 1 − p 2 ), (p 3 , 1 − p 3 ), where 0 ≤ p 1,2,3 ≤ 1 are the probabilities to have have the coin in "up" position. Hence, three random variables X(j), Y(j) and Z(j), j = 1, 2, can be introduced, such that X(1) = x, X(2) = −x, Y(1) = y, Y(2) = −y and Z(1) = z 1 , Z(2) = z 2 , where x, y, z 1 , z 2 are real numbers. The mean values and the moments of these random variables are the following The numbers p i , i = 1, 2, 3 are organised the matrix form (1). Let the operatorĤ 2 have the Hermitian matrix, parametrized by three random variables, as The mean value is defined as The Pauli matrices (31) correspond to (42) with the following parameters One can conclude that the mean values of these observables are In these notations the uncertainty relation (1) can be written as follows This uncertainty relation provides a quantitative description that only one spin component of a two-level system can have a well defined value. One can see, that this relation is the strongest among (33)- (39). As it is shown in [54] the inequalities (35), (34) and (39) most often reach the specified boundary.
Let us rewrite the sum of the areas of the three Malevich's squares (11) in similar to (45) form, namely Since (12), holds, one can rewrite (46) as Using the Monte-Carlo algorithm, we considered 10 4 different probability configurations p i , i = 1, 2, 3 and compared the lower and upper bounds of Malevich's inequality (46) with the best inequalities (35), (34) and (39), that are verified experimentally in [54]. Malevich's inequality reach the lower limit (45) for the probability configurations (13).
The resulting inequality can be experimentally verified and compared, for example with (30).

Discussion and Conclusions
In this paper we introduced the universal geometrical picture of the single qudit quantum system, based on the new quantum suprematism approach, introduced in [44][45][46]. The single qubit is identified with the set of three probability distributions of the spin projections on the three perpendicular directions in space. Three probabilities, parametrizing the density matrix of the qubit, form the three simplexes on the plane. Connecting them, the triangle is formed, the sides of which serve as bases for the three squares, analogues of the Malevich's squares. The sum of the areas of these squares characterize the quantum properties of the single qudit. In this paper, we proposed to go further and introduce polygons, built on simplexes, formed by the probabilities, that parametrize the density matrix, to describe the higher dimension quantum systems. The sides of the polygon serve as bases for the set of squares that form an analogue of the Malevich's Suprematist Composition. The universal inequality, based on the sum of the areas of the squares, is constructed. The upper bounds of the inequality is different for the classical set of probabilities and for the quantum system with the density matrix, parametrized by the probability set. The inequality illustrates the single qudit states quantumness. In quantum case, the upper bound of the inequality corresponds to the pure states as the surface of the Bloch sphere for the single qubit states. The upper bound of the inequality can be found for the qudit states of high dimensions, for example, using the Metropolis Monte-Carlo algorithm. In contrast to the known multidimensional geometrical representations, the Malevich's Suprematist Composition provides a simple and beautiful picture on the plane. The results are illustrated by the example of the single qutrit and ququad states. Particular attention is paid to the case of the Werner ququad state. Finally it is shown that the Malevich's inequalities can serve as uncertainty relations for the systems of high dimensions and successfully compete with already known uncertainty relations for many arbitrary incompatible observables. It is expected that the multi-observable Malevich's inequalities can be verified experimentally using the techniques similar to ones that are presented in [54,55].