Related papers: Universal security for randomness expansion from t…
The combination of various physically plausible properties, such as no signaling, determinism, and experimental free will, is known to be incompatible with quantum correlations. Hence, these properties must be individually or jointly…
To reproduce in a local hidden variables theory correlations that violate Bell inequalities, communication must occur between the parties. We show that the amount of violation of a Bell inequality imposes a lower bound on the average…
In recent decades, quantum technologies have made significant strides toward achieving quantum utility. However, practical applications are hindered by challenges related to scaling the number of qubits and the depth of circuits. In this…
Any Quantum Key Distribution (QKD) protocol consists first of sequences of measurements that produce some correlation between classical data. We show that these correlation data must violate some Bell inequality in order to contain…
Brakerski et. al [BCM+18] introduced the model of cryptographic testing of a single untrusted quantum device and gave a protocol for certifiable randomness generation. We use the leakage resilience properties of the Learning With Errors…
We present a family of quantum money schemes with classical verification which display a number of benefits over previous proposals. Our schemes are based on hidden matching quantum retrieval games and they tolerate noise up to 23%, which…
Quantum-proof randomness extractors are an important building block for classical and quantum cryptography as well as device independent randomness amplification and expansion. Furthermore they are also a useful tool in quantum Shannon…
We show that monogamy of Bell's inequality violations, which is strictly weaker condition than no-signaling is enough to prove security of quantum key distribution. We derive our results for a whole class of monogamy constraints and…
Quantum nonlocality in networks featuring multiple independent sources underpins large-scale quantum communication and poses fundamental challenges for its characterization. In this work, we construct a family of explicit nonlinear Bell…
We revisit the definitions of error and disturbance recently used in error-disturbance inequalities derived by Ozawa and others by expressing them in the reduced system space. The interpretation of the definitions as mean-squared deviations…
Non-classical quantum correlations underpin both the foundations of quantum mechanics and modern quantum technologies. Among them, Bell nonlocality is a central example. For bipartite Bell inequalities, nonlocal correlations obey strict…
The Ekert 91 quantum key distribution (QKD) protocol appears to be secure whatever devices legitimate users adopt for the protocol, as long as the devices give a result that violates Bell's inequality. However, this is not the case if they…
We present a feasible and scalable approach to testing Bell nonlocality and implementing device-independent quantum key distribution (DI-QKD) between distant atomic states in cavity-based architectures, mediated by hybrid atom-light…
A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the…
The field of device-independent quantum cryptography has seen enormous success in the past several years, including security proofs for key distribution and random number generation that account for arbitrary imperfections in the devices…
The aim of this note is to attract attention of experimenters to the original Bell (OB) inequality which was shadowed by the common consideration of the CHSH inequality. There are two reasons to test the OB inequality and not the CHSH…
To generate genuine random numbers, random number generators based on quantum theory are essential. However, ensuring that the process used to produce randomness meets desired security standards can pose challenges for traditional quantum…
The standard randomized benchmarking protocol requires access to often complex operations that are not always directly accessible. Compiler optimization does not always ensure equal sequence length of the directly accessible universal gates…
Recently, a physically realistic protocol amplifying the randomness of Santha-Vazirani sources producing cryptographically secure random bits was proposed; however for reasons of practical relevance, the crucial question remained open…
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that…