There are bipartite quantum nonlocal correlations requiring very low detection efficiency to reach the loophole-free regime but that need too many measurement settings to be practical for actual experiments. This leads to the general problem of what can be concluded about loophole-free Bell nonlocality if only a random subset of these settings is tested. Here we develop a method to address this problem. We show that, in some cases, it is possible to detect loophole-free Bell nonlocality by testing only a small random fraction of the settings. The consequence is a higher detection efficiency. The method allows for the design of loophole-free Bell tests in which, given a quantum correlation that violates a Bell inequality, one can calculate the minimum fraction of contexts needed to reach the detection-loophole-free regime. The results also enforce a different way of thinking about how local realistic models or classical communication can be used to simulate quantum nonlocal correlations, as it shows that the amount of resources that are needed can be made arbitrarily large simply by considering more contexts.
Loophole-free quantum nonlocality often demands experiments with high complexity (defined by all parties' settings and outcomes) and multiple efficient detectors. Here, we identify the fundamental efficiency and complexity thresholds for quantum steering using two-qubit entangled states. Remarkably, it requires only one photon detector on the untrusted side, with efficiency
ε>1/X, where
X≥2 is the number of settings on that side. This threshold applies to all pure entangled states, in contrast to analogous Bell-nonlocality tests, which require almost unentangled states to be loss-tolerant. We confirm these predictions in a minimal-complexity (
X=2 for the untrusted party and a single three-outcome measurement for the trusted party), detection-loophole-free photonic experiment with $ε= (51.6 \pm 0.4)\% $.