5. Entanglement
The proof of Theorem 4 (http://planetmath.org/3distributeddynamicalsystems#Thmthm4)showed the structure presheaf
has non-unique descent,reflecting the fact that measuring devices do not necessarilyreduce to products
of subdevices. Similarly, as we will see,measurements do not in general decompose into independent
submeasurements. Entanglement, , quantifies how far ameasurement diverges in bits from the product of itssubmeasurements. It turns out that is necessary fora system to generate more information than the sum of itscomponents: non-unique descent thus provides “room at the top”to build systems that perform more precise measurementscollectively than the sum of their components.
Entanglement has no direct relation to quantum entanglement.The name was chosen because of a formal resemblance between thetwo quantities, see Supplementary Information of [1].
Definition 10.
Entanglement over partition of is
where and .
Projecting via marginalizes onto the subspace. Entanglement thus compares the measurementperformed by the entire system with submeasurements over thedecomposition of the source occasions into partition .
Theorem 9 (effective information decomposes additively whenentanglement is zero).
Proof: Follows from the observations that (i) if and only if ; (ii);and (iii) the uniform distribution on is a tensor ofuniform distributions on subsystems of .
The theorem shows the relationship between effective informationand entanglement. If a system generates more information “thanit should” (meaning, more than the sum of its subsystems), thenthe measurements it generates are entangled. Alternatively, onlyindecomposable measurements can be more precise than the sum oftheir submeasurements.
We conclude with some detailed computations for, Diagram (11) (http://planetmath.org/4measurement#id2).Let .
Theorem 10 (entanglement and effective information for).
Proof:The first equality follows from Propositions 5 (http://planetmath.org/4measurement#Thmthm5)and 6 (http://planetmath.org/4measurement#Thmthm6)
From the same propositions it follows that equals
Entanglement quantifies how far the size of the pre-image of deviates from the sizes of its and slices as and are varied.
By Corollary 8 (http://planetmath.org/4measurement#Thmthm8)entanglement also equals . InDiagram (11) (http://planetmath.org/4measurement#id2)entanglement is the vertical arrow minus both arrows at thebottom, or the difference between opposing diagonal arrows.Note that the diagonal arrows from left to right areconstructed by adding edge to the nullsystem and the subsystem respectively. Entanglement is thedifference between the information generated by the diagonalarrows. It quantifies the difference between the information generates in two different contexts.
Corollary 11 (characterization of disentangled set-valued functions).
Function performs adisentangled measurement when outputting iff
for any such that .
Proof:By Theorem 10 entanglement is zero iff
for any such that . This implies the desiredresult since .
Thus, the measurement generated by is disentangled iff itspre-image satisfies a strong geometric“rectangularity” constraint: that the pre-image decomposesinto the product of its and slices forall pairs of slices intersecting . Thecategorizations performed within a disentangled measuringdevice have nothing to do with each other, so that the deviceis best considered as two (or more) distinct devices thathappen to have been grouped together for the purposes ofperforming a computation.
Example 4.
An XOR-gate outputting 0generates an entangled measurement. The pre-image is so the XOR-gate generates 1 bitof information about occasions and . However,the bit is not localizable. The measurementgenerates no information about occasion taken singly,since its output could have been 0 or 1 with equalprobability; and similarly for .
Finally, and unsurprisingly, a function is completelydisentangled across all its measurements iff it is aproduct of two simpler functions:
Corollary 12 (completely disentangled functions are products).
If is surjective, then
for all iff decomposes into for and.
Proof:The reverse implication is trivial.In the forward direction, note that and, by Corollary 11, each pre-image has productstructure . Let and similarly for . Define
and similarly for .
References
- 1 David Balduzzi & Giulio Tononi(2009): Qualia: the geometry ofintegrated information. PLoS Comput Biol5(8), p. e1000462,doi:10.1371/journal.pcbi.1000462.