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

Results in Physics

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

Xiaomin Meng, Zhiguang Han, Jingyu Cong, Xiaowan Guo

Published Jun 22, 2023• 2 citations
Publisher

Abstract

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.

DOI
10.1016/j.rinp.2023.106661

Related papers

Optimal quantum state tomography with local informationally complete measurements

Casey Jameson, Zhen Qin, Alireza Goldar +3 more

Quantum state tomography (QST) remains the gold standard for benchmarking and verification of near-term quantum devices. While QST for a generic quantum many-body state requires an exponentially large amount of resources, most physical quantum states are structured and can often be represented by a much smaller number of parameters, making efficient QST potentially possible. A prominent example is a matrix product state (MPS) or a matrix product density operator (MPDO), which is believed to represent most physical states generated by one-dimensional (1D) quantum devices. We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies polynomial in the number of qubits, which is necessary for efficient QST. To make this question practically interesting, we assume only local measurements of qubits directly on the target state. By using a local symmetric informationally complete positive operator-valued measurement (SIC-POVM), we provide a positive answer to the above question for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians. In addition, we also provide an affirmative no answer for certain long-range entangled states such as a family of generalized GHZ states, but with the exception of target states that are known to have real-valued wavefunctions. Our answers are supported by a near-perfect agreement between an efficient calculation of the Cramer-Rao bound that rigorously bounds the sample complexity and numerical optimization results using a machine learning assisted maximal likelihood estimation (MLE) algorithm. This agreement also leads to an optimal QST protocol using local SIC-POVM that can be practically implemented on current quantum hardware and is highly efficient for most 1D physical states.

arXiv:2408.07115•Aug 13, 2024•1 citation

Quantum State Tomography via Variational Quantum Algorithms

Jincheng Zhang

Quantum state tomography (QST) is a fundamental technique in quantum information science, aiming to reconstruct the density matrix of an unknown quantum state from experimental measurements. However, traditional QST methods often suffer from significant computational demands and are highly susceptible to measurement noise, hindering their practical application, particularly with near-term quantum computers. This work proposes a novel approach to QST utilizing variational quantum algorithms (VQAs). VQAs iteratively optimize a parameterized quantum circuit to minimize a cost function related to the fidelity between the desired state and the state predicted by the circuit. This approach dramatically reduces the number of required measurements and offers the potential for achieving high-fidelity state reconstruction with lower quantum resource requirements. We detail the theoretical framework, outlining the core algorithms and mathematical formulations. The key advantage lies in the ability to learn the state directly, mitigating the limitations of traditional methods. We explore the optimization landscape and discuss strategies for improving convergence and robustness. The results demonstrate a promising path toward scalable and robust QST on quantum devices.

•Aug 29, 2026•0 citations

Maximum-Likelihood Quantum State Tomography by Soft-Bayes

Lin, Chien-Ming, Yu-Ming Hsu, Yen-Huan Li

Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an $\varepsilon$-approximate ML estimate in $O( ( D \log D ) / \varepsilon ^ 2 )$ iterations with $O( D^3 )$ per-iteration time complexity, where $D$ denotes the dimension of the unknown quantum state and $\varepsilon$ denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.

arXiv:2012.15498•Dec 31, 2020•0 citations

Reconstruction of quantum states by applying an analytical optimization model

Rohit Prasad, Pratyay Ghosh, Ronny Thomale +1 more

When working with quantum states, analysis of the final quantum state generated through probabilistic measurements is essential. This analysis is typically conducted by constructing the density matrix from either partial or full tomography measurements of the quantum state. While full tomography measurement offers the most accurate reconstruction of the density matrix, limited measurements pose challenges for reconstruction algorithms, often resulting in nonphysical density matrices with negative eigenvalues. This is often remedied using maximum likelihood estimators, which have a high computing time or by other estimation methods that decrease the reconstructed fidelity. In this paper, we show that when restricting the measurement sample size, improvement over existing algorithms can be achieved. Our findings underline the multiplicity of solutions in the reconstruction problem, depending upon the generated state and measurement model utilized, thus motivating further research towards identifying optimal algorithms tailored to specific experimental contexts.

Physical Review A•Feb 3, 2025•1 citation

Convergence of a Reconstructed Density Matrix to a Pure State Using the Maximal Entropy Approach

Rishabh Gupta, Raphael David Levine, Sabre Kais

Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than 1000-qubits by the end of 2023, efficient validation techniques are also being developed for testing quantum processing on these devices. The characterization of a quantum state is done by experimental measurements through the process called quantum state tomography (QST) which scales exponentially with the size of the system. However, QST performed using incomplete measurements is aptly suited for characterizing these quantum technologies especially with the current nature of noisy intermediate-scale quantum (NISQ) devices where not all mean measurements are available with high fidelity. We, hereby, propose an alternative approach to QST for the complete reconstruction of the density matrix of a quantum system in a pure state for any number of qubits by applying the maximal entropy formalism on the pairwise combinations of the known mean measurements. This approach provides the best estimate of the target state when we know the complete set of observables, which is the case of convergence of the reconstructed density matrix to a pure state. Our goal is to provide a practical inference of a quantum system in a pure state that can find its applications in the field of quantum error mitigation on a real quantum computer that we intend to investigate further.

arXiv:2107.01191•The Journal of Physical Chemistry A•Aug 19, 2021•16 citations

Local solutions of maximum likelihood estimation in quantum state tomography

Douglas Soares Gonçalves, Márcia A. Gomes-Ruggiero, Carlile Lavor +2 more

Maximum likelihood estimation is one of the most used methods in quantum state tomography, where the aim is to reconstruct the density matrix of a physical system from measurement results. One strategy to deal with positivity and unit trace constraints is to parameterize the matrix to be reconstructed in order to ensure that it is physical. In this case, the negative log-likelihood function in terms of the parameters, may have several local minima. In various papers in the field, a source of errors in this process has been associated to the possibility that most of these local minima are not global, so that optimization methods could be trapped in the wrong minimum, leading to a wrong density matrix. Here we show that, for convex negative log-likelihood functions, all local minima of the unconstrained parameterized problem are global, thus any minimizer leads to the maximum likelihood estimation for the density matrix. We also discuss some practical sources of errors.

Quantum Information and Computation•Sep 1, 2012•4 citations
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.
Quantum state tomography (QST) remains the gold standard for benchmarking and verification of near-term quantum devices. While QST for a generic quantum many-body state requires an exponentially large amount of resources, most physical quantum states are structured and can often be represented by a much smaller number of parameters, making efficient QST potentially possible. A prominent example is a matrix product state (MPS) or a matrix product density operator (MPDO), which is believed to represent most physical states generated by one-dimensional (1D) quantum devices. We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies polynomial in the number of qubits, which is necessary for efficient QST. To make this question practically interesting, we assume only local measurements of qubits directly on the target state. By using a local symmetric informationally complete positive operator-valued measurement (SIC-POVM), we provide a positive answer to the above question for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians. In addition, we also provide an affirmative no answer for certain long-range entangled states such as a family of generalized GHZ states, but with the exception of target states that are known to have real-valued wavefunctions. Our answers are supported by a near-perfect agreement between an efficient calculation of the Cramer-Rao bound that rigorously bounds the sample complexity and numerical optimization results using a machine learning assisted maximal likelihood estimation (MLE) algorithm. This agreement also leads to an optimal QST protocol using local SIC-POVM that can be practically implemented on current quantum hardware and is highly efficient for most 1D physical states.
Quantum state tomography (QST) is a fundamental technique in quantum information science, aiming to reconstruct the density matrix of an unknown quantum state from experimental measurements. However, traditional QST methods often suffer from significant computational demands and are highly susceptible to measurement noise, hindering their practical application, particularly with near-term quantum computers. This work proposes a novel approach to QST utilizing variational quantum algorithms (VQAs). VQAs iteratively optimize a parameterized quantum circuit to minimize a cost function related to the fidelity between the desired state and the state predicted by the circuit. This approach dramatically reduces the number of required measurements and offers the potential for achieving high-fidelity state reconstruction with lower quantum resource requirements. We detail the theoretical framework, outlining the core algorithms and mathematical formulations. The key advantage lies in the ability to learn the state directly, mitigating the limitations of traditional methods. We explore the optimization landscape and discuss strategies for improving convergence and robustness. The results demonstrate a promising path toward scalable and robust QST on quantum devices.
Quantum state tomography (QST), the task of estimating an unknown quantum state given measurement outcomes, is essential to building reliable quantum computing devices. Whereas computing the maximum-likelihood (ML) estimate corresponds to solving a finite-sum convex optimization problem, the objective function is not smooth nor Lipschitz, so most existing convex optimization methods lack sample complexity guarantees; moreover, both the sample size and dimension grow exponentially with the number of qubits in a QST experiment, so a desired algorithm should be highly scalable with respect to the dimension and sample size, just like stochastic gradient descent. In this paper, we propose a stochastic first-order algorithm that computes an ε\varepsilonε-approximate ML estimate in O((Dlog⁡D)/ε2)O( ( D \log D ) / \varepsilon ^ 2 )O((DlogD)/ε2) iterations with O(D3)O( D^3 )O(D3) per-iteration time complexity, where DDD denotes the dimension of the unknown quantum state and ε\varepsilonε denotes the optimization error. Our algorithm is an extension of Soft-Bayes to the quantum setup.
When working with quantum states, analysis of the final quantum state generated through probabilistic measurements is essential. This analysis is typically conducted by constructing the density matrix from either partial or full tomography measurements of the quantum state. While full tomography measurement offers the most accurate reconstruction of the density matrix, limited measurements pose challenges for reconstruction algorithms, often resulting in nonphysical density matrices with negative eigenvalues. This is often remedied using maximum likelihood estimators, which have a high computing time or by other estimation methods that decrease the reconstructed fidelity. In this paper, we show that when restricting the measurement sample size, improvement over existing algorithms can be achieved. Our findings underline the multiplicity of solutions in the reconstruction problem, depending upon the generated state and measurement model utilized, thus motivating further research towards identifying optimal algorithms tailored to specific experimental contexts.
Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than 1000-qubits by the end of 2023, efficient validation techniques are also being developed for testing quantum processing on these devices. The characterization of a quantum state is done by experimental measurements through the process called quantum state tomography (QST) which scales exponentially with the size of the system. However, QST performed using incomplete measurements is aptly suited for characterizing these quantum technologies especially with the current nature of noisy intermediate-scale quantum (NISQ) devices where not all mean measurements are available with high fidelity. We, hereby, propose an alternative approach to QST for the complete reconstruction of the density matrix of a quantum system in a pure state for any number of qubits by applying the maximal entropy formalism on the pairwise combinations of the known mean measurements. This approach provides the best estimate of the target state when we know the complete set of observables, which is the case of convergence of the reconstructed density matrix to a pure state. Our goal is to provide a practical inference of a quantum system in a pure state that can find its applications in the field of quantum error mitigation on a real quantum computer that we intend to investigate further.
Maximum likelihood estimation is one of the most used methods in quantum state tomography, where the aim is to reconstruct the density matrix of a physical system from measurement results. One strategy to deal with positivity and unit trace constraints is to parameterize the matrix to be reconstructed in order to ensure that it is physical. In this case, the negative log-likelihood function in terms of the parameters, may have several local minima. In various papers in the field, a source of errors in this process has been associated to the possibility that most of these local minima are not global, so that optimization methods could be trapped in the wrong minimum, leading to a wrong density matrix. Here we show that, for convex negative log-likelihood functions, all local minima of the unconstrained parameterized problem are global, thus any minimizer leads to the maximum likelihood estimation for the density matrix. We also discuss some practical sources of errors.