2
talks
1
posters
0
committee roles
0
leadership roles
2022–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Long Distance Quantum State Transfer with Satellite-based Entanglement Distribution | QCRYPT 2022 | regular | Bo Li, Yuan Cao, Yu-Huai Li, Wen-Qi Cai, Wei-Yue Liu, Ji-Gang Ren, Sheng-Kai Liao, Hui-Nan Wu, Shuang-Lin Li, Nai-Le Liu, Chao-Yang Lu, Juan Yin, Yu-Ao Chen, Cheng-Zhi Peng, Jian-Wei Pan |
| Efficient approximation of experimental Gaussian boson sampling | QIP 2022 | regular | Benjamin Villalonga, Murphy Yuezhen Niu, Hartmut Neven, John C. Platt, Vadim Smelyanskiy, Sergio Boixo |
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Spoofing Loophole-Free Bell Test with Classical Sources | QCRYPT 2025 | Su-Yi Cheng, Hai-Hao Dong, Xingjian Zhang, Jin Lin, Wen-Zhao Liu, Cheng-Long Li, Hu Li, Bing Bai, Yang Liu, Jun Zhang, Xiao Jiang, Qiang Zhang, Jian-Wei Pan |
Recent advances in loophole-free Bell tests have profoundly impacted quantum cryptography, yet their security assumes trusted random number generators (RNGs) for measurement choices—a vulnerability termed the freedom-of-choice loophole. Here, we demonstrate that classical systems can spoof Bell violations under ostensibly loophole-free conditions using compromised RNGs. By synchronizing laser-generated separable states with imperfect RNG outputs in an optical setup, we simulate a CHSH test closing locality and detection loopholes. With full RNG access, we achieve a near-maximal CHSH value of 3.99, exceeding quantum limits. Crucially, partial RNG knowledge suffices: predetermining 10.6% of bits reproduces our “loophole free” optical system's CHSH value of 2.007, while Santha-Vazirani generators with 0.38-biased bits enable optimal spoofing. Even weakly correlated RNGs coordinated via entangled states—deviating by 0.04 from independence—allow violations. Prediction-based ratio analysis gives a P-value upper bound of 10^(-18266), misleadingly implying non-classicality if RNG flaws are ignored. Strikingly, we extract "device-independent" random bits from simulated outcomes, mirroring cryptographic protocols. This exposes a critical flaw: compromised input randomness invalidates security guarantees in Bell-inequality-based cryptography. Our findings mandate rigorous verification of both RNG integrity and Bell violations to ensure quantum cryptographic security. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Jian-Wei Pan | 2 |
| Benjamin Villalonga | 1 |
| Bing Bai | 1 |
| Bo Li | 1 |
| Chao-Yang Lu | 1 |
| Cheng-Long Li | 1 |
| Cheng-Zhi Peng | 1 |
| Hai-Hao Dong | 1 |
| Hartmut Neven | 1 |
| Hu Li | 1 |
| Hui-Nan Wu | 1 |
| Ji-Gang Ren | 1 |
| Jin Lin | 1 |
| John C. Platt | 1 |
| Juan Yin | 1 |
| Jun Zhang | 1 |
| Murphy Yuezhen Niu | 1 |
| Nai-Le Liu | 1 |
| Qiang Zhang | 1 |
| Sergio Boixo | 1 |