IEEE Transactions on Instrumentation and Measurement

Online Optimization Algorithm of the Quantum State Filter With Disturbance and Noise and Its Convergence Study

Shuang Cong, Weiyi Qin, Tao Wang

Published Jan 1, 2023• 2 citations

Abstract

An online quantum state filter (OQSF) optimization algorithm in the existence of the sparse disturbance and Gaussian noise is proposed in this paper. The optimization algorithm is based on the continuous weak measurements (CWM) and the online measurement record sequence constructed. The OQSF problem is decomposed into three subproblems, and three variables are estimated in real-time at the same time. The convergence OQSF algorithm proposed is strictly proved by means of two lemmas proof of the lower bound function of the distance between the optimal solution and original one having sufficient decreasing space. By comparing the performances with existing algorithms, the developed OQSF algorithm proposed demonstrates advantages in the numerical performance comparisons.

DOI: 10.1109/tim.2023.3289565

Related papers

A Comparative Study on the Convergence Rate of Two Online Quantum State Reconstruction Algorithms

Shuang Cong, Weiyi Qin

In this paper, the convergence rates of two algorithms for the online quantum states reconstruction with Gaussian measurement noise in continuous weak measurement are studied, one is the online proximal gradient-based alternating direction method of multipliers (OPG-ADMM) algorithm, and another is Kalman fitering-based quantum state estimation (KF-QSE) algorithm. For the OPG-ADMM algorithm, by defining the loss function of the optimization function and the constraint condition in the times T tracking process, the convergence rate theorem of the two loss functions is obtained and proved. Then, the convergence order of the normalized distance of the density matrix under the OPG-ADMM algorithm is derived from the conclusion of the theorem. For the KF-QSE algorithm, after defining the loss function of the optimization function, the theorem of the convergence order of the loss function is investigated. Then, the convergence order of the normalized distance of the KF-QSE algorithm is deduced from the conclusion of the theorem. Finally, in the numerical simulation experiments, we use the normalized distance of density matrix as the indicator and use two algorithms for online reconstruction of the 4-bit quantum system. The derived performance of algorithm convergence rates are verified by the comparison and analysis of the results.

arXiv:2410.09056International Conference on Intelligent Control and Information ProcessingFeb 21, 20260 citations

Quantum State Filter With Disturbance and Noise

Jiaojiao Zhang, Shuang Cong, Qing Hua Ling +2 more

A quantum state filter (QSF) is proposed in this paper to estimate a low-rank quantum density matrix from informationally incomplete and contaminated measurements. There exist sparse disturbances on the quantum density matrix and Gaussian noise in the measurements. A proximal Jacobian variant of the alternating direction method of multipliers (PJ-ADMM) is proposed to design the QSF. The closed-form solutions to three resulting subproblems are given and the iterative QSF is developed. The proposed QSF is proved to be convergent and its superiority is demonstrated in the numerical illustrations compared with different state-of-the-art methods.

IEEE Transactions on Automatic ControlAug 12, 201910 citations

Efficient and Fast Optimization Algorithms for Quantum State Filtering and Estimation

Kun Zhang, Shuang Cong, Jiao Ding +2 more

In this paper, based on Alternating Direction Multiplier Method (ADMM) and Compressed Sensing (CS), we develop three types of novel convex optimization algorithms for the quantum state estimation and filtering. Considering sparse state disturbance and measurement noise simultaneously, we propose a quantum state filtering algorithm. At the same time, the quantum state estimation algorithms for either sparse state disturbance or measurement noise are proposed, respectively. Contrast with other algorithms in literature, simulation experiments verify that all three algorithms have low computational complexity, fast convergence speed and high estimation accuracy at lower measurement rates.

International Conference on Intelligent Control and Information ProcessingDec 1, 20192 citations

Regret Lower Bound for Online Learning of Quantum States with Logarithmic Loss, with Applications to Quantum State Tomography and Confidence Sequences for Matrix Means

Yen-Huan Li, Wei-Fu Tseng

We study the problem of online learning of quantum states with logarithmic loss, which is a quantum generalization of online portfolio selection and has applications to quantum state tomography, the task of estimating an unknown quantum state from measurement outcomes. We first establish a regret lower bound, showing that the regret rates of Exponential Weights and the algorithm of Tseng et al. (2025) have optimal polynomial dependence on the dimension. Our analysis leads to two further results. First, our lower-bound proof leads to a quantum state tomography algorithm that is sample optimal up to polylogarithmic factors in the sample size. Second, we develop an algorithm for constructing confidence sequences for the mean of a matrix-valued random variable. A numerical experiment shows that the latter algorithm is competitive with existing methods.

cs.LGCross-listedarXiv:2610.21273Oct 16, 20260 citations

An Efficient Online Estimation Algorithm for Evolving Quantum States

Kun Zhang, Shuang Cong, Yaru Tang +1 more

In this paper, we propose an online optimization algorithm for estimating state density in free evolution quantum systems from noisy continuous weak measurements. The problem is formulated via sparsity-promoting semidefinite programming, and an online quantum state estimation algorithm is developed based on online proximal gradient and alternating direction multiplier method. The proposed algorithm is computationally efficient and further features high robustness to measurement noise. The merits of the approach are illustrated by numerical experiments in 1-, 2-, 3-, and 4-qubit systems.

European Signal Processing Conference (EUSIPCO)Dec 18, 20204 citations

Online quantum state tomography of N-qubit via continuous weak measurement and compressed sensing

Sajede Harraz, Shuang Cong, Kezhi Li

In this paper, we propose an online state tomography method for [Formula: see text]-qubit quantum system based on the continuous weak measurement and compressed sensing (CS). The quantum system is described by stochastic master equation. The continuous weak measurement operators for the [Formula: see text]-qubit quantum system, which are indirectly acted on the quantum system, are derived according to the measurement operator results of two-level quantum system. The online time-varying measurement operators are obtained by means of the dynamic evolution equation of the system. The quantum state is online estimated by solving the optimization problem of minimizing the two-norm with the positive definite constraints of density matrix, and we use the nonnegative least squares algorithm to solve the optimization problem. CS theory is used to reduce the number of the measurements in the process of online state estimation. In the numerical experiments, we study the effects of external control field, measurement rate and the different numbers of qubits on the performance in the proposed method. The minimum required numbers of measurements for 2, 3, 4 and 5 qubits are found. The normalized distance and fidelity of our proposed method can achieve satisfying accuracy with small number of measurements.

International Journal of Quantum InformationOct 30, 20202 citations