Zero uncertainty states in the presence of quantum memory

The uncertainty principle imposes a fundamental limit on predicting the measurement outcomes of incompatible observables even if complete classical information of the system state is known. The situation is different if one can build a quantum memory entangled with the system. Zero uncertainty states (in contrast with minimum uncertainty states) are peculiar quantum states that can eliminate uncertainties of incompatible von Neumann observables once assisted by suitable measurements on the memory. Here we determine all zero uncertainty states of any given set of nondegenerate observables and determine the minimum entanglement required. It turns out all zero uncertainty states are maximally entangled in a generic case, and vice versa, even if these observables are only weakly incompatible. Our work establishes a simple and precise connection between zero uncertainty and maximum entanglement, which is of interest to foundational studies and practical applications, including quantum certification and verification.


INTRODUCTION
The uncertainty principle represents a key distinction between quantum mechanics and classical mechanics and is still a focus of current research [1][2][3][4] . It imposes a fundamental limit on our ability to predict the measurement outcomes of incompatible observables, such as position and momentum 5,6 . However, uncertainty relations have to be modified in the presence of a quantum memory because entanglement between the memory and system can reduce the uncertainty [7][8][9][10][11][12] . Besides foundational significance, this simple fact is of interest to diverse applications, including entanglement detection [8][9][10] and quantum cryptography 8,11,13 . Nevertheless, several fundamental questions are still left open. Notably, what quantum states of the system and memory can minimize or even eliminate the uncertainty completely? How much entanglement is required to achieve this goal?
In this paper we are interested in those quantum states that can eliminate the uncertainty completely, which are referred to as zero uncertainty states (ZUSs) henceforth. In contrast with the familiar minimum uncertainty states and intelligent states studied in the literature [14][15][16] , our definition of ZUSs does not rely on a specific uncertainty measure, but has a clear operational interpretation. In particular, we determine all ZUSs with respect to any given set of nondegenerate observables on a finite-dimensional Hilbert space coupled with a quantum memory. We also determine the minimum entanglement required to construct any ZUS. It turns out all ZUSs are determined by a simple graph constructed from transition probabilities between eigenbases of the relevant observables. Moreover, all ZUSs are maximally entangled states (MESs), and vice versa, whenever this graph is connected. Notably, this is the case for a generic set of two or more observables, even if these observables are only weakly incompatible. Nevertheless, ZUSs and MESs are not necessarily pure states.
Our study establishes a simple and precise connection between zero uncertainty and maximum entanglement, which is independent of specific uncertainty and entanglement measures. Moreover, our approach applies to arbitrary sets of nondegenerate observables, in sharp contrast with most previous approaches, which are restricted to two observables or complementary observables. This work may shed light on the foundational studies of uncertainty relations, quantum entanglement, and quantum steering 7,[17][18][19][20] . Meanwhile, it is of direct interest to many tasks in quantum information processing, including remote state preparation 21,22 and semi-device-independent quantum certification and verification 18,[23][24][25][26] .  27 . This definition is independent of any specific entanglement measure and is thus quite appealing to the current study.

Maximally entangled states
are the computational bases of H A and H B , respectively. A MES is not necessarily pure, as clarified in the following lemma, essentially proved in ref. 28   Here H(A|B) ρ = S(ρ) − S(ρ B ) is the conditional entropy of A given B, where S(ρ) and S(ρ B ) are the von Neumann entropies of ρ and ρ B :¼ tr A ðρÞ, respectively. E R (ρ) and E F (ρ) are the relative entropy of entanglement and entanglement of formation 27

Zero uncertainty states
Consider the uncertainty game in which Alice can measure m nondegenerate von Neumann observables O ¼ fO x g m x¼1 on H A with uniform probabilities (generalization to nonuniform probabilities is straightforward), and Bob is asked to predict the measurement outcome given the specific observable chosen by Alice 8 . Let B x ¼ f ψ xk j ig k be an orthonormal eigenbasis of O x and B ¼ fB x g m x¼1 . Then predicting the outcome of O x amounts to predicting the outcome of the projective measurement on the basis B x . When these observables are incompatible (do not commute with each other), in general Bob cannot predict the measurement outcome with certainty even if he knows the complete classical description of the system state as characterized by the density matrix ρ A . In the case of two observables for example, the uncertainties of the measurement outcomes satisfy the Maassen-Uffink inequality 29 , where H(O 1 ) and H(O 2 ) are the Shannon entropies of the measurement outcomes of O 1 and O 2 , respectively, and c ¼ max j;k j ψ 1j jψ 2k j 2 . The situation is different if Bob holds a quantum memory with Hilbert space H B and can create an entangled state ρ on the joint system H A H B , as illustrated in Fig. 1. Suppose Alice chooses the basis B x (observable O x ), then Bob can perform a generalized measurement characterized by a positive operator-valued measure (POVM) fΠ xk g k on his subsystem H B , where Π xk corresponds to guessing the outcome k given the measurement basis B x of Alice. The average success guessing probability reads ∑ x p x /m with where ρ xk ¼ ψ xk h jρ ψ xk j i are subnormalized reduced states of Bob. Note that p x is also the probability that the POVM fΠ xk g k can successfully distinguish the ensemble of states The maximum of the average guessing probability over all POVMs can be determined by semidefinite programming, and this maximum is determined by the state ρ and the basis set B (or the observable set O) of Alice. Given a set of observables for Alice, a joint state ρ of Alice and Bob is a ZUS if Bob can predict the measurement outcome of Alice with certainty by a suitable measurement depending on the choice of Alice. Given a ZUS, the guessing probability p x for each measurement of Alice can attain the maximum 1, and the conditional entropy H(O x |B) is 0.
In contrast with minimum uncertainty states and intelligent states [14][15][16] , ZUSs not only minimize the uncertainty, but also eliminate the uncertainty completely. Moreover, here the definition is independent of any specific uncertainty measure.
To appreciate the significance of entanglement to constructing a ZUS, consider an example with two observables, in which case the uncertainty relation in Eq. (1) is modified as follows 8 , HðO 1 jBÞ þ HðO 2 jBÞ ! log 2 ðc À1 Þ þ HðAjBÞ ρ : Here the conditional entropy H(A|B) ρ manifests the impact of entanglement in reducing the uncertainty. Interestingly, a variant of Eq. (4) may be interpreted as uncertainty-reality complementarity, which builds on an intimate connection between uncertainty (or rather certainty) and reality 7,30-32 . By Eq. (4), any ZUS ρ must satisfy the inequalities where the second one is derived in ref. 33 which implies that d B ≥ d A and ρ is a MES by Lemma 1, in which case ρ is indeed a ZUS. Unfortunately, this reasoning does not work in general. To address this problem, we need a completely different line of thinking. Fig. 1 Connection between zero uncertainty and maximum entanglement in the uncertainty game. By performing suitable measurements (depending on the observables of Alice) on his quantum memory, Bob can better predict the measurement outcomes of Alice. When the set of observables of Alice is irreducible, Bob can predict these measurement outcomes with certainty iff his quantum memory is maximally entangled with Alice.

Key observations about ZUSs
Bob can predict the measurement outcome on the basis B x with certainty iff the ensemble Sðρ; The following three propositions are simple corollaries of these observations. Proposition 1 Suppose ρ is a ZUS, then any state supported in the support of ρ is a ZUS.
Proposition 2 Suppose ρ 1 and ρ 2 are two ZUSs on H A H B . If tr A ðρ 1 Þ and tr A ðρ 2 Þ have orthogonal supports, then any convex mixture of ρ 1 and ρ 2 is a ZUS.
Proposition 3 Suppose ρ is bipartite state on H A H B and Λ is a completely positive and trace-preserving (CPTP) map (quantum channel) from system B to systemB. Then ρ is a ZUS if (1 Λ)(ρ) is.
Here Propositions 1 and 2 are tied to the fact that mixture of quantum states can only reduce distinguishability unless the reduced states of Bob have orthogonal supports. Proposition 3 follows from the simple fact that quantum operations cannot enhance distinguishability. Two states ρ 1 and ρ 2 on H A H B are equivalent if they can be turned into each other by local operations on H B . In that case, ρ 1 is a ZUS with respect to B iff ρ 2 is. Under these local operations, ZUSs divide into equivalent classes.

Transition graphs
To determine ZUSs with respect to a given basis set in H A , we first need to pinpoint a key property of the basis set. The transition graph GðBÞ of B is an m-partite graph with md A vertices which are in one-to-one correspondence with the basis states (identical states in different bases correspond to different vertices). Two different vertices are adjacent iff the corresponding states are not orthogonal, that is, the transition probability between the two states is nonzero. The graph GðBÞ encodes the incompatibility structure of the basis set B, which is crucial to studying ZUSs and quantum verification, as we shall see later.
The basis set B is irreducible if the transition graph GðBÞ is connected, in which case the projectors onto basis states generate the whole operator algebra on H A . Any basis set composed of m ≥ 2 mutually unbiased bases (or generic random bases) is irreducible since the transition graph is a complete m-partite graph, as illustrated in Fig. 2.
The basis set B is reducible if the transition graph GðBÞ is not connected. In this case, the basis set may be seen as a direct sum of basis sets defined on smaller subspaces. Suppose GðBÞ has g connected components G 1 , G 2 , …, G g , then each component G a is also an m-partite graph in which all parties have the same number of vertices. Let B a x be the subset of B x that corresponds to the vertices in the component G a . The component subspaceH A;a associated with component a is the subspace of H A spanned by all ψ j i 2 B a x , with component projector and component rank given by These definitions are independent of the choice of the basis index x. Denote by PðBÞ :¼ fP a ðBÞg g a¼1 the set of component projectors, which are mutually orthogonal. In this way, H A decomposes into a direct sum of component subspaces H A;a . In addition, B a x for x = 1, 2, …, m can be regarded as bases in H A;a , and the basis set

Connect ZUSs with MESs
Now we are ready to present our main results on ZUSs and MESs as illustrated in Fig. 1. First, we clarify when Bob can predict the outcome of one projective measurement of Alice. The following lemma proved in the Supplementary Information is a stepping stone to understanding ZUSs in the presence of a quantum memory. Note that Bob can predict the measurement outcome of Alice on the basis B with certainty iff the ensemble Sðρ; BÞ defined in Eq. (3) is perfectly distinguishable. By Lemma 2, this is the case iff ρ A is diagonal with respect to the basis B. Therefore, the pure state ρ is a ZUS with respect to a basis set B iff ρ A is diagonal with respect to each basis in B. When B is irreducible, it turns out only MESs can satisfy this condition. Based on this observation we can derive the following theorem as proved in the Supplementary Information.
Theorem 1 Suppose B is an irreducible basis set in H A . Then a bipartite (pure or mixed) state ρ on H A H B is a ZUS with respect to B iff d B ≥ d A and ρ is a MES.
By Theorem 1 and Lemma 1, each ZUS with respect to B is a tensor product of a pure MES and an ancillary state. In addition, to attain zero uncertainty, the measurements of Bob on the support of ρ B are uniquely determined by the counterpart of Alice, as shown in Supplementary note E. All ZUSs with respect to B can be turned into each other by local operations on H B and thus form a single equivalent class. If d A ≤ d B < 2d A , then all ZUSs are pure and can be turned into each other by unitary transformations on H B . These results hold as long as the transition graph GðBÞ is connected, even if B consists of only two nearly identical bases, so that the corresponding observables are only weakly incompatible, as quantified by the commutator or incompatibility robustness [36][37][38] .
Theorem 1 establishes a simple and precise connection between zero uncertainty and maximum entanglement, which is independent of specific uncertainty and entanglement measures. This connection offers a fresh perspective for understanding the uncertainty principle in the presence of a quantum memory 8 . It may also shed light on uncertainty-reality complementarity given the close relation between the notation of uncertainty and that of reality 7,30-32 . Fig. 2 Transition graph of three mutually unbiased bases for a qubit, which corresponds to the eigenbases of the three Pauli matrices. Two vertices of the same color are associated with the two states in the same basis. This transition graph is connected, so the corresponding basis set is irreducible.
ZUSs with respect to reducible basis sets Next, we determine ZUSs with respect to a reducible basis set B.
Theorem 2 Suppose B is a set of orthonormal bases in H A and has g irreducible components with component subspaces H A;a , component projectors P a , and component ranks r a for a = 1, 2, …, g. Let ρ be a bipartite state on H A H B and ρ a ¼ ðP a 1 B ÞρðP a 1 B Þ. Then ρ is a ZUS with respect to B iff the following three conditions hold: r a ≤ d B whenever tr ðρ a Þ>0; each ρ a with tr ðρ a Þ>0 is a (subnormalized) MES on H A;a H B ; all tr A ðρ a Þ have mutually orthogonal supports.
Theorem 2 follows from Theorem 1. Recall that the basis set B can be regarded as a direct sum of irreducible basis sets B a defined on component subspaces H A;a . So ρ is a ZUS with respect to B iff its restriction ρ a on H A;a H B is a ZUS with respect to B a and, in addition, all tr A ðρ a Þ have mutually orthogonal supports. Note that coherence between different component subspaces are useless to constructing ZUSs. In addition, the dimension d B of H B must satisfy d B ! r min in order to construct a ZUS, where r min ¼ min 1 a g r a is the minimum component rank. When the lower bound is saturated, every ZUS is a pure MES on H A;a H B , where H A;a is a component subspace of dimension r min . Furthermore, r min determines the minimum entanglement required to construct a ZUS, as shown in the Methods section.
In the case of pure states, ZUSs admit a much simpler characterization, as shown in the following corollary.
Corollary 2 A bipartite pure state Ψ j i in H A H B is a ZUS with respect to B iff the reduced state ρ A is a weighted sum of component projectors in PðBÞ.
Corollary 2 is a special case of Theorem 2 and also follows from Lemma 2 and Supplementary Lemma 2. Here ρ A is a weighted sum of component projectors iff ρ A is diagonal with respect to each basis B in B (cf. Supplementary note C). As an implication of Corollary 2, the reduced state ρ A of any (pure or mixed) ZUS ρ with respect to B is a weighted sum of component projectors in PðBÞ, given that any ZUS is a convex mixture of pure ZUSs. The equivalent classes of pure ZUSs are determined in the Methods section.

Applications to quantum certification and verification
Our results on ZUSs have immediate implications for the verification of MESs. Suppose Alice and Bob want to create the MES Φ j i ¼ P dAÀ1 j¼0 jj j i= ffiffiffiffiffi d A p in this way: Bob first creates a MES in his lab and then sends one particle of the entangled pair to Alice via a quantum channel. To verify the resulting state ρ, they can perform tests based on correlated local projective measurements such that only the target state can pass all tests with certainty [39][40][41][42][43] . Suppose Alice can perform projective measurements from the set B ¼ fB x g m x¼1 in which B x is chosen with probability μ x > 0. For each choice B x , she asks Bob to perform the measurement on the conjugate basis B Ã x and return the outcome. The test is passed if Bob and Alice obtain the same outcome 41 .
If Bob is honest, then the average probability that ρ passes each test is tr ðρΩÞ, where Ω ¼ P m x¼1 μ x PðB x Þ 41 is known as the verification operator and is a test projector. Note that Φ j i is an eigenstate of PðB x Þ and Ω with eigenvalue 1 and so can pass each test with certainty. In addition, Φ j i can be reliably verified by this protocol iff the maximum eigenvalue of Ω is nondegenerate, that is, the pass eigenspace of Ω has dimension 1 [40][41][42][43] . This is the case iff the basis set B is irreducible by the following theorem proved in the Supplementary Information. Theorem 3 Suppose B ¼ fB x g m x¼1 is a set of orthonormal bases in H A , and Ω ¼ P m x¼1 μ x PðB x Þ with μ x > 0 and P m x¼1 μ x ¼ 1. Then the degeneracy of the maximum eigenvalue 1 of Ω equals the number of connected components of the transition graph GðBÞ. This eigenvalue is nondegenerate iff the basis set B is irreducible.
Next, suppose Bob is not honest. Then Alice cannot distinguish states that are equivalent under the local operations of Bob. Nevertheless, she can still verify the MES Φ j i up to equivalence. Thanks to Theorem 1, the uncertainty game described before actually provides a verification protocol whenever the basis set B of Alice is irreducible. Note that Bob can pass each test (guess each measurement outcome) of Alice with certainty only if the state ρ prepared is a MES. Surprisingly, the requirement on the measurement bases of Alice remains the same when Bob becomes dishonest. In addition, the measurements of Bob required to attain the maximum guessing probability are essentially uniquely determined by the counterpart of Alice. These results are of interest to semi-device-independent quantum certification and verification 18,[23][24][25][26] Implications for quantum steering Our study also has implications for Einstein-Podolsky-Rosen steering or quantum steering 7,17-20 , which is clear if we interchange the measurement order in the above verification protocol. In each test Alice asks Bob to perform the measurement on the basis B Ã x with probability μ x > 0 for x = 1, 2, …, m and return the outcome. Then Alice performs the projective measurement on B x 2 B, and the test is passed if she obtains the same outcome as Bob. Alternatively, Alice can choose the two-outcome POVM f ψ xk j i ψ xk h j; 1 A À ψ xk j i ψ xk h jg if Bob obtains outcome k. Suppose Alice and Bob share the state ρ and Bob performs the POVM fΠ xk g k instead of the projective measurement on B Ã x . Then the probability that Bob passes the test reads X which is a variant of Eq. (2). The subnormalized states σ xk satisfy the normalization condition ∑ k σ xk = ρ A and form an ensemble of ρ A for each x. The collection of ensembles ffσ xk g k g x is known as an assemblage 19,20,44 . If Bob is honest, then the assemblage generated is ff ψ xk j i ψ xk h j=d A g k g x . When B is irreducible, it turns out only this assemblage can pass each test with certainty, as shown in the following lemma and proved in the Supplementary Information. Lemma 3 Suppose B ¼ fB x g m x¼1 with B x ¼ f ψ xk j ig k is an irreducible set of orthonormal bases in H A . Suppose ffσ xk g k g x is an assemblage for ρ A that satisfies P k ψ xk h jσ xk ψ xk j i ¼ 1 for each x. Then ρ A is completely mixed, and σ xk ¼ ψ xk j i ψ xk h j=d A for each x and k.
Here the condition P k ψ xk h jσ xk ψ xk j i ¼ 1 means the assemblage ffσ xk g k g x can pass each test of Alice with certainty. By virtue of Theorem 1, we can further show that the assemblage ff ψ xk j i ψ xk h j=d A g k g x can only be generated by a MES, as stated in the following theorem and proved in the Supplementary Information.
Theorem 4 Given the basis set B in Lemma 3, suppose ρ is a bipartite state on H A H B that can generate the assemblage ff ψ xk j i ψ xk h j=d A g k g x under the measurements of Bob. Then d B ≥ d A , and ρ is a MES and a ZUS with respect to B.
Thanks to Lemma 3 and Theorem 4, the tests of Alice can verify the assemblage ff ψ xk j i ψ xk h j=d A g k g x , which in turn can verify the MES whenever B is irreducible. In addition, Theorem 4 offers a general recipe for constructing assemblages that are characteristic of MESs. These results establish intimate connections between uncertainty relations, quantum entanglement, and quantum steering, which are of intrinsic interest to foundational studies. Meanwhile, these results are instructive to studying remote state preparation 21,22 and semi-device-independent self testing 18,[23][24][25][26] .

DISCUSSION
ZUSs in the presence of a quantum memory are particular quantum states that can eliminate uncertainties of incompatible von Neumann observables once assisted by suitable measurements on the memory. In this work, we determined all ZUSs with respect to any given set of nondegenerate observables in the presence of a quantum memory. To achieve this goal we introduced several useful tools that apply to an arbitrary set of observables, in sharp contrast with most previous approaches, which only apply to two observables or complementary observables. In addition, we determined the minimum entanglement required to construct a ZUS. Our study shows that all ZUSs are MESs for a generic set of two or more observables even if these observables are only weakly incompatible. In this way, we establish a simple and precise connection between ZUSs and MESs. This connection may shed light on the uncertainty principle in the presence of a quantum memory. It is of intrinsic interest to studying a number of fascinating topics, including the uncertainty principle, quantum entanglement, and quantum steering. Moreover, it has direct applications in semi-device-independent quantum certification and verification, which is currently an active research field.

ZUSs with least entanglement
Here we determine the minimum entanglement required to construct a ZUS, following the premises and notations in Theorem 2.
Given the basis set B in Theorem 2, define Λ B as the CPTP map acting on quantum states on H A H B that removes coherence between different component subspaces, that is, where ρ a = (P a ⊗ 1 B )ρ(P a ⊗ 1 B ) and P a are component projectors defined in Eq. (7). Note that the map Λ B can be realized by LOCC. In addition, ρ is a ZUS with respect to B iff ρ B :¼ Λ B ðρÞ is. When ρ is a ZUS, ρ B is a direct sum of subnormalized MESs ρ a according to Theorem 2.
The component vector is defined as qðρ; BÞ :¼ ðq a Þ a ; q a :¼ tr ½ρðP a 1 B Þ ¼ tr ðρ a Þ; (11) it is invariant under the local operations of Bob and is very useful to studying the entanglement properties and equivalent classes of ZUSs. Note that ρ B and ρ share the same component vector.
where Φðr a Þ j iis a MES of Schmidt rank r a . The second inequality in Eq. (12) is saturated if E is a convex entanglement measure.
Here r a ¼ tr ðP a Þ is the component rank defined in Eq. (7), and r min ¼ min 1 a g r a is the minimum component rank. Theorem 5 applies to any entanglement measure E that is monotonic under selective and nonselective LOCC. In addition, the lower bounds for E(ρ) only depend on the values of the measure E at pure MESs.
When ρ B ≠ ρ, the inequality EðρÞ ! Eðρ B Þ in Eq. (12) is strict for many entanglement measures, including the entanglement of formation, as shown in Corollary 5 below. To determine least entangled ZUSs, we can assume the condition ρ ¼ ρ B , so ρ has no coherence between different component subspaces. Such a ZUS is called economical. In addition, the third inequality in Eq. (12) is usually strict unless q a = 0 when r a > r min (cf. Corollary 6 below). An economical ZUS ρ with q a = 0 for all r a > r min is called a ZUS with least entanglement (ZUSLE) since it can saturate the ultimate lower bound in Eq. (12) for every convex entanglement measure. Such a state can be expressed as follows, Corollary 5 Any ZUS ρ with component vector qðρ; BÞ ¼ ðq a Þ a satisfies E F ðρÞ ! P a q a log 2 r a . The lower bound is saturated iff ρ ¼ ρ B . Corollary 6 Any ZUS ρ with respect to B satisfies E F ðρÞ ! log 2 r min , which is saturated iff ρ is a ZUSLE.
Corollary 5 is proved in the Supplementary Information. Corollary 6 follows from Corollary 5 (cf. Theorem 5). When B is irreducible, the bound E F ðρÞ ! P a q a log 2 r a reduces to E F ðρÞ ! log 2 d A , which is expected in view of Theorem 1 and Lemma 1. In general, the lower bound may be seen as a weighted average of bounds associated with individual irreducible components of B. Incidentally, the bounds in Corollaries 5 and 6 still hold if E F is replaced by any entanglement measure that coincides with E F on pure states, such as the relative entropy of entanglement 27 .

Equivalent classes of ZUSs
Here we clarify the equivalent classes of ZUSs under the local operations of Bob. Suppose ρ is a ZUS with respect to B and has a component vector qðρ; BÞ ¼ ðq a Þ a . According to Corollary 2, (cf. Theorem 2, Lemma 1, and Corollary 1), ρ A is a weighted sum of component projectors, Two ZUSs have the same reduced state and thus same measurement statistics for Alice iff they have the same component vector. So the equivalent classes of pure ZUSs are completely characterized by component vectors. Corollary 7 Two pure ZUSs with respect to B are equivalent iff they have the same component vector.
Given a ZUS ρ with respect to the basis set B, denote by H B;a the support of tr A ðρ a Þ and Q a the corresponding projector; then Q a and Q b are orthogonal whenever a ≠ b by Theorem 2. In addition, we have So ρ can be turned into ρ B by local operations of Bob. Thanks to Corollary 1, ρ B can further be turned into a direct sum of pure MESs of the form L a q a Φ a j i Φ a h j, where Φ a j i is a normalized MES in H A;a H B;a (a product state when r a = 1). These observations lead to the following corollary, which complements Corollary 7.
Corollary 8 Every ZUS on H A H B with respect to B can be turned into an economical ZUS with the same component vector by local operations of Bob. Two economical ZUSs are equivalent iff they have the same component vector.
Thanks to Corollary 8, equivalent classes of economical ZUSs with respect to B are in one-to-one correspondence with component vectors, which form a probability simplex of dimension g − 1, where g is the number of irreducible components of B. In particular, two ZUSLEs are equivalent iff they have the same component vector. If there is only one component subspace of dimension r min , then all ZUSLEs are equivalent.

DATA AVAILABILITY
No data set was generated or analyzed in the current study.

CODE AVAILABILITY
No code was generated or analyzed in the current study.