Related papers: Tilted Hardy paradoxes for device-independent rand…
We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…
We consider a data-driven robust hypothesis test where the optimal test will minimize the worst-case performance regarding distributions that are close to the empirical distributions with respect to the Wasserstein distance. This leads to a…
We demonstrate one-sided device-independent self-testing of any pure entangled two-qubit state based on a fine-grained steering inequality. The maximum violation of a fine-grained steering inequality can be used to witness certain steerable…
Unsharp quantum measurements provide a resource in scenarios where one faces the trade-off between information gain and disturbance. In this work we introduce a prepare-transform-measure scenario in which two-outcome unsharp measurements…
We establish a quantitative relation between Hardy's paradox and the breaking of uncertainty principle in the sense of measurement-disturbance relations in the conditional measurement of non-commuting operators. The analysis of the…
In quantum cryptography, device-independent (DI) protocols can be certified secure without requiring assumptions about the inner workings of the devices used to perform the protocol. In order to display nonlocality, which is an essential…
Device-independent quantum key distribution allows for proving the security of a shared cryptographic key between two distant parties with potentially untrusted devices. The security proof is based on the measurement outcome statistics…
In this paper, we analyze several critical issues in semi-device independent quantum information processing protocol. In practical experimental realization randomness generation in that scenario is possible only if the efficiency of the…
Hardy's argument constitutes an elegant proof of quantum nonlocality. In this work, we report an exotic application of Hardy's nonlocal correlations in two-party communication setup. We come up with a task, wherein a positive payoff can be…
Quantum correlations and non-projective measurements underlie a plethora of information-theoretic tasks, otherwise impossible in the classical world. Existing schemes to certify such non-classical resources in a device-independent manner…
It is well-known that observing nonlocal correlations allows us to draw conclusions about the quantum systems under consideration. In some cases this yields a characterisation which is essentially complete, a phenomenon known as…
We generalize Hardy's proof of nonlocality to the case of bipartite mixed statistical operators, and we exhibit a necessary condition which has to be satisfied by any given mixed state $\sigma$ in order that a local and realistic hidden…
A recent sequence of works, initially motivated by the study of the nonlocal properties of entanglement, demonstrate that a source of information-theoretically certified randomness can be constructed based only on two simple assumptions:…
By applying Hardy's argument, we demonstrate the violation of local realism in a gedanken experiment using independent and separated particle sources.
Quantum nonlocality offers a secure way to produce random numbers: their unpredictability is intrinsic and can be certified just by observing the statistic of the measurement outcomes, without assumptions on how they are produced. To do…
The question of certifying quantum nonlocality under a relaxation of the assumptions in the Bell theorem has gained traction, with potential for device-independent applications under weak seeds and cross-talk. Recently, it was shown that…
The randomness from a quantum random number generator (QRNG) relies on the accurate characterization of its devices. However, device imperfections and inaccurate characterizations can result in wrong entropy estimation and bias in practice,…
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state…
Reliable randomness is a core ingredient in algorithms and applications ranging from numerical simulations to statistical sampling and cryptography. The outcomes of measurements on entangled quantum states can violate Bell inequalities,…
From dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A…