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

Lecture notes in physics

3 Maximum-Likelihood Methodsin Quantum Mechanics

Z. Hradil, Jaroslav Řeháček, Jaromı́r Fiurášek, Miroslav Ježek

Published Aug 18, 2004• 98 citations
Publisher
DOI
10.1007/978-3-540-44481-7_3

Related papers

10 Maximum-Likelihood Estimationin Experimental Quantum Physics

G. Badurek, Z. Hradil, Alexander I. Lvovsky +5 more

Lecture notes in physics•Aug 18, 2004•0 citations

Quantum State Reconstruction: A comparison of Maximum Likelihood

Hideo Mabuchi, J. K. Chin, Andrew C. Doherty +6 more

•Jan 1, 2001•0 citations

Quantum Measurements: Maximum-Likelihood Estimators

WORLD SCIENTIFIC eBooks•Oct 29, 2025•0 citations

Maximum Likelihood Estimator of Quantum Probabilities

Mirko Navara, Jan Ševic

International Journal of Theoretical Physics•Oct 6, 2023•0 citations

Maximum-likelihood estimation of quantum processes

Jaromı́r Fiurášek, Z. Hradil

Maximum-likelihood estimation is applied to identification of an unknown quantum-mechanical process. In contrast to linear reconstruction schemes, the proposed approach always yields physically sensible results. Its feasibility is demonstrated by performing the Monte Carlo simulations for the two-level system (single qubit).

Physical Review A•Jan 9, 2001•103 citations

Differentiable Maximum Likelihood Noise Estimation for Quantum Error Correction

Hanyan Cao, Dongyang Feng, Zixuan Lu +2 more

Accurate noise estimation is essential for fault-tolerant quantum computing, since decoding per formance depends critically on the fidelity of circuit-level noise parameters. We introduce a differ entiable Maximum Likelihood Estimation (dMLE) framework that learns these parameters directly from experimental syndrome data using likelihood gradients, with no decoder in the training loop. Mapping syndrome likelihoods to statistical-mechanical models enables exact and efficient evalua tion via planar solvers for repetition codes and tensor networks (TNs) for surface codes, extending the exact treatment to code distance d = 5 with a small number of rounds, and, via spatial subsam pling combined with time-translation symmetry, to larger codes and larger round counts. Across four experimental superconducting datasets, dMLE reduces logical error rates by up to 30.6% for repetition codes. On the Sycamore d = 3 surface code, a TN decoder using the dMLE prior attains a logical error rate comparable to that reported for state-of-the-art AlphaQubit, using standard syndromes alone without auxiliary leakage data. On the larger d = 5 surface code the dMLE prior lowers the logical error rate of the TN and Tesseract decoders by 7.18% and 5.23% relative to a prior optimized by reinforcement learning; at d = 7 it lowers that of Tesseract by 4.56% and 4.83% in the X and Z bases.

quant-pharXiv:2602.19722•Feb 24, 2026•0 citations
Accurate noise estimation is essential for fault-tolerant quantum computing, since decoding per formance depends critically on the fidelity of circuit-level noise parameters. We introduce a differ entiable Maximum Likelihood Estimation (dMLE) framework that learns these parameters directly from experimental syndrome data using likelihood gradients, with no decoder in the training loop. Mapping syndrome likelihoods to statistical-mechanical models enables exact and efficient evalua tion via planar solvers for repetition codes and tensor networks (TNs) for surface codes, extending the exact treatment to code distance d = 5 with a small number of rounds, and, via spatial subsam pling combined with time-translation symmetry, to larger codes and larger round counts. Across four experimental superconducting datasets, dMLE reduces logical error rates by up to 30.6% for repetition codes. On the Sycamore d = 3 surface code, a TN decoder using the dMLE prior attains a logical error rate comparable to that reported for state-of-the-art AlphaQubit, using standard syndromes alone without auxiliary leakage data. On the larger d = 5 surface code the dMLE prior lowers the logical error rate of the TN and Tesseract decoders by 7.18% and 5.23% relative to a prior optimized by reinforcement learning; at d = 7 it lowers that of Tesseract by 4.56% and 4.83% in the X and Z bases.