Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Expanding the sharpness parameter area based on sequential $$3{\rightarrow }1$$ parity-oblivious quantum random access code

Yao Xiao, Fen-Zhuo Guo, Haifeng Dong, Fei Gao

Published Apr 30, 2023• 6 citations
Publisher
DOI
10.1007/s11128-023-03924-3

Related papers

Semi-device-independent randomness expansion using $$n\rightarrow 1$$ sequential quantum random access codes

Xunan Wang, Jiabin Yuan, Yuqian Zhou +2 more

Quantum Information Processing•Oct 1, 2021•3 citations

Certification of three black boxes with unsharp measurements using 3 → 1 sequential quantum random access codes

Shihui Wei, Fenzhuo Guo, Fei Gao +1 more

Abstract Unsharp measurements play an increasingly important role in quantum information theory. In this paper, we study a three-party prepare-transform-measure experiment with unsharp measurements based on 3 → 1 sequential random access codes (RACs). We derive optimal trade-off between the two correlation witnesses in 3 → 1 sequential quantum random access codes (QRACs), and use the result to complete the self-testing of quantum preparations, instruments and measurements for three sequential parties. We also give the upper and lower bounds of the sharpness parameter to complete the robustness analysis of the self-testing scheme. In addition, we find that classical correlation witness violation based on 3 → 1 sequential RACs cannot be obtained by both correlation witnesses simultaneously. This means that if the second party uses strong unsharp measurements to overcome the classical upper bound, the third party cannot do so even with sharp measurements. Finally, we give the analysis and comparison of the random number generation efficiency under different sharpness parameters based on the determinant value, 2 → 1 and 3 → 1 QRACs separately. This letter sheds new light on generating random numbers among multi-party in semi-device independent framework.

arXiv:2103.03075•New Journal of Physics•Apr 8, 2021•8 citations

Source-device-independent randomness expansion using quantum random access codes

Yu-Qian Zhou, Qian-Kun Yao, Ya-Qi Dong +2 more

Quantum Information Processing•May 13, 2023•0 citations

Semi-device-independent certification of multiple unsharpness parameters through sequential measurements

Sumit Mukherjee, A. K. Pan

Based on a sequential communication game, semi-device-independent certification of an unsharp instrument has recently been demonstrated [K. Mohan, A. Tavakoli, and N. Brunner, New J. Phys. 21, 083034 (2019)]. In this paper, we provide semi-device-independent self-testing protocols in the prepare-measure scenario to certify multiple unsharpness parameters along with the states and the measurement settings. This is achieved through the sequential quantum advantage shared by multiple independent observers in a suitable communication game known as the parity-oblivious random-access code. We demonstrate that in the three-bit parity-oblivious random-access code at most three independent observers can sequentially share quantum advantage. The optimal pair (triple) of quantum advantages enables us to uniquely certify the qubit states, the measurement settings, and the unsharpness parameter(s). The practical implementation of a given protocol involves inevitable losses. In a suboptimal scenario, we derive a certified interval within which a specific unsharpness parameter has to be confined. We extend our treatment to the four-bit case and show that at most two observers can share quantum advantage for the qubit system. Further, we provide an outline to argue that four sequential observers can share the quantum advantage for the two-qubit system, thereby enabling the certification of three unsharpness parameters.

arXiv:2112.14559•Physical Review A•Dec 27, 2021•20 citations

Optimal bounds for parity-oblivious random access codes

André Chailloux, Iordanis Kerenidis, Srijita Kundu +1 more

Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n -bit string x , and wishes to encode x into a quantum state , such that Bob, when receiving the state , can choose any bit and recover the input bit x i with high probability. Here we study two variants: parity-oblivious random access codes (RACs), where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single bits x i ; and even-parity-oblivious RACs, where Bob cannot infer any information about the parity of any even-size subset of bits of the input. In this paper, we provide the optimal bounds for parity-oblivious quantum RACs and show that they are asymptotically better than the optimal classical ones. Our results provide a large non-contextuality inequality violation and resolve the main open problem in a work of Spekkens et al (2009 Phys. Rev. Lett. 102 010401 ). Second, we provide the optimal bounds for even-parity-oblivious RACs by proving their equivalence to a non-local game and by providing tight bounds for the success probability of the non-local game via semidefinite programming. In the case of even-parity-oblivious RACs, the cryptographic property holds also in the device independent model.

arXiv:1404.5153•New Journal of Physics•Apr 8, 2016•85 citations

Quantum low-density parity-check codes

Ivan B. Djordjević

Elsevier eBooks•Jan 1, 2022•4 citations
Expanding the sharpness parameter area based on sequential 3→13{\rightarrow }13→1 parity-oblivious quantum random access code
Semi-device-independent randomness expansion using n→1n\rightarrow 1n→1 sequential quantum random access codes
Abstract Unsharp measurements play an increasingly important role in quantum information theory. In this paper, we study a three-party prepare-transform-measure experiment with unsharp measurements based on 3 → 1 sequential random access codes (RACs). We derive optimal trade-off between the two correlation witnesses in 3 → 1 sequential quantum random access codes (QRACs), and use the result to complete the self-testing of quantum preparations, instruments and measurements for three sequential parties. We also give the upper and lower bounds of the sharpness parameter to complete the robustness analysis of the self-testing scheme. In addition, we find that classical correlation witness violation based on 3 → 1 sequential RACs cannot be obtained by both correlation witnesses simultaneously. This means that if the second party uses strong unsharp measurements to overcome the classical upper bound, the third party cannot do so even with sharp measurements. Finally, we give the analysis and comparison of the random number generation efficiency under different sharpness parameters based on the determinant value, 2 → 1 and 3 → 1 QRACs separately. This letter sheds new light on generating random numbers among multi-party in semi-device independent framework.
Based on a sequential communication game, semi-device-independent certification of an unsharp instrument has recently been demonstrated [K. Mohan, A. Tavakoli, and N. Brunner, New J. Phys. 21, 083034 (2019)]. In this paper, we provide semi-device-independent self-testing protocols in the prepare-measure scenario to certify multiple unsharpness parameters along with the states and the measurement settings. This is achieved through the sequential quantum advantage shared by multiple independent observers in a suitable communication game known as the parity-oblivious random-access code. We demonstrate that in the three-bit parity-oblivious random-access code at most three independent observers can sequentially share quantum advantage. The optimal pair (triple) of quantum advantages enables us to uniquely certify the qubit states, the measurement settings, and the unsharpness parameter(s). The practical implementation of a given protocol involves inevitable losses. In a suboptimal scenario, we derive a certified interval within which a specific unsharpness parameter has to be confined. We extend our treatment to the four-bit case and show that at most two observers can share quantum advantage for the qubit system. Further, we provide an outline to argue that four sequential observers can share the quantum advantage for the two-qubit system, thereby enabling the certification of three unsharpness parameters.
Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an n -bit string x , and wishes to encode x into a quantum state , such that Bob, when receiving the state , can choose any bit and recover the input bit x i with high probability. Here we study two variants: parity-oblivious random access codes (RACs), where we impose the cryptographic property that Bob cannot infer any information about the parity of any subset of bits of the input apart from the single bits x i ; and even-parity-oblivious RACs, where Bob cannot infer any information about the parity of any even-size subset of bits of the input. In this paper, we provide the optimal bounds for parity-oblivious quantum RACs and show that they are asymptotically better than the optimal classical ones. Our results provide a large non-contextuality inequality violation and resolve the main open problem in a work of Spekkens et al (2009 Phys. Rev. Lett. 102 010401 ). Second, we provide the optimal bounds for even-parity-oblivious RACs by proving their equivalence to a non-local game and by providing tight bounds for the success probability of the non-local game via semidefinite programming. In the case of even-parity-oblivious RACs, the cryptographic property holds also in the device independent model.