Related papers: Maximal device-independent randomness in every dim…
An approach to quantum random number generation based on unambiguous quantum state discrimination (USD) is developed. We consider a prepare-and-measure protocol, where two non-orthogonal quantum states can be prepared, and a measurement…
Random numbers play a crucial role in numerous scientific applications. Source-independent quantum random number generators (SI-QRNGs) can offer true randomness by leveraging the fundamental principles of quantum mechanics, eliminating the…
We investigate how much randomness can be extracted from a generic partially entangled pure state of two qubits in a device-independent setting, where a Bell test is used to certify the correct functioning of the apparatus. For any such…
A wide range of applications require, by hypothesis, to have access to a high-speed, private, and genuine random source. Quantum Random Number Generators (QRNGs) are currently the sole technology capable of producing true randomness.…
We introduce a single-number metric, quantum volume, that can be measured using a concrete protocol on near-term quantum computers of modest size ($n\lesssim 50$), and measure it on several state-of-the-art transmon devices, finding values…
Device-independent quantum key distribution (DIQKD) provides a model of quantum key distribution with minimal assumptions and highly abstract theoretical building blocks. Although DIQKD frees us from detailed discussions of specific device…
Measurement outcomes on quantum systems exhibit inherent randomness and are fundamentally nondeterministic. This has enabled quantum physics to set new standards for the generation of true randomness with significant applications in the…
A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can…
The randomness expansion capabilities of semi-device-independent (SDI) prepare and measure protocols are analyzed under the sole assumption that the Hilbert state dimension is known. It's explicitly proved that the maximum certifiable…
In order to guarantee the output of a quantum computation, we usually assume that the component devices are trusted. However, when the total computation process is large, it is not easy to guarantee the whole system when we have scaling…
In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well…
Random numbers are indispensable for a variety of applications ranging from testing physics foundation to information encryption. In particular, nonlocality tests provide a strong evidence to our current understanding of nature -- quantum…
In recent years, several hacking attacks have broken the security of quantum cryptography implementations by exploiting the presence of losses and the ability of the eavesdropper to tune detection efficiencies. We present a simple attack of…
Device-independence is the gold standard of quantum cryptography. To meet this standard, a central assumption is that no information leakage occurs during protocol execution. We relax this assumption by analyzing CHSH-based randomness…
Randomness is both a useful way to model natural systems and a useful tool for engineered systems, e.g. in computation, communication and control. Fully random transformations require exponential time for either classical or quantum…
We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle…
We reverse-engineer, test and analyse hardware and firmware of the commercial quantum-optical random number generator Quantis from ID Quantique. We show that > 99% of its output data originates in physically random processes: random timing…
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…
A cloud quantum computer is similar to a random number generator in that its physical mechanism is inaccessible to its users. In this respect, a cloud quantum computer is a black box. In both devices, its users decide the device condition…
Non-deterministic random bits are needed in many scientific fields. Unfortunately today's computers are very limited in ability to produce them. We present here a method for extraction of non-deterministic random bits from random physics…