Post-selection games formalise a paradox of quantum possibility

Víctor Calleja Rodríguez, Ivan A. Bocanegra-Garay, and Mateus Araújo have formally defined a long-studied quantum paradox within a new framework called “post-selection games.” This work generalizes nonlocal games by allowing a referee to discard rounds, a feature that unlocks an unbounded advantage in statistical power compared to traditional methods. The researchers demonstrate this advantage through algorithms computing local and Tsirelson bounds, and a visual comparison, featured in the accompanying image, showing improved performance even with imperfect detection equipment. This development offers a pathway to more robust analysis of Bell tests in noisy conditions.

Algorithms for Computing Bounds in Post-selection Games

Algorithms for computing local and Tsirelson bounds have been developed to analyze post-selection games, a newly formalized framework for understanding quantum nonlocality. These algorithms allow researchers to precisely define the limits of classical behavior within these games, providing a benchmark against which to measure quantum advantages. The work builds upon the formalization of Hardy’s paradox within post-selection games, transforming a specific example into a generalized, mathematically rigorous concept applicable to a wider range of scenarios.

The statistical power of post-selection games surpasses that of traditional nonlocal games, offering an unbounded advantage particularly when experimental conditions are imperfect. This improvement is visually demonstrated in the featured image, which compares the statistical power of the CHSH nonlocal game and the Hardy post-selection game as a function of detection efficiency.

The image reveals that the Hardy game maintains a higher statistical power, its ability to reliably detect quantum effects, even at lower detection efficiencies, a common limitation in real-world quantum experiments. Traditional Bell tests are highly susceptible to noise, which can obscure the subtle quantum signals needed to demonstrate nonlocality. Post-selection games circumvent this issue by allowing the discarding of rounds with noisy data, effectively “cleaning” the dataset and enhancing the clarity of the results.

The algorithms also compute the local bound, representing the maximum value achievable by any classical strategy, providing a clear distinction between classical and quantum behavior. The researchers explain that “as the resulting data is much cleaner, we need much less of it to have conclusive statistics,” highlighting the practical implications of their work. These algorithms are not limited to analyzing specific games like Hardy’s paradox. They have an unbounded advantage in statistical power over traditional nonlocal games, making them ideally suited for analysing Bell tests with low detection efficiency.

More like this

Quantum Research NewsQuantiCoat project funds technologies at the Center for quantum cryptography components

Quantum Research NewsResearchers at Princeton model a quantum world with limited complexity gains

PhysicsFermi arcs carry superconductivity in PtBi₂ while the bulk remains normal

Quantum PhysicsMeasurement records reveal the entanglement needed, not assumed, in a quantum system