arXiv subjects

Soumyadip Patra

Publications and source records attributed to Soumyadip Patra.

6 recordsLinked to original sources

arXiv2026

Quantum Position Verification with Remote Untrusted Devices

Position information underpins many modern technologies, from navigation and timing to authentication and critical infrastructure. However, classical methods of proving that information originates from a particular position are vulnerable to spoofing. This limitation can be overcome with quantum technologies but current protocols rely on trust in quantum hardware that can be undermined, or require quantum computers and bounds on adversarial computation. Nevertheless, there has been significant interest in experimental demonstrations, and aspects of these protocols have been implemented. Here we introduce and experimentally demonstrate the Bell-test quantum position verification protocol for device-independent quantum position verification that guarantees security with only observed correlations from a loophole-free Bell test across a quantum network. We experimentally implement a version of this device-independent protocol against adversaries who, before each trial, are weakly entangled. Our demonstration achieves a one-dimensional localization 2.47(2) times smaller than the best, necessarily non-remote, classical localization protocol. Compared to classical protocols with identical latencies, the localization volume is 4.53(5) times smaller, and represents a certifiable quantum advantage. The general Bell-test protocol is loss tolerant and secure against adversaries with significant quantum resources. This work allows digital security to be anchored to physically trusted locations, enabling new position-based authentication protocols for applications such as financial transactions, legal agreements, and securing critical infrastructure.

quant-ph↗

arXiv2026

No-signalling-projection-invariant Bell inequalities

In this paper, we highlight how any Bell inequality for a configuration involving $n$ parties each performing one of $m$ binary-outcome measurements has a canonical form that is no-signalling-projection invariant. Specifically, the $L^2$-projection of weakly signalling data onto the no-signalling polytope leaves the violation of this canonical Bell inequality unchanged. Our methods allow us to derive a general closed formula for the projection and present a substantially more computationally simple procedure for its evaluation. We also show this can be generalised to non-standard projections of potential interest for certain applications. No-signalling projections serve as a preliminary step before undertaking any device-independent application involving Bell experiment data, such as hypothesis testing against local realism, random number generation and entanglement detection.

quant-ph↗

arXiv2026

Quantitative and Optimal Device-Independent Lower Bounds on Detection Efficiency

This paper examines a quantitative and optimal lower bound on the detector efficiency in a (2,2,2) Bell experiment within a fully device-independent framework, whereby the detectors used in the experiment are uncharacterized. We provide a tight lower bound on the minimum efficiency required to observe a desired Bell-CHSH violation using the Navascués-Pironio-Acín (NPA) hierarchy, confirming tightness up to four decimal places with numerical optimization over explicit quantum realizations. We then introduce the effect of dark counts and demonstrate how to quantify the minimum required efficiency to observe a desired CHSH violation with an increasing dark count error. Finally, to obtain an analytical closed-form expression of the minimum efficiency, we consider the set of no-signaling behaviors that satisfy the Tsirelson bound, which are easier to characterize than the quantum set. Using such behaviors, we find a simple closed-form expression for a lower bound on the minimum efficiency which is monotonically increasing with the CHSH violation, though the analytically obtained lower bounds are meaningfully below the numerically tight lower bound.

quant-ph↗

arXiv2026

Quantum Advantage over Wirings of Nonsignaling Boxes in Multipartite Networks

Quantum-entangled measurements are known to enable multi-party behaviors that are impossible with unentangled measurements on nonlocal resources, even those that are super-quantum and bound only by the no-signaling principle. This advantage can be witnessed by the entanglement swapping protocol, along with corresponding impossibility results for "nonlocality swapping". However, the advantage assumes the absence of pre-existing nonlocal resources shared by the swapped-to parties; it no longer holds if all pairs of parties are allowed to share bipartite nonlocal resources. Here, we consider a resource-theoretic perspective in which bipartite nonclassical resources are free resources that can be shared by any pair of parties in a multipartite network, and ask whether quantum entangled measurements can still provide an advantage over certain basic measurements, known as wirings, of nonsignaling nonlocal resources. We resolve this question in the affirmative by demonstrating an explicit four-party behavior that can be achieved with bipartite quantum resources subject to entangled measurements, and cannot be achieved if the bipartite resources are allowed to be more general nonsignaling nonlocal "boxes" so long as the measurements are restricted to local wirings, even also allowing for globally shared classical randomness. Furthermore, the argument generalizes: the same separation can be witnessed for K+2 parties with access to K-partite nonlocal resources for any K > 2. We also examine these results in different contexts, such as the star network configurations and scenarios not admitting globally shared classical randomness, further enhancing understanding of the capabilities of entangled measurements in multi-party configurations.

quant-ph↗

arXiv2024

Strength of statistical evidence for genuine tripartite nonlocality

Recent advancements in network nonlocality have led to the concept of local operations and shared randomness-based genuine multipartite nonlocality (LOSR-GMNL). In this paper, we consider two recent experimental demonstrations of LOSR-GMNL, focusing on a tripartite scenario where the goal is to exhibit correlations impossible in a network where each two-party subset shares bipartite resources and every party has access to unlimited shared randomness. Traditional statistical analyses measuring violations of witnessing inequalities by the number of experimental standard deviations do not account for subtleties such as memory effects. We demonstrate a more sound method based on the prediction-based ratio (PBR) protocol to analyse finite experimental data and quantify the strength of evidence in favour of genuine tripartite nonlocality in terms of a valid $p$-value. In our work, we propose an efficient modification of the test factor optimisation using an approximating polytope approach. By justifying a further restriction to a smaller polytope we enhance practical feasibility while maintaining statistical rigour.

quant-ph↗

arXiv2023

Asymptotically Optimal Adversarial Strategies for the Probability Estimation Framework

The Probability Estimation Framework involves direct estimation of the probability of occurrences of outcomes conditioned on measurement settings and side information. It is a powerful tool for certifying randomness in quantum non-locality experiments. In this paper, we present a self-contained proof of the asymptotic optimality of the method. Our approach refines earlier results to allow a better characterisation of optimal adversarial attacks on the protocol. We apply these results to the (2,2,2) Bell scenario, obtaining an analytic characterisation of the optimal adversarial attacks bound by no-signalling principles, while also demonstrating the asymptotic robustness of the PEF method to deviations from expected experimental behaviour. We also study extensions of the analysis to quantum-limited adversaries in the (2,2,2) Bell scenario and no-signalling adversaries in higher $(n,m,k)$ Bell scenarios.

quant-ph↗