Bell projectors reproduce the two check-error effects
ProvedQAlgorithms.Papers.Independent.Intakenext100.P17.bell_check_identitiesLet and , and let . On the two-qubit space,
Thus computational-basis disagreement and Hadamard-basis disagreement have respectively the bit-error and phase-error effects of a Bell measurement. Equality of effects gives equality of these probabilities for every density operator. This identifies the diagnostic probabilities used in the security argument; it makes no assertion about equality of postmeasurement states.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakenext100_P17
namespace QAlgorithms.Papers.Independent.Intakenext100.P17
noncomputable section
open scoped ComplexConjugate
open Classical
open QAlgorithms.DopedTomography (bellVector)
open QAlgorithms.Papers.Independent.Support50.P04 (BinaryWord)
/-- PDF p.3, the two unnumbered displayed Bell-projector identities.
These are identities of marginal error effects, hence give the same Born error
probabilities for every density operator, including coherent Bell off-diagonal terms.
They assert neither joint measurement of incompatible bases nor equality of the
corresponding postmeasurement states. The frozen bellVector on two one-qubit
registers gives Psi+, i Psi-, Phi- for the Pauli labels X, Y, Z respectively;
the global phase i disappears in pureDensity. The first register is Alice's. -/
theorem bell_check_identities :
(pureDensity (bellVector (fun _ : Fin 1 => Stabilizer.Pauli.X)) + pureDensity (bellVector (fun _ : Fin 1 => Stabilizer.Pauli.Y)) =
pureDensity (ket (((fun _ => false), (fun _ => true)) : Qubits 1 × Qubits 1)) +
pureDensity (ket (((fun _ => true), (fun _ => false)) : Qubits 1 × Qubits 1))) ∧
(pureDensity (bellVector (fun _ : Fin 1 => Stabilizer.Pauli.Z)) + pureDensity (bellVector (fun _ : Fin 1 => Stabilizer.Pauli.Y)) =
pureDensity (xPair false true) + pureDensity (xPair true false)) := by sorry
end
end QAlgorithms.Papers.Independent.Intakenext100.P17
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
Write for the vector that is at the pair of one-bit strings and elsewhere, and write for the matrix with entries . Define
which are the vectors obtained by applying the indicated Pauli matrix to the second register of , and define for Boolean , interpreted as or . The theorem asserts both matrix identities
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.