It is a well-known fact that the optimal positive operator valued measure (POVM) for quantum-state tomography is the symmetric, informationally complete POVM (SIC-POVM). We investigate the same problem only in the case when there is some a priori information about the state, specifically when some parameters are known. In this paper, we mainly focus on solving a three-dimensional optimization problem, which gives us a non-trivial example for the so-called conditional SIC-POVMs, a straightforward generalization of the concept of SIC-POVMs. We also present other special cases to show further applications of the proposed numerical methods and to illustrate the complexity of this topic.
The state of a quantum system is a density matrix with several parameters. The concern herein is how to recover the parameters. Several possibilities exist for the optimal recovery method, and we consider some special cases. We assume that a few parameters are known and that the others are to be recovered. The optimal positive-operator-valued measure (POVM) for recovering unknown parameters with an additional condition is called a conditional symmetric informationally complete POVM (SIC-POVM). In this paper, we study the existence or nonexistence of conditional SIC-POVMs. We provide a necessary condition for existence and some examples.
This paper is an announcement of our result and the detailed version will be submitted to somewhere.(See [2].)POVMs (positive operator valued measure) on quantum systems are considered as a measurement in quantum physics.If POVMs have a good condition, then we can determine a state by results of a measurement.In this case, the POVM is called informationally complete and the process is called quantum state tomography.First, we introduce SIC-POVMs (symmetric informationally complete POVM).SIC-POVMs is generated by vectors in
Cn whose the absolute values of inner products of each vectors are same.Zauner conjectured that there exist such
n2 vectors in
Cn for any
n .But the existence is only proved when
n≤15 and
n=19 , 24, 35,48[5, 8].Next, we introduce conditional SIC-POVMs.A state of a quantum system is a density matrix which has several parameters.When a few parameters are known, then SIC-POVM is not the best measurement to determine the state.Hence we need another POVM and it is a conditional SIC-POVM.Conditional SIC-POVMs are also generated by vectors in
Cn .But the existence of conditional SIC-POVMs depends on the system.We will discuss the details in Sect. 4. 2 Preliminaries Definition 2.1
ρ∈Mn(C) is called a density matrix (or state) if
ρ≥0 and
′b(ρ)=1.For any density matrix
ρ , we can define a state
ρ^ by
ρ^(X)=h(ρX) .Conversely, any state is written by the above form.Therefore, there exists a one-t
(≻ one correspondence between density matrices and states.Definition 2.2 A set of positive operators
{Pi}i=1k⊂Mn(C) is called a positive operator valued measure (POVM) if
Pi≥0(1≤i≤k) and
∑i=1kP=I.If
P1 is a projection, then
{Pi}i=1k is called a projection valued measure
(PVM) .
We consider the existence in arbitrary finite dimensions d of a positive operator valued measure (POVM) comprised of d2 rank-one operators all of whose operator inner products are equal. Such a set is called a “symmetric, informationally complete” POVM (SIC–POVM) and is equivalent to a set of d2 equiangular lines in Cd. SIC–POVMs are relevant for quantum state tomography, quantum cryptography, and foundational issues in quantum mechanics. We construct SIC–POVMs in dimensions two, three, and four. We further conjecture that a particular kind of group-covariant SIC–POVM exists in arbitrary dimensions, providing numerical results up to dimension 45 to bolster this claim.
Symmetric informationally complete (SIC) positive operator valued measures (POVMs) are a class of quantum measurements which, in addition to being informationally complete, satisfy three conditions: (1) every POVM element is rank one, (2) the Hilbert-Schmidt inner product between any two distinct elements is constant, and (3) the trace of each element is constant. The third condition is often overlooked, since it may give the impression that it follows trivially from the second. We show that this condition cannot be removed, as it leads to two distinct values for the trace of an element of the POVM. This observation has led us to define a broader class of measurements which we call semi-SIC POVMs. In dimension two, we show that semi-SIC POVMs exist, and we construct the entire family. In higher dimensions, we characterize key properties and applications of semi-SIC POVMs, and note that the proof of their existence remains open.
In this paper, we answer this fundamental question affirmatively by using a class of informationally complete positive operator-valued measures (IC-POVMs), including symmetric IC-POVMs (SIC-POVMs) and spherical
t-designs, focusing on sample complexity while not accounting for the implementation complexity of the measurement settings. For SIC-POVMs and spherical 2-designs, we show that the number of state copies to guarantee bounded recovery error of an MPO state with a constrained least-squares estimator depends on the probability distribution of the MPO under the POVM but scales only linearly with
n when the distribution is approximately uniform. For general spherical
t-designs with a sufficiently large
t, we prove that only a number of state copies proportional to the number of independent parameters in the MPO is sufficient for a guaranteed recovery of any state represented by an MPO. In addition, we establish a sample complexity lower bound based on the Cramer-Rao bound, showing that, for strictly positive definite MPO states and unbiased estimators, a number of state copies proportional to the number of independent parameters in the MPO is also necessary, although the upper and lower bounds do not yet match in their dependence on the target accuracy. Furthermore, we propose a spectral method and a projected gradient descent (PGD) algorithm to solve the constrained least-squares problem, both equipped with rigorous recovery error guarantees.