research40 min studyLesson 449 in Physics

Compare quantum enhancement after noise acts

Calculate flagged-loss information and optimize independent and GHZ frequency probes under a specified Markovian dephasing model with a fixed observation budget.

On this page

What you’ll understand

  • Include unsuccessful sensing attempts in a loss-limited resource budget.
  • Optimize interrogation duration when coherence decays exponentially.
  • Distinguish model-specific scaling limits from a universal ban on entanglement advantages.

An ideal entangled probe can respond rapidly to phase while losing that response rapidly to noise. Whether it improves a measurement therefore depends on the entire noisy channel and the resource budget, not just the input state's information. Two transparent models show how the comparison changes: flagged erasure removes successful interrogations, while independent Markovian dephasing shortens the useful lifetime of collective coherence. Neither example describes every quantum sensor.

Count discarded attempts

Consider an explicit erasure model in which each of N probes survives independently with probability η\eta. An ideal GHZ interrogation retains phase information only if every probe survives; any loss produces a flagged outcome carrying no phase information. The probability of a usable event is therefore ηN\eta^N. Since the success flag is independent of the unknown phase, the Fisher information per attempted batch is the success probability times the conditional information, namely ηNN2\eta^N N^2. This is a defined channel model, not a formula for every optical loss process.

Conditioning on successful runs can leave an impressive phase variance, but it does not account for the resources spent on failures. A fair particle budget includes every attempted probe, any heralded preparation failures, and the elapsed time consumed before rejection. Independent equatorial probes in this same erasure model retain information from each surviving particle separately, giving expected information proportional to the number that survive. State which flags are available and what measurement follows a loss before comparing the two input strategies.

Fϕ,attemptGHZ=ηNN2,Fϕ,attemptind=NηF_{\phi,\mathrm{attempt}}^{\mathrm{GHZ}}=\eta^N N^2,\qquad F_{\phi,\mathrm{attempt}}^{\mathrm{ind}}=N\eta
These are per-attempt phase informations for independent, phase-independent flagged erasures with survival probability η. The GHZ model assumes every any-loss output is phase uninformative, while each surviving independent probe remains useful. Probe preparation is counted before erasure.↔ Scroll wide equations horizontally.

Optimize duration under independent dephasing

Now assume each probe's off-diagonal coherence decays as e−γte^{-\gamma t}, with known Markovian rate γ>0\gamma>0, while a constant angular-frequency offset is encoded. Independent probes have midpoint frequency information Nt2e−2γtNt^2e^{-2\gamma t} per batch. A GHZ state's coherence decays as e−Nγte^{-N\gamma t} for independent local dephasing, giving N2t2e−2NγtN^2t^2e^{-2N\gamma t}. Both formulas assume suitable local readout and neglect preparation and readout overhead. The factor of two comes from squared contrast, not from redefining the coherence lifetime.

For a fixed observation time TT, the available repetition count is approximately T/tT/t. Total independent-probe information is consequently NTte−2γtNTt e^{-2\gamma t}. Differentiating its logarithm gives an optimum t=1/(2γ)t=1/(2\gamma). The GHZ optimum is shorter by N, at t=1/(2Nγ)t=1/(2N\gamma). Substitution gives the same optimized total information for these two strategies. Comparing them at one arbitrary common duration would miss this reoptimization and could overstate or understate the actual gap.

Fω,totind=NTte−2γt,Fω,totGHZ=N2Tte−2Nγt,max⁡tFω,tot=NT2eγF_{\omega,\mathrm{tot}}^{\mathrm{ind}}=NTt e^{-2\gamma t},\quad F_{\omega,\mathrm{tot}}^{\mathrm{GHZ}}=N^2Tt e^{-2N\gamma t},\qquad \max_tF_{\omega,\mathrm{tot}}=\frac{NT}{2e\gamma}
Both maxima agree for these independent-probe and GHZ strategies under independent exponential dephasing, fixed N and T, negligible overhead, and many repeatable cycles. γ is in s⁻¹; angular-frequency information has units s². This is not a global theorem that every entangled input has identical performance.↔ Scroll wide equations horizontally.

Interpret the limit at its actual scope

Equality of those two optimized examples does not prove that every entangled state is useless. Other states may offer constant improvements, and other noise models can change the asymptotic scaling. Spatial correlations, non-Markovian short-time behavior, monitored environments, ancillary systems, and available control all affect the channel and its resource cost. General limits must specify those assumptions. A result for independent fixed-strength noise should not be extrapolated silently to a protected collective mode or a different encoding Hamiltonian.

Error correction also requires distinguishing signal from noise. A correction that removes the same generator through which the desired parameter acts can erase the signal along with the disturbance. Useful protected sensing needs a physical separation that preserves parameter response while suppressing the relevant errors, plus a budget for controls and ancillas. In practical design, calculate the output-state information or measured likelihood after the proposed protection, include preparation time and failures, and compare against an optimized independent baseline using the same laboratory constraints.

An entangled fringe after flagged erasure

In the explicit erasure model, use N=4N=4 probes with independent survival probability η=1/2\eta=1/2. Compare phase information per attempted batch for a GHZ input and four independent equatorial inputs. Then compare total information for one hundred attempted batches.

  1. The GHZ success probability is (1/2)4=1/16(1/2)^4=1/16. Each successful batch has phase information 42=164^2=16, but multiplying by success probability gives information 11 per attempted batch.

  2. Independent inputs retain information from each survivor. Their expected information is Nη=4(1/2)=2N\eta=4(1/2)=2 per attempted batch. Partial survival still provides usable independent outcomes in this model.

  3. One hundred independent attempts give total informations 100100 and 200200. Their regular local standard-deviation bounds are 0.10 rad0.10\,\mathrm{rad} and 1/200≈0.0707 rad1/\sqrt{200}\approx0.0707\,\mathrm{rad}, respectively; each strategy attempted four hundred particle interrogations.

The result

Under this channel and budget, independent probes have twice the information per attempt. Quoting only the GHZ successful-event information of sixteen would hide the failures and reverse the comparison unfairly.

Explore the model

Interactive lab

Interactive lab · probability

Inspect survival counts without simulating decoherence

Reset and set success probability to 0.5 and trials to 4. Predict mean survivors 2, variance 1, and all-four-success probability 1/16 from the exact binomial bars. Compare with a fresh Reset and p = 1, n = 4, where all four survive deterministically. Playback does not generate random losses. This lab models independent binary survival counts only; it has no GHZ coherence, noisy density matrix, dephasing rate, or output-state information.

Inspect survival counts without simulating decoherenceThese are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Current readings: Mean · np: 5; Variance · np(1−p): 2.5; Total probability: 1. All parameters are adjustable with the labeled controls below.03581000.070.150.220.3Successes kP(X = k)k = 0 · P = 9.77e-4
Exact probabilityHighlighted outcomeMean np
Mean · np
5
Variance · np(1−p)
2.5
Total probability
1
t = 0 s

These are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. 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 forThe survival probability of every member multiplies, while failed attempts still consume the preparation budget.

Check your understanding

Under the stated independent exponential dephasing model and zero overhead, how does the optimal GHZ interrogation time compare with that of independent probes?

Try it yourself

Let N=5N=5, γ=2 s−1\gamma=2\,\mathrm{s^{-1}}, and T=10 sT=10\,\mathrm s, with zero overhead. Calculate the optimal interrogation times, corresponding repetition counts, and optimized total angular-frequency information for the independent and GHZ strategies.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

The optimal times differ, but substituting each into its own total-information formula gives a common value.

Compare with the solution

Independent probes use t=1/(2γ)=0.25 st=1/(2\gamma)=0.25\,\mathrm s and m=40m=40 batches. GHZ probes use t=1/(2Nγ)=0.050 st=1/(2N\gamma)=0.050\,\mathrm s and m=200m=200. Each total information is NT/(2eγ)=50/(4e)=12.5/e≈4.598 s2NT/(2e\gamma)=50/(4e)=12.5/e\approx4.598\,\mathrm{s^2}. Thus each local standard-deviation bound is e/12.5≈0.4663 rad s−1\sqrt{e/12.5}\approx0.4663\,\mathrm{rad\,s^{-1}}. The resources fixed here are five available parallel probes and ten seconds, so the strategies use different numbers of freshly prepared particle interrogations.

Take it with you

  • Loss-conditioned precision must be weighted by success probability per attempted resource.
  • Independent dephasing can force shorter entangled interrogation and remove a scaling advantage.
  • Noise limits require a specified channel, available controls, and an optimized comparison budget.

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.