II.1 Examples
We begin by discussing two examples: being the quantum state of 2-qubits and being the quantum state of 3-qubits.
Let be the decomposition of in the computational basis state. If we measure two qubits, then it is fundamental, that is, Born’s rule, that the probability of measuring string () is . If we want to estimate all of this probability , then we need to repeat the measurement multiple times and use the results to statistically estimate all probabilities .
To see how the outcomes can be used for estimating all probabilities from measuring in computational basis, we can first consider the estimation of . Then the measurement outcomes form a Bernoulli distribution for , as we simply treat all the outcomes as a discrete variable with corresponding probability . It is known (via Chernoff bound) that the samples required to estimate to accurary with probability at least is . The same strategy can be applied to estimate by treating each of them and the remaining probabilities as Bernoulli distribution. In the end, the whole procedure takes repetitions to estimate all probabilities to additive accuracy , with high probability.
The same result is applied for 3-qubits case. Let . Then repeating the measurements in computational basis state allows us to estimate each probability (for ) to error at most with success probability at least , with repetitions according to the above lemma. It is straightforward to see that even in -qubits case, the procedure is the same for estimating all amplitudes, hence the sample complexity is to achieve the desired precision.
Now for , instead of measuring all qubits in computational basis state (with four possible outcomes ), we measure the first qubit in computational basis state. Then there will be two possible outcomes, which are 0 and 1 (or more like or in the first qubit), with corresponding probability and :
|
|
|
(1) |
|
|
|
(2) |
where refers to the identity matrix on the second qubit system. To avoid the confusion, as subsequently we also have and but those probabilities are for the measurement’s outcome on the second qubit, we use the superscript to denote the qubit explicitly: and refers to the probability of obtaining and on the first, or second qubit respectively. We remark the following crucial information, which is essentially a marginal probability property:
|
|
|
(3) |
|
|
|
(4) |
where is the usual squared amplitude of state . Likewise, if we measure the second qubit, there would also be two possible outcomes 0 and 1, with probability and . Then we also have that, for second qubit:
|
|
|
(5) |
|
|
|
(6) |
It is straightforward to see that the above equation form a linear system:
|
|
|
(7) |
As we have discussed, repetition is required to estimate and to the precision . This means that the right-hand side of the above linear system is erroneous. Therefore, if we wish to solve the linear system above to obtain the probability , then the solution appears to be erroneous, which we will discuss in more detail later.
Now we examine the same procedure as above for 3-qubits cases. We measure each qubit of the state times, and obtain the outcomes . Recall that
|
|
|
|
(8) |
where each amplitude squared is the probability of obtaining corresponding outcome . Then due to marginal probability property, we have that:
|
|
|
(9) |
|
|
|
(10) |
|
|
|
(11) |
|
|
|
(12) |
|
|
|
(13) |
|
|
|
(14) |
The above equations can be written as a linear system:
|
|
|
(15) |
The above system is rectangular, rather than square system comparing to Eqn. 7, which makes it a bit trickier to solve, as there are more variables than the number of equations. In the context of linear algebra, it is referred as underdetermined systems, and unique solution might not exists, rather, there can be infinitely many solutions. To make it square, we need to have more equations. However, the used procedure employs a single qubit measurement only, and we already measure all individual qubit. In order to collect more information as to obtain more equations, we need to have more measurement outcomes.
There are two possible ways to solve the aforementioned challenge. The first one is, we can perform joint measurement on qubits. Suppose we perform measurement on the first two qubits of , then there are four possible outcomes: 00,01,10,11. Let with denote the probability of measuring on the qubit 1 and 2 of . Then because of the decomposition of , and is the corresponding probability of measuring outcome . Using marginal probability property as in previous 2-qubit case, we have that:
|
|
|
(16) |
|
|
|
(17) |
Note that there are two other outcomes and , however, we don’t need to use them, as the above equations, once combined with equations Eqn.14, yields:
|
|
|
(18) |
|
|
|
(19) |
|
|
|
(20) |
|
|
|
(21) |
|
|
|
(22) |
|
|
|
(23) |
|
|
|
(24) |
|
|
|
(25) |
which is a square linear system:
|
|
|
(26) |
In principle, it is sufficient from the above square system to solve for desired probability from the two qubits measurement outcomes and , in addition to single qubit measurements.
While the above described joint qubit measurement seems efficient enough to do, however, the whole procedure gives us a linear system with probabilities, or amplitude square, as variables. We remark that, all amplitudes are complex number, so for this 3-qubit case, we have amplitudes, corresponding with complex variables. Therefore, we can only find the amplitude square, meanwhile, amplitude could be complex and the above linear system isn’t giving us enough information to find the amplitude, including its real and complex part. Performing more joint 2-qubit measurements, in principle, can give us more equations. However, to our surprise, solution based on only single qubit measurement exists. Remind that, in order to obtain the equation Eqn. 15, we performed single qubit measurement on basis. In fact, we can also perform measurement on arbitrary basis, and it should be able to give us more information. To proceed, let denotes the angle for another basis measurement, and be the eigenstate of corresponding measurement operator. Then the probability of obtaining or is:
|
|
|
(27) |
where refers to identity matrix in the remaining qubits system. Let
|
|
|
(28) |
|
|
|
(29) |
be the decomposition of in regular computational basis. From the above equation, it is easy to rewrite:
|
|
|
(30) |
|
|
|
(31) |
Recall that
|
|
|
|
(32) |
|
|
|
|
(33) |
|
|
|
|
(34) |
|
|
|
|
(35) |
Let and . Then we have:
|
|
|
|
(36) |
If we measure the first qubit, then the probability of measuring is:
|
|
|
(37) |
|
|
|
(38) |
We have that:
|
|
|
|
(39) |
|
|
|
|
(40) |
|
|
|
|
(41) |
|
|
|
|
(42) |
Then:
|
|
|
|
(43) |
|
|
|
|
(44) |
|
|
|
|
(45) |
|
|
|
|
(46) |
Likewise:
|
|
|
|
(48) |
|
|
|
|
(49) |
|
|
|
|
(50) |
|
|
|
|
(51) |
Recall that from equation Eqn. 14:
|
|
|
(53) |
|
|
|
(54) |
|
|
|
(55) |
|
|
|
(56) |
|
|
|
(57) |
|
|
|
(58) |
if we replace for , we equivalently have:
|
|
|
(59) |
|
|
|
(60) |
|
|
|
(61) |
|
|
|
(62) |
|
|
|
(63) |
|
|
|
(64) |
From the above measurement on -angle basis, we have:
|
|
|
(65) |
|
|
|
(66) |
|
|
|
(67) |
|
|
|
(68) |
Putting everything together, we have the following set of equations:
|
|
|
(70) |
We remind that all amplitudes are complex numbers, i.e., . At this point, we still don’t have enough information to solve because as mentioned, all amplitudes are complex number, so this 3-qubit case, we have amplitudes, corresponding with complex variables. The above equations contain 8 equations, so we need 8 more. In fact, there are many ways to collect more equations. Previously we have showed that performing joint 2-qubit measurements can also work, however, if we restrict ourselves to single qubit, then measuring a single qubit can also work well. If we measure the same first qubit in another basis, for example, different angle , then we will have 2 more equations, corresponding with two possible outcomes. By choosing more angles, or we can opt to measure another qubit, then we can obtain more outcomes, thus forming further equations.
The above examples on two-qubits and three-qubits cases have illustrated the key idea behind our proposal, as instead of measuring all qubits, we only need to measure some subsets of qubits, and even a single qubit measurement is sufficient. The outcomes are then being processed classically, e.g., solving a nonlinear system, to obtain the desired amplitudes. Now we proceed to provide a formal description for our method, generalizing the above examples into -qubits state.
II.2 General Framework
From the above examples, it is straightforward to generalize the procedure to the -qubit state. As there are amplitudes and variables, therefore we need equations. Each qubit measurement yields two possible outcomes, corresponding to the equations (see the back equation 7, 14), then measuring each qubit (among qubits) on a given basis yields equations. If, as a first step, we choose to measure each individual qubit in Z basis, then we have equations. Then, we continue to measure only the first qubit, then if in total is a different basis to measure, then we require . Given that is an integer, one can opt for , which is the total of different bases, or different angles, which one needs to choose and measure.
Algorithm 1
Input a -qubit quantum state . Choose and denote by the angle indicating the direction of the measurement basis. Then we do the following:
-
•
Measure each qubit of in computational basis (Z basis) times.
-
•
Measure the first qubit of in basis times.
-
•
Form the following system of nonlinear algebraic equations (e.g., as in 70):
|
|
|
(71) |
-
•
Solve the above equations and obtain , , , for all
The last and very important point we need to discuss is the measurement-induced error and how it affects the solution we solve from such erroneous equations. Recall that the right-hand side of Eqn. 71 are estimated by collecting measurement results from single-qubit measurement. From an earlier discussion, we knew that by obeying the Bernoulli distribution, is necessary and sufficient to estimate, for example, to accuracy if we measure the first qubit. Likewise, all remaining probabilities are estimated up to . As the right-hand side is erroneous, the solution to the system of nonlinear algebraic equations is also deviating from the real, ideal solution. The following theorem characterizes the error deviation of the erroneous system from the ideal system:
Theorem 1 (Erroneous Nonlinear Algerbraic Equations)
Let be variables and be multivariate functions. Define two systems of nonlinear algebraic equations as follows.
|
|
|
(72) |
and
|
|
|
(73) |
Let the Jacobian be:
|
|
|
(74) |
Let denote the solution to 72, and denotes the solution to 73; let and . Then we have that:
|
|
|
(75) |
where refers to the usual Euclidean norm for a vector and matrix norm for a matrix.
Proof: We use Taylor’s expansion around the solution, in the limit . We have that, for :
|
|
|
(76) |
|
|
|
(77) |
Then we have that:
|
|
|
(78) |
|
|
|
(79) |
|
|
|
(80) |
|
|
|
(81) |
which has equivalent matrix form:
|
|
|
(82) |
which could also be written as:
|
|
|
(84) |
Therefore, we have that:
|
|
|
(85) |
|
|
|
(86) |
where refers to the usual Euclidean norm. As , then we have that:
|
|
|
(87) |
As by definition, for being a unit vector. So we have that:
|
|
|
(88) |
The proof is then completed.
The application of the above theorem to our main equation Eqn. 71 is straightforward. Such system forms a nonlinear algebraic equations, with , () being variables as in Theorem 1, for which in this case we have . Additionally, the probabilities on the right hand side of equation 71 corresponds exactly to in theorem 1. As each probability on the right hand side of equation 71 is estimated up to accuracy , it translates directly to the fact that for all , , then we have that:
|
|
|
(89) |
Therefore, from the above, we have:
|
|
|
(90) |
where we remind that, x is being used in an abusive way (following theorem 1) to denote the ideal solution to our main system of interest 71, and denotes the erroneous solution. The above equation suggests that the error deviation depends on the behavior of corresponding Jacobian . If has the lowest non-zero singular value being then the norm gonna be large, making error induced larger. Otherwise, if the lowest non-zero singular value being large enough, then could be . Then . Now we discuss a few specific scenarios to show how our framework can be applied in a broader context.
II.2.1 Estimating each amplitude and its norm with additive error
Suppose our -qubit state is where each is a complex number, and we are interested in estimating its norm to additive error , for all amplitudes. As it is a complex number, we have that:
|
|
|
(91) |
The framework we introduced return an approximation to real and imaginary component of all amplitudes . As we expect all norm of amplitudes having additive accuracy , it is equivalent to:
|
|
|
(92) |
where refers to the approximation of corresponding amplitude . Let and denotes the approximation of real and imaginary part of . Let . We have that:
|
|
|
|
(93) |
|
|
|
|
(94) |
|
|
|
|
(95) |
|
|
|
|
(96) |
where the second line comes from the fact that for any , we have . Remind that we are seeking for:
|
|
|
(97) |
and remind further that all the values , and (for all ) are contained inside and x, as we denoted. We have that:
|
|
|
|
(98) |
|
|
|
|
(99) |
where we have used the fact that . Likewise:
|
|
|
(100) |
So we have:
|
|
|
|
(101) |
|
|
|
|
(102) |
We have the Cauchy-Schwarz inequality:
|
|
|
(103) |
|
|
|
(104) |
Therefore, for all , we have:
|
|
|
(105) |
|
|
|
(106) |
Recall that from previous discussion that lead to equation 90, we have that:
|
|
|
(107) |
where x contains the ideal solution and contains the approximated ones, for all . Hence, is a vector containing all and . It is apparent that, for any specific , we have:
|
|
|
(108) |
|
|
|
(109) |
|
|
|
(110) |
Therefore:
|
|
|
(111) |
|
|
|
(112) |
It implies that:
|
|
|
(114) |
|
|
|
(115) |
|
|
|
(116) |
Previously, we also showed that:
|
|
|
|
(117) |
|
|
|
|
(118) |
Hence:
|
|
|
|
(119) |
|
|
|
|
(120) |
We expect so it is sufficient to set:
|
|
|
(121) |
|
|
|
(122) |
Per algorithm 1, we first make measurement on each qubit times, following by measuring first qubit times. Given that , the total number of measurement (or equivalently, the number of sample of -qubit state ) required to estimate all amplitudes to additive error is .
The previous discussion was devoted to estimating the norm with maximum precision . Now we discuss a quite similar goal, which is outputting amplitudes such that:
|
|
|
(123) |
We have that:
|
|
|
|
(124) |
|
|
|
|
(125) |
|
|
|
|
(126) |
which directly implies that . So, the total number of measurements is .
Naively, as we have discussed, the common approach makes use of jointly all qubit measurement to estimate the amplitude square. More concretely, let . Suppose that we want to estimate for a specific . Then we perform the measurement on all qubits, and the outcome forms a Bernoulli distribution for and the remaining strings, with corresponding probability and . Then it takes measurements to estimate this probability to error . The procedure is then repeated to estimate all amplitude squares to error , resulting in measurements in total. However, we note that these estimations are for the amplitude square. If we want to find the amplitude, we need to take the square root, with further error propagation as follows. Let denotes the amplitude denote the approximation to amplitude square of , i.e:
|
|
|
(127) |
Then we have that:
|
|
|
|
(128) |
|
|
|
|
(129) |
Therefore, if we expect the error to be , we need to set :
|
|
|
(130) |
|
|
|
(131) |
and the total number of measurement needed is , which is quadratically better with respect to comparing to measurements required by the method introduced, which is quite expected because naive procedure employs more qubits measurement.
II.2.2 Estimating probability distribution with total variation
Suppose our -qubit state is , if we measure all qubits in computational basis, then apparently the outcome with corresponding probability forms a probability distribution, denoted as . If we wish to estimate such a distribution up to total variation , that is, obtain a distribution such that . Similarly to the previous discussion, let and denote the real and imaginary components of , and denotes the approximation to the corresponding real and imaginary components. We want that:
|
|
|
|
(132) |
As discussed above, we have that:
|
|
|
(133) |
|
|
|
(134) |
|
|
|
(135) |
Therefore:
|
|
|
(137) |
|
|
|
(138) |
|
|
|
(140) |
where the second line comes from Cauchy-Schwarz inequality. Recall that we have:
|
|
|
|
(141) |
|
|
|
|
(142) |
So we have that:
|
|
|
|
(143) |
As desired, we expect the total variation to be , so we need to set . The total number of measurements is then .
In a naive approach, as described earlier, it takes in total of measurement to estimate all amplitudes square , each to accuracy . Hence, the accumulated error is:
|
|
|
(144) |
If we want the total variation to be , then we require . So the total measurement required is . We remark that, given the decomposition of initial state , its density matrix representation is:
|
|
|
(145) |
And the fact that we expect to obtain approximations of all amplitudes with total variation
|
|
|
(146) |
is essentially equivalent to obtaining a state such that , e.g., defining
|
|
|
This problem has been extensively studied in yu2020sample ; haah2016sample , where the authors proposed different measurement schemes to output the desired density matrix that approximates the given state. The work haah2016sample employs more qubits measurement, meanwhile yu2020sample employs single-qubit measurement. The complexity of yu2020sample is measurement required to output the density state to trace distance , which is quadratically more efficient than our method in error , but less efficient by a factor of .
II.2.3 Estimating with average -norm accuracy
Again, let and instead of individual error as in section II.2.1, we expect the average error to be :
|
|
|
(147) |
Similar as before, let , and where and denotes the approximation to respectively. As showed previously, we have that:
|
|
|
|
(148) |
|
|
|
|
(149) |
|
|
|
|
(150) |
|
|
|
|
(151) |
We have:
|
|
|
(152) |
|
|
|
(153) |
|
|
|
(154) |
|
|
|
(155) |
|
|
|
(156) |
where the last line comes from Eqn. 90, with . We expect that
|
|
|
(157) |
so we need to set . Hence, the total number of measurements needed is . Naively, we have seen that it takes number of measurements to estimate all amplitude square to accuracy . We also had from previous discussion, in section II.2.1 that
|
|
|
|
(158) |
|
|
|
|
(159) |
Hence:
|
|
|
(160) |
|
|
|
(161) |
If we expect the average norm error to be , then we need to set . So using naively, jointly multi-qubits measurement approach, the total number of measurement required is . Hence, in comparison, our single-qubit measurement framework achieves assymtotically similar number of measurements, given that the norm grows as .