A New Method Based on Locally Optimal Step Length in Accelerated Gradient Descent for Quantum State Tomography

Abstract

Quantum state tomography (QST) is one of the key steps in determining the state of the quantum system, which is essential for understanding and controlling it. With statistical data from measurements and Positive Operator-Valued Measures (POVMs), the goal of QST is to find a density operator that best fits the measurement data. Several optimization-based methods have been proposed for QST, and one of the most successful approaches is based on Accelerated Gradient Descent (AGD) with fixed step length. While AGD with fixed step size is easy to implement, it is computationally inefficient when the computational time required to calculate the gradient is high. In this paper, we propose a new optimal method for step-length adaptation, which results in a much faster version of AGD for QST. Numerical results confirm that the proposed method is much more time-efficient than other similar methods due to the optimized step size.

1. Introduction

Quantum physics emerged from Albert Einstein’s efforts to explain the “Photoelectric effect”, which suggested that light can behave like a particle. Other scientists explored the alternative idea that particles such as electrons can behave like waves [1], and this wave-like behavior of particles was later mathematically formulated by Erwin Schrödinger. Schrödinger’s equation provides a theoretical foundation for quantum mechanics, but when it comes to making measurements and interpreting experimental data, statistical tools are essential. One of these tools is quantum state tomography (QST), which is briefly explained in the next section.

In quantum computing and quantum information theory, QST is one crucial step in determining the state of a quantum system, which is essential for understanding and controlling a given quantum system. It uses many identical particles, each measured in a slightly different way. By piecing together these measurements, scientists can build a picture of the original quantum state. In QST, projections are the results of measurements on the quantum system, expressed as probabilities and expectation values.

It is worth noting that QST is a general concept that can be applied to any quantum system, including digital quantum computers [2] and analog quantum simulators (computers) [3]. In [3], a tomography approach (described in terms of Positive Operator-Valued Measures (POVMs) formalism) that is implementable on analog quantum simulators, including ultra-cold atoms, is proposed. Additionally, since quantum sensing and imaging technologies have a lot of exciting applications in optical measurements, using entanglement with applications in quantum lithography [4], one of the applications of QST is in quantum sensing [5].

The QST problem can be formulated as a smooth optimization problem, and as a result, gradient-based methods [6] can be used to solve the problem. If we denote the value of the objective function of the optimization (minimization) problem at point $x$ by $f\left(x\right)$, the gradient descent uses $x_{k+1}=x_k-\epsilon \nabla f\left(x_k\right)$, where $\nabla f\left(x_k\right)$ is the gradient of $f$ at $x_k$, which is a vector consisting of the first-order partial derivatives of $f$ with respect to the decision variables, and $\epsilon$ is a small number and represents the step size. However, while gradient-based methods are easy to implement and highly scalable, they are very slow to converge.

Another approach is to generalize the iteration procedure by using $x_{k+1}=x_k-\epsilon D\nabla f\left(x_k\right)$, where $D$ is a square matrix. Note that if we set $D$ to be equal to the identity matrix then we will arrive at $x_{k+1}=x_k-\epsilon \nabla f\left(x\right)$, as in gradient descent.

If we set $D={\left({\nabla }^{2}f\left(x\right)\right)}^{-1}$, then we will have the Newton method [6], which is very fast to converge in terms of the number of iterations, but ${\left({\nabla }^{2}f\left(x\right)\right)}^{-1}$ is not only challenging and time-consuming to compute, but also requires a lot of memory (RAM). Now, one solution is to use less idealistic but more practical choices of $D$. For instance, L-BFGS [7] tries to directly approximate the vector ${({\nabla }^{2}f\left(x\right))}^{-1}\nabla f(x)$ using a limited number of previous gradients stored in RAM. However, another class of methods that are less demanding in terms of memory (RAM) usage are Accelerated Gradient Descent (AGD) methods [8,9,10], which are based on running two iterative procedures simultaneously. The advantages of this method are its ease of implementation, relatively fast convergence, and being less memory-intensive compared to L-BFGS.

To solve the QST problem, a solver based on Accelerated Gradient Descent (AGD) followed by the singular value decomposition (SVD) projection step is proposed in [2]. A MATLAB implementation is available on GitHub [11]. In [12], compressed sensing (CS) is proposed for QST. In [13], AGD is applied again; SVD projection is bypassed by introducing a non-convex programming formulation of the QST problem, and the Python code is made available [14]. A neural network-based method is presented in [15], and the code is available on GitHub [16]. In [17], a combination of CS and projected least squares (PLS) is proposed, and the code is available in [18]. In [19], attention mechanisms are used in neural networks on informationally complete POVMs. For digital quantum computers, the complexity of tomography scales exponentially with the number of qubits. To address the challenge of exponential scaling, in [20], POVMs are approximated with low-rank approximation (rank-1 projectors of the K = 6 eigenstates of the Pauli matrices), which is similar to the approach that we use for generating simulated data to validate the proposed method. The authors in [5] performed QST on pure tomography sensing using singular value decomposition (SVD) techniques for a 2-qubit system to come up with a robust method.

In this paper, we propose a new method based on the modification of AGD for a non-convex programming formulation. In our approach, one of two step sizes is adaptively chosen which increases the speed of convergence, as demonstrated in the numerical evaluations carried out. A comparison of similarities and differences between the proposed method and the top two most similar methods is presented in

Table 1. Comparison of AGD-based methods for QST.

Method	PGDM [2]	MiFGD [13]	Proposed Method
Using SVD	Yes	No	No
AGD	Yes	Yes	Yes
Step size	Fixed	Fixed	Variable
Unit trace	Yes	No	No
Low rank	No	Yes	Yes
# fcn eval	1	1	3

. The proposed method combines Momentum-inspired Factorized Gradient Descent (MiFGD) with an adaptive step length. The novel contribution of the proposed method is the introduction of a closed-form solution for locally optimal step length in AGD, significantly enhancing the convergence speed of the original MiFGD.

2. Introduction to Quantum Tomography

Quantum physics began with Albert Einstein’s attempts to explain the “Photoelectric effect”. Einstein’s theory suggested that the energy carried by each single energy packet (quantum) of light can be computed as follows:

$$E=hf$$

(1)

where $f$ is the frequency of the light and $h$ is Planck’s constant. In 1924, Louis de Broglie suggested that particles such as electrons can behave like waves [1], and the equation for such wavy behavior was then proposed by Erwin Schrödinger:

$$ih{\displaystyle \frac{\mathit{\partial }\mathsf{\Psi }(x,t)}{\mathit{\partial }t}}=\left[-{\displaystyle \frac{h^2}{2m}}{\displaystyle \frac{{\mathit{\partial }}^2}{\mathit{\partial }{x}^2}}+V(x,t)\right]\mathsf{\Psi }(x,t)$$

(2)

for matter particles with mass $m$, where $V(x,t)$ is the potential. Indeed, physical quantities that physicists are interested in measuring, such as position, energy, momentum, and spin, are represented by Hermitian operators (acting on a Hilbert space), which are called observables. Since these operators are Hermitian, their eigenvalues are real, corresponding to the possible measurement outcomes of their corresponding observable. For example, the eigenvalues of the Hamiltonian operator $\widehat{H}=\left[-{\displaystyle \frac{h^2}{2m}}{\displaystyle \frac{{\mathit{\partial }}^2}{\mathit{\partial }{x}^2}}+V(x,t)\right]$ are real numbers that correspond to the energy of the particle.

Indeed, it can be shown that if $E_n$ is an eigenvalue with the corresponding eigenfunction ${\psi }_{E_n}\left(x\right)$, which is to say that $\widehat{H}{\psi }_{E_n}\left(x\right)=E_n{\psi }_{E_n}\left(x\right)$, then ${\mathsf{\Psi }}_n\left(x,t\right)=e^{-i{E}_{n}t/h}{\psi }_{E_n}\left(x\right)$ is a solution for (2), which is called a wave function.

It can be shown that with some assumptions in Ket–Bra notation, we have the following:

$$〈{\mathsf{\Psi }}_n\left(x,t\right){|\mathsf{\Psi }}_m\left(x,t\right)〉=0, m\ne n$$

(3)

$$〈{\mathsf{\Psi }}_m\left(x,t\right){|\mathsf{\Psi }}_m\left(x,t\right)〉=1$$

(4)

Also, the general solution of (2) is the following:

$$\mathsf{\Psi }\left(x,t\right)={\sum }_{n=0}^{\infty }{C}_n{\mathsf{\Psi }}_n(x,t)$$

(5)

where $C_1,C_2,C_3,\dots .$ are complex numbers.

Now, it is easy to see that

$$〈\mathsf{\Psi }\left(x,t\right)|\mathsf{\Psi }\left(x,t\right)〉={\left|C_1\right|}^2+{\left|C_2\right|}^2+{\left|C_3\right|}^2+\dots$$

(6)

It is assumed that ${\left|C_1\right|}^2+{\left|C_2\right|}^2+{\left|C_3\right|}^2+\dots =1$.

Max Born (1882–1970) suggested that the set of possible outcomes is exclusively restricted to ${\mathsf{\Psi }}_1\left(x,t\right),{\mathsf{\Psi }}_2\left(x,t\right),{\mathsf{\Psi }}_3\left(x,t\right),\dots$ but with different probabilities. These probabilities are proportional to ${\left|C_1\right|}^2,{\left|C_2\right|}^2$, ${\left|C_3\right|}^2$, ….

Now, if we define ${\mathrm{P}}_m=\left|{\mathsf{\Psi }}_m\times {\mathsf{\Psi }}_m\right|$, then it is easy to see that

$$P_m|\mathsf{\Psi } ⟩=C_m|{\mathsf{\Psi }}_m⟩$$

(7)

Equation (7) means that $P_m$ projects $|\mathsf{\Psi }⟩$ onto $|{\mathsf{\Psi }}_m⟩$, and for this reason $P_m$ is called a projector.

Another property which immediately follows from (5) and (7) is the following:

$$\left({\sum }_{n=0}^{\infty }{P}_n\right)|\mathsf{\Psi }⟩={\sum }_{n=0}^{\infty }{P}_n|\mathsf{\Psi }⟩={\sum }_{n=0}^{\infty }{C}_n|{\mathsf{\Psi }}_n⟩=|\mathsf{\Psi }⟩$$

(8)

which says that ${\sum }_{n=0}^{\infty }{P}_n=I$, where I is the identity operator.

Also, note that $P_n$ is a positive semi-definite (PSD) matrix.

Now, if we define $\varrho =\left|\mathsf{\Psi }\times \mathsf{\Psi }\right|$, then it is obvious that $\varrho$ is PSD and

$$\varrho =\left|\mathsf{\Psi }\times \mathsf{\Psi }\right|=\left({\sum }_{n=0}^{\infty }{C}_n|{\mathsf{\Psi }}_n ⟩\right)\left({\sum }_{m=0}^{\infty }{C}_m^{*}⟨{\mathsf{\Psi }}_m|\right)$$

(9)

As a result, ${\varrho }_{ij}=C_i{C}_j^{\mathrm{\ast }}$, and therefore $trace\left(\varrho \right){=\left|C_1\right|}^2$ + ${\left|C_2\right|}^2$ + ${\left|C_3\right|}^2$ + … = 1.

Now, if $y_m$ denotes the probability of outcome $m$, then

$$y_m=C_m{C}_m^{*}=trace\left(\varrho P_m\right)$$

(10)

For this reason, ϱ is called a density operator. The projection operators $P_1,P_2,P_3,\dots$ can be generalized to PSD matrices $M_1,M_2,M_3,\dots$, such that ${\sum }_{n=0}^{\infty }{M}_n=I$. In this case, they are referred to as POVMs.

Now, given the statistical data $y_1,\dots ,y_m$ and the POVMs $M_1,M_2,M_3,\dots$, the goal is to find a PSD density operator $\varrho$ that best fits the measurement data $y_1,\dots ,y_m$.

In other words, we want to solve the following optimization problem:

$$\begin{gathered} \min {\sum }_i{‖y_i-trace\left(\varrho M_i\right)‖}^2 \\ \hspace{1em}\hspace{1em}\hspace{1em}\mathrm{s}.\mathrm{t} trace\left(\varrho \right)=1 \& \varrho is PSD \end{gathered}$$

(11)

Optimization (11) is called quantum state tomography (QST) [2]. In quantum computing and quantum information theory, quantum state tomography (QST) is one of the key steps in determining the state of the quantum system, which is crucial as this is key to understanding and controlling the quantum system. The term “tomography” comes from the ancient Greek words “tomos” (“slice” or “section”) and “grapho” (“to draw” or “to write”) [21]. Regular X-ray tomography (such as CT scans in medicine) performs a 3D reconstruction of an object (which cannot be directly seen) by piecing together 2D X-ray images (measurements) taken from different angles or sections to build up a 3D picture of the original unknown object in the body. QST, to a large extent, is similar, but instead of 2D X-ray images (2D X-ray projections) taken from different angles or perspectives, QST uses multiple measurements on many identical copies of the same quantum system, each measured in a slightly different way (by projecting the state onto various bases). The outcomes of these measurements are gathered as statistical data. Again, like X-ray tomography, in which complex algorithms are used to process 2D X-ray data to reconstruct a 3D image in QST, mathematical optimization based on linear algebra, like (11), is used to reconstruct the density matrix $\varrho$ (which fully describes the quantum state). Having gathered the statistical data $y_1,\dots ,y_m$, what these optimization techniques (for instance, least squares fitting) do is to fit a model (the density matrix $\varrho$) that best fits the measurement data $y_1,\dots ,y_m$. Here, we must deal with statistical noise from quantum measurements and reconstruct the most probable quantum state, despite measurement imperfections. The main difference here is that while 3D reconstruction in X-ray tomography can be undertaken via a series of measurements on the same (classical) object, in the case of a single quantum particle, measurement perturbs the state of the quantum particle, often making its further investigation uninformative [21]. We use a source that creates many identical particles in the same unknown quantum state. So, tomography uses many identical particles, each measured in a slightly different way. By piecing together these measurements, scientists can build a picture of the original quantum state.

3. Proposed Adaptive Method for QST

As problem (11) does not have a closed-form solution, we need to use an iterative approach to solve it.

In [13], problem (11) is formulated as follows:

$$\begin{gathered} min{\sum }_i{‖y_i-trace\left(U{U}^{†}{M}_i\right)‖}^2 \\ \hspace{1em}\hspace{1em}\hspace{1em}s.t {‖U‖}^2=1,\hspace{1em}\hspace{1em}\hspace{1em}U\in C^{d\times r} \end{gathered}$$

(12)

in which the matrix $U$ is assumed to be low rank. Also, $‖U‖$ is the Frobenius norm of $U$, which means that

$${‖U‖}^2={\sum }_j{\sum }_i{‖U_{ij}‖}^2={\sum }_j{\sum }_i{U}_{ij}{U}_{ij}^{*}$$

(13)

Then, an Accelerated Gradient Descent (AGD) method called MiFGD is proposed [8], as follows:

$$U_{k+1}=Z_k-\eta \left[{\sum }_i\left(trace\left(Z_k{Z}_k^{†}{M}_i\right)-y_i\right)M_i\right]Z_k$$

(14)

$$Z_{k+1}=U_{k+1}+\mu (U_{k+1}-U_k)$$

(15)

in which $\eta$ and $\mu$ are two fixed step sizes.

In this paper, we present a method for finding a closed-form solution for the greedy optimal choice of $\eta$, which means choosing $\eta$ in a way that results in the biggest decrease in the objective function in that iteration. A description of the proposed method is given below and in Figure 1.

Here, it is worth mentioning that we keep the other step size $\mu$ constant, which is set to $\mu =0.95 \mathrm{i}\mathrm{n}\mathrm{o}\mathrm{u}\mathrm{r}\mathrm{e}\mathrm{x}\mathrm{p}\mathrm{e}\mathrm{r}\mathrm{i}\mathrm{m}\mathrm{e}\mathrm{n}\mathrm{t}\mathrm{s}$.

For this reason, in two consecutive steps, there is a possibility that while $\eta$ is chosen to result in a lower error in the next iteration, the step size $\mu$ will remain out of our control and may push the iterative approach away from what we hope to see for the next run. However, the method still performs much better than MiFGD overall. This is something that we will verify in our experiments (see Section 4).

Let us start with rewriting (15) as follows:

$$Z_{k+1}=U_{k+1}+\mu \left(U_{k+1}-U_k\right)=\left(1+\mu \right)U_{k+1}-{\mu U}_k$$

(16)

Now, if we plug in $U_{k+1}$ from (14), we arrive at the following:

$$Z_{k+1}=T_k+\eta S_k$$

(17)

in which

$$S_k=-\left(1+\mu \right)\left[{\sum }_i\left(trace\left(Z_k{Z}_k^{†}{M}_i\right)-y_i\right)M_i\right]Z_k$$

(18)

and

$$T_k=\left(1+\mu \right)Z_k-{\mu U}_k$$

(19)

As we want $Z_{k+1}$ to be normalized, we need to minimize

$${\sum }_i{‖y_i-trace\left({\displaystyle \frac{Z_{k+1}}{‖Z_{k+1}‖}}{\displaystyle \frac{Z_{k+1}^{†}}{‖Z_{k+1}‖}}{M}_i\right)‖}^2$$

We consider that

$$argmin{\sum }_i{‖y_i-trace\left({\displaystyle \frac{Z_{k+1}}{‖Z_{k+1}‖}}{\displaystyle \frac{Z_{k+1}^{†}}{‖Z_{k+1}‖}}{M}_i\right)‖}^2=argmin{\sum }_i{‖y_i{‖Z_{k+1}‖}^2-trace\left(Z_{k+1}{Z}_{k+1}^{†}{M}_i\right)‖}^2$$

(20)

It can be obtained that

$${‖Z_{k+1}‖}^2={‖T_k‖}^2+{\eta }^2{‖S_k‖}^2+2\eta {\sum }_j{\sum }_i T_{ij,k} S_{ij,k}^{*}$$

(21)

Also, note that ${‖T_k‖}^2,{‖S_k‖}^2$ and ${\sum }_j{\sum }_i{T}_{ij,k}{S}_{ij,k}^{\mathrm{\ast }}$ are real numbers independent of $\eta$; therefore, if we set ${a_k=‖T_k‖}^2,b_k={‖S_k‖}^2$, and $c_k={\sum }_j{\sum }_i{T}_{ij,k}{S}_{ij,k}^{\mathrm{\ast }}$, then

$${‖Z_{k+1}‖}^2=a_k+{b_k\eta }^2+{2c}_k\eta$$

(22)

Similarly, we have

$$trace\left(Z_{k+1}{Z}_{k+1}^{†}{M}_i\right)=trace\left(T_k{T}_k^{†}{M}_i\right)+{\eta }^{2}trace\left(S_k{S}_k^{†}{M}_i\right)+2\eta trace\left(T_k{S}_k^{†}{M}_i\right)$$

(23)

Now, if we define vectors $A,B,C$ and Y to be vectors whose $i$’th entries are $trace\left(T_k{T}_k^{†}{M}_i\right),trace\left(S_k{S}_k^{†}{M}_i\right),trace\left(T_k{S}_k^{†}{M}_i\right)$ and $y_i$, respectively, then from (20) and (23), we have

$$\begin{array}{cc}\hfill & argmin{\sum }_i{∥y_i-trace\left({\displaystyle \frac{Z_{k+1}}{∥Z_{k+1}∥}}{\displaystyle \frac{Z_{k+1}^{†}}{∥z_{k+1}∥}}{M}_i\right)∥}^2=argmin\parallel Y\parallel Z_{k+1}{\parallel }^2-A-{\eta }^{2}B-2\eta C{\parallel }^2=\hfill \\ \hfill & argmin{\left(Y{∥Z_{k+1}∥}^2-A-{\eta }^{2}B-2\eta C\right)}^T\left(Y{∥Z_{k+1}∥}^2-A-{\eta }^{2}B-2\eta C\right)=Y^{T}Y{∥Z_{k+1}∥}^4-\hfill \\ \hfill & 2Y^{T}A{∥Z_{k+1}∥}^2-2{\eta }^2{Y}^{T}B{∥Z_{k+1}∥}^2-4\eta Y^{T}C{∥Z_{k+1}∥}^2+A^{T}A+2{\eta }^2{A}^{T}B+4\eta A^{T}C+\hfill \\ \hfill & {\eta }^4{B}^{T}B+4{\eta }^3{B}^{T}C+4{\eta }^2{C}^{T}C\hfill \end{array}$$

(24)

It is worth noting that while $A,B,C$ and Y are vectors, ${Y^{T}Y,Y}^{T}A,Y^{T}B,Y^{T}C,A^{T}A$ $,A^{T}B,A^{T}C,B^{T}B,B^{T}C$ and $C^{T}C$ are all real numbers independent of $\eta$.

Now, from (22) and (24), we can conclude that we have to minimize the following 4th-order polynomial with respect to $\eta$:

$$\begin{array}{cc}\hfill & Y^{T}Y{a}^2-2Y^{T}Aa+A^{T}A+\eta \left(4Y^{T}Yac-4Y^{T}Ca-4Y^{T}Ac+4A^{T}C\right)+{\eta }^2\left(4C^{T}C+2A^{T}B-\right.\hfill \\ \hfill & \left.2Y^{T}Ba-2Y^{T}Ab-8Y^{T}Cc+4Y^{T}Y{c}^2+2Y^{T}Yab\right)+{\eta }^3\left(4Y^{T}Ybc-4Y^{T}Cb-4Y^{T}Bc+\right.\hfill \\ \hfill & \left.4B^{T}C\right)+{\eta }^4\left(Y^{T}Y{b}^2-2Y^{T}Bb+B^{T}B\right)\hfill \end{array}$$

(25)

This attains a minimum where the derivative with respect to $\eta$ is zero:

$$\begin{array}{cc}\hfill & \left(4Y^{T}Yac-4Y^{T}Ca-4Y^{T}Ac+4A^{T}C\right)+\eta \left(8C^{T}C+4A^{T}B-4Y^{T}Ba-4Y^{T}Ab-16Y^{T}Cc+\right.\hfill \\ \hfill & \left.8Y^{T}Y{c}^2+4Y^{T}Yab\right)+{\eta }^2\left(12Y^{T}Ybc-12Y^{T}Cb-12Y^{T}Bc+12B^{T}C\right)+{\eta }^3\left(4Y^{T}Y{b}^2-8Y^{T}Bb+\right.\hfill \\ \hfill & \left.4B^{T}B\right)=0\hfill \end{array}$$

(26)

Now, by solving (26), which is a humble cubic equation with respect to $\eta$, the optimal step size for the $k$th step is obtained.

Note that computing $A, B$, and $C$ at each step is the most time-consuming operation, which makes the proposed method almost three times slower at each iteration compared to MiFGD, but as we choose a much more optimized step size, our approach becomes faster overall. The numerical results are presented in Section 5.

4. Numerical Results

While what we have explained in the previous section applies to general quantum systems, in this section, we apply it to multi-qubit spin-half systems.

Suppose that we have a particle that only has two states, and the state of the particle has two entries:

$$\left(\begin{array}{c}\psi \left(x_1\right)\\ \psi \left(x_2\right)\end{array}\right)=\left( \begin{array}{c}\alpha \\ \beta \end{array}\right)$$

(27)

where α and β are two complex numbers and ${\left|\alpha \right|}^2$ and ${\left|\beta \right|}^2$ are the probabilities of being at each of the two states. The discretization of the Hamiltonian is a 2 by 2 matrix. On the other hand, since the Hamiltonian as an operator is expected to be Hermitian, which guarantees that the eigenvalues are real (and as a result, they correspond to the possible measurement outcomes of their corresponding observable), physicists investigate the space of all possible 2 by 2 Hamiltonians that satisfy the following equations:

$$H_{11}^{*}=H_{11}$$

(28)

$$H_{12}^{*}=H_{21}$$

(29)

$$H_{22}^{*}=H_{22}$$

(30)

As a result, both $H_{11}$ and $H_{22}$ should be real numbers, and $H_{21}$ should be the conjugate of $H_{12}$. After straightforward calculation, physicists arrive at the following as the general formula for the Hamiltonian in the aforementioned binary state.

$$H={\displaystyle \frac{1}{2}}\left(I+r_x{\sigma }_1+r_y{\sigma }_2+r_z{\sigma }_3\right)$$

(31)

in which

$${\sigma }_1=\left(\begin{array}{cc}0& 1\\ 1& 0\end{array}\right),{\sigma }_2=\left(\begin{array}{cc}0& -i\\ i& 0\end{array}\right),{\sigma }_3=\left(\begin{array}{cc}1& 0\\ 0& -1\end{array}\right)$$

(32)

which are called Pauli matrices.

Additionally, the following matrices can be defined:

$$S_x={\displaystyle \frac{h}{2}}{\sigma }_1,S_y={\displaystyle \frac{h}{2}}{\sigma }_2,S_z={\displaystyle \frac{h}{2}}{\sigma }_3$$

(33)

These satisfy the following properties:

$$S_x{S}_y-S_y{S}_x=ih{S}_z$$

(34)

$$S_y{S}_z-S_z{S}_y=ih{S}_x$$

(35)

$$S_z{S}_x-S_x{S}_z=ih{S}_y$$

(36)

The above three equalities remind physicists of angular momentum. For this reason, they relate them to the spin system. They call the system “spin-1/2” because of the coefficient ${\displaystyle \frac{h}{2}}$ (in Equation (33)), which is the component of angular momentum. These spin-1/2 systems are interesting since they have two states and are the building blocks for qubits (in digital quantum computers).

Now, if we assume that, for example, the density operator in the case of a single qubit is

$$\varrho ={\displaystyle \frac{1}{2}}\left(I+r_x{\sigma }_1+r_y{\sigma }_2+r_z{\sigma }_3\right)$$

(37)

then

$$trace\left(\varrho {\sigma }_1\right)={\displaystyle \frac{1}{2}}trace\left({\sigma }_1+r_x{\sigma }_1{\sigma }_1+r_y{\sigma }_2{\sigma }_1+r_z{\sigma }_3{\sigma }_1\right)={\displaystyle \frac{1}{2}}trace\left(r_{x}I\right)=r_x$$

(38)

and from (10) we can calculate $r_x$ from our measurement data. Similarly, we can calculate from our measurement data the other coefficients, $r_y$ and $r_z$, which allows us to identify the density matrix $\varrho$. This is the simplest form of QST. But for more complicated cases (multi-qubit systems), more has to be undertaken.

It is easy to see that

$${\sigma }_3\left[\begin{array}{c}1\\ 0\end{array}\right]={\displaystyle \frac{h}{2}}\left[\begin{array}{c}1\\ 0\end{array}\right]$$

(39)

$${\sigma }_3\left[\begin{array}{c}0\\ 1\end{array}\right]=-{\displaystyle \frac{h}{2}}\left[\begin{array}{c}0\\ 1\end{array}\right]$$

(40)

Here, $\left[\begin{array}{c}1\\ 0\end{array}\right]$ is called spin-up and is denoted by $|\uparrow ⟩$. Also, $\left[\begin{array}{c}0\\ 1\end{array}\right]$ is called spin down and is denoted by $|\downarrow ⟩$.

Therefore, Equations (39) and (40) are sometimes expressed as follows:

$${\sigma }_3|\uparrow ⟩={\displaystyle \frac{h}{2}}|\uparrow ⟩$$

(41)

$${\sigma }_3|\downarrow ⟩=-{\displaystyle \frac{h}{2}}|\downarrow ⟩$$

(42)

which indicates that the eigenstates of ${\sigma }_3$ are $|\uparrow ⟩$ and $|\downarrow ⟩$, with the corresponding eigenvalues ${\displaystyle \frac{h}{2}}$ and $-{\displaystyle \frac{h}{2}}$, respectively. Also, it can be seen that the following two vectors are the eigenvectors for ${\sigma }_1$:

$$|x,\uparrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩+|\downarrow ⟩\right)$$

(43)

$$|x,\downarrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩-|\downarrow ⟩\right)$$

(44)

and the following two are the eigenvectors for ${\sigma }_2$:

$$|y,\uparrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩+i|\downarrow ⟩\right)$$

(45)

$$|y,\downarrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩-i|\downarrow ⟩\right)$$

(46)

Furthermore, the real three-dimensional space that we live in relates to the two-dimensional complex vector space within which a qubit sits by rewriting Equation (27) as follows. Suppose that

$$\psi =\alpha |\uparrow ⟩+\beta |\downarrow ⟩$$

(47)

where ${{\left|\alpha \right|}^2+\left|\beta \right|}^2=1$. Using polar coordinates, we have

$$\begin{gathered} \psi =r_1{e}^{i{\varphi }_1}|\uparrow ⟩+r_2{e}^{i{\varphi }_2} |\downarrow ⟩=e^{i{\varphi }_1}\left(r_1|\uparrow ⟩+r_2{e}^{i{(\varphi }_2-{\varphi }_1)} |\downarrow ⟩\right) \\ =e^{i{\varphi }_1}\left(r_1|\uparrow ⟩+r_2{e}^{i\varphi } |\downarrow ⟩\right) \end{gathered}$$

(48)

But since $r_1^2+r_2^2=1$, we can write $r_1=\cos \left({\displaystyle \frac{\theta }{2}}\right),r_2=\sin \left({\displaystyle \frac{\theta }{2}}\right)$, and therefore

$$\psi =e^{i{\varphi }_1}\left(\cos \left({\displaystyle \frac{\theta }{2}}\right)|\uparrow ⟩+\sin \left({\displaystyle \frac{\theta }{2}}\right)e^{i\varphi } |\downarrow ⟩\right)$$

(49)

And if we ignore $e^{i{\varphi }_1}$, we end up with the following:

$$\psi =\cos \left({\displaystyle \frac{\theta }{2}}\right)|\uparrow ⟩+\sin \left({\displaystyle \frac{\theta }{2}}\right)e^{i\varphi }|\downarrow ⟩$$

(50)

which is called the Bloch sphere representation of the quantum state.

The Bloch sphere representation (50) is important as it helps us to figure out the state of a qubit on the surface of a unit sphere in real 3D space rather than complex 2D space. Now, in this coordinate system state, “z” (when $\theta =0$) is equivalent to $|\uparrow ⟩$ and “−z” (when $\theta =\pi$, $\varphi$ = 0) is equivalent to $|\downarrow ⟩$, which means that while in complex vector space $|\uparrow ⟩$ and $|\downarrow ⟩$ are orthogonal states, once we represent them on the Block sphere they are antipodal states that point in opposite directions. Indeed, angle $\theta$ is the angle between the unit vector representing the state of a qubit in 3D space and the axis z, and angle $\varphi$ is the angle between the projection of the unit vector on the x-y plane and the x axis. Now, $\theta ={\displaystyle \frac{\pi }{2}}$ and $\varphi =0$ are equivalent to $|x,\uparrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩+|\downarrow ⟩\right)$, and if $\theta ={\displaystyle \frac{\pi }{2}}$ and $\varphi =\pi$, we arrive at $|x,\downarrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩-|\downarrow ⟩\right)$, and the last two vectors lie on the x and –x axes, respectively. Also, $(\theta ,\varphi )=({\displaystyle \frac{\pi }{2}}$,${\displaystyle \frac{\pi }{2}})$ corresponds to $|y,\uparrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩+i|\downarrow ⟩\right)$, which is in the direction of the y axis and, $(\theta ,\varphi )=({\displaystyle \frac{\pi }{2}}$,$-{\displaystyle \frac{\pi }{2}})$ corresponds to $|y,\downarrow ⟩={\displaystyle \frac{1}{\sqrt{2}}}\left(|\uparrow ⟩-i|\downarrow ⟩\right)$, which is in the direction of the –y axis. Moreover, as we have

$$|\uparrow ⟩⟨\uparrow |+|\downarrow ⟩⟨\downarrow |=\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)=I$$

(51)

$$|x,\uparrow ⟩⟨x,\uparrow |+|x,\downarrow ⟩⟨x,\downarrow |=\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)=I$$

(52)

$$|y,\uparrow ⟩⟨y,\uparrow |+|y,\downarrow ⟩⟨y,\downarrow |=\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)=I$$

(53)

in [13], the following three bases are used for QST:

$$B_1=\left\{|x,\uparrow ⟩,|x,\downarrow ⟩\right\}$$

(54)

$$B_2=\left\{|y,\uparrow ⟩,⟨y,\downarrow |\right\}$$

(55)

$$B_3=\left\{|\uparrow ⟩,|\downarrow ⟩\right\}$$

(56)

However, in [11], more complicated bases are introduced, as follows:

$$B_1=\left\{W_1^T,W_2^T\right\}$$

(57)

$$B_2=\left\{W_3^T,W_4^T\right\}$$

(58)

$$B_3=\left\{W_5^T,W_6^T\right\}$$

(59)

where $W_1,\dots ,W_6$ are the rows of the following matrix:

$$W=\left[\begin{array}{cc}\cos \left(\theta /2\right)& -\mathrm{isin}\left(\theta /2\right)\\ -\mathrm{isin}\left(\theta /2\right)& \cos \left(\theta /2\right)\\ \cos \left(\theta /2\right)& -\sin \left(\theta /2\right)\\ \sin \left(\theta /2\right)& \cos \left(\theta /2\right)\\ \cos \left(\theta /2\right)-\mathrm{isin}\left(\theta /2\right)& 0\\ 0& \cos \left(\theta /2\right)+\mathrm{isin}\left(\theta /2\right)\end{array}\right]$$

(60)

Now, again, similar to (51)–(53), we have

$$W_1^T{W}_1+W_2^T{W}_2=I$$

(61)

$$W_3^T{W}_3+W_4^T{W}_4=I$$

(62)

$$W_5^T{W}_5+W_6^T{W}_6=I$$

(63)

To obtain the above formulas, remember that, for example, what we mean by $W_1^T$ is $\left[\begin{array}{c}\cos \left(\theta /2\right)\\ \mathrm{isin}\left(\theta /2\right)\end{array}\right]$, not $\left[\begin{array}{c}\cos \left(\theta /2\right)\\ -\mathrm{isin}\left(\theta /2\right)\end{array}\right]$.

We create our data according to the procedure explained in [11]. As mentioned in [2], the reason for choosing this kind of procedure is that it allows for applications in which the measurement matrices are ill conditioned [22,23,24].

To be more specific, the proposed procedure selects (with repetitions) $n$ rows of matrix $W$ in $6^n$ different ways, and for each of these choices we compute the tensor products of the selected rows. Then, we come up with $s=6^n$ different row vectors, $A_1,\dots ,A_s$, each of which with $d=2^n$ entries. Now, for an $n$-qubit system, the POVMs are $M_1=A_1^T{A}_1,M_2=A_2^T{A}_2,\dots ,M_s=A_s^T{A}_s$. Also, a random PSD matrix $\varrho$ is created and the simulated generated data are constructed by the relation $y_i=trace\left(\varrho M_i\right)+{\epsilon }_i$, where ${\epsilon }_i$ is a Gaussian noise term. Now, given the POVMs $M_1=A_1^T{A}_1,M_2=A_2^T{A}_2,\dots ,M_s=A_s^T{A}_s$ and the simulated measurement data $y_1,\dots ,y_s$, the QST algorithm should be able to find a PSD matrix $\varrho$ such that $y_i\approx trace\left(\varrho M_i\right)$, for which we solve (12) using the proposed method. As our simulated data are constructed by $y_i=trace\left(\varrho M_i\right)+{\epsilon }_i$, we expect that the optimal value of the problem (12) will be ${\sum }_i{‖{\epsilon }_i‖}^2$, which is around 0.003 in all our experiments. So, we can approximately measure the optimality gap.

As an illustrative example of how POVMs are created, let us take n = 3. Also, suppose that $\theta ={\displaystyle \frac{\pi }{2}}$. Therefore, the matrix $W$ is as follows:

$$W={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1& -i\\ -\mathrm{i}& 1\\ 1& -1\\ 1& 1\\ 1-\mathrm{i}& 0\\ 0& 1+\mathrm{i}\end{array}\right]$$

(64)

It is easy to check that (61)–(63) are verified.

$$W_1^T{W}_1+W_2^T{W}_2={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{c}1\\ i\end{array}\right]\times {\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1& -i\end{array}\right]+{\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{c}i\\ 1\end{array}\right]\times {\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}-i& 1\end{array}\right]=\left[\begin{array}{cc}1& 0\\ 0& 1\end{array}\right]=I$$

$$W_3^T{W}_3+W_4^T{W}_4={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{c}1\\ -1\end{array}\right]\times {\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1& -1\end{array}\right]+{\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{c}1\\ 1\end{array}\right]\times {\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1& 1\end{array}\right]=\left[\begin{array}{cc}1& 0\\ 0& 1\end{array}\right]=I$$

$$W_5^T{W}_5+W_6^T{W}_6={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{c}1+i\\ 0\end{array}\right]\times {\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1-i& 0\end{array}\right]+{\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{c}0\\ 1-i\end{array}\right]\times {\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}0& 1+i\end{array}\right]=\left[\begin{array}{cc}1& 0\\ 0& 1\end{array}\right]=I$$

Now, we have ${s=6}^3$ different ways to select (with repetitions) $3$ rows of matrix $W$, which we denote by the following 216 rows:

$$\begin{gathered} \begin{array}{ccc}1& 1& 1\\ ⋮& ⋮& ⋮\\ 1& 1& 6\end{array} \\ \begin{array}{ccc}1& 2& 1\\ ⋮& ⋮& ⋮\\ 1& 2& 6\end{array} \\ \begin{array}{ccc}⋮& ⋮& ⋮\\ 1& 6& 1\\ ⋮& ⋮& ⋮\end{array} \\ \begin{array}{ccc}1& 6& 6\\ ⋮& ⋮& ⋮\\ 6& 6& 1\end{array} \\ \begin{array}{ccc}6& 6& 2\\ ⋮& ⋮& ⋮\\ 6& 6& 6\end{array} \end{gathered}$$

Then, for example, for the 9th row, which is [1 2 3], we have to pick the corresponding rows in W, which are

$$W_1={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1& -i\end{array}\right]$$

$$W_2={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}-i& 1\end{array}\right]$$

$$W_3={\displaystyle \frac{1}{\sqrt{2}}}\left[\begin{array}{cc}1& -1\end{array}\right]$$

Now, as the tensor product of two row vectors is defined as

$$a\otimes b=\left[a_1\dots a_n\right]\otimes \left[b_1\dots b_n\right]=[a_1{b}_1\dots a_1{b}_n\dots a_n{b}_1\dots a_n{b}_n]$$

we have

$$W_1\otimes W_2={\displaystyle \frac{1}{2}}\left[\begin{array}{cc}1& -i\end{array}\right]\otimes \left[\begin{array}{cc}-i& 1\end{array}\right]={\displaystyle \frac{1}{2}}[\begin{array}{cc}-i& 1\end{array}-1-i]$$

and therefore

$$\begin{gathered} {A_{10}=W}_1\otimes W_2\otimes W_3={\displaystyle \frac{1}{2\sqrt{2}}}\left[\begin{array}{cc}-i& 1\end{array}-1-i\right]\otimes \left[\begin{array}{cc}1& -1\end{array}\right] \\ ={\displaystyle \frac{1}{2\sqrt{2}}}[\begin{array}{cc}-i& i\end{array} 1-1-1 1-i i] \end{gathered}$$

In a similar way, $A_1,\dots ,A_{216}$ are constructed. Now, for a $3$-qubit system, the POVMs are $M_1=A_1^T{A}_1,M_2=A_2^T{A}_2,\dots ,M_{216}=A_{216}^T{A}_{216}$, consisting of 216 matrices of dimensions of 8 by 8.

We apply the proposed method on a n-qubit system, where in our case n = 6, 7, 8 each with $\theta ={\displaystyle \frac{\pi }{3}} \mathrm{o}\mathrm{r} \theta ={\displaystyle \frac{\pi }{2}}$ and rank($U$) = 10 or rank($U$) = d.

As a result, we will report the comparison of our method with MiFGD for 12 different configurations.

For n = 6, we compare the performance of the two algorithms for four different configurations, $(\theta ,rank)=({\displaystyle \frac{\pi }{2}},d)$, $(\theta ,rank)=({\displaystyle \frac{\pi }{2}},10)$, $(\theta ,rank)=({\displaystyle \frac{\pi }{3}},d)$, and $(\theta ,rank)=({\displaystyle \frac{\pi }{3}},10)$, as shown in Figure 2, Figure 3, Figure 4 and Figure 5. As it can be seen, our algorithm reaches the same accuracy of MiFGD approximately 25 times faster.

To be more specific, for instance, in the first configuration (as seen in Figure 2), after 3480 iterations and spending 318 s, MiFGD reaches a normalized error of 0.0082, while our method after just 61 iterations in 15 s reaches a normalized error of 0.0080.

As can be seen, the proposed method takes 0.24 s per iteration, while MiFGD takes 0.09 s, which means that the proposed method is 2.7 times slower per iteration, but overall much faster thanks to a very well-optimized step length.

A summary of the results is presented in

Table 2. Comparison of MiFGD and the proposed method for n = 6.

$(\mathit{\theta },\mathit{r}\mathit{a}\mathit{n}\mathit{k})$	MiFGD	Proposed Method
	Time [s], Number of Iterations, Normalized Error
$({\displaystyle \frac{\pi }{2}},d)$	(318, 3480, 0.0082)	(15, 61, 0.0080)
$({\displaystyle \frac{\pi }{2}},10)$	(364, 3960, 0.0081)	(15, 59, 0.0079)
$({\displaystyle \frac{\pi }{3}},d)$	(497, 5196, 0.0080)	(21, 81, 0.0078)
$({\displaystyle \frac{\pi }{3}},10)$	(578, 6074, 0.0080)	(20, 78, 0.0077)

. As it can be seen, although the elapsed time per iteration when using the proposed method is higher due to the fact that the number of expensive operations (computing $trace\left(T_k{T}_k^{†}{M}_i\right),trace\left(S_k{S}_k^{†}{M}_i\right)$ and $trace\left(T_k{S}_k^{†}{M}_i\right)$) is tripled compared to MiFGD (in which the only expensive operation is the calculation of $trace\left(Z_k{Z}_k^{†}{M}_i\right)$), both the number of iterations and the elapsed time have decreased in the proposed method.

In the case of n = 7, for the first configuration, MiFGD performed 3229 iterations in 3488 s, which is approximately 1 s per iteration, while the proposed method completed 74 iterations in 225 s, which is 3 s per iteration. However, overall, it performed much better, as can be seen from Figure 6, Figure 7, Figure 8 and Figure 9. Indeed, in the proposed method, in each step, we have to perform three expensive operations to calculate $trace\left(T_k{T}_k^{†}{M}_i\right),trace\left(S_k{S}_k^{†}{M}_i\right)$ and $trace\left(T_k{S}_k^{†}{M}_i\right)$ (as opposed to MiFGD, in which the only expensive operation is the calculation of $trace\left(Z_k{Z}_k^{†}{M}_i\right)$), yet the elapsed time decreased. This is because once $trace\left(T_k{T}_k^{†}{M}_i\right), trace\left(S_k{S}_k^{†}{M}_i\right)$ and $trace\left(T_k{S}_k^{†}{M}_i\right)$ are computed, due to the optimal choice of $\eta$, we have a better value for $trace\left(Z_{k+1}{Z}_{k+1}^{†}{M}_i\right)$, which can be calculated from the following equation (Equation (23)):

$$trace\left(Z_{k+1}{Z}_{k+1}^{†}{M}_i\right)=trace\left(T_k{T}_k^{†}{M}_i\right)+{\eta }^{2}trace\left(S_k{S}_k^{†}{M}_i\right)+2\eta trace\left(T_k{S}_k^{†}{M}_i\right)$$

which approximates the experimental measurement data $y_i$ (see Equation (12)).

A summary of the results is presented in

Table 3. Comparison of MiFGD and the proposed method for n = 7.

$(\mathit{\theta },\mathit{r}\mathit{a}\mathit{n}\mathit{k})$	MiFGD	Proposed Method
	Time [s], Normalized Error
$({\displaystyle \frac{\pi }{2}},d)$	(3488, 0.0081)	(225, 0.0076)
$({\displaystyle \frac{\pi }{2}},10)$	(3973, 0.0082)	(224, 0.0076)
$({\displaystyle \frac{\pi }{3}},d)$	(4640, 0.0082)	(244, 0.0076)
$({\displaystyle \frac{\pi }{3}},10)$	(5523, 0.0082)	(241, 0.0082)

. As can be seen from both the table and the figures, when we restrict the rank of the matrix $U$ to 10, MiFGD struggles more noticeably to converge.

For n = 8, in the first configuration, MiFGD took 617.5 s for each iteration while the proposed method took 1596 s per iteration. This means the proposed algorithm is approximately 2.6 times slower per iteration, as it performs more calculations to avoid an uneducated step, but overall it is much faster to converge, as can be seen from both

Table 4. Comparison of MiFGD and the proposed method for n = 8.

$(\mathit{\theta },\mathit{r}\mathit{a}\mathit{n}\mathit{k})$	MiFGD	Proposed Method
	Time [s], Normalized Error
$({\displaystyle \frac{\pi }{2}},d)$	(15,439, 0.5384)	(14,550, 0.1032)
$({\displaystyle \frac{\pi }{2}},10)$	(14,396, 0.5239)	(13,915, 0.0890)
$({\displaystyle \frac{\pi }{3}},d)$	(15,782, 0.4764)	(14,992, 0.0630)
$({\displaystyle \frac{\pi }{3}},10)$	(15,236, 0.4073)	(15,213, 0.0685)

and Figure 10, Figure 11, Figure 12 and Figure 13.

Again, as can be seen from both the table and the figures, when we restrict the rank of the matrix $U$ to 10, MiFGD struggles more noticeably to converge compared to the case in which rank($U)$ = d.

Another interesting thing is that while the proposed method is supposed to choose the optimal step size, we can see some oscillation noticeably at the beginning. The reason for the oscillation is that, in equations $U_{k+1}=Z_k-\eta \left[{\sum }_i\left(trace\left(Z_k{Z}_k^{†}{M}_i\right)-y_i\right)M_i\right]Z_k$ and $Z_{k+1}=U_{k+1}+\mu (U_{k+1}-U_k)$ (Equations (14) and (15)), two different step lengths, $\eta$ and $\mu$, are involved. What we have undertaken so far in the proposed method is finding the optimal $\eta$, while the other one is fixed ($\mu =0.95)$. Indeed, the computation of $Z_{k+1}$ will be influenced not only by $U_{k+1}$, but also by $U_k$ from the previous steps. Intuitively, $\mu$ determines to what extent the method “remembers” the past iterations (for instance, $\mu =0$ means no “memories” from the past iterations). As a result, while the random starting point might be very far from optimal, it gets reflected in the “memory” of the method and it takes a while before it fades away and gets overshadowed by the accumulation of new memories. As a result, we cannot expect a strictly decreasing error. This issue is something that we will address shortly.

In all the previous experiments, we considered $\mu =0.95$. The main reason was that this keeps the number of expensive operations small, but we could have merged (17) and (19) as follows: $Z_{k+1}=\left(1+\mu \right)Z_k-{\mu U}_k+\eta S_k$. This way, by having computed $trace\left(Z_k{Z}_k^{†}{M}_i\right), trace\left(U_k{U}_k^{†}{M}_i\right),trace\left(S_k{S}_k^{†}{M}_i\right), trace\left(Z_k{U}_k^{†}{M}_i\right), trace\left(Z_k{S}_k^{†}{M}_i\right)$ and $trace\left(U_k{S}_k^{†}{M}_i\right)$, and by having a fixed $\mu$, we can quickly (without much calculation) compute $T_k=\left(1+\mu \right)Z_k-{\mu U}_k$ and then compute $trace\left(T_k{T}_k^{†}{M}_i\right), trace\left(S_k{S}_k^{†}{M}_i\right)$ and $trace\left(T_k{S}_k^{†}{M}_i\right)$, and then we can calculate the linear combinations of $trace\left(Z_k{Z}_k^{†}{M}_i\right), trace\left(U_k{U}_k^{†}{M}_i\right), trace\left(S_k{S}_k^{†}{M}_i\right), trace\left(Z_k{U}_k^{†}{M}_i\right), trace\left(Z_k{S}_k^{†}{M}_i\right)$ and $trace\left(U_k{S}_k^{†}{M}_i\right)$ and plug them into (23) to find the optimal step length $\eta$, as before. This means that by increasing the number of expensive operations per iteration from 3 to 6, we will be able to use grid search (for instance, varying $\mu$ from 0.01 to 0.99 by increments of 0.01) to adaptively obtain a good choice of $\mu$ for every iteration. Below, we compare this new version of adaptively selecting $\mu$ versus fixed $\mu$ ($\mu =0.95$) for the case of n = 8.

As can be seen from the Figure 14, Figure 15, Figure 16 and Figure 17, with this slight modification, we no longer have the oscillatory behavior, and the convergence is slightly faster. Also, note that the computational cost per iteration for the case of adaptive $\mu$ is two times the cost for the case of fixed $\mu$, resulting in faster convergence. However, still, it seems that $\eta$ has the main crucial role compared to $\mu$.

5. Conclusions

In this paper, we proposed a novel method for achieving a closed-form solution for optimal step length in an AGD approach to QST, leading to significantly improved performance compared to existing methods. Although the proposed method is three times slower per iteration, the numerical results demonstrate that it is more than ten times faster overall due to the educated step size that is chosen in each iteration. The key innovation of our method lies in the adaptive selection of the step length η, which ensures that each iteration leads to the maximum possible reduction in the objective function. This approach leverages the current state information to make more informed adjustments, thereby enhancing the overall efficiency of the algorithm. Looking ahead, this adaptive step-size strategy opens up several promising avenues for future research. One potential direction is to integrate similar adaptive step-size methods into more sophisticated gradient-based algorithms where the curvature information is better encoded in the iterative approach.