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

Quantum Reports

On-Line Prediction of the Quantum Density Matrix

Mehrzad Soltani, Mark J. Balas

Published Dec 22, 2025• 0 citations
Publisher

Abstract

Time evolution of open quantum systems is governed by the master equation. The master equation, which is a matrix formalism, is the time derivative of the density matrix, which contains the complete information on the state of a quantum system. Instead of implementing successive measurements on repeated identically prepared systems, which are inevitably imperfect and can only be performed a limited number of times, a state estimator can be designed to obtain the whole information about the state of a quantum system represented in a density matrix. Trace-one and positive semi-definite properties of the density matrix arising from physical constraints have to be preserved during state estimation in quantum systems. To address this challenge, we present a projection technique that incorporates Dykstra’s algorithm and physical constraints into state estimation. This technique, which is an iterative method, ensures convergence and includes a designed oracle that projects the estimated state into intersections of admissible closed convex sets. The oracle structure is constructed using Hilbert projection, which looks for the best approximation of the projected estimated state within a Hilbert space into a closed convex set. According to the Hilbert projection theorem, this proposed oracle guarantees the existence and uniqueness of the best approximation of the projected state.

DOI
10.3390/quantum8010001

Related papers

Closed-Form Hilbert Projection for Quantum State Observers

Maison Clouâtré, Mark J. Balas, Makhin Thitsa

Designing an observer of an unknown quantum density operator is difficult because the operator must be Hermitian positive semidefinite with unit trace. In this paper, we derive a closed-form solution for projecting an arbitrary matrix onto the set of valid density operators. This allows us to design linear quantum state observers and retract the observer’s state back to this set while retaining the exponential convergence rate of the linear observer. The derived closed-form projection can be used alongside any quantum state estimation technique to produce a valid state estimate without increasing the state estimation error.

Proceedings of the ... American Control Conference/Proceedings of the American Control Conference•May 31, 2023•3 citations

Maximum-likelihood estimation of the density matrix

Konrad Banaszek, Giacomo Mauro D’Ariano, Matteo G. A. Paris +1 more

We present a universal technique for quantum-state estimation based on the maximum-likelihood method. This approach provides a positive-definite estimate for the density matrix from a sequence of measurements performed on identically prepared copies of the system. The method is versatile and can be applied to multimode radiation fields as well as to spin systems. The incorporation of physical constraints, which is natural in the maximum-likelihood strategy, leads to a substantial reduction of statistical errors. Numerical implementation of the method is based on a particular form of the Gauss decomposition for positive-definite Hermitian matrices.

arXiv:quant-ph/9909052•Physical Review A•Dec 8, 1999•341 citations

Feshbach Projection Formalism for Open Quantum Systems

Dariusz Chruściński, Andrzej Kossakowski

We provide a new approach to open quantum systems which is based on the Feshbach projection method. Instead of looking for a master equation for the dynamical map acting in the space of density operators we provide the corresponding equation for the evolution in the Hilbert space of the amplitude operators. Its solution enables one to construct a legitimate quantum evolution (completely positive and trace preserving). Our approach, contrary to the standard Nakajima-Zwanzig method, allows for a series of consistent approximations resulting in a legitimate quantum evolution. The new scheme is illustrated by the well-known spin-boson model beyond the rotating wave approximation. It is shown that the presence of counterrotating terms dramatically changes the asymptotic evolution of the system.

arXiv:1302.6218•Physical Review Letters•Jul 30, 2013•36 citations

Projection methods in quantum information science

Yuen-Lam Cheung, Dmitriy Drusvyatskiy, Chi-Kwong Li +2 more

We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $\{ρ_1, \dots, ρ_k\}$ to another such set $\{\hatρ_1, \dots, \hatρ_k\}$. In other words, we must find a {\em completely positive linear map}, if it exists, that maps a given set of density matrices to another given set of density matrices. This problem, in turn, is an instance of a positive semi-definite feasibility problem, but with highly structured constraints. The nature of the constraints makes projection based algorithms very appealing when the number of variables is huge and standard interior point-methods for semi-definite programming are not applicable. We provide emperical evidence to this effect. We moreover present heuristics for finding both high rank and low rank solutions. Our experiments are based on the \emph{method of alternating projections} and the \emph{Douglas-Rachford} reflection method.

arXiv:1407.6604•Jul 24, 2014•0 citations

Rank-Adaptive Matrix-Free Atomic Quantum State Tomography

Amirhossein Taherpour, Alireza Sadeghi, Georgios B. Giannakis

Quantum state tomography estimates an unknown density operator from measurement data. Dense reconstruction however, can be impractical for many-qubit systems because the Hilbert-space dimension grows exponentially. This contribution develops a rank-adaptive matrix-free approach to low-rank quantum state tomography based on rank-one atomic coordinates. The density operator is represented as a convex combination of pure-state atoms, which preserves positivity and unit trace while avoiding dense density, measurement, and gradient matrices. The resultant algorithm combines atom updates, simplex-constrained coefficient reweighting, and periodic spectral refactorization using only predicted probability vectors, atom vectors, and descriptor-level measurement actions. These computations decompose across measurement outcomes, and admit a master--worker implementation with the measurements partitioned across workers. A rank penalty adapts the representation size during optimization. Provable feasibility, prediction consistency, monotone descent of the penalized objective, and an exact spectral proximal characterization of the refactorization step are established. Simulations with Pauli measurements show favorable accuracy--runtime--memory tradeoffs relative to competing alternatives.

quant-pharXiv:2607.19577•Jul 23, 2026•0 citations

Intelligent optimization based density matrix reconstruction method with semi-positive constraint

Xiaomin Meng, Zhiguang Han, Jingyu Cong +1 more

Quantum state tomography (QST) is a technique used to reconstruct the density matrix of unknown quantum states based on experimentally obtained measurements. QST is a fundamental tool in the field of quantum information and quantum technology. It is commonly employed to assess the quality and limitations of experimental platforms. However, the density matrix reconstructed using the standard QST method often fails to guarantee semi-positive definiteness, which is physically unacceptable, due to limitations imposed by the randomness of quantum state measurements, noise in practical applications, and the number of measurements. To address this issue, a method is proposed that combines maximum likelihood (ML) estimation with population intelligence optimization algorithms. First, the issue of guaranteeing the semi-positive definiteness of the density matrix reconstructed using standard QST methods is analyzed. Subsequently, the ML method is introduced, and four commonly used population intelligence optimization algorithms are applied to find the density matrix that maximizes the likelihood of reproducing the experimental measurements. Finally, the superiority of the proposed method is demonstrated using an IBM Quantum (IBMQ) processor in scenarios involving separable and entangled states of multiple qubits, and compared with the standard QST method.

Results in Physics•Jun 22, 2023•2 citations
Time evolution of open quantum systems is governed by the master equation. The master equation, which is a matrix formalism, is the time derivative of the density matrix, which contains the complete information on the state of a quantum system. Instead of implementing successive measurements on repeated identically prepared systems, which are inevitably imperfect and can only be performed a limited number of times, a state estimator can be designed to obtain the whole information about the state of a quantum system represented in a density matrix. Trace-one and positive semi-definite properties of the density matrix arising from physical constraints have to be preserved during state estimation in quantum systems. To address this challenge, we present a projection technique that incorporates Dykstra’s algorithm and physical constraints into state estimation. This technique, which is an iterative method, ensures convergence and includes a designed oracle that projects the estimated state into intersections of admissible closed convex sets. The oracle structure is constructed using Hilbert projection, which looks for the best approximation of the projected estimated state within a Hilbert space into a closed convex set. According to the Hilbert projection theorem, this proposed oracle guarantees the existence and uniqueness of the best approximation of the projected state.
Designing an observer of an unknown quantum density operator is difficult because the operator must be Hermitian positive semidefinite with unit trace. In this paper, we derive a closed-form solution for projecting an arbitrary matrix onto the set of valid density operators. This allows us to design linear quantum state observers and retract the observer’s state back to this set while retaining the exponential convergence rate of the linear observer. The derived closed-form projection can be used alongside any quantum state estimation technique to produce a valid state estimate without increasing the state estimation error.
We present a universal technique for quantum-state estimation based on the maximum-likelihood method. This approach provides a positive-definite estimate for the density matrix from a sequence of measurements performed on identically prepared copies of the system. The method is versatile and can be applied to multimode radiation fields as well as to spin systems. The incorporation of physical constraints, which is natural in the maximum-likelihood strategy, leads to a substantial reduction of statistical errors. Numerical implementation of the method is based on a particular form of the Gauss decomposition for positive-definite Hermitian matrices.
We provide a new approach to open quantum systems which is based on the Feshbach projection method. Instead of looking for a master equation for the dynamical map acting in the space of density operators we provide the corresponding equation for the evolution in the Hilbert space of the amplitude operators. Its solution enables one to construct a legitimate quantum evolution (completely positive and trace preserving). Our approach, contrary to the standard Nakajima-Zwanzig method, allows for a series of consistent approximations resulting in a legitimate quantum evolution. The new scheme is illustrated by the well-known spin-boson model beyond the rotating wave approximation. It is shown that the presence of counterrotating terms dramatically changes the asymptotic evolution of the system.
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states {ρ1,…,ρk}\{ρ_1, \dots, ρ_k\}{ρ1​,…,ρk​} to another such set {ρ^1,…,ρ^k}\{\hatρ_1, \dots, \hatρ_k\}{ρ^​1​,…,ρ^​k​}. In other words, we must find a {\em completely positive linear map}, if it exists, that maps a given set of density matrices to another given set of density matrices. This problem, in turn, is an instance of a positive semi-definite feasibility problem, but with highly structured constraints. The nature of the constraints makes projection based algorithms very appealing when the number of variables is huge and standard interior point-methods for semi-definite programming are not applicable. We provide emperical evidence to this effect. We moreover present heuristics for finding both high rank and low rank solutions. Our experiments are based on the \emph{method of alternating projections} and the \emph{Douglas-Rachford} reflection method.
Quantum state tomography estimates an unknown density operator from measurement data. Dense reconstruction however, can be impractical for many-qubit systems because the Hilbert-space dimension grows exponentially. This contribution develops a rank-adaptive matrix-free approach to low-rank quantum state tomography based on rank-one atomic coordinates. The density operator is represented as a convex combination of pure-state atoms, which preserves positivity and unit trace while avoiding dense density, measurement, and gradient matrices. The resultant algorithm combines atom updates, simplex-constrained coefficient reweighting, and periodic spectral refactorization using only predicted probability vectors, atom vectors, and descriptor-level measurement actions. These computations decompose across measurement outcomes, and admit a master--worker implementation with the measurements partitioned across workers. A rank penalty adapts the representation size during optimization. Provable feasibility, prediction consistency, monotone descent of the penalized objective, and an exact spectral proximal characterization of the refactorization step are established. Simulations with Pauli measurements show favorable accuracy--runtime--memory tradeoffs relative to competing alternatives.
Quantum state tomography (QST) is a technique used to reconstruct the density matrix of unknown quantum states based on experimentally obtained measurements. QST is a fundamental tool in the field of quantum information and quantum technology. It is commonly employed to assess the quality and limitations of experimental platforms. However, the density matrix reconstructed using the standard QST method often fails to guarantee semi-positive definiteness, which is physically unacceptable, due to limitations imposed by the randomness of quantum state measurements, noise in practical applications, and the number of measurements. To address this issue, a method is proposed that combines maximum likelihood (ML) estimation with population intelligence optimization algorithms. First, the issue of guaranteeing the semi-positive definiteness of the density matrix reconstructed using standard QST methods is analyzed. Subsequently, the ML method is introduced, and four commonly used population intelligence optimization algorithms are applied to find the density matrix that maximizes the likelihood of reproducing the experimental measurements. Finally, the superiority of the proposed method is demonstrated using an IBM Quantum (IBMQ) processor in scenarios involving separable and entangled states of multiple qubits, and compared with the standard QST method.