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

International Conference on Mathematical Modeling in Materials Science of Electronic Components (MMMSEC)

SIMULATION OF OPTICAL QUANTUM STATES TOMOGRAPHY USING THE MAXIMUM LIKELIHOOD ALGORITHM

Ivan Golyshev, Nadegda Bogdanova, Andrey Sharapov, Yuriy Bogdanov

Published Oct 18, 2025• 0 citations
Publisher

Abstract

In this study, the iterative algorithm based on the root approach and the gradient method for finding the extremum of the likelihood function in problems of optical quantum states reconstruction using a set of mutually complementary quantum measurements was developed.
DOI
10.29003/m4768.mmmsec-2025/46-48

Related papers

Diluted maximum-likelihood algorithm for quantum tomography

Jaroslav Řeháček, Z. Hradil, Emanuel H. Knill +1 more

We propose a refined iterative likelihood-maximization algorithm for reconstructing a quantum state from a set of tomographic measurements. The algorithm is characterized by a very high convergence rate and features a simple adaptive procedure that ensures likelihood increase in every iteration and convergence to the maximum-likelihood state. We apply the algorithm to homodyne tomography of optical states and quantum tomography of entangled spin states of trapped ions and investigate its convergence properties.

arXiv:quant-ph/0611244•Physical Review A•Apr 18, 2007•194 citations

Maximum-Likelihood Quantum State Tomography by Cover's Method with Non-Asymptotic Analysis

Chien-Ming Lin, Hao–Chung Cheng, Yen-Huan Li

We propose an iterative algorithm that computes the maximum-likelihood estimate in quantum state tomography. The optimization error of the algorithm converges to zero at an $O ( ( 1 / k ) \log D )$ rate, where $k$ denotes the number of iterations and $D$ denotes the dimension of the quantum state. The per-iteration computational complexity of the algorithm is $O ( D ^ 3 + N D ^2 )$, where $N$ denotes the number of measurement outcomes. The algorithm can be considered as a parameter-free correction of the $R ρR$ method [A. I. Lvovsky. Iterative maximum-likelihood reconstruction in quantum homodyne tomography. \textit{J. Opt. B: Quantum Semiclass. Opt.} 2004] [G. Molina-Terriza et al. Triggered qutrits for quantum communication protocols. \textit{Phys. Rev. Lett.} 2004.].

arXiv:2110.00747•Oct 2, 2021•7 citations

Maximum-likelihood algorithm for quantum tomography

Konrad Banaszek

Optical homodyne tomography is discussed in the context of classical image processing. Analogies between these two fields are traced and used to formulate an iterative numerical algorithm for reconstructing the Wigner function from homodyne statistics.

arXiv:quant-ph/9904063•Apr 15, 1999•2 citations

Iterative maximum-likelihood reconstruction in quantum homodyne tomography

Alexander I. Lvovsky

I propose an iterative expectation maximization algorithm for reconstructing the density matrix of an optical ensemble from a set of balanced homodyne measurements. The algorithm applies directly to the acquired data, bypassing the intermediate step of calculating marginal distributions. The advantages of the new method are made manifest by comparing it with the traditional inverse Radon transformation technique.

arXiv:quant-ph/0311097•Journal of Optics B Quantum and Semiclassical Optics•May 28, 2004•321 citations

Statistical reconstruction of optical quantum states based on mutually complementary quadrature quantum measurements

Yu. I. Bogdanov, G. V. Avosopiants, L. V. Belinsky +3 more

We describe a new method for reconstructing the quantum state of the electromagnetic field from the results of mutually complementary optical quadrature measurements. This method is based on the root approach and displaces squeezed Fock states are used as the basis. Theoretical analysis and numerical experiments demonstrate the considerable advantage of the developed tools over those described in the literature.

Journal of Experimental and Theoretical Physics•Aug 1, 2016•9 citations

Gradient-based stopping rules for maximum-likelihood quantum-state tomography

Scott Glancy, Emanuel H. Knill, Mark Girard

When performing maximum-likelihood quantum-state tomography, one must find the quantum state that maximizes the likelihood of the state given observed measurements on identically prepared systems. The optimization is usually performed with iterative algorithms. This paper provides a gradient-based upper bound on the ratio of the true maximum likelihood and the likelihood of the state of the current iteration, regardless of the particular algorithm used. This bound is useful for formulating stopping rules for halting iterations of maximization algorithms. We discuss such stopping rules in the context of determining confidence regions from log-likelihood differences when the differences are approximately chi-squared distributed.

arXiv:1205.4043•New Journal of Physics•Sep 18, 2012•16 citations
We propose a refined iterative likelihood-maximization algorithm for reconstructing a quantum state from a set of tomographic measurements. The algorithm is characterized by a very high convergence rate and features a simple adaptive procedure that ensures likelihood increase in every iteration and convergence to the maximum-likelihood state. We apply the algorithm to homodyne tomography of optical states and quantum tomography of entangled spin states of trapped ions and investigate its convergence properties.
We propose an iterative algorithm that computes the maximum-likelihood estimate in quantum state tomography. The optimization error of the algorithm converges to zero at an O((1/k)log⁡D)O ( ( 1 / k ) \log D )O((1/k)logD) rate, where kkk denotes the number of iterations and DDD denotes the dimension of the quantum state. The per-iteration computational complexity of the algorithm is O(D3+ND2)O ( D ^ 3 + N D ^2 )O(D3+ND2), where NNN denotes the number of measurement outcomes. The algorithm can be considered as a parameter-free correction of the RρRR ρRRρR method [A. I. Lvovsky. Iterative maximum-likelihood reconstruction in quantum homodyne tomography. \textit{J. Opt. B: Quantum Semiclass. Opt.} 2004] [G. Molina-Terriza et al. Triggered qutrits for quantum communication protocols. \textit{Phys. Rev. Lett.} 2004.].
When performing maximum-likelihood quantum-state tomography, one must find the quantum state that maximizes the likelihood of the state given observed measurements on identically prepared systems. The optimization is usually performed with iterative algorithms. This paper provides a gradient-based upper bound on the ratio of the true maximum likelihood and the likelihood of the state of the current iteration, regardless of the particular algorithm used. This bound is useful for formulating stopping rules for halting iterations of maximization algorithms. We discuss such stopping rules in the context of determining confidence regions from log-likelihood differences when the differences are approximately chi-squared distributed.