11
talks
5
posters
7
committee roles
3
leadership roles
2014–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Experimental Multi-Dimensional Side-Channel-Secure Quantum Key Distribution | QCRYPT 2025 | Hao Dong, Cong Jiang, Di Ma, Chi Zhang, Jia Huang, Hao Li, Li-Xing You, Yang Liu, Xiang-Bin Wang, Jian-Wei Pan |
Quantum key distribution (QKD) theoretically provides unconditional security between remote parties. However, guaranteeing practical security through device characterisation alone is challenging in real-world implementations due to the multi-dimensional spaces in which the devices may be operated. The side-channel-secure (SCS)-QKD protocol, which only requires bounding the upper limits of the intensities for the two states, theoretically provides a rigorous solution to the challenge and achieves measurement-device-independent security in detection and security for whatever multi-dimensional side channel attack in the source. Here, we demonstrate a practical implementation of SCS-QKD, achieving a secure key rate of 6.60 kbps through a 50.5 km fibre and a maximum distribution distance of 101.1 km while accounting for finite-size effects. Our experiment also represents an approximate forty-times improvement over the previous experiment. |
||
| Experimental practical quantum tokens with transaction time advantage | QCRYPT 2025 | Yang-Fan Jiang, Adrian Kent, Damián Pitalúa-García, Xiaochen Yao, Xiao-Han Chen, Jia Huang, George Cowperthwaite, Qibin Zheng, Hao Li, Lixing You, Yang Liu, Jian-Wei Pan |
Quantum money is the first invention in quantum information science, promising advantages over classical money by simultaneously achieving unforgeability, user privacy, and instant validation. However, standard quantum money relies on quantum memories and long-distance quantum communication, which are technologically extremely challenging. Quantum "S-money" tokens eliminate these technological requirements while preserving unforgeability, user privacy, and instant validation. Here, we report the first full experimental demonstration of quantum S-tokens, proven secure despite errors, losses and experimental imperfections. The heralded single-photon source with a high system efficiency of 88.24% protects against arbitrary multi-photon attacks arising from losses in the quantum token generation. Following short-range quantum communication, the token is stored, transacted, and verified using classical bits. We demonstrate a transaction time advantage over intra-city 2.77 km and inter-city 60.54 km optical fibre networks, compared with optimal classical cross-checking schemes. Our implementation demonstrates the practicality of quantum S-tokens for applications requiring high security, privacy and minimal transaction times, like financial trading and network control. It is also the first demonstration of a quantitative quantum time advantage in relativistic cryptography, showing the enhanced cryptographic power of simultaneously considering quantum and relativistic physics. |
||
| 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, Li Li, Yang Liu, Jun Zhang, Xiao Jiang, 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. |
||
| 1002 km Twin-Field Quantum Key Distribution with Finite-Key Analysis | QCRYPT 2024 | Yang Liu, Wei-Jun Zhang, Cong Jiang, Jiu-Peng Chen, Di Ma, Chi Zhang, Wen-Xin Pan, Hao Dong, Jia-Min Xiong, Cheng-Jun Zhang, Hao Li, Rui-Chun Wang, Chao-Yang Lu, Jun Wu, Teng-Yun Chen, Lixing You, Xiang-Bin Wang, Jian-Wei Pan |
Quantum key distribution (QKD) holds the potential to establish secure keys over long distances. The distance of point-to-point QKD secure key distribution is primarily impeded by the transmission loss inherent to the channel. In the quest to realize a large-scale quantum network, increasing the QKD distance under current technology is of great research interest. Here we adopt the 3-intensity sending-or-not-sending twin-field QKD (TF-QKD) protocol with the actively-odd-parity-pairing method. The experiment demonstrates the feasibility of secure QKD over a 1002 km fibre channel considering the finite size effect. The secure key rate is $3.11 10^{-12}$ per pulse at this distance. Furthermore, by optimizing parameters for shorter fiber distances, we conducted performance tests on key distribution for fiber lengths ranging from 202 km to 505 km. Notably, the secure key rate for the 202 km, the normal distance between major cities, reached 111.74 kbps. |
||
| Experimental covert communication over metropolitan distances | QCRYPT 2017 | Yang Liu, Juan Miguel Arrazola, Wen-Zhao Liu, Ignatius William Primaatmaja, Valerio Scarani, Jian-Wei Pan |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QCRYPT 2025 | Local | member | LO Co-Chair |
| QCRYPT 2020 | SC | chair | — |
| QCRYPT 2019 | SC | member | — |
| QCRYPT 2018 | SC | chair | — |
| QCRYPT 2018 | Local | chair | Local Chair |
| QCRYPT 2017 | SC | member | — |
| QCRYPT 2016 | PC | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Jian-Wei Pan | 14 |
| Yang Liu | 12 |
| Hao Li | 9 |
| Zhen Wang | 7 |
| Lixing You | 6 |
| Chi Zhang | 5 |
| Wei-Jun Zhang | 5 |
| Xiang-Bin Wang | 5 |
| Jian-Yu Guan | 4 |
| Jiu-Peng Chen | 4 |
| Li-Xing You | 4 |
| Teng-Yun Chen | 4 |
| Wen-Zhao Liu | 4 |
| Xiao Jiang | 4 |
| Bing Bai | 3 |
| Cong Jiang | 3 |
| Jia Huang | 3 |
| Jingyun Fan | 3 |
| Jun Zhang | 3 |
| Xiao-Long Hu | 3 |