Increased certification of semi-device independent random numbers using many inputs and more post-processing

DOI10.1088/1367-2630/18/6/065004MaRDI QIDQ5855052zbMATH OpenOpenAlexFDO

Authors Piotr Mironowicz, Armin Tavakoli, Alley Hameedi, Breno Marques, Marcin Pawłowski, M. Bourennane

Publication date 12 March 2021

Published in New Journal of Physics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://arxiv.org/abs/1511.05791

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: Quantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements of the postprocessing of experimental data. In particular, we consider semi-device independent randomness certification from an experiment using a four dimensional quantum system to violate the classical bound of a random access code. Using state-of-the-art techniques, a smaller quantum violation requires more computational power to demonstrate randomness, which at some point becomes impossible with today's computers although the randomness is (probably) still there. We show that by dedicating more input settings of the experiment to randomness certification, then by more computational postprocessing of the experimental data which corresponds to a quantum violation, one may increase the amount of certified randomness. Furthermore, we introduce a method that significantly lowers the computational complexity of randomness certification. Our results show how more randomness can be generated without altering the hardware and indicate a path for future semi-device independent protocols to follow.

Recommendations

• Improved security evaluation techniques for imperfect randomness from arbitrary distributions
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Robust randomness amplifiers: upper and lower bounds
• Bounds on Fixed Input/Output Length Post-processing Functions for Biased Physical Random Number Generators
• Randomness condensers for efficiently samplable, seed-dependent sources
• Amplifying the Randomness of Weak Sources Correlated With Devices
• Robust pseudo-random number generators with input secure against side-channel attacks
• True random number generators secure in a changing environment: improved security bounds
• Device-independent randomness certification using multiple copies of entangled states

Cites work

• scientific article; zbMATH DE number 1825622 (Why is no real title available?)
• Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
• More randomness from the same data
• Physical random numbers generated by radioactivity
• Proposed experiment to test local hidden-variable theories
• Semidefinite Programming
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(2)

• Semi-device-independent randomness certification with partially free random sources using \(4\rightarrow 1\) quantum random access code
• Device-independent randomness certification using multiple copies of entangled states

Describes a project that uses

Uses Software

• Octave

This page was built for publication: Increased certification of semi-device independent random numbers using many inputs and more post-processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855052)