1
talks
1
posters
0
committee roles
0
leadership roles
2025–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| High-Rate Asynchronous Measurement-Device-Independent Quantum Communication without Optical Reference Light | QCRYPT 2025 | regular | Shanfeng Shao, Jinping Lin, Chengfang Ge, Mariella Minder, Yuan-Mei Xie, Zhengyu Yan, Hua-Lei Yin, Lai Zhou, Zhiliang Yuan |
Asynchronous measurement-device-independent quantum key distribution (AMDI-QKD) stands out for its experimental simplicity and high key rate generation. To simplify the system further, we devise a post-measurement compensation scheme to accurately estimate the mutual frequency offset between two compact lasers using just the announced quantum-signal detection results, thereby obviating the need for optical reference light. As a result, we demonstrate an AMDI-QKD system operating at 2.5 GHz and achieving secure key rates (SKRs) of 537 and 101 kbit/s at distances of 100 and 201 km, respectively. By leveraging ultra-stable lasers, we achieve the highest SKRs with measurement-device-independent security within the 100 to 400 km range. |
|||
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Experimental Quantum Fingerprinting without the Shared Randomness Loophole | QCRYPT 2025 | Yu-Shuo Lu, Xiping Wu, Jinping Lin, Xiao-Yu Cao, Chengfang Ge, Shan-Feng Shao, Hua-Lei Yin, Lai Zhou, Zhiliang Yuan |
Quantum fingerprinting (QF) enables exponential reduction of information transmission in communication complexity tasks. Coherent QF implementations rely upon a direct optical link to maintain coherence between the users, violating the no-shared-randomness rule. Here, we propose and experimentally demonstrate a novel QF protocol based on asynchronous coincidence pairing from the interference results between independent, remotely prepared coherent fields. Over a length of 20 km telecom fiber, our setup has outperformed the classical algorithm, for the first time without being susceptible to shared randomness. This work advances the practical application of QF in communication complexity. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Chengfang Ge | 2 |
| Hua-Lei Yin | 2 |
| Jinping Lin | 2 |
| Lai Zhou | 2 |
| Zhiliang Yuan | 2 |
| Mariella Minder | 1 |
| Shan-Feng Shao | 1 |
| Shanfeng Shao | 1 |
| Xiao-Yu Cao | 1 |
| Xiping Wu | 1 |
| Yu-Shuo Lu | 1 |
| Yuan-Mei Xie | 1 |
| Zhengyu Yan | 1 |