English
Related papers

Related papers: Semi-device independent random number expansion pr…

200 papers

Although quantum random number generators rely on the inherent indeterminism of quantum mechanics, ensuring that the numbers produced are secure remains a significant challenge. We introduce two semi-device-independent randomness expansion…

Quantum Physics · Physics 2026-04-09 Rutvij Bhavsar , Hamid Tebyanian , Roger Colbeck

A device-independent randomness expansion protocol aims to take an initial random seed and generate a longer one without relying on details of how the devices operate for security. A large amount of work to date has focussed on a particular…

Quantum Physics · Physics 2020-06-08 Peter J. Brown , Sammy Ragy , Roger Colbeck

The sequential quantum random access code (QRAC) allows two or more decoders to obtain a desired message with higher success probability than the best classical bounds by appropriately modulating the measurement sharpness. Here, we propose…

Quantum Physics · Physics 2021-05-03 Ya Xiao , Xin-Hong Han , Xuan Fan , Hui-Chao Qu , Yong-Jian Gu

Quantum Random Access Codes (QRACs) are key tools for a variety of protocols in quantum information theory. These are commonly studied in prepare-and-measure scenarios in which a sender prepares states and a receiver measures them. Here, we…

Quantum Physics · Physics 2019-08-21 Karthik Mohan , Armin Tavakoli , Nicolas Brunner

By testing the classical correlation violation between two systems, the random number can be expanded and certified without applying classical statistical method. In this work, we propose a new random number expansion protocol without…

Quantum Physics · Physics 2011-12-21 Hong-Wei Li , Zhen-Qiang Yin , Yu-Chun Wu , Xu-Bo Zou , Shuang Wang , Wei Chen , Guang-Can Guo , Zheng-Fu Han

We consider a communication method, where the sender encodes n classical bits into 1 qubit and sends it to the receiver who performs a certain measurement depending on which of the initial bits must be recovered. This procedure is called…

Quantum Physics · Physics 2009-06-15 Andris Ambainis , Debbie Leung , Laura Mancinska , Maris Ozols

We present a device-independent randomness expansion protocol, involving only a constant number of non-signaling quantum devices, that achieves \emph{infinite expansion}: starting with $m$ bits of uniform private randomness, the protocol…

Quantum Physics · Physics 2014-04-03 Matthew Coudron , Henry Yuen

Collaborative communication tasks such as random access codes (RACs) employing quantum resources have manifested great potential in enhancing information processing capabilities beyond the classical limitations. The two quantum variants of…

Quantum Physics · Physics 2017-05-31 Alley Hameedi , Debashis Saha , Piotr Mironowicz , Marcin Pawlowski , Mohamed Bourennane

Semi-device independent (Semi-DI) quantum random number generators (QRNG) gained attention for security applications, offering an excellent trade-off between security and generation rate. This paper presents a proof-of-principle time-bin…

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…

Quantum Physics · Physics 2023-11-23 Rutvij Bhavsar

In a world where Quantum Networks are rapidly becoming a reality, the development of the Quantum Internet is gaining increasing interest. Nevertheless, modern quantum networks are still in the early stages of development and have limited…

Randomness expansion where one generates a longer sequence of random numbers from a short one is viable in quantum mechanics but not allowed classically. Device-independent quantum randomness expansion provides a randomness resource of the…

An (n,m,p) Random Access Code (RAC) allows to encode n bits in an m bit message, in such a way that a receiver of the message can guess any of the original $n$ bits with probability p, greater than 1/2. In Quantum RAC's (QRACs) one…

Quantum Physics · Physics 2013-05-29 Marcin Pawlowski , Marek Zukowski

The quantum enhancement of success probability in the Random Access Code (RAC) protocols remains unexplored from two important perspectives. First, the use of entanglement between two co-measurable degrees of freedom of a single particle…

Quantum Physics · Physics 2026-05-19 Nilaj Saha , Sumit Mukherjee , Dipankar Home

In quantum cryptography, secure randomness expansion involves using a short private string of random bits to generate a longer one, even in the presence of an adversary who may have access to quantum resources. In this work, we demonstrate…

Quantum Physics · Physics 2024-10-01 Jaskaran Singh , Cameron Foreman , Kishor Bharti , Adán Cabello

We consider two classes of quantum generalisations of Random Access Code (RAC) and study lower bounds for probabilities of success for such tasks. It provides a useful framework for the study of certain information processing tasks with…

Quantum Physics · Physics 2023-06-16 Nitica Sakharwade , Michał Studziński , Michał Eckstein , Paweł Horodecki

Quantum Bell nonlocality allows for the design of protocols that amplify the randomness of public and arbitrarily biased Santha-Vazirani sources, a classically impossible task. Information-theoretical security in these protocols is…

Quantum Physics · Physics 2021-08-23 Gabriel Senno , Antonio Acín

In this paper we investigate properties of several randomness generation protocols in the device independent framework. Using Bell-type inequalities it is possible to certify that the numbers generated by an untrusted device are indeed…

Quantum Physics · Physics 2013-09-25 Piotr Mironowicz , Marcin Pawłowski

Randomness is a vital resource for modern day information processing, especially for cryptography. A wide range of applications critically rely on abundant, high quality random numbers generated securely. Here we show how to expand a random…

Quantum Physics · Physics 2016-11-02 Carl A. Miller , Yaoyun Shi

A (Quantum) Random Access Code ((Q)RAC) is a scheme that encodes $n$ bits into $m$ (qu)bits such that any of the $n$ bits can be recovered with a worst case probability $p>\frac{1}{2}$. Such a code is denoted by the triple $(n,m,p)$. It is…

Quantum Physics · Physics 2017-05-17 Ola Liabøtrø
‹ Prev 1 2 3 10 Next ›