Skip to content
Shadow Theory

Sealed or Leaky Section 8

What a quantum preparation description necessarily omits

Section 9 of 17

8 What a quantum preparation description necessarily omits

An ontological model assigns to each preparation PP a probability measure μP\mu_P on a measurable space Λ\Lambda and to each binary measurement MjM_j a measurable response ξj:Λ→[0,1]\xi_j:\Lambda\to[0,1], with p(j∣Mj,P)=∫ξj dμPp(j\mid M_j,P)=\int\xi_j\,d\mu_P. The response is fixed by the measurement and the ontic state; it does not depend separately on the preparation procedure. Randomized preparation is represented convex-linearly:

μ∑aqaPa=∑aqaμPa. \mu_{\sum_a q_aP_a}=\sum_aq_a\mu_{P_a}.

These are explicit modeling commitments. Calling them simply “realism” would conceal their mathematical content. In particular, the objects μP\mu_P are distributions of possible individual states, not individual states themselves. Preparation contextuality concerns these distributions [12, 1].

8.1 A sharp finite-table separation and a robust witness

Let n1,n2,n3n_1,n_2,n_3 be coplanar unit Bloch vectors with n1+n2+n3=0n_1+n_2+n_3=0. Write P±iP_{\pm i} for the preparations of the six pure qubit states with Bloch vectors ±ni\pm n_i, and let MjM_j measure the projector with Bloch vector njn_j. Define

qj,±i:=p(j∣Mj,P±i),dji:=qj,+i−qj,−i,νi:=12(μ+i+μ−i). q_{j,\pm i}:=p(j\mid M_j,P_{\pm i}),\qquad d_{ji}:=q_{j,+i}-q_{j,-i},\qquad \nu_i:=\tfrac12(\mu_{+i}+\mu_{-i}).

Each randomized preparation has density matrix I/2I/2 in the ideal quantum realization. Its probabilities are

qi,+i=1,qi,−i=0,qj,+i=14,qj,−i=34(j≠i). q_{i,+i}=1,\quad q_{i,-i}=0,\qquad q_{j,+i}=\tfrac14,\quad q_{j,-i}=\tfrac34\quad(j\ne i). (28)
Theorem 8.1 (Robust pairwise preparation separation)

Status: Proved.

For any convex-linear ontological model, any four preparations P±i,P±jP_{\pm i},P_{\pm j} and any three binary measurements indexed by distinct i,j,ki,j,k, one has

TV(νi,νj) ≥ max⁡{0,−1+dii+djj−dji−dij4−dki+dkj2}. \TV(\nu_i,\nu_j)\ \ge\ \max\left\{0,-1+ \frac{d_{ii}+d_{jj}-d_{ji}-d_{ij}}4 -\frac{d_{ki}+d_{kj}}2\right\}. (29)

No outcome determinism or measurement noncontextuality is assumed. For the ideal trine table (28), every pair i≠ji\ne j obeys

TV(νi,νj)≥14. \TV(\nu_i,\nu_j)\ge\tfrac14. (30)

The constant 1/41/4 is sharp for this finite preparation–measurement table. If every probability used in (29) differs from its ideal value by at most ϵ\epsilon, then

TV(νi,νj)≥max⁡{0,14−4ϵ}. \TV(\nu_i,\nu_j)\ge\max\{0,\tfrac14-4\epsilon\}. (31)
Proof

Put xa=2ξa−1∈[−1,1]x_a=2\xi_a-1\in[-1,1], D=xi−xj∈[−2,2]D=x_i-x_j\in[-2,2], and f=−Dxk/4∈[−1/2,1/2]f=-Dx_k/4\in[-1/2,1/2]. Four pointwise inequalities are

12f≥14ξi−14ξj−12ξk,12f≥−12−14ξi+14ξj+12ξk,−12f≥−14ξi+14ξj−12ξk,−12f≥−12+14ξi−14ξj+12ξk.\begin{aligned}\tfrac12 f&\ge\tfrac14\xi_i-\tfrac14\xi_j-\tfrac12\xi_k,\\ \tfrac12 f&\ge-\tfrac12-\tfrac14\xi_i+\tfrac14\xi_j+\tfrac12\xi_k,\\ -\tfrac12 f&\ge-\tfrac14\xi_i+\tfrac14\xi_j-\tfrac12\xi_k,\\ -\tfrac12 f&\ge-\tfrac12+\tfrac14\xi_i-\tfrac14\xi_j+\tfrac12\xi_k. \end{aligned}

Their respective differences, left side minus right side, are (2−D)(1+xk)/8(2-D)(1+x_k)/8, (2+D)(1−xk)/8(2+D)(1-x_k)/8, (2+D)(1+xk)/8(2+D)(1+x_k)/8, and (2−D)(1−xk)/8(2-D)(1-x_k)/8, all nonnegative. Integrate these inequalities against μ+i,μ−i,μ+j,μ−j\mu_{+i},\mu_{-i},\mu_{+j}, \mu_{-j} respectively and add. Their left sides sum to ∫f d(νi−νj)\int f\,d(\nu_i-\nu_j) and their right sides to the expression in (29). Since f+1/2f+1/2 takes values in [0,1][0,1], ∫f d(νi−νj)≤TV(νi,νj)\int f\,d(\nu_i-\nu_j)\le\TV(\nu_i,\nu_j). This proves the general inequality. Substitution of dii=djj=1d_{ii}=d_{jj}=1 and all four cross terms equal to −1/2-1/2 gives 1/41/4. Each dabd_{ab} can change by at most 2ϵ2\epsilon, and the sum of the absolute coefficients of the six dd terms is 22, giving (31). The following construction proves sharpness.

□
Proposition 8.2 (A saturating model of the finite table)

Status: Proved.

Let Λ\Lambda consist of the six binary strings 100,010,001,110,101,011100,010,001,110,101,011, and set ξj(v)=vj\xi_j(v)=v_j. Let eie_i be the iith binary unit vector. Give μ+i\mu_{+i} mass 1/21/2 at eie_i, mass 1/41/4 at each of ei+eje_i+e_j with j≠ij\ne i, and zero elsewhere. Define μ−i\mu_{-i} by bitwise complementation of μ+i\mu_{+i}. Extend preparation assignments convex-linearly. This model reproduces (28) and has TV(νi,νj)=1/4\TV(\nu_i,\nu_j)=1/4 for every i≠ji\ne j.

Proof

The iith bit is always one under μ+i\mu_{+i}; each other bit is one with probability 1/41/4. Complementation supplies the negative preparation probabilities. The distribution νi\nu_i has mass 1/41/4 at eie_i and 1−ei\mathbf1-e_i, and mass 1/81/8 at the other four strings. For i≠ji\ne j, four masses differ by 1/81/8, so the total-variation distance is 12(4/8)=1/4\frac12(4/8)=1/4.

□

This proves sharpness for the displayed finite table, not sharpness of the minimum inaccessible information among models reproducing all qubit measurements. Such a global optimum is not established here.

Theorem 8.3 (Separation from the trine mixture)

Status: Proved.

Put ν4=(μ+1+μ+2+μ+3)/3\nu_4=(\mu_{+1}+\mu_{+2}+\mu_{+3})/3. For the ideal table (28), all four mixtures prepare I/2I/2 and

∑i=13TV(νi,ν4)≥12,max⁡iTV(νi,ν4)≥16. \sum_{i=1}^3\TV(\nu_i,\nu_4)\ge\tfrac12, \qquad \max_i\TV(\nu_i,\nu_4)\ge\tfrac16. (32)

The sum constant is sharp for this finite table. For arbitrary probability data represented by the same ontological model,

∑i=13TV(νi,ν4)≥−32+16∑iqi,+i+12∑i∑j≠i(qj,−i−qj,+i). \sum_{i=1}^3\TV(\nu_i,\nu_4)\ge -\tfrac32+\tfrac16\sum_iq_{i,+i} +\tfrac12\sum_i\sum_{j\ne i}(q_{j,-i}-q_{j,+i}). (33)

Consequently entrywise probability error at most ϵ\epsilon implies the lower bound max⁡{0,1/2−13ϵ/2}\max\{0,1/2-13\epsilon/2\} for the sum.

Proof

Apply the same Markov kernel to each ontic distribution, taking conditionally independent binary bits bjb_j with success probabilities ξj(λ)\xi_j(\lambda). This preserves all the probabilities qj,±iq_{j,\pm i}, commutes with preparation mixtures, and contracts total variation. It suffices to prove the bound for the resulting distributions on {0,1}3\{0,1\}^3; this mathematical coupling asserts no joint physical measurability of the three quantum measurements.

For an ideal table, let Di={ei,1−ei}D_i=\{e_i,\mathbf1-e_i\}. The sets DiD_i are disjoint. Under μ+i\mu_{+i} the iith bit is one, and each other bit is one with probability 1/41/4, so the union bound gives μ+i(ei)≥1/2\mu_{+i}(e_i)\ge1/2. Complementarily μ−i(1−ei)≥1/2\mu_{-i}(\mathbf1-e_i)\ge1/2. Hence νi(Di)≥1/2\nu_i(D_i)\ge1/2 and

∑iTV(νi,ν4)≥∑i[νi(Di)−ν4(Di)]≥32−1=12. \sum_i\TV(\nu_i,\nu_4) \ge\sum_i[\nu_i(D_i)-\nu_4(D_i)]\ge\tfrac32-1=\tfrac12.

In the saturating model of Proposition 8.2, ν4\nu_4 is uniform on the six nonconstant strings. Each TV(νi,ν4)=1/6\TV(\nu_i,\nu_4)=1/6.

For the robust assertion define hi(b)∈[−1/2,1/2]h_i(b)\in[-1/2,1/2] as follows: on 000000 all hi=−1/2h_i=-1/2; on 111111 all hi=1/2h_i=1/2; on the remaining six strings hi=1/2h_i=1/2 when coordinate ii is the minority bit and hi=−1/2h_i=-1/2 otherwise. Put H(b)=∑ihi(b)H(b)=\sum_ih_i(b). For each ii the following inequalities hold on all eight strings:

12hi−13H≥14+16bi−12∑j≠ibj,12hi≥−34+12∑j≠ibj. \tfrac12h_i-\tfrac13H\ge \tfrac14+\tfrac16b_i-\tfrac12\sum_{j\ne i}b_j, \qquad \tfrac12h_i\ge-\tfrac34+\tfrac12\sum_{j\ne i}b_j.

For completeness, the respective slacks as a function of the bit bib_i and the number rr of ones among the other two bits are

(bi,r)(0,0)(0,1)(0,2)(1,0)(1,1)(1,2)first slack01/67/6001/3second slack1/200100 \begin{array}{c|rrrrrr} (b_i,r)&(0,0)&(0,1)&(0,2)&(1,0)&(1,1)&(1,2)\\\hline \text{first slack}&0&1/6&7/6&0&0&1/3\\ \text{second slack}&1/2&0&0&1&0&0 \end{array}

and are nonnegative. Integrate the first inequality against μ+i\mu_{+i}, the second against μ−i\mu_{-i}, and sum over ii. The left side equals ∑i∫hi d(νi−ν4)\sum_i\int h_i\,d(\nu_i-\nu_4) and is at most ∑iTV(νi,ν4)\sum_i\TV(\nu_i,\nu_4). The right side is (33). The total absolute probability coefficient is 3/6+12/2=13/23/6+12/2=13/2, proving the noise bound.

□

Likewise, the noise bound applies directly to the specified mixtures of the actual preparations. To call these mixtures members of one density-matrix fiber under experimental imperfections requires a separate certificate that their density matrices remain equal. Approximate tomographic agreement alone does not establish exact operational equivalence. Secondary preparations can sometimes supply exact equivalences within a specified operational model; the relevant experimental methodology is developed in [7].

Corollary 8.4 (Conditional noninjectivity of the preparation readout)

Status: Proved conditional on a convex-linear ontological model reproducing the trine table and tomographically complete qubit statistics.

Suppose a convex-linear ontological model reproduces the trine table and a tomographically complete set of quantum measurements. On the set of realized preparation distributions the map p(μP)=ρPp(\mu_P)=\rho_P is well defined and noninjective. Its fiber over I/2I/2 contains three distributions whose pairwise total-variation distances are at least 1/41/4.

Proof

Equality of two ontic distributions gives equality of all modeled outcome probabilities, hence equality of density matrices by tomography. The three distributions νi\nu_i share density matrix I/2I/2 and are distinct by (30).

□

The conclusion is preparation contextuality expressed as incompleteness of a specified preparation readout. It does not establish incompleteness of a pure state as the individual ontic state, of a universal quantum state, or of the total internal operational description. Indeed, the Beltrametti–Bugajski model takes rays as ontic states, assigns pure preparations Dirac measures, proper mixtures their convex-linear mixtures, and Born response functions [2]. Pure states are complete in that model although distinct proper mixtures with the same density matrix remain distinct ontic distributions. This explicit countermodel blocks the stronger inference. The underlying qualitative obstruction is Spekkens' preparation-contextuality theorem [12]; total variation as a measure of inaccessible preparation information is prior work of Marvian [1]. The finite-table inequality and its displayed constants are derived here; no exhaustive priority claim is made.