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

Deterministic Quantum State Tomography via Idempotent Simplex Projections: Restoring Physicality Beyond Linear Inversion and Accelerating Maximum Likelihood Estimation

A. Emre Cetin

Published Sep 19, 2026• 0 citations
Publisher

Abstract

Reconstruction of the quantum density operator ρ from finite projective measurement statistics is a foundational requirement for quantum characterization, verification, and benchmarking (QCVB) in modern quantum processors. However, standard linear inversion systematically fails non-negativity (λmin < 0) in the presence of statistical shot noise, yielding unphysical indefinite operators that violate the Born rule and predict negative probabilities. Conversely, standard iterative Maximum Likelihood Estimation (MLE) via Hradil's RρR map or Semidefinite Programming (SDP) incurs high computational overhead and exhibits sensitivity to rank deficiencies, creating severe latency bottlenecks in automated quantum processing unit (QPU) calibration sweeps. Here, we present IdemQST, a deterministic quantum state tomography framework governed by idempotent projection operator theory (Π2 = Π). In an informationally complete orthogonal Pauli basis, sequential projection across measurement hyperplanes collapses in exactly one pass to the unconstrained linear inversion estimate ρlin, and subsequent Euclidean simplex spectral projection ΠΔ yields the exact global Frobenius-closest physical state on the quantum state cone Sd, establishing mathematical equivalence to Projected Linear Inversion (PLI; Smolin, Gambetta, and Smith, 2012). Rather than asserting novel algorithmic optimality for the simplex step, IdemQST re-articulates this foundation within metric idempotent operator algebra, integrates zero-heap static workspace caching (IdemKV), provides empirical dynamic drift cancellation via Dynamic Permutation Networks (DPN), and extends to incomplete or shadow tomography (M < 4N - 1) via cyclic Projections Onto Convex Sets (POCS). Across simulated projective Born measurements on one-, two-, and three-qubit systems under realistic Poisson shot noise (Nshots ∈ [102, 2 × 104]), IdemQST unconditionally eliminates negative eigenvalues (λmin ≥ 0), conserves unit trace to machine precision (10-15), and achieves state fidelities F > 0.994 under pure prior projection or large shot budgets. Crucially, across N=30 repeated timing benchmarks, IdemQST executes the core simplex spectral projection in 96.7 ± 44.3 μs for two-qubit Bell states (39.3× speedup over Hradil MLE and 41.1× over Diluted MLE) and 0.145 ± 0.035 ms (145.0 μs) for three-qubit GHZ states (d=8), achieving a 111.0× speedup over iterative Hradil MLE (16.08 ± 2.17 ms) and 113.6× over accelerated Diluted MLE (16.46 ± 1.58 ms; Šeháček et al., 2007). Furthermore, we incorporate State Preparation and Measurement (SPAM) readout mitigation via simplex-constrained assignment inversion, providing a deterministic, hardware-ready platform for real-time automated QPU calibration.

DOI
10.5281/zenodo.22847197

Related papers

Geometric Shadow Inversion: Real-Time Quantum State Tomography at the Information Threshold

Moralez, Marcos

Problem: Quantum state tomography (QST) is the bottleneck for characterizing intermediate-scale quantum devices, scaling exponentially in measurement complexity (4n) and reconstruction time. Standard iterative optimization methods become computationally intractable for systems beyond 5-6 qubits, limiting real-time characterization capabilities essential for quantum error correction and adaptive protocols. Solution: We introduce Geometric Shadow Inversion (GSI), a reconstruction framework that treats quan- tum state recovery as kernel regression on the density matrix manifold. GSI utilizes a Gaussian-weighted adjoint projection to triangulate the state geometry in a single non-iterative pass, eliminating the computational bottle- neck of iterative optimization entirely. Key Discovery: We identify a fundamental information threshold at measurement ratio M/P ≈1.17 where quantum state reconstruction undergoes a sharp performance transition. Systematic validation across M/P ∈[0.08, 7.84] for 4-qubit systems reveals three distinct regimes: (1) Underdetermined (M/P < 0.6): F < 0.997, performance sensitive to bandwidth; (2) Information Threshold (0.6 < M/P < 2): F crosses 0.9975 and becomes robust to bandwidth—variations of ±50% in σ (range 0.7–1.5) produce fidelity changes < 0.03; (3) Overdetermined (M/P > 2): F →0.999, saturated performance. This robustness at threshold is the signature of geometric regularization making theoretically-sufficient measurements practically sufficient. Our choice of σ = 0.78 operates within this robust plateau, explaining its consistent performance across system sizes n ∈[3, 6]. Below the information threshold, GSI extends into the strongly underdetermined regime (M/P= 0.73), achiev- ing F= 0.905 ±0.004 for 6-qubit states through geometric smoothness priors. Impact: With runtimes of ≈10ms (3 qubits) to ≈5min (6 qubits), GSI enables real-time calibration loops for drift monitoring in logical qubit blocks and tractable diagnostic verification for NISQ hardware. The information threshold phenomenon provides both a practical tool for continuous state characterization and a theoretical framework connecting kernel geometry to fundamental information-theoretic limits in quantum reconstruction.

•Nov 25, 2025•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

Rigorous maximum-likelihood estimation for quantum states

K. Aditi, Stephen Becker

Existing quantum state tomography methods are limited in scalability due to their high computation and memory demands, making them impractical for the recovery of large quantum states. In this work, we address these limitations by reformulating the maximum likelihood estimation problem using the Burer--Monteiro factorization, resulting in a nonconvex but low-rank parametrization of the density matrix. We derive a fully unconstrained formulation by analytically eliminating the trace-one and positive-semidefinite constraints, thereby avoiding the need for projection steps during optimization. Furthermore, we determine the Lagrange multiplier associated with the unit-trace constraint a priori, reducing computational overhead. The resulting formulation is amenable to scalable first-order optimization, and we demonstrate its tractability using the limited-memory Broyden-Fletcher-Goldfarb-Shanno method. Importantly, we also propose a low-memory version of the above algorithm to fully recover certain large quantum states with Pauli-based positive-operator-value measurements. Our low-memory algorithm avoids explicitly forming any density matrix, and does not require the density matrix to have a matrix product state or other tensor structure. For a fixed number of measurements and fixed rank, our algorithm requires just $O(d{log}_{2}d)$ complexity per iteration to recover a $d\ifmmode\times\else\texttimes\fi{}d$ density matrix. Additionally, we derive a useful error bound that can be used to give a rigorous termination criterion. We numerically demonstrate that our method is competitive with state-of-the-art algorithms for moderately sized problems, and then demonstrate that our method can solve a 20-qubit problem on a laptop in under 5 hours.

arXiv:2506.16646•Physical Review A•Nov 19, 2025•0 citations

Deterministic Quantum Mechanics: A Unified Foundational Program

Brian Burch

Deterministic Quantum Mechanics (DQM) is a research program investigating whether the probabilistic content of quantum mechanics can be understood as an emergent statistical description of an underlying deterministic physical theory. This paper consolidates the program’s cumulative results into a single account.The central proposal is that a complete microscopic state evolves deterministically, that the quantum state is a coarse-grained ensemble descriptor rather than the complete physical state, and that measurement outcomes are selected by which deterministic basin of an enlarged phase space a microscopic trajectory occupies. Under this proposal, Born probabilities are basin measures rather than fundamental stochastic laws.For a qubit, this program is realized exactly: a hidden variable λ on the unit sphere, a preparation-dependent density μ_r(λ) = [r·λ]₊/π, and the deterministic response A(n,λ) = sgn(n·λ) reproduce the qubit Born rule P(±|r,n) = (1 ± r·n)/2 exactly, together with sequential-measurement statistics and the associated expectation values. This preparation measure is itself shown to be the deterministic pushforward of a uniformly distributed microscopic preparation coordinate, removing any appeal to fundamental preparation-level stochasticity.Measurement is then developed as deterministic basin selection within a finite-time Hamiltonian architecture, with a finite-time stability theorem governing when microscopic perturbations cannot dislodge a trajectory from its basin. Entangled correlations are reproduced by an autonomous, rotationally covariant Bell Hamiltonian containing dynamical setting registers and a conserved-momentum phase shear; this mechanism reproduces the singlet correlation E(a,b) = −a·b and the CHSH value 2√2 in its ideal limit, while preserving exactly uniform local marginals at finite setting inertia and yielding an explicit, quantitatively bounded finite-inertia correction. A finite Hamiltonian bath (Model-C) supplies a deterministic amplification and record-retention mechanism; its analytic structure — including an exact completed-square cancellation of the static bath backreaction and an exact finite-bath spectral equation — is derived independently of, and is shown to survive, a documented numerical implementation failure (the C14 program), which is retained in the record as a diagnosed, non-Hamiltonian right-hand side rather than as evidence against the underlying construction.Extending the program beyond the qubit exposes a genuine mathematical obstruction: no deterministic basin defined directly on the qutrit pure-state manifold ℂP² can reproduce an arbitrary rank-one Born probability, because positivity forces any exact basin onto a measure-zero point. This is proved rigorously. The resolution is not the abandonment of determinism but the enlargement of the hidden state beyond the quantum ray itself, to a genuine mechanical phase space such as the cotangent bundle T*SU(3), on which the quantum state re-emerges as a coarse-grained moment and on which contextual, Kochen–Specker-compatible measurement dynamics can in principle be realized.Throughout, the paper enforces a strict evidentiary hierarchy — mathematical construction, analytic theorem, numerical validation, and experimental confirmation are never conflated — and closes with an explicit account of what has been proved, what remains open, and what would be required to render the program experimentally falsifiable.

•Aug 11, 2026•0 citations

Quantum measurement tomography with mini-batch stochastic gradient descent

Akshay Gaikwad, Manuel Sebastian Torres, Anton Frisk Kockum

Drawing inspiration from gradient-descent methods developed for data processing in quantum state tomography [\href{https://iopscience.iop.org/article/10.1088/2058-9565/ae0baa}{Quantum Sci.~Technol.~\textbf{10} 045055 (2025)}] and quantum process tomography [\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.150402}{Phys.~Rev.~Lett.~\textbf{130}, 150402 (2023)}], we introduce stochastic gradient descent (SGD) algorithms for fast quantum measurement tomography (QMT), applicable to both discrete- and continuous-variable quantum systems -- thus completing the tomography trio. A measurement device or detector in a quantum experiment is characterized by a set of positive operator-valued measure (POVM) elements; the goal of QMT is to estimate these operators from experimental data. To ensure physically valid (positive and complete) POVM reconstructions, we propose two distinct parameterization schemes within the SGD framework: one leveraging optimization on a Stiefel manifold and one based on Hermitian operator normalization via eigenvalue scaling. Within the SGD-QMT framework, we further investigate two loss functions: mean squared error, equivalent to L2 or Euclidean norm, and average negative log-likelihood, inspired by maximum likelihood estimation. We benchmark performance against state-of-the-art constrained convex optimization methods. Numerical simulations demonstrate that, compared to standard methods, our SGD-QMT algorithms offer significantly lower computational cost, superior reconstruction fidelity, and enhanced robustness to noise. We make a Python implementation of the SGD-QMT algorithms publicly available at \href{https://github.com/agtomo/SGD-QMT}{github.com/agtomo/SGD-QMT}.

quant-pharXiv:2511.15682•Nov 20, 2025•0 citations

Superfast maximum-likelihood reconstruction for quantum tomography

Jiangwei Shang, Zhengyun Zhang, Hui Khoon Ng

Conventional methods for computing maximum-likelihood estimators (MLE) often converge slowly in practical situations, leading to a search for simplifying methods that rely on additional assumptions for their validity. In this work, we provide a fast and reliable algorithm for maximum-likelihood reconstruction that avoids this slow convergence. Our method utilizes the state-of-the-art convex optimization scheme, an accelerated projected-gradient method, that allows one to accommodate the quantum nature of the problem in a different way than in the standard methods. We demonstrate the power of our approach by comparing its performance with other algorithms for $n$-qubit state tomography. In particular, an eight-qubit situation that purportedly took weeks of computation time in 2005 can now be completed in under a minute for a single set of data, with far higher accuracy than previously possible. This refutes the common claim that MLE reconstruction is slow and reduces the need for alternative methods that often come with difficult-to-verify assumptions. In fact, recent methods assuming Gaussian statistics or relying on compressed sensing ideas are demonstrably inapplicable for the situation under consideration here. Our algorithm can be applied to general optimization problems over the quantum state space; the philosophy of projected gradients can further be utilized for optimization contexts with general constraints.

arXiv:1609.07881•Physical Review A•Jun 27, 2017•108 citations
Reconstruction of the quantum density operator ρ from finite projective measurement statistics is a foundational requirement for quantum characterization, verification, and benchmarking (QCVB) in modern quantum processors. However, standard linear inversion systematically fails non-negativity (λmin < 0) in the presence of statistical shot noise, yielding unphysical indefinite operators that violate the Born rule and predict negative probabilities. Conversely, standard iterative Maximum Likelihood Estimation (MLE) via Hradil's RρR map or Semidefinite Programming (SDP) incurs high computational overhead and exhibits sensitivity to rank deficiencies, creating severe latency bottlenecks in automated quantum processing unit (QPU) calibration sweeps. Here, we present IdemQST, a deterministic quantum state tomography framework governed by idempotent projection operator theory (Π2 = Π). In an informationally complete orthogonal Pauli basis, sequential projection across measurement hyperplanes collapses in exactly one pass to the unconstrained linear inversion estimate ρlin, and subsequent Euclidean simplex spectral projection ΠΔ yields the exact global Frobenius-closest physical state on the quantum state cone Sd, establishing mathematical equivalence to Projected Linear Inversion (PLI; Smolin, Gambetta, and Smith, 2012). Rather than asserting novel algorithmic optimality for the simplex step, IdemQST re-articulates this foundation within metric idempotent operator algebra, integrates zero-heap static workspace caching (IdemKV), provides empirical dynamic drift cancellation via Dynamic Permutation Networks (DPN), and extends to incomplete or shadow tomography (M < 4N - 1) via cyclic Projections Onto Convex Sets (POCS). Across simulated projective Born measurements on one-, two-, and three-qubit systems under realistic Poisson shot noise (Nshots ∈ [102, 2 × 104]), IdemQST unconditionally eliminates negative eigenvalues (λmin ≥ 0), conserves unit trace to machine precision (10-15), and achieves state fidelities F > 0.994 under pure prior projection or large shot budgets. Crucially, across N=30 repeated timing benchmarks, IdemQST executes the core simplex spectral projection in 96.7 ± 44.3 μs for two-qubit Bell states (39.3× speedup over Hradil MLE and 41.1× over Diluted MLE) and 0.145 ± 0.035 ms (145.0 μs) for three-qubit GHZ states (d=8), achieving a 111.0× speedup over iterative Hradil MLE (16.08 ± 2.17 ms) and 113.6× over accelerated Diluted MLE (16.46 ± 1.58 ms; Šeháček et al., 2007). Furthermore, we incorporate State Preparation and Measurement (SPAM) readout mitigation via simplex-constrained assignment inversion, providing a deterministic, hardware-ready platform for real-time automated QPU calibration.
Problem: Quantum state tomography (QST) is the bottleneck for characterizing intermediate-scale quantum devices, scaling exponentially in measurement complexity (4n) and reconstruction time. Standard iterative optimization methods become computationally intractable for systems beyond 5-6 qubits, limiting real-time characterization capabilities essential for quantum error correction and adaptive protocols. Solution: We introduce Geometric Shadow Inversion (GSI), a reconstruction framework that treats quan- tum state recovery as kernel regression on the density matrix manifold. GSI utilizes a Gaussian-weighted adjoint projection to triangulate the state geometry in a single non-iterative pass, eliminating the computational bottle- neck of iterative optimization entirely. Key Discovery: We identify a fundamental information threshold at measurement ratio M/P ≈1.17 where quantum state reconstruction undergoes a sharp performance transition. Systematic validation across M/P ∈[0.08, 7.84] for 4-qubit systems reveals three distinct regimes: (1) Underdetermined (M/P < 0.6): F < 0.997, performance sensitive to bandwidth; (2) Information Threshold (0.6 < M/P < 2): F crosses 0.9975 and becomes robust to bandwidth—variations of ±50% in σ (range 0.7–1.5) produce fidelity changes < 0.03; (3) Overdetermined (M/P > 2): F →0.999, saturated performance. This robustness at threshold is the signature of geometric regularization making theoretically-sufficient measurements practically sufficient. Our choice of σ = 0.78 operates within this robust plateau, explaining its consistent performance across system sizes n ∈[3, 6]. Below the information threshold, GSI extends into the strongly underdetermined regime (M/P= 0.73), achiev- ing F= 0.905 ±0.004 for 6-qubit states through geometric smoothness priors. Impact: With runtimes of ≈10ms (3 qubits) to ≈5min (6 qubits), GSI enables real-time calibration loops for drift monitoring in logical qubit blocks and tractable diagnostic verification for NISQ hardware. The information threshold phenomenon provides both a practical tool for continuous state characterization and a theoretical framework connecting kernel geometry to fundamental information-theoretic limits in quantum reconstruction.
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.
Existing quantum state tomography methods are limited in scalability due to their high computation and memory demands, making them impractical for the recovery of large quantum states. In this work, we address these limitations by reformulating the maximum likelihood estimation problem using the Burer--Monteiro factorization, resulting in a nonconvex but low-rank parametrization of the density matrix. We derive a fully unconstrained formulation by analytically eliminating the trace-one and positive-semidefinite constraints, thereby avoiding the need for projection steps during optimization. Furthermore, we determine the Lagrange multiplier associated with the unit-trace constraint a priori, reducing computational overhead. The resulting formulation is amenable to scalable first-order optimization, and we demonstrate its tractability using the limited-memory Broyden-Fletcher-Goldfarb-Shanno method. Importantly, we also propose a low-memory version of the above algorithm to fully recover certain large quantum states with Pauli-based positive-operator-value measurements. Our low-memory algorithm avoids explicitly forming any density matrix, and does not require the density matrix to have a matrix product state or other tensor structure. For a fixed number of measurements and fixed rank, our algorithm requires just O(dlog2d)O(d{log}_{2}d)O(dlog2​d) complexity per iteration to recover a $d\ifmmode\times\else\texttimes\fi{}d$ density matrix. Additionally, we derive a useful error bound that can be used to give a rigorous termination criterion. We numerically demonstrate that our method is competitive with state-of-the-art algorithms for moderately sized problems, and then demonstrate that our method can solve a 20-qubit problem on a laptop in under 5 hours.
Deterministic Quantum Mechanics (DQM) is a research program investigating whether the probabilistic content of quantum mechanics can be understood as an emergent statistical description of an underlying deterministic physical theory. This paper consolidates the program’s cumulative results into a single account.The central proposal is that a complete microscopic state evolves deterministically, that the quantum state is a coarse-grained ensemble descriptor rather than the complete physical state, and that measurement outcomes are selected by which deterministic basin of an enlarged phase space a microscopic trajectory occupies. Under this proposal, Born probabilities are basin measures rather than fundamental stochastic laws.For a qubit, this program is realized exactly: a hidden variable λ on the unit sphere, a preparation-dependent density μ_r(λ) = [r·λ]₊/π, and the deterministic response A(n,λ) = sgn(n·λ) reproduce the qubit Born rule P(±|r,n) = (1 ± r·n)/2 exactly, together with sequential-measurement statistics and the associated expectation values. This preparation measure is itself shown to be the deterministic pushforward of a uniformly distributed microscopic preparation coordinate, removing any appeal to fundamental preparation-level stochasticity.Measurement is then developed as deterministic basin selection within a finite-time Hamiltonian architecture, with a finite-time stability theorem governing when microscopic perturbations cannot dislodge a trajectory from its basin. Entangled correlations are reproduced by an autonomous, rotationally covariant Bell Hamiltonian containing dynamical setting registers and a conserved-momentum phase shear; this mechanism reproduces the singlet correlation E(a,b) = −a·b and the CHSH value 2√2 in its ideal limit, while preserving exactly uniform local marginals at finite setting inertia and yielding an explicit, quantitatively bounded finite-inertia correction. A finite Hamiltonian bath (Model-C) supplies a deterministic amplification and record-retention mechanism; its analytic structure — including an exact completed-square cancellation of the static bath backreaction and an exact finite-bath spectral equation — is derived independently of, and is shown to survive, a documented numerical implementation failure (the C14 program), which is retained in the record as a diagnosed, non-Hamiltonian right-hand side rather than as evidence against the underlying construction.Extending the program beyond the qubit exposes a genuine mathematical obstruction: no deterministic basin defined directly on the qutrit pure-state manifold ℂP² can reproduce an arbitrary rank-one Born probability, because positivity forces any exact basin onto a measure-zero point. This is proved rigorously. The resolution is not the abandonment of determinism but the enlargement of the hidden state beyond the quantum ray itself, to a genuine mechanical phase space such as the cotangent bundle T*SU(3), on which the quantum state re-emerges as a coarse-grained moment and on which contextual, Kochen–Specker-compatible measurement dynamics can in principle be realized.Throughout, the paper enforces a strict evidentiary hierarchy — mathematical construction, analytic theorem, numerical validation, and experimental confirmation are never conflated — and closes with an explicit account of what has been proved, what remains open, and what would be required to render the program experimentally falsifiable.
Drawing inspiration from gradient-descent methods developed for data processing in quantum state tomography [\href{https://iopscience.iop.org/article/10.1088/2058-9565/ae0baa}{Quantum Sci.~Technol.~\textbf{10} 045055 (2025)}] and quantum process tomography [\href{https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.130.150402}{Phys.~Rev.~Lett.~\textbf{130}, 150402 (2023)}], we introduce stochastic gradient descent (SGD) algorithms for fast quantum measurement tomography (QMT), applicable to both discrete- and continuous-variable quantum systems -- thus completing the tomography trio. A measurement device or detector in a quantum experiment is characterized by a set of positive operator-valued measure (POVM) elements; the goal of QMT is to estimate these operators from experimental data. To ensure physically valid (positive and complete) POVM reconstructions, we propose two distinct parameterization schemes within the SGD framework: one leveraging optimization on a Stiefel manifold and one based on Hermitian operator normalization via eigenvalue scaling. Within the SGD-QMT framework, we further investigate two loss functions: mean squared error, equivalent to L2 or Euclidean norm, and average negative log-likelihood, inspired by maximum likelihood estimation. We benchmark performance against state-of-the-art constrained convex optimization methods. Numerical simulations demonstrate that, compared to standard methods, our SGD-QMT algorithms offer significantly lower computational cost, superior reconstruction fidelity, and enhanced robustness to noise. We make a Python implementation of the SGD-QMT algorithms publicly available at \href{https://github.com/agtomo/SGD-QMT}{github.com/agtomo/SGD-QMT}.
Conventional methods for computing maximum-likelihood estimators (MLE) often converge slowly in practical situations, leading to a search for simplifying methods that rely on additional assumptions for their validity. In this work, we provide a fast and reliable algorithm for maximum-likelihood reconstruction that avoids this slow convergence. Our method utilizes the state-of-the-art convex optimization scheme, an accelerated projected-gradient method, that allows one to accommodate the quantum nature of the problem in a different way than in the standard methods. We demonstrate the power of our approach by comparing its performance with other algorithms for nnn-qubit state tomography. In particular, an eight-qubit situation that purportedly took weeks of computation time in 2005 can now be completed in under a minute for a single set of data, with far higher accuracy than previously possible. This refutes the common claim that MLE reconstruction is slow and reduces the need for alternative methods that often come with difficult-to-verify assumptions. In fact, recent methods assuming Gaussian statistics or relying on compressed sensing ideas are demonstrably inapplicable for the situation under consideration here. Our algorithm can be applied to general optimization problems over the quantum state space; the philosophy of projected gradients can further be utilized for optimization contexts with general constraints.