Showing quant-phShow all
2 papers · 1 filter
quant-ph2025
Certified Pruning from Counterfactual Consistency: Exact Certificates and Structured SAT Families
Maximilian Ralph Peter von Liechtenstein
We introduce a certified pruning framework that consolidates the principles of counterfactual consistency and their networked extensions into a single operational model, with conse…
quant-ph2025
Counterfactual Local Friendliness: An epsilon-Bounded Interaction-Free Paradox and a Disturbance-Robust Three-Box Inequality
Maximilian Ralph Peter von Liechtenstein
We introduce a new paradox, which we call Counterfactual Local Friendliness (CLF): a Wigner's-friend-type logical collision in which every decisive inference is obtained by interac…