22
collaborators
2016–2021
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
2 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Security proof of practical quantum key distribution with detection-efficiency mismatch | QCRYPT 2020 | regular | Yanbao Zhang, Patrick Coles, Jie Lin, Norbert Lütkenhaus |
Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cut-off of incoming signals such that our security proof is complete. Though we consider polarization encoding in the demonstration of our method, the method applies to a variety of coding mechanisms, including time-bin encoding, and also allows for general manipulations of the spatial-temporal modes by the adversary. We thus can close the long-standing question how to provide a valid, complete security proof of a QKD setup with characterized efficiency mismatch. Our method also shows that in the absence of efficiency mismatch, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary. |
|||
| Reliable numerical key rates for quantum key distribution | QCRYPT 2017 | regular | Patrick Coles, Norbert Lütkenhaus |
7 Posters
| Title | Conference | Co-authors |
|---|---|---|
| An Open-source Software Platform for Numerical Key Rate Calculation of General Quantum Key Distribution Protocols | QCRYPT 2021 | Wenyuan Wang, Jie Lin, Ian George, Twesh Upadhyaya, Shlok Ashok Nahar, Kai-Hong Li, Kun Fang, Natansh Mathur, John Burniston, Max Chemtov, Shahabeddin M. Aslmarand, Yanbao Zhang, Christopher Boehm, Patrick Coles, Norbert Lütkenhaus |
In this work, we present an open-source software platform that calculates key rate for general QKD protocols, building upon the numerical framework proposed by our group that can perform automated security proof of QKD protocols. The software platform is fully modularized with mutually independent modules for descriptions of protocols/channels, solvers for bounding key rate, and parameter optimization algorithms. It currently supports BB84 and measurement-device-independent QKD (including decoy states), as well as discrete-modulated continuous variable QKD. It also supports finite-size analysis for non-decoy-state protocols. We hope that the open-sourcing can attract theorists to test new protocols and/or contribute to new solvers, as well as appeal to experimentalists who wish to analyze their data or optimize parameters for new experiments. |
||
| Towards an Open-source Software Platform for Numerical Key Rate Calculation of General Quantum Key Distribution Protocols | QCRYPT 2020 | Jie Lin, Ian George, Kai-Hong Li, Kun Fang, Twesh Upadhyaya, Natansh Mathur, Max Chemtov, Shlok Ashok Nahar, Shahabeddin M. Aslmarand, Thomas Van Himbeeck, Yanbao Zhang, Christopher Boehm, Patrick Coles, Wenyuan Wang, Norbert Lütkenhaus |
A numerical approach for the calculation of QKD key rates allows a uniform framework to be applied to general QKD protocols. Based on our group's previous work, we would like to build a universal software platform that is fully modularized and user-friendly, where one can easily swap in and out different QKD protocol descriptions, channel simulation models or experimental data, backend numerical solvers, and parameter optimization algorithms. Our goal is to build an open-source platform that can be both useful for theorists testing new protocols as well as experimentalists looking for optimal parameters or analyzing their experimental data. |
||
| Suppressing non-Markovianity in quantum circuits | QIP 2019 | Joel Wallman, Joseph Emerson |
| Computable measures of non-Markovianity | QIP 2019 | Joel Wallman, Joseph Emerson |
| Quantum Key Distribution with Coherent States | QCRYPT 2017 | Jie Lin, Patrick Coles, Norbert Lütkenhaus |
| Security proof of quantum key distribution with detection-efficiency mismatch | QCRYPT 2017 | Yanbao Zhang, Patrick Coles, Norbert Lütkenhaus |
| Software for Numerical Calculation of Key Rates | QCRYPT 2016 | Patrick Coles, Jie Lin, Yanbao Zhang, Eric Metodiev, Shouzhen Gu, Electra Eleftheriadou, Filippo Miatto, Norbert Lütkenhaus |
Collaborators
| Co-author | Joint talks |
|---|---|
| Norbert Lütkenhaus | 7 |
| Patrick Coles | 7 |
| Jie Lin | 5 |
| Yanbao Zhang | 5 |
| Christopher Boehm | 2 |
| Ian George | 2 |
| Joel Wallman | 2 |
| Joseph Emerson | 2 |
| Kai-Hong Li | 2 |
| Kun Fang | 2 |
| Max Chemtov | 2 |
| Natansh Mathur | 2 |
| Shahabeddin M. Aslmarand | 2 |
| Shlok Ashok Nahar | 2 |
| Twesh Upadhyaya | 2 |
| Wenyuan Wang | 2 |
| Electra Eleftheriadou | 1 |
| Eric Metodiev | 1 |
| Filippo Miatto | 1 |
| John Burniston | 1 |