Read the conditions behind a quantum precision bound
Separate local unbiased bounds, finite-sample performance, global identifiability, and the measurement conditions required to approach quantum Fisher information.
On this page
The question for today
What you’ll understand
- State local unbiasedness and regularity assumptions behind the Cramér–Rao bound.
- Distinguish saturating measurement information from an efficient estimator.
- Recognize bias and phase aliases that an inverse-information number does not describe.
A lower bound is useful only when its hypotheses match the reported error. Quantum Fisher information bounds the classical information extracted by a measurement; the classical Cramér–Rao inequality then bounds estimator variance under statistical conditions. Combining the two produces a powerful design benchmark. It does not promise that a small finite dataset, a biased estimator, or a globally ambiguous phase experiment achieves that benchmark.
Track the two inequalities
For independent identical preparations, classical information adds. At a regular parameter value, an estimator that is locally unbiased has variance at least the reciprocal of that total classical information, which is itself bounded below by the reciprocal quantum information. Local unbiasedness requires both the correct expectation at the reference point and unit derivative of that expectation there. Getting the mean right at just one isolated point is insufficient: a constant estimator equal to that point has zero variance but no local response.
The usual proof differentiates expectations and uses Cauchy–Schwarz on the estimator and score. It therefore needs smoothness, suitable interchange of differentiation and integration or summation, and regular support behavior. A parameter-dependent boundary can invalidate the elementary argument. When information vanishes or an inverse is singular, first diagnose identifiability rather than quoting an infinite or zero error mechanically. For multiple unknown parameters, inverse information matrices and measurement compatibility introduce further conditions beyond this single-parameter treatment.
Separate local calibration from global inference
An ideal midpoint sine fringe illustrates exact local saturation. Let count successes with and define . Its expectation is , so it is locally unbiased at zero but not globally unbiased as an angle estimator. Its variance at zero is , equal to the phase information bound. The construction uses a linear local calibration and retains a finite-sample equality at that reference point; it does not establish an unbiased estimator over a full period.
A cosine or sine fringe repeats when phase advances by a full turn. High Fisher information can sharpen every repeated likelihood peak without selecting the correct peak. A known narrow parameter interval, extra interrogation times, or additional calibration information is needed to resolve aliases. The same issue appears in a more severe form for entangled fringes that oscillate several times faster. Local distinguishability and global identifiability answer different questions, and an experimental uncertainty statement must say which one is controlled.
Attain measurement and estimator limits separately
An SLD measurement can extract quantum Fisher information at a chosen parameter value, yet an estimator based on its finite record can still fail to reach the variance bound. Conversely, a statistically efficient estimator cannot recover information that the detector never collected. Adaptive protocols often use some preparations to obtain a rough estimate and then tune the readout near its local optimum. The tuning data and feedback time are resources, and the rough estimate must select the correct neighborhood with sufficiently high reliability.
With a correctly specified identifiable regular model, likelihood-based procedures often approach the bound in a large-data regime. The rate of that approach and the effect of outliers require checking for the actual protocol. Bias can intentionally reduce mean-squared error relative to an unbiased-variance benchmark, especially with prior information or restricted parameter ranges. Such a result does not violate quantum mechanics. Compare the same loss function and the same assumptions before describing a claimed bound violation; uncertainty from model mismatch remains a separate concern.
Work it through
Exact local saturation without global unbiasedness
Use the ideal sine-fringe model with independent outcomes and estimator . At true phase zero, compute its expectation, standard deviation, and information bound. For an observed , report its estimate.
At , the success probability is , so and . The derivative of its expectation is , which equals one at zero; both local unbiasedness conditions hold.
The count variance is . Scaling by gives estimator variance and standard deviation .
Each outcome has unit phase information at this midpoint, so the reciprocal total information is , exactly the variance. The observed count gives through this local estimator.
The estimator saturates the local bound at zero with standard deviation 0.10 rad. The observed estimate is also 0.10 rad, but the equality of these numbers is incidental; its expectation away from zero is sine of phase rather than phase.
The living notebook
Explore the model
Interactive lab · sampling
Inspect a regular interior count distribution
Reset and set p = 0.5 and n = 100. Predict that the exact sample-mean variance is 0.0025, so the local estimator twice the fraction minus one has variance 0.01. Compare after a fresh Reset with p = 0 and n = 100: the distribution is degenerate and the normal comparison is disabled. The lab displays exact distributions, not repeated experiments, estimator confidence intervals, or a test of Cramér–Rao regularity.
- Mean sample proportion
- 0.5
- Sample-mean variance
- 0.0125
- Uniform CDF error bound
- ≤ 0.1062
Exact binomial masses for the mean of n independent Bernoulli trials, compared with normal mass between adjacent half-count boundaries; normal tails outside the finite support remain outside the bars. Playback highlights outcomes, not random samples. The Berry–Esseen bound applies to standardized CDFs, not individual bars or continuity-corrected errors. At p = 0 or 1, normal comparison and that bound are disabled. Normal-CDF evaluation uses a numerical approximation with absolute error below 7.5×10⁻⁸ (at most 1.5×10⁻⁷ per interval, before rounding). Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.
Look forAn interior binomial experiment and a deterministic boundary require different statistical care.
Pause & reason
Check your understanding
Your turn
Try it yourself
For eight independent Bernoulli outcomes with unknown success probability , use the deliberately biased estimator . At , calculate bias, variance, and mean-squared error. Compare with the regular unbiased bound .
Take a moment to make a prediction or work it out on paper. Open a hint when you need one.
Give me a hint
Use the mean and variance of the binomial count before rescaling; then add squared bias to variance.
Compare with the solution
The count has mean and variance . Thus the estimator mean is , bias is , and variance is . Its mean-squared error is . The unbiased variance bound is , slightly larger than this biased estimator's mean-squared error at the chosen point. There is no contradiction: the estimator derivative is , and the quoted bound concerns a different estimator class. Performance elsewhere must also be checked.
Keep the idea
Take it with you
- State unbiasedness, support, smoothness, and identifiability conditions with a precision bound.
- An optimal measurement and an efficient finite-data estimator are separate requirements.
- Bias and unresolved phase aliases can invalidate an inverse-information error claim.
Read further
Original sources and deeper explanations to follow at your own pace.
Optional progress, saved in this browser when available. Revisit any lesson at any time.
Lesson not marked complete.