A combined-probability space and (un)certainty relations for a finite-level quantum system
Arun Sehrawat

TL;DR
This paper introduces a new geometric framework called combined-probability space for finite-level quantum systems, deriving uncertainty relations using convex analysis and parametric curves, unifying and extending known results.
Contribution
It develops a novel combined-probability space for qudits, characterizes its extreme points, and derives uncertainty relations without exhaustive search by focusing on parametric curves.
Findings
The combined-probability space is a compact convex set with extreme points on parametric curves.
Uncertainty relations are obtained by minimizing concave functions on these curves.
Many known tight (un)certainty relations for qubits are recovered through triangle inequalities.
Abstract
The Born rule provides a probability vector (distribution) with a quantum state for a measurement setting. For two settings, we have a pair of vectors from the same quantum state. Each pair forms a combined-probability vector that obeys certain quantum constraints, which are triangle inequalities in our case. Such a restricted set of combined vectors, titled combined-probability space, is presented here for a -level quantum system (qudit). The combined space turns out a compact convex subset of a Euclidean space, and all its extreme points come from a family of parametric curves. Considering a suitable concave function on the combined space to estimate the uncertainty, we deliver an uncertainty relation by finding its global minimum at the curves for a qudit. If one chooses an appropriate concave (or convex) function, then there is no need to search for the absolute minimum (maximum)âŚ
| 0 | ||
| 0 | ||
| If and only if | Then |
|---|---|
| and | |
| and | |
| and | |
| and | |
| 0 | ||
| 0 | ||
| If and only if | Then |
|---|---|
| and | |
| and | |
| and | |
| and | |
| 0 | ||
| 0 | ||
| If | Then | |
| and | ||
| and | ||
| and | ||
| and | ||
| and | ||
| and | ||
| 0 | ||
| 0 | ||
| If | Then | |
|---|---|---|
| and | ||
| and | ||
| and | ||
| and | ||
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
A combined-probability space and (un)certainty relations for a finite-level quantum system
Arun Sehrawat
Department of Physical Sciences, Indian Institute of Science Education & Research (IISER) Mohali, Sector 81 SAS Nagar, Manauli PO 140306, Punjab, India
Abstract
The Born rule provides a probability vector (distribution) with a quantum state for a measurement setting. For two settings, we have a pair of vectors from the same quantum state. Each pair forms a combined-probability vector that obeys certain quantum constraints, which are triangle inequalities in our case. Such a restricted set of combined vectors, titled combined-probability space, is presented here for a -level quantum system (qudit). The combined space turns out a compact convex subset of a Euclidean space, and all its extreme points come from a family of parametric curves. Considering a suitable concave function on the combined space to estimate the uncertainty, we deliver an uncertainty relation by finding its global minimum at the curves for a qudit. If one chooses an appropriate concave (or convex) function, then there is no need to search for the absolute minimum (maximum) on the whole space, it will be at the parametric curves. So these curves are quite useful for establishing an uncertainty (or a certainty) relation for a general pair of settings. In the paper, we also demonstrate that many known tight (un)certainty relations for a qubit can be obtained with the triangle inequalities.
I Introduction
Every setting for a measurement on a quantum system can be completely specified by an orthonormal basis of the systemâs Hilbert space. Identical systems can be independently prepared in a (pure) state such that, every time, we get a definite outcome when a system is measured in a setting . If we change to a physically distinct setting , then we observeâsometimes one and sometimes otherâmultiple outcomes. In other words, there the probability is one for an outcome in -setting, whereas none of the probabilities is one in -setting. Of course, in any setting, all the probabilities are nonnegative numbers that sum up to one. Apart from that, the probability vectors (distributions) and âassociated with the two settings and , respectivelyâmust follow certain constraints, called quantum constraints (QCs), together.
Historically, such QCs are expressed in terms of uncertainty relations (URs) by taking Hermitian operators rather than orthonormal bases. An UR is an inequality, , between two real-valued functions: uncertainty measure and its lower bound . In 1927, Heisenberg introduced the first UR Heisenberg27 ; Wheeler83 (derived by Weyl in Weyl32 ) for the position and momentum operators. Different aspects of his seminal work are reviewed in Busch07 . Robertson Robertson29 generalized the Heisenbergâs relation for an arbitrary pair of operators by employing the standard deviation as a measure of uncertainty. In Robertsonâs UR, the lower bound is a function of state . Deutsch criticized it and introduced a new UR Deutsch83 for a finite-dimensional state space by taking entropy as a measure of uncertainty. He achieved a state independent . Later, a better lower bound was conjectured by Kraus Kraus87 and then proved by Maassen and Uffink Maassen88 . Such URs areâknown as entropy URsâreviewed in Wehner10 ; Bialynicki11 ; Coles17 .
Throughout the article, we are considering -level quantum systems (qudits) and projective measurements. Our primary objective is to study a set of combined-probability vectors , called combined-probability space, where every vector respects certain, if not all, QCs. Here the elemental QCs are the triangle inequalities (TIs) between quantum angles, and the (un)certainty relations emerge from them. As an angle between a pair of ketsâcalled quantum angleâis a metric over the set of all pure states Wootters81 , we own TIs. Landau and Pollak obtained a single TI Landau61 of this kind for continuous-time signals and provided a classical UR (see also Sec. 8 in Folland97 ).
In Sec. II, we present the combined space that is a compact convex subset of the -dimensional real vector space . Thanks to the Krein-Milman theorem (see Theorem and Appendix A.3 in Niculescu93 ), every compact convex subset of can be generated by the convex combinations of its extreme points. As a principal result, we provide a family of parametric curves in Sec. II, which represents all the extreme points of the combined space. In the case of , all the parametric curves form an ellipse, and the same ellipse also appears in Lenard72 ; Larsen90 ; Kaniewski14 as a special case.
An uncertainty measure should be a concave function on the combined-probability space, argued in the beginning of Sec. III. The concavity of ensures that its global minimum will occur at the parametric curves (extreme points) of the space (see Theorem and Appendix A.3 in Niculescu93 ). Hence, one can exploit these curves to obtain an UR, rather easily, for her or his liking of and, of course, for general measurement settings and .
In Sec. III, we choose a concave, thus uncertainty, measure . A significance of our choice lies in the fact that is again a concave function on every parametric curve (that is, as a function of the parameter). Therefore its absolute minimum will occur nowhere but at the endpoint(s) of these curves. A simple three-step procedure is delivered to find the lower bound for an arbitrary pair of settings and for a finite . One can employ an ordinary computer to run the procedure. Besides, is presented in analytic forms for and in the case of mutually unbiased bases (MUBs) Durt10 . References Kraus87 ; Larsen90 ; Ivanovic92 ; Sanchez-Ruiz95 ; Ballester07 ; Wu09 ; Mandayam10 contains URs particularly for MUBs. At the end of Sec. III, we provide another uncertainty measure that is also concave on all the parametric curves, so the whole analysis given before for can be straightforwardly applied to this measure.
If a suitable concave function can be a measure of the uncertainty, then an appropriate convex function will be a measure of certainty. In Sec. IV, we pick some other concave and convex functions and exhibit that the tight (un)certainty relations given in Rastegin12 ; Larsen90 ; Busch14 ; Garrett90 ; Sanchez-Ruiz98 ; Ghirardi03 ; Bosyk12 ; Vicente05 ; Zozor13 ; Deutsch83 ; Maassen88 for a qubit can be achieved with the TIs that specifies the ellipse. We conclude the article with Sec. V.
The appendices are kept for certain technical details and proofs: the TIs are derived in Appendix A. It is manifested in Appendix B that the combined space is a compact convex set. The parametric curves are explicitly obtained in Appendix D with the help of Appendix C.
II Quantum constraints and combined-probability space
In quantum theory, observables are represented by Hermitian operators. If such an operator is degenerate, then it possesses more than one eigenbases, where some of them can represent physically different measurement setups. Hence, âmeasurement in an orthonormal basisâ of the underlying Hilbert space is rather well defined than âa measurement of an operatorâ (see Chapter 7 in Peres93 ). In fact, measurement in a basis measure all the operators whose eigenbasis is . Moreover, Deutsch pointed out that a measure of uncertainty for a discrete observable must not depend on its eigenvalues, but on its eigenbasis Deutsch83 . With all these considerations, we choose orthonormal bases instead of Hermitian operators to specify different projective measurements for a qudit.
We begin with two orthonormal bases
[TABLE]
of a -dimensional Hilbert space to depict the two measurement settings and , respectively. In this paper, all (un)certainty relations are preparation (un)certainty relations that are applicable in the following experimental scheme.
[TABLE]
A similar scenario Peres used in his book Peres93 at page 93 to interpret the position-momentum UR. In proposal (2), clearly, the two measurements have no influence whatsoever on each other.
Throughout the text, we assume is a pure quantum state so that we can associate angles (4) and TIs (12) with the state vector . Although every (un)certainty relation presented in this paper as it is applicable for every quditâs state [see the text around (39)].
The state provides two probability distributions for the two measurement settings [given in (1)] by the Born rule:
[TABLE]
are the probabilities of getting outcome in the -setting and outcome in the -setting, respectively. Next, we present quantum angles:
[TABLE]
are the angles between and and between and , respectively. In the entire article, we consider only the principal values of the (multivalued) function. With (3) and (4), one can recognize that the absolute value of the inner product establishes a one-to-one correspondence between the anglesâthat belong to âand the probabilitiesâthat lie in .
Related to the -setting, every probability vector satisfies
[TABLE]
and the collection of all such vectors constitutes a probability space . Similarly, isârelated to the basis âdefined be the constraints
[TABLE]
Equations (5) and (7) state that all the probabilities add up to one, and inequalities (6) and (8) tell that probabilities are nonnegative numbers. Both and areâthe standard -simplicesâcompact convex subsets of the -dimensional real vector space , and their Cartesian product is a compact convex subset of [see Appendix B]. Basically, is determined by the conditions (5)â(8).
Performing measurement on every qudit using a single setting, say , looks like throwing a -sided dice, every time. The vector alone is limited by (5) and (6) that specify , which is also the probability space of a -sided dice. Whereas the experimental scheme (2) is not similar to throwing one out of two -sided dices at a time, although is the probability space of two dices: every pure or mixed state of a qudit gives a unique pair by the Born rule [see (3) and (39)], but not every pair has a quantum state. For example, if for some , then one cannot get always the same outcome: in the -setting and in the -setting. In other words, it is impossible to prepare prep a quantum system in a state (in this case, there exists no quantum state) that can provide , where , which identifies an extreme point of .
So, other than (5)â(8), there are certain constraints that are purely quantum mechanical in nature and must be obeyed by and together. In our case, QCs are the TIs given in (12), which arise naturally from the structure of Hilbert space on which quantum theory is based. To write the TIs, we need
[TABLE]
that is the probability of getting outcome if (or if ) is our state for the system. Like and in (4),
[TABLE]
is the angle between the pure states and . In the subscripts of and , from left, the first and second indices are reserved for and , respectively. Therefore, note that is different from , and likewise for .
After choosing the measurement settings, and in (1), the entries in
[TABLE]
get fixed by (9) and (10). Each entry in and in belong to and , respectively. Sum of all the entries in each row and every column of is one, thus it is a doubly stochastic matrix. If the two measurement settings described by (1) are physically the same, then will be a permutation matrix. For every state vector , there are three TIs
[TABLE]
attached to each entry in . These TIs [see (114)] are derived in Appendix A.
For simplicity, out the three TIs (12), here we choose only one
[TABLE]
Angles and vary, whereas is fixed, as we change the state vector . The kets that saturates TI (13) for certain lie in the linear span of [consider (108) and (109) with from Appendix A]. In the triangle equality (TE) , and are reminiscent of complementary angles from planar geometry, and . Identifying , , and in Landau61 by our , , and , respectively, one can see that the TI is obtained by Landau and Pollak for continuous-time signals (see also Sec. 8 in Folland97 ). They also plotted elliptic curves (for different s) one of this kind is shown in Fig. 1 between the point and (see also Lenard72 ). The results in Landau61 ; Lenard72 are more general than here, but they are only for a pair of projectors. Whereas, we take every possible pair and and present three TIs [see (12)], not just one, for each pair.
The cosine function is strictly decreasing on , so applying it on both sides of TIÂ (13) and using (3), (4), (9), and (10), we attain
[TABLE]
after a rearrangement of terms. As both sides in (14) are nonnegative functions of the probabilities, squaring and further simplification lead to
[TABLE]
for every .
All those pairs that obey QCÂ (15) for every build the combined-probability space for the two measurement bases in (1). In the case of , even if we consider all TIs given in (12) for each , they do not capture the full QCs for a general pair of settings. Therefore, one can still find some that corresponds to no quantum state. Nevertheless, our analysis relies on the following fact: every that does not belong to cannot be obtained from a quantum state, thus it is discarded. To investigate a space âthat contains all those, and only those, pairs that originate from the quantum statesâis not the aim of this paper. However, it is not tough to realize that for ; in general, .
Note that is a proper subset of . To prove this one can show: only one out of the two extreme pointsâspecified by and , where âof can belong to . Recall that if and only if then the point described by belongs to , otherwise will be violated. Secondly, if then , and cannot be obeyed by the other point; hence that stays outside of .
The space isâheld by the conditions (5)â(8) and (15)âa compact and convex subset of [for a proof, see Appendix B]. Every point of such a set can be written as a convex combination of its extreme points due to the Krein-Milman theorem (see Theorem and Appendix A.3 in Niculescu93 ). We begin our journey from an interior point of in Appendix D.1 and arrive at its extreme points at the end of Appendix D.3. There it is concluded that the set of all extreme points of comes from a family of parametric curves.
One can skip all those technical details and start constructing the parametric curves straight from the conclusion (197): the first step is to pick a set of angles from a single column or row of the matrix given in (11). Such a set is called -set, and . For instance, we pick the top angles from the first column. Then we associate TEs with the -set as
[TABLE]
by taking , where the subscript 1 reflects the selected column.
Next, with (3) and (4), we assign probabilities to the angles: and . They create the probability vectors
[TABLE]
One can observe that {\big{(}\vec{p}{\scriptstyle(\beta_{1})}\,,\,\vec{q}{\scriptstyle(\beta_{1})}\big{)}} serves as a vector-valued function of a single real parameter , thus it exhibits a parametric curve. Since the curve is associated with an -set and all its points obey TEs (16), we call it an -parametric curve.
A part of the curve, identified by the upper and lower limits , lies in and represents its extreme points because {\big{(}\vec{p}{\scriptstyle(\beta_{1})}\,,\,\vec{q}{\scriptstyle(\beta_{1})}\big{)}} cannot be written into a convex combination of other points of . In Appendix D.4, we realize that the two limits are fixed by
[TABLE]
[see (215)]. Equations (22) and (24) are like Eq. (214), whose roots are stated in (221). Always the root with + sign delivers the correct limit [for justifications, see the last paragraph in Appendix D.4].
If one chooses an -set from a row of , say , then the -parametric curve is constructed as
[TABLE]
Now the parameter is , and the limits are determined by
[TABLE]
One can check that, for , both (16)â(23) and (25)â(31) describe the same thing, provided and are identical in both the cases. So an -parametric curve is identified by an -set and the positions of and (that is, and ) in and , respectively.
Let us count the total number of curves such as describe by (16)â(20). One can harvest distinct -sets from a single column of , and there are total columns. The probability can take separate places in of (17) for distinct , and can take separate places in of (18) for distinct . Thus we have individual -parametric curves with a single -set. Since , we collect
[TABLE]
number of curves, where each -set is made of angles from a column of .
We secure the same number if we consider rows, rather than columns, to build an -set and then a curve such as given by (25)â(29). For , every -set is a part of a row as well as a part of a column. So, to avoid double counting errors, we take the cases and separately. In total, there are
[TABLE]
number of parametric curves for a qudit.
If one adopts a suitable concave function on the combined space to estimate the uncertainty, then its absolute minimum will occur only at the parametric curves (see Theorem and Appendix A.3 in Niculescu93 ). So ultimately one needs to find absolute minima of, at most, functions, each of a single variable [for example, see (42)]. Then the smallest minimum will be the lower bound in an UR. This task can be easily completed with a regular computer. In the next two sections, we discuss certain concave as well as convex functions on .
III Uncertainty measures and relations
If quantifies the uncertaintyâabout the outcomes when a qudit is measured in the basis of (1)âthen should be a concave function of . It is because mixing probability distributions, and as with , can only increase uncertainty (see Chapter 9 in Peres93 ). In this regard, every mixed state, say , has more uncertainty.
So, here, we adopt a real-valued smooth concave function
[TABLE]
as an uncertainty measure. It is associated with the Tsallis entropy Tsallis88 , where the Boltzmann constant. To prove is a concave function on , it is sufficient to demonstrate that the Hessian matrixâthat is a symmetric matrix of second-order partial derivatives of âis a negative semidefinite matrix at every point in (see Theorem in Rockafellar70 ). At an interior point (where all ) of , the entry in the th row and th column in the Hessian matrix is
[TABLE]
where and is the Kronecker delta function. These entries indeed provide a negative definite matrix, thus is strictly concave in the interior of . At a boundary point (where one or more ), all the partial derivatives in a certain row(s) and column(s) of the Hessian matrix become zero, thus the matrix turns out to be a negative semidefinite and to be a concave function. By the way, can be employed for the entanglement detection (see Remark 2 in Sehrawat16 ).
If the state vector is an equal superposition of all the kets in or the state is completely mixed, then all the outcomes will be equally probable: for every is the center of , where reaches its maximum value . Whereas, only in the case of a definite outcomeâthat is when , and then for a particular âwe have the minimum uncertainty as it should be. Note that characterizes an extreme point of .
To establish a measure of combined uncertainty for the experimental proposal (2), we take the same function,
[TABLE]
for the -setting. Like of (35), is a concave function on with the range . Now we define our combined uncertainty measure
[TABLE]
on the convex set , rather than . Sum of two concave functions is concave, so is also a concave function.
A mixed quantum state is a convex combination of pure states, the probabilities
[TABLE]
are linear functions of the state (, ), and is a compact and convex set. As a result, every associated with any (pure or mixed) quantum state lies in . And, because is a concave function on , our UR given in (40) applies to every state for a qudit. This is also true in the case of other (un)certainty relations presented in Sec. IV, because mostly there also we have either a concave or a convex function. In (93) and (94), the functions are neither concave nor convex on , but the relations are followed by every qubitâs state. By the way, one can check that if then the Born rule (39) reduces to (3).
The range of and our UR are presented as
[TABLE]
is the global minimum that will occur at the -parametric curves [given in Sec. II]. Whereas, gains its absolute maximum only at the point identified by for all . It is called the center of , which represents the uniform distribution for both the settings. Now recall from Sec. II that an extreme point of , describe by , belongs to if and only if . Only in such a situationâthat does not necessarily require both the bases and to be the same in any wayâwe have the trivial lower bound and thus the UR . A similar statement is made by Deutsch in Deutsch83 . For , the trivial case is possible if and only if the two measurement settings are (physically) the same. A nontrivial lower bound materializes when the settings are completely different, that is when for every . So the following analysis is obviously for the nontrivial cases.
To find the lower bound (41) and to establish the UR , we write the functional form
[TABLE]
which of (38) acquires on an -parametric curve specified by (16)â(21). To show that of (42) is a concave function of , we present
[TABLE]
With these derivatives, one can clearly see for . Whereas, for , one can directly realize . This proves that is a (strictly) concave function on every parametric curve. Therefore, its global minimum will always be at the endpoints of the curves. Endpoints of an -parametric curve are identified by the two limits on a parameter [see (22)â(24) as well as (30)â(32)].
It is manifested in Appendix D.4 that, to compute a limit, we always have to solve an equation such as (214); which carries m number of angles from a column or a row of [given in (11)]. Note that we use small letter ââ when we construct a parametric curve with an -set [see Sec. II] and use capital letter âmâ when we compute a limit with an m-set. Essentially, one needs to follow a three-step procedure to compute a limit and then the value of [defined in (38), see also (42)] at the corresponding endpoint of a curve:
[TABLE]
The equation in Step 2 is like Eq. (214) that is solved in Appendix D.4, and every time we take the solution (221) with + sign. One can observe that and therefore are solely determined by the m-set picked in Step 1.
After repeating the three-step procedure for every m-set and for each , we collect a set of values for all the endpoints. Then, the smallest value in this set will be [defined by (41)], and thus we own our UR [presented in (40)]. Since every is determined by the entries in -matrix, the lower bound âdepends only on the measurement bases in (1)âis independent of a quantum state. Besides, to compute , we can employ an ordinary computer, which repeats the three steps of (46) by taking
[TABLE]
number of m-sets one by one. In fact, is the total number of endpoints for a qudit.
Although we have the solution (221) for Step 2, it is easy to calculate and for . For a 2-set , one can directly realize
[TABLE]
Every endpoint of a parametric curve is determined by a set of angles [see (22), (23), (30), and (31)]. For a -set , that is an entire column or row of , we have the total probability . Therefore, we obtain the solution
[TABLE]
For general measurement settings, it isâeasy to compute butâdifficult to express in an analytic form. Nevertheless, we present it for and when the measurement bases in (1) are MUBs Durt10 .
In the case of a qubit, , a (un)certainty relation can be stated with the three probabilities , , and , hence we drop their subscripts here and in the next section. Furthermore, all the TIs (13) can now be put together as
[TABLE]
where , , and are associated with , , and , respectively [through (3), (4), (9), and (10)]. Here only parametric curves exist, which are four in total [see with (II)]. To draw an endpoint of a curve, we can use either (48) or (51); both are equal (because ). There are only four [see (47)] endpoints . Next, one can realize that (49) and (52) are also the same for a qubit. Furthermore, is even identical for every set. It implies that our combined uncertainty function (38) takes the same value at all the four endpoints, thus and
[TABLE]
is an UR for . It is also given in Rastegin12 .
Together all the parametric curvesâthat represent all the extreme points of the combined-probability space âcan be expressed by an ellipse
[TABLE]
in the case of a qubit. As a special case, the same ellipse also appears in Lenard72 ; Larsen90 ; Kaniewski14 through different routes diff-routes , although our approach is closer to Lenard72 . One can observe that the ellipse turns into a circle for and into certain line segments for . In Fig. 1, we present a contour plot of on by taking . So , and one can see that is bounded by the ellipse (55). Furthermore, by putting in , we can have the four endpoints , respectively.
In the case of , there always exist a quantum state for each point in , thus . For instance, the kets such as (108) and (109) correspond to points on the ellipse (55) by the Born rule (3). In particular, the kets of basis correspond to the points , and the kets of are related with . So the lower bound in the UR (54) is achievedâhence, it is a tight URâonly by those state vectors that (up to a phase factor) belong to one of the bases in (1). The lower bound will be the largest when, , the measurement bases are MUBs [see also (58)].
An UR is called tight if there exists a quantum state that saturates the UR. In the case of a qubit, all the relations mentioned in this and the next section are tight because . For , , hence our UR is not tight in general.
In the case of (qutrit), there are only two kinds of parametric curves (for ), and two types of endpoints (for ). So (48) and (51) can specify any endpoint for a qutrit. To compute the lower bound , we have to evaluate the function of (49) for every 2-set and of (52) every -set drawn from the -matrix. For , there are 18 2-sets and 6 -sets [see the total in (47)]. Then, the smallest out of the values will be our . Now let us consider a pair of MUBs Durt10 for a finite dimension .
If the two bases given in (1) are such that for every [for , see (9)], then they are called MUBs and the measurement settings and are designated as complementary Kraus87 . In the case of MUBs, for every , so one can straightforward realize
[TABLE]
in Step 2 and 3 of the three-step procedure (46). One can acknowledge that here and depend on , not on a particular m-set, because every is the same. Furthermore, decreases, whereas increases, with m. Hence the lower bound is
[TABLE]
which does not deliver a tight UR when , whereas tight URs Kraus87 ; Maassen88 ; Ballester07 are known for MUBs in a finite . We close this section with the following remarks.
Remark 1: By the Born rule (3), provides an extreme point, given by and , of [see (174) and (173) in Appendix D.3]. At this point the combined uncertainty function (38) has the value [see also (52)]. Likewise, gives the combined uncertainty . Now we take the minimum value
[TABLE]
Next, one can easily establish
[TABLE]
The first inequality in (62) comes from (40). The last inequality is due to and the similar relation where the summation is over index instead of . is the largest lower bound that defines the tight UR . For , our lower bound , and the UR (54) is tight. Whereas, if the two bases in (1) share a ket then turns out to be the trivial bound: . One can use (62) to avoid errors while calculating .
Remark 2: The function is the RÊnyi entropy Renyi61 of order . Using (36), one can realize that is a concave function on , hence the sum
[TABLE]
is concave on . Taking (43)â(45), one can confirm that the sum is also concave on each of the parametric curves, therefore its absolute minimum will be on the endpoints. By repeating the three-step procedure (46)âwhere in the third step now we need to compute
[TABLE]
instead of âfor every m-set, we can own an UR based on the combined entropy (64) for any pair of measurement settings. Analogues to (49), (52), and (57), here we have
[TABLE]
respectively, with these one can directly get URs for qubit, qutrit, and for a pair of MUBs just like above. For a qubit, we express the corresponding tight UR (also obtained in Rastegin12 )
[TABLE]
in terms of the product . In this case, the product turns out not only a concave function on but also on each of the four parametric curves. And, its absolute minimumâgiven in left-hand side of (69)âoccurs at all the four endpoints , and the absolute maximum at the center [denoted by in Fig. 1] of .
IV Other (un)certainty measures and relations
The negative of a concave function is a convex function, hence a suitable convex function can be taken as a measure of certainty, rather than uncertainty. Here we present other popular measures of (un)certainty and obtain the associated (un)certainty relations for by finding the absolute minimum (for concave) and maximum (for convex) on the ellipse (55). We want to emphasize that all the relations given in this paper for a qubit are already known, thanks to Larsen90 ; Busch14 ; Garrett90 ; Sanchez-Ruiz98 ; Ghirardi03 ; Bosyk12 ; Vicente05 ; Zozor13 ; Deutsch83 ; Maassen88 ; Rastegin12 , through different methods. The following analysis merely shows that they all can be obtained from the TIs (53) that characterize the ellipse. Recall that one can have the same ellipse from Lenard72 ; Larsen90 ; Kaniewski14 .
One can always construct Hermitian operators, for example
[TABLE]
by assigning real numbers to the measurement outcomes and for the two settings specified by (1). Then and are the sets of eigenvalues of and , respectively. With (3) and (70), one can perceive that the squared standard deviations
[TABLE]
are functions of the probabilities as well as the eigenvalues.
Taking , like the derivatives (36) of , we get the second-order partial derivatives
[TABLE]
of the function (71) for . One can validate that the Hessian matrixâmade of the derivatives (73)âis a negative semidefinite matrix for any set a of eigenvalues. Thus, is a concave function on (see Theorem in Rockafellar70 ). Likewise, is a concave function on . Hence, analogues to of (38), the sum
[TABLE]
establishes a concave, thus uncertainty, measure on the combined space . In Maccone14 , URs are presented by taking a sum such as (74), however, here the approach is different.
In the case of a qubit (), every measurement setting can also be described by a three-component real vector. So, we designate the two settings [see (1)] by certain unit vectors and and then construct the Hermitian operators and with the dot product, where is the Pauli vector operator. One can verify that , therefore the eigenvalues are: . Suppose the kets and of the two bases [in (1)] are associated with the eigenvalue of and , respectively. Now one can easily derive the relation
[TABLE]
between the three kinds of inner products. From Sec. III, let us recall that we only require three probabilities , , and to express a (un)certainty relation for . So, there is no further need for the subscripts. With all the above considerations, of (74) turns out to be the function
[TABLE]
of and .
We plot of (76) on in Fig. 2 by taking . Since is a concave function on , its absolute minimum will be at the four parametric curves, which are jointly described by the ellipse (55) and by their endpoints . To compute the minimum, first, we need to represent as a function of a parameter, like in (42), on each curve. Then, we have to find the critical points of . Here we obtain four critical points âone on each curveâthat are depicted by the bullets in Fig. 2. By putting in of (55), one can have , in that order. Record that the -points are not the endpoints that are only shown in Fig. 1, not in Fig. 2.
The function of (76) takes the value at both the points and takes the value at . So the global minimum is
[TABLE]
and thus we obtain a tight UR, like (54). One can confirm that the lower bound is
[TABLE]
Remark 3: The standard deviation is a concave function of , hence the sum is a concave function on . As a result, we have another tight uncertainty relation
[TABLE]
One can check that the sum reaches its absolute minimum value at all the endpoints , and has its maximum value at the center of . Both the tight URs (77) and (79) are known due to Busch14 . A quantum state that saturates a tight UR is called its minimum uncertainty state. Since the -points and the -points are not the same, in general, the setâof minimum uncertainty statesâis different for the two URs (77) and (79) based on the standard deviation. Note that we always get the trivial lower bound for the product of standard deviations, and this bound can be reached by any ket belongs to either of the bases given in (1).
Next, the Shannon entropy Shannon48
[TABLE]
is arguably the most famous measure of uncertainty at present. It is superior than the standard deviation Bialynicki11 ; Coles17 because it only depends on , not on the eigenvalues. One can show that , and it is a concave function on with the Hassian matrix composed of the second-order derivatives
[TABLE]
where . Considering the same function for the -setting, that is , one can formulate a combined uncertainty measure by the sum and then produce an entropy UR Deutsch83 ; Kraus87 ; Maassen88 . Such URs are reviewed in Wehner10 ; Bialynicki11 ; Coles17 . For , the tight entropy UR is achieved in Garrett90 ; Ghirardi03 (see also Sanchez-Ruiz98 ), and we can directly import all their results here. In fact, Eq. (7) in Garrett90 and Eq. (2.4) in Ghirardi03 are on the ellipse (55), and they found the absolute minimum of on the ellipse. In Ghirardi03 , all the results are given in terms of angles between the real unit vectors, which are related to the angles between kets through (75).
We can choose
[TABLE]
as another (un)certainty measure, which is closely related to the Tsallis Tsallis88 and RĂŠnyi Renyi61 entropies of order . One can prove that the Hassian matrix with entries
[TABLE]
, is a negative and positive semidefinite matrix for and , respectively. It confirms that is a concave (uncertainty) and convex (certainty) measure when and , respectively. A similar observation is made in Luis11 ; Rastegin12 . In fact, our uncertainty measure of (35) is with the exponent . Furthermore, the range of is if and is if . When , for every due to Eq. (5), thus is not a genuine (un)certainty measure.
Like before, one can establish a (un)certainty relation with the sum . For , in the case of , we obtain
[TABLE]
as a tight certainty relation; which is also given in Larsen90 for . Due to (84), one can immediately derive (85) from the UR (77). Where of (76) reaches its absolute minimum (uncertainty) on , there the function (84) achieves its global maximum (certainty)
[TABLE]
The certainty measure (84) hits its absolute minimum 1 at the center of [depicted by the star in Figs. 1 and 2].
Remark 4: One can have another tight certainty relation
[TABLE]
where product of certainty measures is used. The relation (87) is presented in Larsen90 for . One can verify that is a convex functions on . Therefore, its absolute maximum [given in (87)] will be on the ellipse [specified by (55)], and the global minimum will be at the center of . The product-function reaches its upper bound on the -points. By applying the negative of the logarithm on both sides of the inequality (87), we get the corresponding tight URâachieved in Bosyk12 âin terms of the collision entropy (that is, the RĂŠnyi entropy Renyi61 of order ).
Lastly, we pick the function
[TABLE]
that defines a norm on if we replace with . Since every follows (6), the modulus sign is not shown in (88). Every norm is a convex function, so can be considered as a certainty measure on ; {u_{\textrm{max}}(\vec{p}\,)\in\big{[}\tfrac{1}{d}\,,1\big{]}} for every . Note that is not differentiable everywhere in . Nevertheless, we can assemble a combined certainty measure with the sum on .
In the case of , the function is equal to
[TABLE]
The limits on stated in (89) divide âthat is an elliptical region [see Figs. 1 and 2]âinto four quadrants. The function is differentiable in each of the quadrants. Furthermore, since it is a convex function on , its global maximum will be at the ellipse (55). Here we discover four critical points, one in each quadrant on the ellipse, where the combined function takes a maximum value. In fact, these four points are the same exhibited in Fig. 2.
The combined measure acquires the value at both and reaches the value at both . Thus, like (85), we get the tight certainty relation
[TABLE]
for a qubit. And, the absolute maximum (upper bound) is given by
[TABLE]
analogues to (86). Besides, has its global minimum 1 at the center of [exhibited by the star in Figs. 1 and 2].
The certainty relation (90) is captured in Vicente05 using the inequality
[TABLE]
Instead of TIs (53), for a qubit, all the tight relation (54), (69), (77), (79), (85), (87), (90), (93), (94), and the entropy UR given in Garrett90 ; Sanchez-Ruiz98 ; Ghirardi03 can be obtained with (92). In fact, inequality (92), that is , can be produced from TIs (13), and it is weaker than the TIs: all those that are bounded by (92) rather than (13) constitute a bigger combined-probability space.
Remark 5: One can confirm that the product is neither a concave nor a convex function on (for a similar observation, see Maassen88 ), so it not clear to us whether or not we can take it as a good combined-(un)certainty measure for every qubitâs state. It also shows that product of two convex (concave) functions is not necessarily a convex (concave) function. By computing the gradient of in each of the four quadrants, one can realize: the function reaches its global minimum at the center of and reaches its global maximum (on the ellipse) at the -points. Hence, we have the tight relation
[TABLE]
which is reported in Maassen88 (and implicitly appear in Deutsch83 ). In fact, for , the ket given by Eq. (11) in Deutsch83 is the ket (108) with and , and the ket corresponds to the point . By applying the negative of the logarithm on both sides of the inequality (93), one can turn this relation in the min-entropy terms Mandayam10 . The min-entropy is the smallest in the family of RÊnyi entropies Renyi61 , and it is neither concave nor convex function on the interval . Like above, using the min-entropy, one can have another tight relation
[TABLE]
that is also given in Maassen88 , recall that . The function always takes its global minimum at the endpoints and and takes its absolute maximum at the center [shown in Fig. 1] of . In Zozor13 , a general expression for the tight lower bound of a sum of RÊnyi entropies is given, which is basically the minimization of the sum on the ellipse.
V Conclusion and outlook
Taking a pure quantum state for a qudit, we present TIs (13) and then the combined-probability space for a general pair of measurement settings. The combined space is a compact and convex set in , and all its extreme points are represented by the -parametric curves, . These curves are determined by the two settings (-matrix) and are sufficient to generate the whole as well as to provide a (un)certainty relation.
One can pick some suitable concave and convex functions on to quantify the uncertainty and certainty, respectively. Subsequently, one can establish an uncertainty (a certainty) relation by finding the absolute minimum (maximum) of a function at the parametric curves. Due to the parametric curves, formulation of a (un)certainty relation become a single-parameter optimization problem.
Particularly for the uncertainty measures (38) and (64), the absolute minima can always be easily computed by repeating the three-step procedure given in Sec. III with every m-set, , built with entries in the -matrix. And, thus, one can enjoy the corresponding URs for any pair of measurement settings. For the other functions, one needs to find all the critical points on the curves first and then the absolute extremum at those points. That is, still, much easier than searching the extremum on the whole space. In each case, the extremumâthat is a lower (upper) bound on an uncertainty (certainty) measureâonly depends on the measurement settings, not on a quantum state. Every (pure or mixed) state of a qudit provides a point in by the Born rule and respects every (un)certainty relation presented in this write-up.
In the case of a qubit, , we show that many known tight (un)certainty relations, owing to Larsen90 ; Busch14 ; Garrett90 ; Sanchez-Ruiz98 ; Ghirardi03 ; Bosyk12 ; Vicente05 ; Zozor13 ; Deutsch83 ; Maassen88 ; Rastegin12 , can be derived from the TIs (53). These TIs define an ellipse that represents all the parametric curves, and each point on the ellipse (and in ) corresponds to a qubitâs state, thus we have tight relations. The same ellipse also emerges in Lenard72 ; Larsen90 ; Kaniewski14 as a special case. For a pair of measurement setting on a qubit, it seems that the TIs (13) and the results in Lenard72 ; Larsen90 ; Kaniewski14 ; Landau61 provide more fundamental QCs than the tight (un)certainty relations.
TIs (13) do not provide all possible QCs when the dimension , hence there are still some points in that correspond to no quantum state, and our URs given in Sec. III are not tight in general. However, all our (un)certainty relations are built on the fact that âevery point outside of is, surely, not associated with any quantum stateâ. One can include other QCs, namely TIs (12), then the domain of a (un)certainty function will be smaller. Consequently, better bounds and finer (un)certainty relations can be achieved. To get a tight bound, in the case of general settings and , is a challenging task. Tight URs are only known in some special cases: position-momentum Weyl32 , MUBs Kraus87 ; Maassen88 ; Larsen90 ; Sanchez-Ruiz95 ; Ballester07 ; Mandayam10 , and a qubit Larsen90 ; Busch14 ; Garrett90 ; Sanchez-Ruiz98 ; Ghirardi03 ; Bosyk12 ; Vicente05 ; Zozor13 ; Deutsch83 ; Maassen88 ; Rastegin12 .
URs have numerous applications in different strands of physics. Recently, these are employed for certain quantum information processing tasks such as the cryptography Mandayam10 and the entanglement detection Vicente05 ; Hofmann03 ; Guhne04 ; Giovannetti04 ; Guhne04b . As our (un)certainty relations arise solely from TIs, one can directly appoint TIs (12) as genuine QCs for such a job. Furthermore, in quantum state estimation Paris04 , one collects data by applying different measurement settings, thus realizes scheme (2) in a laboratory. Then, is constructed with the data. There one needs to confirm that the estimated represents a legitimate quantum state. Again TIs (12) could be utilized for such a test, for instance, one can firstly check whether the estimated follows all the TIs or not.
Acknowledgements.
I am very grateful to Arvind for stimulating discussions and helpful comments on the manuscript. I thank Arun Kumar Pati for bringing Ref. Landau61 to my attention and JÄdrzej Kaniewski for explaining and making me aware about their work Kaniewski14 .
Appendix A Derivation of the triangle inequalities
Landau and Pollak obtained a single TI of the kind given in (13) for continuous-time signals. One can spot several similarities between their work Landau61 and the following derivation. In this paper, the primary QCs are the TIs (12). To derive such TIs, we consider three kets , , and of a -dimensional Hilbert space . Their inner products are expressed in the polar form as
[TABLE]
where the phases . In the main text, is associated with a quantum state, and and are with the two measurement settings [see (1)]. Through the inner products, the quantum angles , , and are related with the probabilities , , and [see also (3), (4), (9), and (10)], and . Recall that the angles lie in , and the probabilities belong to the interval .
It is always feasible to write one ket, say , as a sum of its component in the linear span of other two and its component in the orthogonal complement of the span [see (100)]. In general, and are not orthogonal to each other. In the case of , employing the Gram-Schmidt orthogonalization process, one can convert the linearly independent set into an orthonormal set or , where
[TABLE]
The two sets are related by a unitary transformation:
[TABLE]
Now we can resolve
[TABLE]
with a suitable ket that follows . If and only if lies in the span of , the last term in the expansion (100) vanishes, otherwise not. With the normalization of , one can recognize , and subsequently
[TABLE]
Taking the transformation (99) and the polar form (97), we realize another representation of the ket
[TABLE]
from (100). With the new representation (102) and the polar form
[TABLE]
we attain
[TABLE]
Remember that because lies in the orthogonal complement of . Owing to
[TABLE]
first, we obtain the left-hand side inequality in
[TABLE]
and afterwards the right-hand side inequality with the aid of (101). Eventually, from above, we have
[TABLE]
[using the polar form (95)].
If there are equalities in (105) as well as in (101), then we reach an equalityâat the place of inequalityâin (107): are the solutions of equation . And, implies that is contained in the subspace generated by , thus . These two conditions turn (100) and (102) into
[TABLE]
These ketsâwhere is specified by the polar form (97), provided , and the global phase can be any real numberâare the only kets that saturate the inequality (107). We can not straightforward use the above analysis for the next two cases , hence these are studied individually.
In the case of , and ; in fact, there is no need for the orthogonalization process, and both the representations (100) and (102) of become the same. Furthermore, is not determined by the polar form (97), whereas . Now the inequality (107) becomes , which isâdirectly realized from (100) due to (101)âsaturated by the ket (108) with an arbitrary real phase [remember due to (95)].
In the case of , and according to (97), and the above orthogonalization process, thus and , does not exist. Consequently, the term will not then appear in the decomposition (100) of . At the places of (101), (107), and (108) we have , , and , respectively. In this case, there is no genuine QC, nevertheless is saturated by the ket(s) [remember , see (96)].
One can appreciate that inequality (107) is a legitimate QC, and and must respect that for every . Applying square root to both sides of the inequality, we gain
[TABLE]
Since and , both and are nonnegative numbers, hence there is no need to use the modulus on either side of the above inequality. As the function is a strictly decreasing function and for , from (110), we own an equivalent form
[TABLE]
of (107). In fact, (111) carries two TIs: and . of (108) with saturates the TI and with saturates the other TI . TIs such as [see (13)] are used to define the combined-probability space in Sec. II.
Replacing the ordered set by in (100) and repeating the above analysis, one will discover
[TABLE]
at the places of (107) and (111), respectively. Jointly (111) and (113) can be written as
[TABLE]
which displays three TIs associated with the three angles. A TI says: the sum of two quantum angles must be greater than or equal to the remaining quantum angle.
In fact, the quantum angle â" is a metric (and a distinguishability measure Wootters81 ) on the set of all pure states (). It is because the four conditions,
2. 2.
if and only if 3. 3.
4. 4.
â,
are satisfied for every , , and in , where . Note that every pure state on is made of a ket in , and two kets that are equal up to a global phase provide the same pure state. As the function is nonnegative, the first condition is valid. The second and third are true by the virtue of and , respectively. The last condition is, the TI , already derived above.
Returning to the TIs (114), as , will be a true upper bound on only if it is smaller than or equal to . Hence, we can further improve (114) as
[TABLE]
Taking the right-hand side inequality and applying the cosine functionâthat decreases monotonically on âto both the terms, we get
[TABLE]
Now, considering the Heavisideâs unit step function
[TABLE]
one can rewrite (116) as
[TABLE]
Since the terms on either side of the above inequality are nonnegative, squaring both sides delivers
[TABLE]
Putting (107) and (119) side by side, we accomplish
[TABLE]
Furthermore, due to (95)â(97), (120) becomes
[TABLE]
In essence, we obtain QCs (115) and (121) that are equivalent to each other, one is in terms of the quantum angles and the other is in terms of the probabilities.
Appendix B Compactness and convexity of
The real vector space is also a metric space with the Euclidean distance, and both its subsets and are closed as well as bounded, hence they are compact sets (thanks to the Heine-Borel theorem, see in Rudin76 ). Since a convex combination of probability vectors is again a probability vector, both and are convex subsets of . Moreover, is a convex set because it is a Cartesian product of two such sets.
To prove the convexity of , we consider two combined vectors {\big{(}\vec{p}\,^{\prime},\vec{q}\,^{\prime}\big{)}} and {\big{(}\vec{p}\,^{\prime\prime},\vec{q}\,^{\prime\prime}\big{)}} that belong to . It means that their components follow the constraints (5)â(8) and (15) that is
[TABLE]
for every . For the proof, we need to show that a convex combination
[TABLE]
fulfills all the requirements (5)â(8) and (15)âtherefore, lies in âfor every . Thanks to the convexity of , the combination (126) belongs to and \big{(}\vec{p},\vec{q}\,\big{)} meets all the demands (5)â(8).
Now we demonstrate that the components and of \big{(}\vec{p},\vec{q}\,\big{)} respect inequality (15):
[TABLE]
We have equality (129) due to the convex combination (126), and then we acquire inequality (129) by employing (124) and (125). The next inequality (129) is attributed to the concavity of a real-valued function
[TABLE]
defined on , and the last equality is again because of the combination (126). In conclusion, the combined-probability space is a convex set in . Beside, to recognize that is a concave function, we present the Hessian matrix
[TABLE]
that is a negative semidefinite matrix for every and in the interval . For or or both, , and the Hessian matrix is the zero matrix.
Appendix C Preliminary calculations for the next appendix
With (3), (4), (9), and (10), let us again acknowledge that , and the quantum angles belong to the interval . Now we consider and
[TABLE]
Since the difference between angles , we have . Hence, with (133), one can establish
[TABLE]
and then
[TABLE]
due to the function; note that for . One can also perceive as a TI.
Next we are going to validate a result that is applied in Appendix D.
[TABLE]
Let us designate and by and , respectively, and write
[TABLE]
just like (133). One can show that the sum
[TABLE]
due to and (135). Clearly because , and if [see the requirements in (136)] then we have and . As a net result, , the last term in (137) turns out to be a nonnegative function, and thus we achieve . It completes a proof of (136).
[TABLE]
If and then evidently we have the equality of (139). Now let us prove the converse under the requirements of (136). If then the last term in (137) must vanish, which occursâprovided âwhen the sum in (138) attains its upper bound or . The case arises when and , and happens when and . Both these cases come under âthat is when the sum in (138) reaches its upper boundâwhich materialize if and only if and ; it validates (139).
Similar to (135) we have
[TABLE]
and to (136) plus (139) we have
[TABLE]
Appendix D Extreme points of
In Appendix B, we demonstrate that the combined-probability space is a compact convex set in . According to the Krein-Milman theorem (see Theorem and Appendix A.3 in Niculescu93 ), every point of such a set can be decomposed into a convex combination of its extreme points. In this appendix, starting from an arbitrary interior point of , we move toward its extreme points.
D.1 Interior of
A point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}\in\bm{\omega}} that obeys each of the constraints (6), (8), and (13) with strict inequality,
[TABLE]
is called an interior point of . In certain cases, such as and , there existâno interior pointâonly extreme points, then the following analysis is not needed. However, for , there is always an interior point: with , one can show that the centerâspecified by for all âof is an interior point when .
We begin our journey from a general but fixed interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}} along a straight line, which is the locus of points {\vec{P}=\big{(}p_{1},p_{2},\dot{\vec{p}}_{\mathrm{rest}},\dot{\vec{q}}\,\big{)}\in\mathbb{R}^{2d}}, where obey the linear equation
[TABLE]
and . One can acknowledge that two points on this line differ from each other only in the first two coordinates, hence are the only variables here. In (143), the inequality saturates for and becomes strict due to (142) when .
Since we never want to move outside of the combined space, we only consider those points on the line that lie in . From Sec. II recall that a point of lies in if and only if it meets all the requirements (5)â(8), and if it also satisfies all the TIs (13) only then it belongs to . So a point {\vec{P}=\big{(}p_{1},p_{2},\dot{\vec{p}}_{\mathrm{rest}},\dot{\vec{q}}\,\big{)}} on the line, defined by (143), is contained in if and only if
[TABLE]
With (143) and (144), one can derive
[TABLE]
As per (3) and (4), we can attach angles and with and , correspondingly. If these angles comply with
[TABLE]
only then . Observe that the other demands for to be in â(142) for and (7)âare automatically met, because and are also parts of the interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}\in\bm{\omega}}.
Considering the suprema
[TABLE]
we can convert all the conditions in (146) into two
[TABLE]
Throughout the paper, in the subscripts of angles, capital letters are used to highlight a supremum. A supremum, say , cannot be a negative number: implies for every by the definition (147). Which leads to for each by the relations (3), (4), (9), and (10), and then to the contradiction . Furthermore, if and only if for every . So, both suprema (147) and (148) lie in .
Since the cosine function is monotonically decreasing and nonnegative on , we can translate the constraints (149) as
[TABLE]
and then as
[TABLE]
By the way, inequalities (111) and (107) impose stronger restrictions than (146), (151), and (152). Since follows with Eq. (143), all the restrictions (145), (151), and (152) can be put together as
[TABLE]
One can witness that these bounds on depend on the chosen interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}}. In short, only those that fulfill the requirements (143) and (153) belong to the combined space .
From the interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}}, we can travel on the line in two directions: where increases and where decreases. While moving we pass four points of that are presented in Table 1. When we proceed in the direction where increases, then we reach first either or . It all depends on the minimum value in (153). The point that we reach first belongs to . Whereas the other point, then, fails to satisfy (153), and thus it lies outside of . While moving in the other direction, where decreases, we encounter first either or . Depending on the maximum value in (153) one of will be in, other will be out of, (unless both these points are the same).
All the above possibilities are communicated through Table 2. For any {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}}, only two of these possibilities can and will materialize, thus contains only a duo of (distinct) points from Table 1. In Table 3, we present every such duo. In fact, the interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}} can be expressed as a convex combination
[TABLE]
of points of the one duo that lies in . For each duo, is presented in Table 3.
By varying from 0 to 1 in the combination (154), one can generate the line segment from to . Recall that the line is described by (143). If belong to the combined space, then obviously the whole segment will be in thanks to its convexity. The line segments connecting with (provided ) and connecting with remain outside of . Therefore, these two duos are not listed in Table 3.
In this part, it is shown that every interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}} in can be decomposed as a convex combination of boundary points of , which are decomposed in the next part. Note that the subsequent analysis is for . In the case of , , and Table 1 already carries the extreme points of . In fact, for , we only need and , because contains and if and only if and , respectively.
D.2 Boundary of
The boundary of is made of regions, where a region is characterized by equality in one of the constraints (6), (8), and (13):
[TABLE]
for . A point from Table 1, provided it is in , called a boundary point because it belongs to one of the regions (155)â(157). To reveal that the boundary points of can be decomposed into certain convex combinations, let us suppose that the duo belongs to and analyze first and then . Of course, an identical treatment can be delivered in the case of other duos from Table 3.
Now we start from and travel within the region along a new set of points {\vec{P}=\big{(}0,p_{2},p_{3},\dot{\vec{p}}_{\mathrm{rest}},\dot{\vec{q}}\,\big{)}} by changing according to
[TABLE]
where . Repeating the procedure similar to Appendix D.1, here we have
[TABLE]
which is like (153). The supremum is defined by (148) and
[TABLE]
If and only if respects (159) and follows with (158), then a new .
Analogous to Tables 1â3, here we compose Tables 4â6, in that order. Table 4 holds a collection of four points. Table 5 has the conditions that decide whether a point of Table 4 is in or out of . Table 6 supplies all possible couplesâof points from Table 4âout of which one belongs to , that one is determined by . The line segmentâconnecting the one coupleâcarries and completely occupies in the region .
Now we are going to focus on . Let us proceed from by altering only of another new vector {\vec{P}=\big{(}{\cos(\theta_{1J}-\dot{\beta}_{J})}^{2},p_{2},p_{3},\dot{\vec{p}}_{\mathrm{rest}},\dot{\vec{q}}\,\big{)}} with respect to
[TABLE]
Note that , and (161) identifies a straight line, a segment of which is contained in the region . In addition to (161), if agrees to
[TABLE]
only then the new vector . Like Tables 1 and 4, here we assemble Table 7 of four points using the four bounds in (D.2).
Due to (136) and (139) from Appendix C, we have
[TABLE]
These inequalities are strict because a requirements in (139), , cannot be met since is caused by (142). Now taking (D.2)â(D.2) with , one can deduce that the vectors and of Table 7 can not belong to unless and , respectively. This fact is recorded in Table 8 with some other conditions, together they tell when a point of Table 7 will be in or out of the region .
A duo, out of the four listed in Table 9, resides in and expresses through a convex combination. As Tables 1â3 are linked with the interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}\in\bm{\omega}} and Tables 4â6 are attached to , Tables 7â9 are associated with . Tables 1, 4, and 7 carry the boundary points of , , and , respectively.
D.3 Extreme of
In the above parts, it is demonstrated that every interior point {\big{(}\dot{\vec{p}},\dot{\vec{q}}\,\big{)}\in\bm{\omega}} can be decomposed into a convex combination of the boundary points of , which can further be decomposed into convex combinations of the boundary points of regions (155)â(157). Continuing this decomposition process, we reach at a point {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}}, where
[TABLE]
Since every of (166) is a supremum, [see the explanation below (149)] and due to (142), we deduce that
[TABLE]
The point {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}}, designated by (165)â(169), satisfies and number of equality constraints of type (13) and (6), respectively. If of (167) follows
[TABLE]
then {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}\in\bm{\omega}}, where
[TABLE]
is a supremum like (147), (148), (160), and (166). One can check that points in Table 1 for and in Tables 4 as well as 7âprovided and âfor are like {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}}; remember that due to (5). Furthermore, one can easily recognize in each of these points. Then, one can see through Table 2, 5, and 8 that one of the two inequalities in (171) is required for a point to be in . The other inequality is automatically obeyed due to (142) and the conditions appeared in the earlier decompositions.
If we start our journey from a point {\big{(}\dot{\vec{p}}\,,\dot{\vec{q}}\,\big{)}}, where
[TABLE]
then we will arrive at the point {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}}, where
[TABLE]
[for 0, see (168)]. This point represents an extreme point of and a special case
[TABLE]
of (169) and (167). In the case (175), the supremum that is possible if and only if , means , for every . Indeed, it is so [see (173)]. In all other cases, for every [see the limits (170) on of (166)], and {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}} can be decomposed further by adopting the same procedure as before.
Without loss of generality, let us suppose for the subsequent analysis. Here we begin with {\vec{Q}=\big{(}\mathring{\vec{p}}\,,\dot{q}_{1},q_{2},q_{3},\dot{\vec{q}}_{\mathrm{rest}}\,\big{)}}, where
[TABLE]
and . One can acknowledge that represents all those points, including {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}}, that fall on the straight line characterized by (176).
If stays on the line with , which follows
[TABLE]
then . Here
[TABLE]
are suprema, and the angles are related to the components of through (3) and (4) [see also (165) and (166)]. The constraints (177) look alike (153) and (159). Identical to Tables 1, 4, and 7, we enter a list of four points in Table 10, where the points are drawn from the four bounds on given in (177).
Now, to establish criteria for a point of Table 10 to be in or out of , we are going to address the two cases
[TABLE]
individually [see Eq. (167) for and the range (169) of ]. Let us first take the case (181): whatever the suprema (178) and (179) are, we have
[TABLE]
To demonstrate this, we consider , the cases with can be handled likewise. For , we have (where ) due to (166). If associated with the supremum (178) is 1, then by taking we can validate the strict inequality (182) thanks to (141). If , we can do the same by now considering . In a similar fashion, we can establish the other inequality (183).
We draw the following inferences from inequalities (182) and (183).
[TABLE]
implies that the maximum and the minimum values in (177) are 0 and , respectively. Consequently, the points and of Table 10 never, whereas and always, belong to in the case (181). Moreover, {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}} can be broken into the convex combination , where [see Table 12].
Next, it is not difficult to realize that both and can be decomposed further and further until we arrive at a point \big{(}\mathring{\vec{p}}\,,\mathring{\vec{q}}\,\big{)}, where
[TABLE]
In the decomposition process one will encounter inequalities, such as (182) and (183), that can be tacked like the above. For , a point \big{(}\mathring{\vec{p}}\,,\mathring{\vec{q}}\,\big{)} defined by (165)â(168) and (186) is an extreme point of , because it cannot be written into a convex combination of other points of . Furthermore, \big{(}\mathring{\vec{p}}\,,\mathring{\vec{q}}\,\big{)} is a vector-valued function of since -angles are fixed by (10) once the measurement settings are selected in (1).
Let us now turn to the case (180), where according to (166),
[TABLE]
Since supremum (178) is a nonnegative number, can either be or 1 here. It is due to when and , because then and every . Similarly, related to the supremum (179) can either be or 1 here.
When or or both, we encounter situation similar to the case (181): When thenâdue to (141)âwe have
[TABLE]
One can perceive that (189) and (190) are analogues to (182) and (184), respectively. The inequalities in (190) suggest that is the minimum value in (177). Therefore, without exception lies in , if then . Identically, for , always , and belongs to only when it is .
When and only then and can be in without being equal to and , respectively [see Table 11]. With Table 11, for the case (180), one can find out whether or not a duplet of points from Table 10 lies in . All such duplets are gathered in Table 12, which reveals that the point {\big{(}\mathring{\vec{p}}\,,\dot{\vec{q}}\,\big{)}} can be split into a convex combination. As before, we can break the points of Table 10 further and further until we reach extreme points of .
In the case (180), the decomposition process leads to
[TABLE]
If of (193) obeys
[TABLE]
then the point {\big{(}\mathring{\vec{p}}\,,\mathring{\vec{q}}\,\big{)}} stated by (188) and (191) belongs to . It is an extreme point of in the case (180). One can also realize that both there and are functions of by noticing in (192) with . In fact, the extreme point identified by (174) and (173) in the case (175) can also be represented with these and of (188) and (191) by taking , which make it as an endpoint of the parametric curve {\big{(}\mathring{\vec{p}}{\scriptstyle(\mathring{\alpha}_{1})}\,,\mathring{\vec{q}}{\scriptstyle(\mathring{\alpha}_{1})}\,\big{)}}. In conclusion, we realize the structure of extreme points of :
[TABLE]
D.4 Limits on
We start with the -parametric curve {\big{(}\vec{p}{\scriptstyle(\beta_{1})}\,,\vec{q}{\scriptstyle(\beta_{1})}\,\big{)}} identified by (16)â(21). According to (197), a part of the curve that lies in represents its extreme points. This part is specified by the upper and lower limits of . To compute these limits, here, we only need to consider
[TABLE]
When and then , and when and , then . So one can easily perceive that the points {\big{(}\vec{p}{\scriptstyle(\beta_{1})}\,,\vec{q}{\scriptstyle(\beta_{1})}\,\big{)}} fulfill rest of the requirements (13) as well as (5)â(8) to be in .
For in (199) or in (200), the TI is always obeyed: due to
[TABLE]
With (140), (16), and (135) one can sequentially go through the steps (201)â(203), and the left-hand side inequality in (204) is a consequence of . Since and obey , they certainly follow the TI as every .
If we decrease then decreases, and reaches its lower limit when the inequality (200), for , gets saturated. It means that is a solution of the equation and thus of
[TABLE]
[by (16) and (19)]. If we increase then and decrease, and attains its upper limit as soon as one of the inequalities (198) and (199) gets saturated. Using (16), (19), and [owing to (135)], these inequalities can be expressed as
[TABLE]
Now we need to investigate the two cases, and listed in (197), separately for .
In the case , (206) clearly holds, and the upper limit
[TABLE]
is obtained when (207) is saturated. Corresponding to of (208), we have
[TABLE]
which is a root of the equation
[TABLE]
In the case , when we increase then the inequality (206), rather than (207), gets saturated first. Hence, is now a solution of
[TABLE]
One can justify these statements by proving
[TABLE]
where . As is a root of Eq. (211), is a root of
[TABLE]
Equations (205), (211), and (213) are of the form
[TABLE]
where m anglesâthe m-set âare taken from the first column of matrix [given in (11)]. Always, we must choose the root of Eq. (214) that respects for every . Furthermore, as we add more angles from the first column to the m-set, the number of nonnegative terms increases on the left-hand side of Eq. (214). Then of smaller value will satisfy Eq. (214). So, by comparing Eqs. (211) and (213) in this way, we can certify the left-hand side inequality in (212). Whereas, after a simplification, the right-hand side inequality turns into , which is true as every .
[TABLE]
In fact, Eq. (210)âwhere two angles are taken from the first column of âis also like Eq. (214). Basically, one needs to solve equation such as (214)âwhere angles are picked from a row or a column of âto get a limit and then an endpoint of an -parametric curve. When then m can only be 2 [see (205) and (210)]. And, when then m can either be or [see (211) and (205)].
To solve Eq. (214) for , we transform it into
[TABLE]
Calling by the relations (3) and (4), we can write Eq. (216) as
[TABLE]
The two roots of Eq. (220) are
[TABLE]
which only depend on the m-set associated with Eq. (214).
We pick the root (221) with + sign due to the following reasons. First, for , we have equation such as (213), and its root âgiven in (212)âcorresponds to the + sign solution [see also (209) with (210)]. Second, for , is the only permissible solution of Eq. (214). It is because angles are not random real numbers, they follow . When , [see (217) and (219)], and always the solution (221) with + sign offers . Third reason, for a pair of MUBs Durt10 , where every is the same , one can directly solve Eq. (214). For every m-set, we get the same [see in (56)], which corresponds to
[TABLE]
that is clearly the root (221) with + sign.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) W. Heisenberg, Z. Phys. 43 , 172 (1927); English translation in Wheeler 83 .
- 2(2) J. A. Wheeler and W. H. Zurek, eds., Quantum Theory and Measurement (Princeton University Press, Princeton, New Jersey, 1983), pp. 62â84.
- 3(3) H. Weyl, The Theory of Groups and Quantum Mechanics , English translated by H. P. Robertson (E.P. Dutton, New York, 1932), Chapter 2, Section 7 and Appendix 1.
- 4(4) P. Busch, T. Heinonen, and P. Lahti, Phys. Rep. 452 , 155 (2007).
- 5(5) H. P. Robertson, Phys. Rev. 34 , 163 (1929).
- 6(6) D. Deutsch, Phys. Rev. Lett. 50 , 631 (1983).
- 7(7) K. Kraus, Phys. Rev. D 35 , 3070 (1987).
- 8(8) H. Maassen and J. B. M. Uffink, Phys. Rev. Lett. 60 , 1103 (1988).
