Manuscript X-Enter@1 · X-Enter.tex · theorem · 484b71bc

Theorem: Conditional selective relational readout

Option B: conditional relational inputs › A two-qubit program without pre-combination · lines 931–1010 · proof included or linked

X-Enter@1#thm:relational, X-Enter@1#eq:relmaps

Back to manuscript

On the encoded family (eq:phaseencoding), has complete selective record

with the unit residual on every positive branch. It is invariant under Hypothesis hyp:reference. Under (eq:matching), it is invariant on the whole convolution gauge algebra in the stated coefficient model.

Proof. The amplitudes after CNOT and Hadamard, in raw output order , are

The raw probabilities depend on . Thus reporting both raw bits would not be invariant.

For arbitrary two-qubit density operators, put

The path formula gives the actual selective maps

In the first line the two fine maps with bras are added, not postselected. Their effects sum to . All three maps sum to a trace-preserving map.

For the encoded input, the first line has weight . The other weights are , giving the stated law.

More generally, let

The failure effect commutes with , and both acquire the same phase . Consequently

This proves equality of the displayed selective maps, not just an unexamined equality of effects. The reference hypothesis induces exactly this collective phase shift. Condition (eq:matching) supplies the same conclusion for arbitrary convolution gauge directions.

Displayed formulas in this passage

  • X-Enter@1#eq:relmaps · line 970

  • unlabeled · line 935

  • unlabeled · line 949

  • unlabeled · line 962

  • unlabeled · line 994

  • unlabeled · line 1002

Nearby in this section