Universal security for randomness expansion from the spot-checking protocol
From MaRDI portal
Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Linear operators belonging to operator ideals (nuclear, (p)-summing, in the Schatten-von Neumann classes, etc.) (47B10) Random number generation in numerical analysis (65C10) Contextuality in quantum theory (81P13) Quantum measurement theory, state operations, state preparations (81P15) Quantum coherence, entanglement, quantum correlations (81P40) Quantum cryptography (quantum-theoretic aspects) (81P94)
Abstract: Colbeck (Thesis, 2006) proposed using Bell inequality violations to generate certified random numbers. While full quantum-security proofs have been given, it remains a major open problem to identify the broadest class of Bell inequalities and lowest performance requirements to achieve such security. In this paper, working within the broad class of spot-checking protocols, we prove exactly which Bell inequality violations can be used to achieve full security. Our result greatly improves the known noise tolerance for secure randomness expansion: for the commonly used CHSH game, full security was only known with a noise tolerance of 1.5%, and we improve this to 10.3%. We also generalize our results beyond Bell inequalities and give the first security proof for randomness expansion based on Kochen-Specker inequalities. The central technical contribution of the paper is a new uncertainty principle for the Schatten norm, which is based on the uniform convexity inequality of Ball, Carlen, and Lieb (Inventiones mathematicae, 115:463-482, 1994).
Recommendations
Cites work
- A Fully Quantum Asymptotic Equipartition Property
- Amplifying the Randomness of Weak Sources Correlated With Devices
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Certifiable quantum dice, or, true random number generation secure against quantum adversaries
- Entanglement Sampling and Applications
- Entropic Fluctuations in Quantum Statistical Mechanics. An Introduction
- Entropy accumulation
- Infinite randomness expansion with a constant number of devices
- On quantum Rényi entropies: a new generalization and some properties
- Proposed experiment to test local hidden-variable theories
- Quantum -entropy inequalities: independent condition for local realism?
- Quantum information processing with finite resources. Mathematical foundations
- Relations for certain symmetric norms and anti-norms before and after partial trace
- Robust randomness amplifiers: upper and lower bounds
- Robust self-testing of the singlet
- SECURITY OF QUANTUM KEY DISTRIBUTION
- Sharp uniform convexity and smoothness inequalities for trace norms
- Simple and tight device-independent security proofs
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- Trevisan's extractor in the presence of quantum side information
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Cited in
(11)- Semi-device-independent randomness expansion using \(n\rightarrow1\) sequential quantum random access codes
- Robust randomness amplifiers: upper and lower bounds
- The effects of free will on randomness expansion
- Simple and tight device-independent security proofs
- Analysing causal structures with entropy
- A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness
- Certified randomness from quantum supremacy
- Improved device-independent randomness expansion rates using two sided randomness
- Self-testing of a single quantum device under computational assumptions
- No-signalling-projection-invariant Bell inequalities
- Generalised entropy accumulation
This page was built for publication: Universal security for randomness expansion from the spot-checking protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348456)
