Optimal joint single-shot test and four probabilities
OpenQAlgorithms.Papers.Independent.Intakenext100.P96.entangled_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
Use the resource , transmitting only the signal and retaining the ancillary photon perfectly. Write , , and . With equal prior probabilities, the ideal joint measurement , guessing present on yes, minimizes error among all binary effects on signal and ancilla. The four conditional probabilities are
The labels denote absence and presence. These probabilities express the effective background reduction from to .
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 pp.6--7, (9): the ideal Phi_d joint projector is an optimal equal-prior
single-shot test, with all four displayed conditional probabilities. -/
theorem entangled_single_shot (p : ModelParameters) :
IsEffect (pairTest p.d) ∧
(∀ M : Matrix (SignalIndex p.d × Fin p.d) (SignalIndex p.d × Fin p.d) ℂ,
IsEffect M →
binaryError (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta) (pairTest p.d) ≤
binaryError (pairAbsent p.d p.b) (pairPresent p.d p.b p.eta) M) ∧
effectProb (1 - pairTest p.d) (pairAbsent p.d p.b) = 1 - p.b / (p.d : ℝ) ∧
effectProb (1 - pairTest p.d) (pairPresent p.d p.b p.eta) =
(1 - p.b / (p.d : ℝ)) * (1 - p.eta) ∧
effectProb (pairTest p.d) (pairAbsent p.d p.b) = p.b / (p.d : ℝ) ∧
effectProb (pairTest p.d) (pairPresent p.d p.b p.eta) =
(1 - p.eta) * (p.b / (p.d : ℝ)) + 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 satisfying , , and . Let , , and define a vector on by and . Set , , and . Writing and , the theorem asserts that and , that for every matrix on satisfying and , and that
The allowed parameters include , , , , and .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.