Violation of the causal inequality: a four-qubit process with
ProvedOCB2012.causal_inequality_violationThere exist a four-qubit process matrix on (Eqs. (4)–(5)), a local instrument for Alice for each input bit , and a local instrument for Bob for each pair of input bits (positive semidefinite CJ matrices whose outcome sums are CJ matrices of CPTP maps) such that the success probability of the task of Eq. (1),
with independent and uniform, strictly exceeds the causal bound: .
import Mathlib import Definitions.Def_PeresTerno_kraus_basics import Definitions.Def_OCB2012_defs open Matrix open scoped Kronecker ComplexOrder
namespace OCB2012
theorem causal_inequality_violation :
∃ (W : Matrix ((Qubit × Qubit) × (Qubit × Qubit)) ((Qubit × Qubit) × (Qubit × Qubit)) ℂ)
(MA : Bool → Bool → Matrix (Qubit × Qubit) (Qubit × Qubit) ℂ)
(MB : Bool → Bool → Bool → Matrix (Qubit × Qubit) (Qubit × Qubit) ℂ),
IsProcessMatrix W ∧ IsAliceInstrument MA ∧ IsBobInstrument MB ∧
3 / 4 < pSucc W MA MB := by sorry
end OCB2012Read-back
What the Lean code literally says, in plain math · claude-opus-5-5
Read-back of OCB2012.causal_inequality_violation.
Setting. A "qubit" index set is , so every system is . Operators on (and on ) are complex matrices indexed by pairs , first component (resp. ), second (resp. ). Operators on all four systems are complex matrices indexed by , i.e. in the order . Bits are Booleans, with and . Nothing in the statement is universally quantified, and it has no hypotheses or typeclass parameters beyond the fixed concrete types above. The whole statement is a single existential claim.
The claim. There exist
- a complex matrix on ,
- a family of complex matrices on , indexed by two bits (first index = Alice's output/guess, second = her input),
- a family of complex matrices on , indexed by three bits (first index = Bob's guess, then inputs and ),
such that all four of the following hold simultaneously:
- is a process matrix (defined below);
- is an Alice instrument (defined below);
- is a Bob instrument (defined below);
- the success probability satisfies the strict inequality
No particular , or is required; in particular the statement does not refer to the specific matrices , , defined in the same file, nor to causal separability or any no-signalling condition. Any witnesses meeting conditions 1–4 suffice.
Auxiliary definitions, unfolded.
Partial trace over the second factor. For a matrix indexed by pairs , is the matrix with entries
For on this traces out (the output system); for on it traces out .
CPTP Choi condition. A matrix on "is the CJ matrix of a CPTP map" means exactly:
Here is Mathlib's positive semidefiniteness, which includes Hermiticity () together with for all complex vectors . No other condition (such as a particular Choi normalization convention or transpose) is imposed.
Probability of a pair of outcomes. For on and matrices on , on ,
where is the Kronecker product with , indexing and indexing .
Process matrix. is a process matrix iff
for every on and every on that both satisfy the CPTP Choi condition above. (This is an equality of complex numbers.)
Alice instrument. is an Alice instrument iff
- for all , and
- for each , the sum satisfies the CPTP Choi condition, i.e. it is PSD and its partial trace over equals (the identity).
Bob instrument. is a Bob instrument iff
- for all , and
- for each pair , the sum satisfies the CPTP Choi condition (PSD, partial trace over equals ).
The input index is allowed to change the whole instrument (the CPTP sum may differ for different inputs), and Bob's instrument may depend on both and .
Success probability. With (the real part of the complex trace),
Concretely: the first term uses Alice's matrix (her guess index set equal to Bob's input ) and Bob's , summed over Bob's guess ; the second uses Alice's , summed over her guess , and Bob's (his guess index set equal to Alice's input ). Each of the eight input triples thus carries weight , i.e. are treated as independent uniform bits; when success means Alice's guess equals , and when success means Bob's guess equals .
Edge cases and logical strength.
- The conclusion is a strict inequality of real numbers; equality would not suffice.
- Only real parts of the traces enter . Since and all , are required to be PSD (hence Hermitian, and is PSD), each trace is automatically a nonnegative real, so the real part loses nothing for witnesses satisfying conditions 1–3.
- The process-matrix condition is satisfiable (e.g. satisfies it, since then the trace equals ), so the hypotheses on the witnesses are not contradictory; the statement is not vacuous in that sense, and the content lies in exhibiting witnesses that additionally exceed .
- Given conditions 1–3, the normalization makes for each input triple, so for any valid witnesses; the claim asks for a value in .
- All dimensions are fixed at 2 for every system; the statement says nothing about other dimensions.
- The proof is currently
sorry(unproved).
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.