Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2410.09056 · International Conference on Intelligent Control and Information Processing

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

Shuang Cong, Weiyi Qin

Published Feb 21, 2026• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.1109/icicip67436.2026.11417600

Related papers

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, 2020•4 citations

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

Shuang Cong, Weiyi Qin, Tao Wang

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.

IEEE Transactions on Instrumentation and Measurement•Jan 1, 2023•2 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 Information•Oct 30, 2020•2 citations

Efficient online quantum state estimation using a matrix-exponentiated gradient method

Akram Youssry, Christopher Ferrie, Marco Tomamichel

In this paper, we explore an efficient online algorithm for quantum state estimation based on a matrix-exponentiated gradient method previously used in the context of machine learning. The state update is governed by a learning rate that determines how much weight is given to the new measurement results obtained in each step. We show convergence of the running state estimate in probability to the true state for both noiseless and noisy measurements. We find that in the latter case the learning rate has to be chosen adaptively and decreasing to guarantee convergence beyond the noise threshold. As a practical alternative we then propose to use running averages of the measurement statistics and a constant learning rate to overcome the noise problem. The proposed algorithm is numerically compared with batch maximum-likelihood and least-squares estimators. The results show a superior performance of the new algorithm in terms of accuracy and runtime complexity.

arXiv:1807.01852•New Journal of Physics•Feb 4, 2019•32 citations

RECONSTRUCTING PURE 14-QUBIT QUANTUM STATES IN THREE HOURS USING COMPRESSIVE SENSING

Zhilin Hu, Kezhi Li, Shuang Cong +1 more

Reconstructing high-dimensional quantum state accurately with noise is a challenging problem, because of the probabilistic measurements of quantum states and the exponential growth of the computation in terms of the number of qubits. In this paper, an improved Alternating Direction Multiplier Method (ADMM) is proposed for the quantum state estimation based on the lower limit of the measurement rate inferred by Compressive Sensing (CS) theory. The proposed algorithm solves the density matrix correlation subproblems by introducing a proximal gradient step to avoid large-scale matrix inversion. Furthermore, it reduces the computational complexity by changing the order of operations. The algorithm we proposed can dramatically reduces the reconstruction time on the premise of achieving high reconstruction accuracy. When the number of qubits n = 14 and sampling rate η = 0.0819%, it takes about 3 hours to reconstruct the density matrix of a pure quantum state with the reconstruction error of 4.97e-2 and fidelity of 98.79%.

IFAC-PapersOnLine•Jan 1, 2019•4 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 Processing•Dec 1, 2019•2 citations
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.
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.
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.
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.
In this paper, we explore an efficient online algorithm for quantum state estimation based on a matrix-exponentiated gradient method previously used in the context of machine learning. The state update is governed by a learning rate that determines how much weight is given to the new measurement results obtained in each step. We show convergence of the running state estimate in probability to the true state for both noiseless and noisy measurements. We find that in the latter case the learning rate has to be chosen adaptively and decreasing to guarantee convergence beyond the noise threshold. As a practical alternative we then propose to use running averages of the measurement statistics and a constant learning rate to overcome the noise problem. The proposed algorithm is numerically compared with batch maximum-likelihood and least-squares estimators. The results show a superior performance of the new algorithm in terms of accuracy and runtime complexity.
Reconstructing high-dimensional quantum state accurately with noise is a challenging problem, because of the probabilistic measurements of quantum states and the exponential growth of the computation in terms of the number of qubits. In this paper, an improved Alternating Direction Multiplier Method (ADMM) is proposed for the quantum state estimation based on the lower limit of the measurement rate inferred by Compressive Sensing (CS) theory. The proposed algorithm solves the density matrix correlation subproblems by introducing a proximal gradient step to avoid large-scale matrix inversion. Furthermore, it reduces the computational complexity by changing the order of operations. The algorithm we proposed can dramatically reduces the reconstruction time on the premise of achieving high reconstruction accuracy. When the number of qubits n = 14 and sampling rate η = 0.0819%, it takes about 3 hours to reconstruct the density matrix of a pure quantum state with the reconstruction error of 4.97e-2 and fidelity of 98.79%.
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.