The laws of physics are CPT-symmetric, yet laboratory quantum mechanics prepares the past and only samples the future. This working paper distinguishes five levels of taking the symmetry seriously — symmetric laws with the open future left implicit, a two-boundary description, symmetric processes, a nontrivial final boundary, and laboratory access to it — places published views and experiments on them, and states what each predicts for a final-boundary test, in which an engineered terminal acts on a flag and an entangled partner is read on every trial. Exact results: an open future propagates backward through any physical channel; a terminal can only transfer, never manufacture, final-side contrast, giving lambda = tanh(hbar omega / 2 k T_f) in a swap model, the mirror of a reset; a clamp of budget A needs an energy of at least k T_f ln A in some branch; under free local control any every-trial final condition signals, with visibility equal to the clamp strength. Under stated transfer models a null reads as a lower bound on a swap-equivalent final temperature (Partridge: above 3.5e7 K for escaping microwaves; planned qubit tests: about 27 K and 360 K). The paper audits transport to the future, specifies what any physical source of a final condition must supply, and finds that no named candidate meets the specification. CPT motivates the reversed-resource question; channel duality bounds its possible transfer; laboratory access remains an additional physical hypothesis, decided only by experiment. No new experimental result is reported. Drafted with AI assistance and revised after AI-assisted reviews; responsibility rests with the author.
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce a chosen initial state, however, for the final state measurement chooses a random value instead. As e.g. pull/push, negative/positive pressure, stimulated emission/absorption causing deexcitation/excitation are CPT analogs, and one can be used for state preparation, the second should allow for its CPT analog, referred here as CPT(state preparation) - allowing for additional chosen enforcement of the final state, its more active treatment than measurement. It should act similarly to postselection, but through applied physical constraints (instead of running multiple times). Like pumped to
∣1⟩ prepared state vs its "unpumped"
⟨0∣ CPT analog, hopefully allowing to construct two-way quantum computers (2WQC) e.g. hydrodynamical, and hopefully photonic: seen as
⟨Φfinal∣Uquantum gates∣Φinitial⟩ like for scattering matrix, with influenced both initial and final states. If possible, for example for an instance of 3-SAT problem on
n variables, we could prepare ensemble of
2n inputs with Hadamard gates, calculate 3-SAT alternatives for them, and use CPT(state preparation) to enforce outcomes of all these alternatives to '1'. This way hopefully restricting this ensemble to satisfying given 3-SAT problem:
∑a:SAT(a)∣a⟩, in theory allowing to attack NP problems by simultaneously pushing and pulling information through the system for better control.
Standard one-way quantum computers (1WQC) combine time symmetric unitary evolution, with asymmetric treatment of boundaries: state preparation allows to enforce chosen initial state, however, for the final state measurement chooses a random value instead. As e.g. pull/push, negative/positive pressure, stimulated emission/absorption causing deexcitation/excitation are CPT analogs, and one can be used for state preparation, there should also exist its CPT analog, referred here as CPT(state preparation) - allowing for additional chosen enforcement of the final state, its more active treatment than measurement. It should act similarly to postselection, but through applied physical constraints (instead of running multiple times). Like pumped to |1> prepared state vs its "unpumped" <0| CPT analog, hopefully allowing to construct two-way quantum computers (2WQC) e.g. hydrodynamical, and hopefully photonic, with influenced both initial and final states. If possible, for example for an instance of 3-SAT problem on n variables, we could prepare ensemble of 2^n inputs with Hadamard gates, calculate 3-SAT alternatives for them, and use CPT(state preparation) to enforce outcomes of all these alternatives to '1'. This way hopefully restricting this ensemble to satisfying given 3-SAT problem, in theory allowing to attack NP problems by simultaneously pushing and pulling information through the system for better control.