Adaptive State Fidelity Estimation for Higher Dimensional Bipartite Entanglement

An adaptive method for quantum state fidelity estimation in bipartite higher dimensional systems is established. This method employs state verifier operators which are constructed by local POVM operators and adapted to the measurement statistics in the computational basis. Employing this method, the state verifier operators that stabilize Bell-type entangled states are constructed explicitly. Together with an error operator in the computational basis, one can estimate the lower and upper bounds on the state fidelity for Bell-type entangled states in few measurement configurations. These bounds can be tighter than the fidelity bounds derived in [Bavaresco et al., Nature Physics (2018), 14, 1032–1037], if one constructs more than one local POVM measurements additional to the measurement in the computational basis.


Introduction
Entanglement is the key resource in quantum information processing that brings advantages over its classical counterparts. In many quantum information tasks, higher dimensional entanglement in qudit systems can fortify the power of quantum information processing over its applications in qubit systems, e.g., in QKD [1,2], quantum computation [3], etc. In practice, higher dimensional entangled states created in an entanglement generation process are always subjected to errors. To qualify an entanglement generation process, one will need to extract some information on the created states by measurements.
Employing quantum state tomography (QST), one can obtain the complete information of a quantum state [4][5][6][7][8][9][10][11][12][13][14]. Although higher dimensional pure states can be determined using just five measurement settings [15], the number of measurement configurations that are required in QST of a general d-dimensional quantum state scales badly with the dimension d. For the qualification of a state generation process, instead of full QST, one may just need to employ quantum state fidelity estimation (QSFE) to reveal partial information about the most relevant Pauli operator components that signify the target state [16][17][18]. One can even ease the measurement complexity, if one just estimates the lower and upper bounds instead of the exact value of the state fidelity. Such an approach is employed in [19] for the detection of entanglement dimensionality in a higher-dimensional entanglement generation process.
Another method for characterizing a quantum state resource called quantum state verification (QSV) is proposed in [20]. In QSV, one tests a quantum state resource under eventual malicious attacks or errors by a quantum state verifier, which is also called a "strategy". One takes N samples from the inputs of the quantum state resource and verifies the samples by randomly selected local measurement setups assisted with classical communications. This method is generalized for noisy quantum state resources [21] and general adversary scenarios [22,23] with slightly different problem settings. It is shown that the state verifier in QSV can also be exploited for state fidelity estimation, if one continuously tests all the N samples even when the testing fails [23]. The frequency of passing a test in the N samples will then determine a lower and an upper bound on the state fidelity with certain confidence levels.
Since lower bounds on quantum state fidelity can be employed to detect the entanglement dimensionality of a bipartite state [19], a tighter lower bound on quantum state fidelity means better robustness of the entanglement detection against noises in a system. In both QSFE and QSV, for each copy of a testing state, one randomly chooses a measurement setting from a set of predefined measurement configurations to obtain the statistics regardless of the particular noises in an individual entanglement generation. The bounds on state fidelity obtained in such predefined measurement configurations are in general not optimum under these particular noises. In practice, the feasibility and efficiency of different local measurement configurations differ from each other. Some measurement configurations, e.g., measurements in the computational basis, are much easier and more efficient to implement than the other configurations, e.g., POVM measurements in a non-computational basis. Instead of randomly choosing a measurement setting from predefined measurement configurations for each copy of a testing state, it is possible to efficiently obtain the information of diagonal elements of a quantum state density matrix in the computational basis prior to the other measurement settings. This information contains some partial information about the noises in a generation process of a bipartite quantum state. One can therefore exploit this information to tailor the subsequential measurement settings for the particular noises of the testing system to refine the state fidelity estimation, which would be important for entanglement detection subject to noises.
In this paper, we will employ the state verifiers, which are introduced in QSV, to derive the lower and upper bounds on state fidelity of bipartite qudit states for the purpose of QSFE. We will show in Lemma 2 that measurement statistics in the computational basis can be exploited to refine the bounds on quantum state fidelity derived from state verifiers. Since these refined bounds depend both on the measurement statistics in the computational basis P e and the configurations of subsequential measurements M, one can adapt the subsequential measurement configurations M for tighter bounds on state fidelity subject to the a priori statistics P e . Following this idea, we will derive an adaptive state fidelity estimation approach for bipartite Bell-type states in Theorem 1. We will compare our approach with the one derived in [19] and demonstrate it under different types of noises.

Quantum State Fidelity Estimation Employing State Verifiers
In a quantum information processing employing a pure state |ψ in a bipartite d-dimensional system H d , the very first task is to create bipartite quantum states as close as possible to the target state |ψ . To evaluate how good a state preparation is, one can estimate the |ψ -state fidelity F ψ of the generated states ρ in local measurements, where the state fidelity F ψ is defined as In this section, we review the strategy operators employed in QSV [20][21][22][23][24], and their application in QSFE. In QSFE, one evaluates expectation values of certain observables from the whole measurement outputs instead of testing each input by each output of measurements according to a "strategy"; we therefore refer to the "strategy" in QSV as "state verifier operators" in the context of QSFE in this paper.
In the measurement of the computational basis {|e k A , e k B } k A ,k B , one can verify the testing state ρ by the characteristic correlations of the target state |ψ . The probability of the outputs satisfying the target characteristic correlations is determined to the expectation value of the following |ψ -state stabilizer: We call a stabilizer of the target state |ψ a |ψ -state verifier. If the measurement in the Schmidt basis of |ψ is feasible and efficient in a laboratory, it is preferable to choose the Schmidt basis as the computational basis, since the state verifier V e constructed in the Schmidt basis has the least rank, which means that V e can detect the |ψ -orthogonal part of a testing state ρ more efficiently.
To estimate the quantum state fidelity, a single state verifier in the computational basis is not enough, since |ψ is not the only one state that is stabilized by V e . To construct a state verifier that stabilizes only the target state |ψ , one needs to include the state verifiers in the other measurement basis. Let M a set of measurement configurations additional to the computational basis Note that, for projective measurements with orthogonal basis states, there is no need to add the factor 1/d in Equation (4). However, for consistency of formulation, we adopt the representation in Equation (4) for projective measurements. In each measurement configuration M j , one can construct a state verifier operator V j by adding up its corresponding measurement operators Proof. see Methods.
A good measurement configuration M should have nonzero v m A m B in its state verifier V j as few as possible, which leads to the minimum rank of V j and better detection efficiency of |ψ -orthogonal states. For this reason, POVM measurements are preferable for most bipartite states in general. For example, for the general Bell-type states that will be studied in Section 2.3, the POVM measurements that are associated with the generalized Heisenberg-Weyl operators defined in Equation (24) Together with the state verifier V e in the computational basis, one can then construct a |ψ -state verifier operator, which only stabilizes the target state |ψ , Since the |ψ -state verifier V ψ is a Hermitian stabilizer of |ψ by definition, the |ψ -state verifier can be decomposed into the mixture of the projection onto the target state and its orthogonal part Note that the state verifier V ψ is called a verification strategy in the context of quantum state verification (QSV). Let {λ i } i be the eigenvalues of the |ψ -orthogonal operator V ⊥ ψ associated with the eigenstates {|φ i } i . The maximum and minimum eigenvalue λ max,min of V ⊥ ψ determines the efficiency of the verification strategy in QSV as well as the fidelity bounds in QSFE [23], Let |φ max and |φ min be the eigenstates of V ⊥ ψ associated with the maximum and minimum eigenvalues λ max and λ min , respectively. The lower bound in Equation (9) can be achieved by the testing states ρ ∈ span (|ψ , |φ max ) in the Hilbert subspace that is spanned by the target state |ψ and the maximum-eigenvalue state |φ max , while the upper bound can be achieved by the states ρ ∈ span (|ψ , |φ min ). However, the noises in a state generation process are in general not the eigenstates |φ max or |φ min of the operator V ⊥ ψ , which means that the bounds in Equation (9) are not the tightest for a particular noisy state generation. As the fidelity lower bound can be employed for entanglement dimensionality certification [19], a tighter fidelity lower bound in a state fidelity estimation implies the better robustness of the entanglement detection against the noises that present in the experiment. It is therefore desirable to refine the fidelity bounds in QSFE by adapting the estimation approach to the noises of a particular state generation.

Quantum State Fidelity Estimation Assisted with Measurement Statistics in the Computational Basis
In this section, we employ the state verifiers in a scenario of quantum state fidelity estimation under the assumption that the computational-basis measurement is more efficient and feasible than the other measurement configurations. In this case, one can first measure a testing state ρ in the computational basis and obtain the corresponding measurement statistics: This measurement statistics contains information about the noises in a state generation. These noises can contribute to the expectation value of the |ψ -orthogonal part V ⊥ ψ of the state verifier V ψ , where V ⊥ e and V ⊥ M are the |ψ -orthogonal part of V e and V M , respectively, To estimate the state fidelity F ψ , one will need to exclude the contribution of |ψ -orthogonal part V ⊥ ψ from the expectation value of the state verifier V ψ , since F ψ = V ψ − V ⊥ ψ . In Equation (9), the expectation value V ⊥ ψ is bounded by its maximum and minimum eigenvalues, which does not depend on the measurement statistics P e . Here, the a priori information of the computational-basis measurement statistics P e can help us to adjust the measurement configurations M to the noises of the systems and refine the bounds on the expectation value V ⊥ ψ . To estimate V ⊥ ψ exploiting the measurement statistics P e , one can bound the operator V ⊥ ψ by an operator I, which is diagonal in the computational basis, where E M is the non-zero diagonal part of the |ψ -orthogonal operator V ⊥ M assigned by a weight γ k A k B , The operator E M contains the information of the |ψ -orthogonal contributions in V M , which are the errors that we want to exclude from the state verifier. This information can be extracted from the measurement statistics P e in the computational basis by the operator I prior to the implementation of the measurement M. It can help us to evaluate the measurement configurations M and to bound the operator V ⊥ ψ exploiting the a priori statistics P e . The operator I can be decomposed into the |ψ projector and a non-|ψ component I ⊥ , The expectation value I is the sum of the state fidelity F ψ and the expectation value I ⊥ , which contains partial information about the |ψ -orthogonal contribution V ⊥ ψ of a testing state in the expectation value of the state verifier V ψ . One can show that there exists an assignment of the weights γ k A k B in E M , such that the operators V ⊥ ψ and I ⊥ can be decomposed by a set of pure where {| φ i } i are in general non-orthogonal, λ i ≥ 0 are non-negative and r i > 0 are positive. One can then bound the operator V ⊥ ψ by I ⊥ with two real-value coefficients α and β such that α I ⊥ V ⊥ ψ β I ⊥ , which refines the bounds on the |ψ -orthogonal contribution V ⊥ ψ in V ψ given in Equation (13), As a result, one can then refine the bounds on the state fidelity given in Equation (9) as follows.
Lemma 2 (Bounds on state fidelity). The state fidelity for a target state |ψ is bounded by where α and β are the maximum and minimum ratio betweenλ i and r i α := max iλ i r i and β := min Proof. see Methods.
A trivial construction of E M is the assignment of γ k A k B = 1, which leads to I = 1. For this construction, the decomposition in Equation (17) is the eigenstate decomposition of V ⊥ ψ . In this case, the bounds in Equation (19) coincide with the bounds given in Equation (9). Since 1 = 1 is constant and does not depend on the measurement configurations M and measurement statistics P e in the computational basis, it can not be employed to adapt the measurement configurations M to P e .
In order to adapt the measurement configurations M to P e , one needs to introduce the M and P e dependency in I , such that one can find the optimal measurement configuration M for the minimum I subject to a given measurement statistics P e . To this end, one can explicitly construct a nontrivial I and determine the coefficients (α, β) following the protocol given in the proof of Lemma 2 in Section 4 (Methods). Employing the operator I constructed in Equation (55), one can then adapt the measurement configurations M to the measurement statistics P e such that the expectation value I is minimum subject to a given P e , which leads to a higher lower bound on the state fidelity. Usually, the coefficient β is zero, unless one chooses a large set of measurement configurations such that the state verifier V ψ has the same rank as I. As a consequence, the minimization of I does not affect the upper bound in most cases. Following these steps, one can therefore construct the subsequential measurements M depending on the measurement statistics in the computational basis P e , which means the operators V ψ and I in Equation (19) also depend on P e , V ψ = V ψ (P e ) and I = I(P e ).
As a result, Lemma 2 allows us to estimate quantum state fidelity employing V ψ (P e ) and I(P e ) adapted to the measurement statistics in the computational basis P e to obtain tighter bounds. In the next section, we will employ this method to derive an adaptive approach of quantum state fidelity estimation for Bell-type states explicitly.

Adaptive State Fidelity Estimation for Bell-Type States
A general Bell-type entangled state in d × d Hilbert state is an entangled state with the Schmidt rank d, which is an important higher dimensional entanglement resource in bipartite systems. If the Schmidt basis happens to be more feasible than the other basis in a laboratory, one can employ the Schmidt basis as the computational basis in our adaptive estimation approach. In this case, a bipartite pure state is decomposed as where s k are the Schmidt coefficients. In order to construct a state verifier for a Bell-type state |ψ , one needs to construct stabilizers of |ψ employing measurement operators in different measurement bases. In the computational basis, the state verifier V e that characterizes the correlations of the target state |ψ is given by For the construction of state verifiers in the other measurement bases, one needs the other stabilizers of the Bell-type state |ψ , which can be derived from the standard Heisenberg-Weyl (HW) operators [25] with a modification associated with a coefficient vector χ = (χ 0 , ..., χ d−1 ). A χ-modified HW operator Ω i,j ( χ) is comprised of the χ-modified shift operator X( χ) and the clock operator Z, where the χ-modified shift operator X( χ) and the clock operator Z are defined as with | χ| = 1 and w := e i 2π d . Here, the symbol "⊕" stands for the d-modulus plus ( The symbol ⊕ d ( d ) is employed to denote the d-modulus plus (minus) of two quantities, e.g., a ⊕ d b : . For conciseness, we omit the subscript d.). Note that the relevant HW operators in this paper are the operators with the label i = 1, of which the notation are simplified by Ω j := Ω 1,j . The target Bell-type state |ψ is stabilized by all the local HW operators As a consequence, the measurement configurations M for the |ψ -state verifier can be constructed in the eigenbasis of the χ A,B -modified HW operators, As one can show that Ω j |E m (j; χ) = w m |E m (j; χ) by simply applying Ω j on the state, the eigenstate |E m (j; χ) is associated with the eigenvalue w m . Since the eigenstate |E m (j; χ) depends on the coefficient χ, the set of measurement configurations M are therefore determined by the coefficients χ A,B , which can be adapted to the measurement statistics P e in the computational basis, i.e., , one can construct its corresponding state verifier V j according to Lemma 1, The state verifier V j has the minimum rank of d, which is optimum for a Bell-type state |ψ in a d × d-dimensional Hilbert space. The state verifier V M = ∑ j u j V j associated with the non-computational-basis measurement configurations M is then comprised of { V j } j∈M with certain weights {u j } j∈M according to Equation (7). Together with the state verifier V e in the computational basis, one can construct a |ψ -state verifier V ψ = u e V e + (1 − u e ) V M according to Equation (8). To estimate the state fidelity, one still needs to construct the operator I = V e + E M , where the error operator E M can be determined according to Equation (55) as follows: The error operator E M characterizes the unexpected outputs for the target state |ψ in the computation basis, which still contribute to the expectation value of the state verifier V M in the subsequential measurements M. Employing the operators V ψ and I, one can then estimate the lower and upper bounds on the |ψ -state fidelity F ψ according to Lemma 2. In a laboratory, there will be a set of available measurement configurations M. However, taking all the available measurement configurations into the construction of the state verifier V M does not always give us better bounds on the state fidelity. Let d = p n 1 1 ...p n k k be the prime number factorization of the local dimensionality d with p 1 < ... < p k . One can show that the optimum bound on the state fidelity F ψ determined by Lemma 2 is achieved by the subsets M of M, which are constructed by selecting one element from each p 1 -modulus equivalent subclass (quotient subset) C i of M. Here, a p 1 -modulus subclass C i of M is defined as From each nonempty subclass C i , one selects a measurement configuration to construct a subset M of the available measurement configurations M. The set of all possible measurement configurations under this construction is i=0,...,p 1 −1 The cardinality of the subset of measurement configurations M is equal to the number of nonempty p 1 -modulus subclasses C i of M, which is denoted by |M /p 1 |. We can then assign a state verifier V M to each measurement configuration subset M according to Equation (7) to determine a lower bound on F ψ . One can show that the optimum choice of the weights {u j } j∈ M for { V j } j∈ M in V M is the uniform weight u j = 1/|M /p |, which takes the average of the state verifiers V j in M As a result of Lemma 2, one can estimate the lower and upper bounds on the |ψ -state fidelity as follows.
and upper bounded by If d is prime and M = {0, ..., d − 1}, the value of F ψ can be explicitly determined by Proof. see Methods.
For a prime dimension d, the lower and upper bounds on the state fidelity for the Bell-type state |ψ in Equations (34) and (35) Equation (19) coincide with each other, which leads to an exact value of the state fidelity given in Equation (36). One can therefore directly measure a state fidelity in d + 1 measurement configurations. In this case, the method of state fidelity estimation in Equation (36) is equivalent to the state fidelity derived in [19]. Since the state fidelity is exactly measured, the choices of the coefficients χ A,B do not affect the final result ( Theoretically, the exact value of the |ψ -state fidelity of a testing state should not depend on the measurement configurations, if one has large enough data of measurement outputs.). One can therefore choose χ A,B according to the feasibility of their corresponding measurement settings. Note that the most simple measurement is usually the projective measurement with the uniform coefficient As a result of Equation (26), the preferable measurement settings in this case are then the projective measurements associated with .., 1/ √ d} on one local system A combined with the POVM measurements associated with χ B = {s 0 , ..., s d−1 } on the other local system B.
If d is non-prime or M {0, ..., d − 1}, there will be a gap between the lower and upper bounds on the state fidelity given in Equations (34) and (35). This gap can be reduced by carefully choosing proper coefficients χ A,B adapted to the measurement statistics in the computational basis before the implementation of remaining measurement configurations M( χ A , χ B ). Since the only information we have is the measurement statistics in the computational basis, we can not optimize χ A,B for the maximum expectation value of the state verifier V M that is evaluated in the upcoming measurements. The optimization that we can carry out at this stage is to find the optimum χ A,B for the minimum expectation value of the error operator E ( χ A , χ B ) as follows: The following conditions are sufficient for the minimum expectation value E |χ (A) Pr e (k, k ) Pr e (k , k) s k s k and |χ However, these conditions can not be fulfilled for all (k, k ) in general. For the special case when the measurement statistics is approximately symmetric under the exchange of the local systems, i.e., Pr e (k, k ) ≈ Pr e (k , k), the expectation value of the error operator is lower bounded by where the minimum is achieved by In practice, one may just want to estimate the state fidelity for the Bell-type state that is closest to the testing state, rather than a predefined one. In this case, one can even adapt the Schmidt coefficients s k to the measurement probability Pr e (k, k) such that As a whole, one can estimate a lower and an upper bound on the state fidelity for the Bell-type state that is closest to a testing state adaptively in the following steps: 1.
One implements a measurement in the computational basis to obtain the statistics Pr e (k A , k B ).

2.
Adapted to the measurement statistics {Pr e (k A , k B )} k A ,k B , one finds the optimum coefficients χ A,B for the minimum expectation value of the error operator E ( χ A , χ B ) according to Equation (37).

3.
Depending on the facilities of a laboratory, one implements a set of available local POVM measurements M( χ A , χ B ) associated with the χ A,B -modified Heisenberg-Weyl operators (27) and (28).

4.
From the measurement statistic obtained in each measurement configuration j ∈ M( χ A , χ B ), one evaluates the corresponding state verifier operator V j ( χ A , χ B ).

5.
Employing Theorem 1, one estimates a lower and an upper bound on the state fidelity F ψ .

Adaptive State Fidelity Estimation in Noisy Bell-Type State Preparation
In this section, we demonstrate the fidelity estimation method derived in Theorem 1 for Bell-type quantum states prepared under certain types of noises. As an example, we first consider the white noises, which are symmetric under the exchange of two local systems. In entanglement generation of a Bell-type state with the white noises, the final state is described by where is the weight of the white noises. The measurement statistics in the computational basis Pr e (k A , k B ) = Pr e (k B , k A ) is symmetric under the exchange of the local systems A, B. One can therefore choose the measurement coefficients χ A,B as given in Equation (40). In this case, our approach employs the same measurement configurations as the ones employed in [19]. If one just exploits one measurement configuration added to the computational basis, the lower bound derived in [19] is tighter than the bound in Theorem 1. However, as the number of measurement configurations in M increases, the lower bound in Theorem 1 is improved faster, and becomes better than the one derived in [19], which can be seen from the comparison between these two bounds in Figure 1 for a prime dimension d = 7.
In Figure 1, we plot the state fidelity F ψ (orange solid) of a 7 × 7-dimensional testing state ρ( ), and its corresponding upper (blue dot-dashed) and lower (green dashed) bounds determined by Theorem 1. These lower bounds are compared with the lower bounds derived in [19] (red dotted) and the ones obtained by the nonadaptive method in Equation (9) (violet dot-dot-dashed). From this example, one can see that the lower bounds derived in Theorem 1 become tighter than the one in [19], if one chooses more than one measurement configurations M ⊇ {0, 1}. One can also see that both the adaptive methods in Theorem 1 and in [19] can determine tighter lower bounds than the nonadaptive method in Equation (9). A limitation of the fidelity estimation in Theorem 1 is that, for a non-prime dimension, the lower bounds are not necessarily tighter, if the number of measurement configurations increases. According to Theorem 1, if the available measurement configurations M ⊃ {0, ..., p 1 − 1} have more than p 1 settings, then one should take the maximum of the lower bounds estimated by all subsets M of M, which has one element in each p 1 -modulus subclass. In this case, the optimum lower bound obtained in Theorem 1 can be already saturated, when M = {0, ..., p 1 − 1}. As one can observe in Figure 2 for d = 9, the optimum lower bounds on F ψ derived in Theorem 1 are already achieved by M = {0, 1, 2}, while the lower bounds derived in [19] are continuously improved, as one includes more measurement configurations. When one includes enough measurement configurations such that M ⊇ {0, ..., 5}, the method in [19] can provide tighter lower bounds than the ones derived in Theorem 1, while for the measurement configurations {0, 1} ⊆ M ⊆ {0, ..., 4}, the method in Theorem 1 is still better.  In general, the noises in two separated local systems A, B are not symmetric under the exchange of local systems. In this case, Theorem 1 allows us to adapt the measurement coefficients χ A,B to the measurement statistics in the computational basis to refine the state fidelity estimation. For example, in linear optics networks [26] which have path modes as their degree of freedom, one possible type of error is crosstalk between the computational basis states associated with neighboring paths. If the crosstalk error is small enough, such that the crosstalk between the computational-basis states |e k and |e k associated with far neighboring paths |k − k | > 1 is negligible relative to the crosstalk between the closest neighboring paths |k − k | = 1, i.e., Pr e (k, k ± ∆k) Pr e (k, k ± 1) for ∆k > 1, the expectation value E can be approximately given by In this case, the optimum χ A,B determined by Equations (38) and (41) can be solved by Pr e (k , k + 1) Pr e (k + 1, k ) where N A,B are the normalization factors. As an example, a state produced in a Bell-type state generation under a simple model of local cross-talking noises ( A , B ) can be described by Here, the error coefficients A and B are the probability of a photon crossing to a closest neighboring path in the local system A and B, respectively. According to Equation (44), the optimum χ A,B for one-side cross-talking errors are For symmetric cross-talking errors A = B , the probability distribution Pr e (k, k ) is symmetric under the exchange of A and B, the minimum of E is then achieved by the measurement coefficients The computational-basis measurement statistics of the testing states ρ(0.04, 0) and ρ(0, 0.04) with one-side local crosstalk is asymmetric (see Figure 3a,c), while it is symmetric for the testing state

Discussion
In this paper, we have employed state verifiers in Lemma 1 to derive lower and upper bounds on state fidelity in Lemma 2, which can be refined under the assistance of measurement statistics in the computational basis. This method allows us to adapt the subsequential measurement configurations to measurement statistics in the computational basis to obtain tighter bounds, which are desirable for entanglement detection. We have therefore employed this method to derive an adaptive approach of quantum state fidelity estimation for Bell-type bipartite entangled states in Theorem 1. This adaptive approach can determine lower and an upper bounds on the state fidelity which are tighter than the fidelity bounds obtained in QSV [23]. One has to note that QSFE and QSV have different problem settings. We can not simply employ our adaptive method in QSV, since, in QSV, a priori knowledge of a testing quantum system is not justified, and the computational-basis measurement with a large enough number of outputs is inefficient. To be precise, our method is good for the determination of tighter bounds on quantum state fidelity with the cost of some degree of inefficiency in the measurement process for obtaining a priori information in the computational basis.
Another adaptive method of state fidelity estimation for Bell-type states is also derived in [19]. Their fidelity lower bound is tighter than the one derived in Theorem 1, if one implements only one measurement configuration added to the measurement in the computational basis. However, our method can be tighter than their bound, if one constructs more than one additional measurement configurations (see Figure 1). Note that our method can saturate its optimum, if the set of measurement configurations M ⊆ {0, ..., d − 1} is a p 1 -modulus subclass of {0, ..., d − 1}, where p 1 is the smallest prime divisor of d. For example, the measurement configurations M = {0, ..., p 1 − 1} can already achieve the optimum of the QSFE employing Theorem 1 (see Figure 2). In this case, the adaptive method in [19] could provide tighter bounds again, if one includes enough measurement configurations M ⊃ {0, ..., p 1 − 1} (e.g., M ⊇ {0, ..., 5} for QSFE of the 9 × 9 quantum system demonstrated in Figure 2). However, to get this benefit from the method in [19] over our method in Theorem 1, one will need to implement at least (p 1 + 1) measurement settings added to the computational-basis measurement.
One advantage of the adaptive method in this paper is that one can tailor the measurement configurations to asymmetric local noises by adjusting the coefficients χ A,B according to Equation (38) Equation (37). For the state preparation under a simple local cross-talking error model in linear optics network systems, where the probability of a photon in a path mode cross-talking with its neighboring paths is small enough, one can find the optimum local measurement coefficients χ A,B as given in Equation (44). As shown in the example of Figure 3d, the optimum measurement coefficients χ A,B can improve the fidelity lower bound by about 1.4% over the symmetric measurement coefficients.
The approach in this paper only adapts to the measurement in the computational basis. It can be extended to a scheme of sequentially adaptive quantum state fidelity estimation analogous to the sequentially adaptive QST [12], in which one constructs each subsequential measurement setting adapted to the measurement statistics obtained in all the prior measurement settings. This adaptive scenario can be also extended to the QSV with a priori knowledge of measurement statistics in some particular bases, if the a priori knowledge is justified by a trusted authorized agent.

Methods
In this section, we will prove our main results given in Lemmas 1, 2 and Theorem 1. First, we show the state verifier V j constructed in Lemma 1 stabilizes the target state |ψ .
Proof of Lemma 1. After performance of the state verifier V j on the target state |ψ , one has Since e m A , e m B | T † A (j) ⊗ T † B (j)|ψ = E m A (j), E m B (j)|ψ , with the construction given in Equation (6), V j |ψ , can be simplified to Since e m B | by definition, one can obtain the following eigenequation: The operator V j constructed in Lemma 1 is therefore a valid state verifier associated with the measurement M Second, we show the existence of a nontrivial decomposition | φ i i for Lemma 2 and prove that the coefficients α and β lead to the fidelity bounds given in (19).
Proof of Lemma 2. According to Equation (17), the operator V ⊥ ψ − c I ⊥ can be decomposed as For c = α := max i ( λ i /r i ), the operator (c I ⊥ − V ⊥ ψ ) is positive semidefinite, while, for c = β := min i ( λ i /r i ), the operator ( V ⊥ ψ − β I ⊥ ) is positive semidefinite. As a result of Equation (18), the two coefficients α and β lead to the lower and upper bounds on the state fidelity given in Equation (19). the state verifier V j in Equation (29) can be decomposed as while the error operator E can be decomposed as Employing these decompositions, one can prove Theorem 1 as follows.
Proof of Theorem 1. For the measurement configurations M( χ A , χ B ) ⊆ {0, ..., d − 1} associated with the ( χ A , χ B )-modified HW operators given in Equation (27), one can construct a state verifier V ψ according to Equation (8) and decompose it into a mixture of the ( χ A , χ B )-modified Bell-type states Employing the same decomposition components {|ψ µν } µ,ν , the operator I in Equation (14) can be constructed by I = V e + E . First, we derive the lower bound on the state fidelity as follows. According to Lemma 2, the coefficient α for the lower bound on where C i (M) ∈ M /p 1 are the p 1 -modulus equivalent subclasses of the measurement configurations M. Here, p 1 is the minimum prime-number divisor of the dimension d. The smaller the coefficient α is, the larger the lower bound. The optimum lower bound is then obtained by the minimum value of α, which is achieved by α = u e = α/(1 + α). Insert this value of the coefficient α in Equation (19), one can obtain the lower bound This bound can be improved by minimizing the coefficient α, which is equal to the number of nonempty p 1 -modulus subclasses of M, i.e., minα = |M /p 1 |. As a consequence, F ψ is lower bounded by This lower bound is achieved by the weights ∑ j∈C i (M) u j = 1/|M /p 1 |, which are uniformly weighted over all p 1 -modulus equivalent subclasses C i (M). Indeed, this bound can be even improved by evaluating the lower bounds obtained with the measurement-configuration subsets M(⊆ M), which have exactly one element in each p 1 -modulus subclasses C i (M) as given in Equation (32). With each measurement configuration subset M, one determine a lower bound on F ψ employing the same formula given in Equation (65) with the measurement configuration weights {u j = 1/|M /p 1 |} j∈ M .
The state verifier operator V M is then the average of the state verifiers V j associated with the measurement configurations in M, As a result, one can estimate a lower bound on the state fidelity by For the upper bound on F ψ , one needs to determine the coefficient β given in Equation (20) in Lemma 2. If d is non-prime or M = {0, ..., d − 1}, the coefficient β is always equal to zero. As a consequence, the upper bound is given by the convex combination of the expectation values V e and V j∈M weighted by u e and u j∈M , which means that F ψ is upper bounded by the minimum of V e and V j∈M , If d is prime and M = {0, ..., d − 1}, then the coefficient β is given by The optimum choice of the weights u e , u j∈M for the maximum β is then u e = u j = 1/(d + 1), which leads to the maximum β = 1/(d + 1). In this case, the upper bound on F ψ determined in Equation (19) is

Conflicts of Interest:
The author declares no conflict of interest.

Abbreviations
The following abbreviations are used in this manuscript: QST Quantum state tomography QSV Quantum state verification QSFE Quantum state fidelity estimation HW operator Heisenberg-Weyl operator