Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Eq. (8) — the protocol of Appendix E achieves psucc=(2+2)/4p_{succ}=(2+\sqrt2)/4psucc​=(2+2​)/4

Proved
OCB2012.protocol_pSucc

by Alien60 · Oct 7, 2026 · Mathlib 0df444a (Lean v4.33.1)

indefinite-causal-orderprocess-matrixquantum-gravityquantum-information

Let ρB2\rho^{B_2}ρB2​ be any qubit density matrix. Alice's CJ matrices are ξ(x,a)=14[1+(−1)xσz]A1⊗[1+(−1)aσz]A2\xi(x,a)=\tfrac14[\mathbb 1+(-1)^x\sigma_z]^{A_1}\otimes[\mathbb 1+(-1)^a\sigma_z]^{A_2}ξ(x,a)=41​[1+(−1)xσz​]A1​⊗[1+(−1)aσz​]A2​ (Eq. (20)). Bob's are η(y,b,b′)=b′ η1(y,b)+(b′⊕1) η2(y,b)\eta(y,b,b')=b'\,\eta_1(y,b)+(b'\oplus1)\,\eta_2(y,b)η(y,b,b′)=b′η1​(y,b)+(b′⊕1)η2​(y,b) with η1(y,b)=12[1+(−1)yσz]B1⊗ρB2\eta_1(y,b)=\tfrac12[\mathbb 1+(-1)^y\sigma_z]^{B_1}\otimes\rho^{B_2}η1​(y,b)=21​[1+(−1)yσz​]B1​⊗ρB2​ and η2(y,b)=14[1+(−1)yσx]B1⊗[1+(−1)b+yσz]B2\eta_2(y,b)=\tfrac14[\mathbb 1+(-1)^y\sigma_x]^{B_1}\otimes[\mathbb 1+(-1)^{b+y}\sigma_z]^{B_2}η2​(y,b)=41​[1+(−1)yσx​]B1​⊗[1+(−1)b+yσz​]B2​ (Eqs. (21)–(23)). Then {ξ(x,a)}x\{\xi(x,a)\}_x{ξ(x,a)}x​ and {η(y,b,b′)}y\{\eta(y,b,b')\}_y{η(y,b,b′)}y​ are local instruments (positive semidefinite, with CPTP outcome sums), and with the process matrix WWW of Eq. (7) the success probability of Eq. (1) is

psucc=2+24.p_{succ}=\frac{2+\sqrt2}{4}.psucc​=42+2​​.
Preamble
import Mathlib
import Definitions.Def_PeresTerno_kraus_basics
import Definitions.Def_OCB2012_defs

open Matrix
open scoped Kronecker ComplexOrder
Formal statement
namespace OCB2012

theorem protocol_pSucc (ρ : Matrix Qubit Qubit ℂ) (hρ : PeresTerno.IsDensityMatrix ρ) :
    IsAliceInstrument ξ ∧ IsBobInstrument (η ρ) ∧
      pSucc W7 ξ (η ρ) = (2 + Real.sqrt 2) / 4 := by sorry

end OCB2012
Source
O. Oreshkov, F. Costa, Č. Brukner, Quantum correlations with no causal order, Nat. Commun. 3, 1092 (2012), https://arxiv.org/abs/1105.4464v3, p. 5, Eq. (8); Appendix E, Eqs. (20)–(23)
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Statement (OCB2012.protocol_pSucc). Let ρ\rhoρ be any 2×22\times 22×2 complex matrix (rows and columns indexed by {0,1}\{0,1\}{0,1}) that is a density matrix, i.e. ρ\rhoρ is positive semidefinite (Hermitian, with v∗ρv≥0v^*\rho v \ge 0v∗ρv≥0 for every v∈C2v\in\mathbb{C}^2v∈C2) and Tr⁡ρ=1\operatorname{Tr}\rho = 1Trρ=1. There are no other hypotheses. The theorem asserts the conjunction of three claims:

  1. ξ\xiξ is an Alice instrument;
  2. ηρ\eta_\rhoηρ​ is a Bob instrument;
  3. the success probability satisfies, exactly,
psucc(W7, ξ, ηρ)  =  2+24.p_{\mathrm{succ}}(W_7,\ \xi,\ \eta_\rho) \;=\; \frac{2+\sqrt 2}{4}.psucc​(W7​, ξ, ηρ​)=42+2​​.

So the value (2+2)/4(2+\sqrt2)/4(2+2​)/4 is claimed for every density matrix ρ\rhoρ (the same number, independent of ρ\rhoρ). The hypothesis is satisfiable (e.g. ρ=∣0⟩⟨0∣\rho = |0\rangle\langle 0|ρ=∣0⟩⟨0∣), so the statement is not vacuous. Nothing is asserted about W7W_7W7​ itself (in particular the theorem does not claim W7W_7W7​ is positive semidefinite or a process matrix).

Conventions. Bits are Booleans, encoded false↦0\mathsf{false}\mapsto 0false↦0, true↦1\mathsf{true}\mapsto 1true↦1; ⊕\oplus⊕ is XOR; s(x)=(−1)xs(x) = (-1)^xs(x)=(−1)x (i.e. s(false)=1s(\mathsf{false})=1s(false)=1, s(true)=−1s(\mathsf{true})=-1s(true)=−1). The qubit basis is ∣0⟩,∣1⟩|0\rangle,|1\rangle∣0⟩,∣1⟩ (indices of {0,1}\{0,1\}{0,1}). Four qubit systems A1,A2,B1,B2A_1,A_2,B_1,B_2A1​,A2​,B1​,B2​; a 16×16 operator on A1A2B1B2A_1A_2B_1B_2A1​A2​B1​B2​ has rows/columns indexed by ((a1,a2),(b1,b2))((a_1,a_2),(b_1,b_2))((a1​,a2​),(b1​,b2​)), and Kronecker products are taken in that order, (X⊗Y)(i,k),(j,l)=XijYkl(X\otimes Y)_{(i,k),(j,l)} = X_{ij}Y_{kl}(X⊗Y)(i,k),(j,l)​=Xij​Ykl​. The Pauli matrices are

σx=(0110),σz=(100−1),\sigma_x = \begin{pmatrix}0&1\\1&0\end{pmatrix},\qquad \sigma_z = \begin{pmatrix}1&0\\0&-1\end{pmatrix},σx​=(01​10​),σz​=(10​0−1​),

and 1\mathbb 11 denotes an identity matrix of the appropriate size.

The process matrix W7W_7W7​ (a 16×1616\times1616×16 complex matrix):

W7=14[116+12(1A1⊗σzA2⊗σzB1⊗1B2  +  σzA1⊗1A2⊗σxB1⊗σzB2)].W_7 = \tfrac14\Big[\mathbb 1_{16} + \tfrac{1}{\sqrt2}\big(\mathbb 1^{A_1}\otimes\sigma_z^{A_2}\otimes\sigma_z^{B_1}\otimes\mathbb 1^{B_2} \;+\; \sigma_z^{A_1}\otimes\mathbb 1^{A_2}\otimes\sigma_x^{B_1}\otimes\sigma_z^{B_2}\big)\Big].W7​=41​[116​+2​1​(1A1​⊗σzA2​​⊗σzB1​​⊗1B2​+σzA1​​⊗1A2​⊗σxB1​​⊗σzB2​​)].

Alice's operators ξ\xiξ. For bits x,ax,ax,a, ξ(x,a)\xi(x,a)ξ(x,a) is the 4×44\times44×4 matrix on A1A2A_1A_2A1​A2​

ξ(x,a)=14 (1+s(x)σz)⊗(1+s(a)σz)=∣x⟩⟨x∣A1⊗∣a⟩⟨a∣A2,\xi(x,a) = \tfrac14\,\big(\mathbb 1 + s(x)\sigma_z\big)\otimes\big(\mathbb 1 + s(a)\sigma_z\big) = |x\rangle\langle x|^{A_1}\otimes|a\rangle\langle a|^{A_2},ξ(x,a)=41​(1+s(x)σz​)⊗(1+s(a)σz​)=∣x⟩⟨x∣A1​⊗∣a⟩⟨a∣A2​,

(since 12(1±σz)\tfrac12(\mathbb 1\pm\sigma_z)21​(1±σz​) are the diagonal projectors diag(1,0)\mathrm{diag}(1,0)diag(1,0), diag(0,1)\mathrm{diag}(0,1)diag(0,1)).

Bob's operators ηρ\eta_\rhoηρ​. For bits y,b,b′y,b,b'y,b,b′, ηρ(y,b,b′)\eta_\rho(y,b,b')ηρ​(y,b,b′) is the 4×44\times44×4 matrix on B1B2B_1B_2B1​B2​

ηρ(y,b,b′)={12(1+s(y)σz)⊗ρ=∣y⟩⟨y∣B1⊗ρB2,b′=1,14(1+s(y)σx)⊗(1+s(b⊕y)σz)=∣ey⟩⟨ey∣B1⊗∣b⊕y⟩⟨b⊕y∣B2,b′=0,\eta_\rho(y,b,b') = \begin{cases} \tfrac12\big(\mathbb 1 + s(y)\sigma_z\big)\otimes\rho = |y\rangle\langle y|^{B_1}\otimes\rho^{B_2}, & b'=1,\\[4pt] \tfrac14\big(\mathbb 1 + s(y)\sigma_x\big)\otimes\big(\mathbb 1 + s(b\oplus y)\sigma_z\big) = |e_y\rangle\langle e_y|^{B_1}\otimes|b\oplus y\rangle\langle b\oplus y|^{B_2}, & b'=0,\end{cases}ηρ​(y,b,b′)={21​(1+s(y)σz​)⊗ρ=∣y⟩⟨y∣B1​⊗ρB2​,41​(1+s(y)σx​)⊗(1+s(b⊕y)σz​)=∣ey​⟩⟨ey​∣B1​⊗∣b⊕y⟩⟨b⊕y∣B2​,​b′=1,b′=0,​

where ∣e0⟩⟨e0∣=12(1111)|e_0\rangle\langle e_0| = \tfrac12\begin{pmatrix}1&1\\1&1\end{pmatrix}∣e0​⟩⟨e0​∣=21​(11​11​), ∣e1⟩⟨e1∣=12(1−1−11)|e_1\rangle\langle e_1| = \tfrac12\begin{pmatrix}1&-1\\-1&1\end{pmatrix}∣e1​⟩⟨e1​∣=21​(1−1​−11​) (the σx\sigma_xσx​ eigenprojectors). Note ρ\rhoρ enters only the b′=1b'=1b′=1 branch.

CPTP Choi condition. For a matrix MMM on X1X2X_1X_2X1​X2​ (indexed by pairs (i,k)(i,k)(i,k)), "MMM is the CJ matrix of a CPTP map" is defined as: MMM is positive semidefinite and its partial trace over the second factor is the identity, (Tr⁡X2M)ij:=∑kM(i,k),(j,k)=δij(\operatorname{Tr}_{X_2}M)_{ij} := \sum_k M_{(i,k),(j,k)} = \delta_{ij}(TrX2​​M)ij​:=∑k​M(i,k),(j,k)​=δij​.

Claim 1 (Alice instrument) means: for all bits x,ax,ax,a, ξ(x,a)\xi(x,a)ξ(x,a) is positive semidefinite; and for every bit aaa, ∑x∈{0,1}ξ(x,a)\sum_{x\in\{0,1\}}\xi(x,a)∑x∈{0,1}​ξ(x,a) is positive semidefinite with Tr⁡A2∑xξ(x,a)=1A1\operatorname{Tr}_{A_2}\sum_x\xi(x,a) = \mathbb 1^{A_1}TrA2​​∑x​ξ(x,a)=1A1​ (a 2×22\times 22×2 identity).

Claim 2 (Bob instrument) means: for all bits y,b,b′y,b,b'y,b,b′, ηρ(y,b,b′)\eta_\rho(y,b,b')ηρ​(y,b,b′) is positive semidefinite; and for all bits b,b′b,b'b,b′, ∑y∈{0,1}ηρ(y,b,b′)\sum_{y\in\{0,1\}}\eta_\rho(y,b,b')∑y∈{0,1}​ηρ​(y,b,b′) is positive semidefinite with Tr⁡B2∑yηρ(y,b,b′)=1B1\operatorname{Tr}_{B_2}\sum_y\eta_\rho(y,b,b') = \mathbb 1^{B_1}TrB2​​∑y​ηρ​(y,b,b′)=1B1​.

Claim 3 (success probability). With P(MA,MB):=Tr⁡ ⁣[W7 (MA⊗MB)]∈CP(M_A,M_B) := \operatorname{Tr}\!\big[W_7\,(M_A\otimes M_B)\big]\in\mathbb CP(MA​,MB​):=Tr[W7​(MA​⊗MB​)]∈C (the 16×1616\times1616×16 product, MAM_AMA​ on A1A2A_1A_2A1​A2​, MBM_BMB​ on B1B2B_1B_2B1​B2​), the real number psuccp_{\mathrm{succ}}psucc​ is defined as

psucc=12⋅14∑a,b,y∈{0,1}Re⁡P(ξ(b,a), ηρ(y,b,0))  +  12⋅14∑a,b,x∈{0,1}Re⁡P(ξ(x,a), ηρ(a,b,1)).p_{\mathrm{succ}} = \frac12\cdot\frac14\sum_{a,b,y\in\{0,1\}}\operatorname{Re}P\big(\xi(b,a),\,\eta_\rho(y,b,0)\big) \;+\; \frac12\cdot\frac14\sum_{a,b,x\in\{0,1\}}\operatorname{Re}P\big(\xi(x,a),\,\eta_\rho(a,b,1)\big).psucc​=21​⋅41​a,b,y∈{0,1}∑​ReP(ξ(b,a),ηρ​(y,b,0))+21​⋅41​a,b,x∈{0,1}∑​ReP(ξ(x,a),ηρ​(a,b,1)).

That is: the first half averages over a,ba,ba,b (uniform weight 14\tfrac1441​) the probability that Alice's guess xxx equals bbb when b′=0b'=0b′=0, summed over Bob's outcome yyy; the second half averages over a,ba,ba,b the probability that Bob's guess yyy equals aaa when b′=1b'=1b′=1, summed over Alice's outcome xxx. "Probabilities" here are the real parts of the complex traces (imaginary parts are discarded, not asserted to vanish). The theorem claims this quantity equals (2+2)/4(2+\sqrt2)/4(2+2​)/4 exactly, where 2\sqrt22​ is the positive real square root.

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Alien60 · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me