Rong Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rong Wang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Shuang Wang
University of Science and Technology of China
2 shared publications - Zhen-Qiang Yin
CAS Key Laboratory of Quantum Information, University of Science and Technology of China, Hefei, CHINA
2 shared publications - Guan-Jie Fan-Yuan
University of Science and Technology of China
1 shared publication Guang-Can Guo
Laboratory of Quantum Information, University of Science and Technology of China, Hefei, China
1 shared publicationHong-Wei Li
Henan Key Laboratory of Quantum Information and Cryptography, Zhengzhou Information Science and Technology Institute, Zhengzhou, China
1 shared publication- Qi Zhao
The University of Hong Kong
1 shared publication
Latest Publications
- Open Access
- 15 September 2026
- Published by Springer Nature in Communications Physics
Witnessing quantum discord for secure quantum key distribution
The study of quantum information processing seeks to characterize the resources that enable quantum information processing to perform tasks that are unfeasible or inefficient for classical information processing. Quantum cryptography is one such task, and researchers have identified entanglement as a sufficient resource for secure key generation. However, quantum discord, another type of quantum correlation beyond entanglement, has been found to be necessary for guaranteeing secure communication. Despite this, it remains a long-standing problem to clearly understand the role that discord plays and how to effectively utilize discord for analyzing security in specific quantum cryptography protocols. Here, we strictly prove that discord determines the secrecy and show its practical interest by considering a three-state quantum key distribution protocol. Its robustness against imperfections in qubit sources and measurements as well as basis misalignment, results in better key rates than BB84 protocol. Those advantages are experimentally demonstrated via photonic phase encoding systems.
- 15 September 2026
- Published by Springer Nature in Communications Physics
Open AccessWitnessing quantum discord for secure quantum key distribution
The study of quantum information processing seeks to characterize the resources that enable quantum information processing to perform tasks that are unfeasible or inefficient for classical information processing. Quantum cryptography is one such task, and researchers have identified entanglement as a sufficient resource for secure key generation. However, quantum discord, another type of quantum correlation beyond entanglement, has been found to be necessary for guaranteeing secure communication. Despite this, it remains a long-standing problem to clearly understand the role that discord plays and how to effectively utilize discord for analyzing security in specific quantum cryptography protocols. Here, we strictly prove that discord determines the secrecy and show its practical interest by considering a three-state quantum key distribution protocol. Its robustness against imperfections in qubit sources and measurements as well as basis misalignment, results in better key rates than BB84 protocol. Those advantages are experimentally demonstrated via photonic phase encoding systems.
- Open Access
- 29 May 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (22) , eaec2555
Certified quantum randomness within purity constraints
Quantum random number generators (QRNGs) exploit quantum mechanics to produce true randomness, but practical implementations suffer from device imperfections that can compromise security. We propose a semi–device-independent QRNG based on measurement uncertainty under purity constraints for conditional min-entropy estimation. Our protocol requires no detailed modeling of the two-dimensional source and the countable-dimensional measurement and remains secure against quantum attacks on measurement devices. We uncover an implicit uncertainty relation arising from naturally satisfied purity conditions, define a randomness parameter C using test states, and connect it to an analytical bound on extractable randomness via unitary rotation symmetries of states and measurements. Using the generalized entropy accumulation theorem, we extend the single-round bound to multirounds and obtain composable security against coherent attacks. Implemented on a standard commercial fiber system, our high-tolerance protocol achieves exponential secure randomness expansion and is suitable for integrated-photonic platforms.
- 29 May 2026
- Published by American Association for the Advancement of Science (AAAS) in Science Advances
- Vol. 12 (22) , eaec2555
Open AccessCertified quantum randomness within purity constraints
Quantum random number generators (QRNGs) exploit quantum mechanics to produce true randomness, but practical implementations suffer from device imperfections that can compromise security. We propose a semi–device-independent QRNG based on measurement uncertainty under purity constraints for conditional min-entropy estimation. Our protocol requires no detailed modeling of the two-dimensional source and the countable-dimensional measurement and remains secure against quantum attacks on measurement devices. We uncover an implicit uncertainty relation arising from naturally satisfied purity conditions, define a randomness parameter C using test states, and connect it to an analytical bound on extractable randomness via unitary rotation symmetries of states and measurements. Using the generalized entropy accumulation theorem, we extend the single-round bound to multirounds and obtain composable security against coherent attacks. Implemented on a standard commercial fiber system, our high-tolerance protocol achieves exponential secure randomness expansion and is suitable for integrated-photonic platforms.
- Open Access
Certifying optimal device-independent quantum randomness in quantum networks
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at $N=3$, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.Open AccessCertifying optimal device-independent quantum randomness in quantum networks
Bell nonlocality provides a device-independent (DI) way to certify quantum randomness, based on which true random numbers can be extracted from the observed correlations without detail characterizations on devices for quantum state preparation and measurement. However, the efficiency of current strategies for DI randomness certification is still heavily constrained when it comes to non-maximal Bell values, especially for multiple parties. Here, we present a family of multipartite Bell inequalities that allows to certify optimal quantum randomness and self-test GHZ (Greenberger-Horne-Zeilinger) states, which are inspired from the stabilizer group of the GHZ state. Due to the simple representation of stabilizer group for GHZ states, this family of Bell inequalities is of simple structure and can be easily expanded to more parties. Compared with the Mermin-type inequalities, this family of Bell inequality is more efficient in certifying quantum randomness when non-maximal Bell values achieved. Meanwhile, the general analytical upper bound for the Holevo quantity is presented, and achieves better performance compared with the MABK (Mermin-Ardehali-Belinskii-Klyshko) inequality, Parity-CHSH (Clauser-Horne-Shimony-Holt) inequality and Holz inequality at $N=3$, which is of particular interests for experimental researches on DI quantum cryptography in quantum networks.