Manuscript Hawk01-A@1 · Hawk01-A.tex · theorem · 11979653

Theorem: Sharp measure-before-query bound

Exact delayed-query scoring and classical nulls · lines 787–837 · proof included or linked

Hawk01-A@1#thm:classical, Hawk01-A@1#eq:EBform, Hawk01-A@1#eq:EBbound

Back to manuscript

Suppose the complete channel from the trusted qubit is measure-and-prepare:

with the measurement performed before the fresh query. Then

The bound is sharp, even with a two-outcome measurement and a one-bit classical record. It also holds when the complete pre-query output is an arbitrary classical record generated by a POVM on the trusted qubit.

Proof. Giving the decoder the entire label can only improve its performance. Write

For the classical label channel, the requested-bit probability difference is

where and . Equation (eq:helstromscore) therefore gives

The final inequality uses . Measuring along attains equality. For a continuous outcome space the same proof uses the trace measure of the POVM and its Bloch-vector density.

Displayed formulas in this passage

  • Hawk01-A@1#eq:EBform · line 791

  • Hawk01-A@1#eq:EBbound · line 799

  • unlabeled · line 812

  • unlabeled · line 820

  • unlabeled · line 826

Nearby in this section