Quantum key distribution rates from semidefinite programming

J 2023

Quantum key distribution rates from semidefinite programming

ARAUJO, Mateus, Marcus HUBER, Miguel NAVASCUES, Matej PIVOLUSKA, Armin TAVAKOLI et. al.

Basic information

Original name

Quantum key distribution rates from semidefinite programming

Authors

ARAUJO, Mateus, Marcus HUBER, Miguel NAVASCUES, Matej PIVOLUSKA (703 Slovakia, guarantor, belonging to the institution) and Armin TAVAKOLI

Edition

QUANTUM, WIEN, VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF, 2023, 2521-327X

Other information

Language

English

Type of outcome

Článek v odborném periodiku

Field of Study

10200 1.2 Computer and information sciences

Country of publisher

Austria

Confidentiality degree

není předmětem státního či obchodního tajemství

References:

URL

Impact factor

Impact factor: 6.400 in 2022

RIV identification code

RIV/00216224:14610/23:00131033

Organization unit

Institute of Computer Science

DOI

http://dx.doi.org/10.22331/Q-2023-05-24-1019

UT WoS

001000469200001

Keywords (in Czech)

Kvantová distribuce klíčů; semi-definitní programování

Keywords in English

quantum key distribution; semi-definite programming

Abstract

V originále

Computing the key rate in quantum key distribution (QKD) protocols is a long standing challenge. Analytical methods are limited to a handful of protocols with highly symmetric measurement bases. Numerical methods can handle arbitrary measurement bases, but either use the min-entropy, which gives a loose lower bound to the von Neumann entropy, or rely on cumbersome dedicated algorithms. Based on a recently discovered semidefinite programming (SDP) hierarchy converging to the conditional von Neumann entropy, used for computing the asymptotic key rates in the device independent case, we introduce an SDP hierarchy that converges to the asymptotic secret key rate in the case of characterised devices. The resulting algorithm is efficient, easy to implement and easy to use. We illustrate its performance by recovering known bounds on the key rate and extending high-dimensional QKD protocols to previously intractable cases. We also use it to reanalyse experimental data to demonstrate how higher key rates can be achieved when the full statistics are taken into account.

Links

MUNI/G/1596/2019, interní kód MU

Name: Development of algorithms for application of quantum computers in electronic-structure calculations in solid-state physics and chemistry (Acronym: Qubits4PhysChem)

Investor: Masaryk University, INTERDISCIPLINARY - Interdisciplinary research projects

Citovat

ARAUJO, Mateus, Marcus HUBER, Miguel NAVASCUES, Matej PIVOLUSKA and Armin TAVAKOLI. Quantum key distribution rates from semidefinite programming. QUANTUM. WIEN: VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF, 2023, vol. 7, No 1, p. 1-18. ISSN 2521-327X. Available from: https://dx.doi.org/10.22331/Q-2023-05-24-1019.

@article{2293062,
   author = {Araujo, Mateus and Huber, Marcus and Navascues, Miguel and Pivoluska, Matej and Tavakoli, Armin},
   article_location = {WIEN},
   article_number = {1},
   doi = {http://dx.doi.org/10.22331/Q-2023-05-24-1019},
   keywords = {quantum key distribution; semi-definite programming},
   language = {eng},
   issn = {2521-327X},
   journal = {QUANTUM},
   title = {Quantum key distribution rates from semidefinite programming},
   url = {https://quantum-journal.org/papers/q-2023-05-24-1019/},
   volume = {7},
   year = {2023}
}

TY  - JOUR
ID  - 2293062
AU  - Araujo, Mateus - Huber, Marcus - Navascues, Miguel - Pivoluska, Matej - Tavakoli, Armin
PY  - 2023
TI  - Quantum key distribution rates from semidefinite programming
JF  - QUANTUM
VL  - 7
IS  - 1
SP  - 1-18
EP  - 1-18
PB  - VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF
SN  - 2521327X
KW  - quantum key distribution
KW  - semi-definite programming
UR  - https://quantum-journal.org/papers/q-2023-05-24-1019/
N2  - Computing the key rate in quantum key distribution (QKD) protocols is a long standing challenge. Analytical methods are limited to a handful of protocols with highly symmetric measurement bases. Numerical methods can handle arbitrary measurement bases, but either use the min-entropy, which gives a loose lower bound to the von Neumann entropy, or rely on cumbersome dedicated algorithms. Based on a recently discovered semidefinite programming (SDP) hierarchy converging to the conditional von Neumann entropy, used for computing the asymptotic key rates in the device independent case, we introduce an SDP hierarchy that converges to the asymptotic secret key rate in the case of characterised devices. The resulting algorithm is efficient, easy to implement and easy to use. We illustrate its performance by recovering known bounds on the key rate and extending high-dimensional QKD protocols to previously intractable cases. We also use it to reanalyse experimental data to demonstrate how higher key rates can be achieved when the full statistics are taken into account.
ER  -

ARAUJO, Mateus, Marcus HUBER, Miguel NAVASCUES, Matej PIVOLUSKA and Armin TAVAKOLI. Quantum key distribution rates from semidefinite programming. \textit{QUANTUM}. WIEN: VEREIN FORDERUNG OPEN ACCESS PUBLIZIERENS QUANTENWISSENSCHAF, 2023, vol.~7, No~1, p.~1-18. ISSN~2521-327X. Available from: https://dx.doi.org/10.22331/Q-2023-05-24-1019.

Detailed Information on Publication Record