Manuscript Oai272-A@1 · Oai272-A.tex · section · a40828a0
Conditioning, implementation error, and protocol restrictions
Conditioning, implementation error, and protocol restrictions · lines 1108–1116
Thus the plan's “drop two-way discussion” and “drop unlimited communication” entries require correction. A positive-rate comparison or a sharp one-way/two-way formula could be new work; the inherited zero upper bound is immediate. An entangled-game repetition theorem is not needed for that logical restriction.
Nearby in this section
- proposition: Proposition: Public conditioning and aborts
- proposition: Proposition: Complete-interface robustness
- section: Conditioning, implementation error, and protocol restrictions
- example: Example: Dropping the public record manufactures apparent secrecy
- proposition: Proposition: Restriction is not a new impossibility theorem