Optimal unentangled single-shot test and four probabilities
OpenQAlgorithms.Papers.Independent.Intakenext100.P96.unentangled_single_shotWork in the retained vacuum/single-photon model, on a signal space with vacuum and orthogonal single-photon modes. Let be the background probability per mode, with , and let be the reflection probability. Set
Let be any unit single-photon vector with zero vacuum amplitude, let , and put . With equal prior probabilities of absence and presence, the binary measurement , guessing present on yes, minimizes the error among all binary POVMs. Its four conditional probabilities are
The labels denote object absent and present. This gives both the decision measurement and its complete conditional law, without claiming uniqueness when the states coincide.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P96
noncomputable section
open Filter
open scoped BigOperators Topology ComplexConjugate ComplexOrder Matrix.Norms.L2Operator
namespace QAlgorithms.Papers.Independent.Intakenext100.P96
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF p.3, (2): optimal equal-prior single-shot test and all four conditional
probabilities. Optimality is not uniqueness, including at eta=0. -/
theorem unentangled_single_shot (p : ModelParameters)
(psi : EuclideanSpace ℂ (Fin p.d)) (hpsi : IsState psi) :
IsEffect (signalTest psi) ∧
(∀ M : Matrix (SignalIndex p.d) (SignalIndex p.d) ℂ, IsEffect M →
binaryError (background p.d p.b) (signalPresent p.b p.eta psi) (signalTest psi) ≤
binaryError (background p.d p.b) (signalPresent p.b p.eta psi) M) ∧
effectProb (1 - signalTest psi) (background p.d p.b) = 1 - p.b ∧
effectProb (1 - signalTest psi) (signalPresent p.b p.eta psi) =
(1 - p.b) * (1 - p.eta) ∧
effectProb (signalTest psi) (background p.d p.b) = p.b ∧
effectProb (signalTest psi) (signalPresent p.b p.eta psi) =
p.b * (1 - p.eta) + p.eta := by sorry
end QAlgorithms.Papers.Independent.Intakenext100.P96
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Let consist of a natural number and real numbers with , , and , and let satisfy . On , define , , , and . Write and . The theorem asserts that and , that for every matrix on satisfying and , and that
The parameter range includes , , , , and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.