Semi-device-independent randomness certification with partially free random sources using $$4\rightarrow 1$$ quantum random access code

2022 ◽  
Vol 21 (1) ◽  
Author(s):  
Xunan Wang ◽  
Jiabin Yuan ◽  
Yuqian Zhou ◽  
Ying Liu ◽  
Lili Fan
Keyword(s):  
Random Access ◽  
Access Code

Nonsignaling quantum random access-code boxes

2015 ◽  
Vol 92 (5) ◽  
Author(s):  
Andrzej Grudka ◽  
Michał Horodecki ◽  
Ryszard Horodecki ◽  
Antoni Wójcik
Keyword(s):  
Random Access ◽  
Access Code

scholarly journals Complementarity between entanglement-assisted and quantum distributed random access code

2017 ◽  
Vol 95 (5) ◽  
Author(s):  
Alley Hameedi ◽  
Debashis Saha ◽  
Piotr Mironowicz ◽  
Marcin Pawłowski ◽  
Mohamed Bourennane
Keyword(s):  
Random Access ◽  
Access Code

Semi-device-independent randomness expansion with partially free random sources using3→1quantum random access code

2016 ◽  
Vol 94 (3) ◽  
Author(s):  
Yu-Qian Zhou ◽  
Fei Gao ◽  
Dan-Dan Li ◽  
Xin-Hui Li ◽  
Qiao-Yan Wen
Keyword(s):  
Random Access ◽  
Access Code

The randomness in 2 $$\rightarrow $$ → 1 quantum random access code without a shared reference frame

2018 ◽  
Vol 17 (10) ◽  
Author(s):  
S.-J. Qin ◽  
Y.-K. Wang ◽  
R.-Z. Li ◽  
F. Gao ◽  
Q.-Y. Wen
Keyword(s):  
Reference Frame ◽  
Random Access ◽  
Access Code

scholarly journals Quantum Random Access Codes for Boolean Functions

Quantum ◽  
2021 ◽  
Vol 5 ◽  
pp. 402
Author(s):  
João F. Doriguello ◽  
Ashley Montanaro
Keyword(s):  
Boolean Function ◽  
Upper Bound ◽  
Boolean Functions ◽  
Success Probability ◽  
Random Access ◽  
Fixed Size ◽  
Multiplicative Constant ◽  
Noise Stability ◽  
Access Code ◽  
Quantum Protocols

An n↦pm random access code (RAC) is an encoding of n bits into m bits such that any initial bit can be recovered with probability at least p, while in a quantum RAC (QRAC), the n bits are encoded into m qubits. Since its proposal, the idea of RACs was generalized in many different ways, e.g. allowing the use of shared entanglement (called entanglement-assisted random access code, or simply EARAC) or recovering multiple bits instead of one. In this paper we generalize the idea of RACs to recovering the value of a given Boolean function f on any subset of fixed size of the initial bits, which we call f-random access codes. We study and give protocols for f-random access codes with classical (f-RAC) and quantum (f-QRAC) encoding, together with many different resources, e.g. private or shared randomness, shared entanglement (f-EARAC) and Popescu-Rohrlich boxes (f-PRRAC). The success probability of our protocols is characterized by the noise stability of the Boolean function f. Moreover, we give an upper bound on the success probability of any f-QRAC with shared randomness that matches its success probability up to a multiplicative constant (and f-RACs by extension), meaning that quantum protocols can only achieve a limited advantage over their classical counterparts.

Sign in / Sign up

Export Citation Format

Share Document