MétaCan
Menu
Back to cohort
Record W4413342590 · doi:10.1103/ltz3-163t

Higher-order corrections to the quantum Cramér-Rao bound

2025· article· en· W4413342590 on OpenAlexaff
J. L. Romero, Aaron Z. Goldberg, Ángel S. Sanz, Z. Hradil, J. Řeháček, L. L. Sánchez-Soto

Bibliographic record

VenuePhysical review. A/Physical review, A · 2025
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsNational Research Council Canada
FundersQuantERAKavli Institute for Theoretical Physics, University of California, Santa BarbaraAgencia Estatal de InvestigaciónUniverzita Palackého v OlomouciNational Science Foundation
KeywordsOrder (exchange)Cramér–Rao boundQuantumMathematicsUpper and lower boundsPhysicsStatistical physicsStatisticsQuantum mechanicsMathematical analysisEconomics

Abstract

fetched live from OpenAlex

Quantum Fisher information and the associated quantum Cramér-Rao bound (QCRB) are fundamental tools in frequentist quantum metrology, offering both analytical simplicity and practical precision limits for parameter estimation. The QCRB sets a lower bound on the mean square error (MSE) in the idealized limit of infinite measurement trials ( ν → ∞ ). Here we perform a systematic expansion in powers of 1 / ν to refine MSE estimates in realistic, finite-resource scenarios. These corrections reveal differences between measurements that appear equally optimal under the QCRB. They also help to distinguish among multiple optimal state families for estimating an unknown unitary transformation. Additionally, we explore the Bhattacharyya bound and its quantum counterpart, which constrain these corrections. Our results are relevant for preasymptotic metrology, enabling optimized protocols with limited resources without reliance on numerical simulations.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.010
metaresearch head score (Gemma)0.070
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.013
Threshold uncertainty score0.055

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0100.070
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0020.003
Science and technology studies0.0020.008
Scholarly communication0.0040.009
Open science0.0040.004
Research integrity0.0020.010
Insufficient payload (model declined to judge)0.0130.003

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.015
GPT teacher head0.359
Teacher spread0.344 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations1
Published2025
Admission routes1
Has abstractyes

Explore more

Same venuePhysical review. A/Physical review, ASame topicQuantum Information and CryptographyFrench-language works237,207