{"title":"一个更简单的六态量子密钥分发安全性证明","authors":"Kaan Akyuz, Boris Skoric","doi":"10.26421/qic23.11-12-4","DOIUrl":null,"url":null,"abstract":"Six-state Quantum Key Distribution (QKD) achieves the highest key rate in the class of qubit-based QKD schemes. The standard security proof, which has been developed since 2005, invokes complicated theorems involving smooth R\\'{e}nyi entropies. In this paper we present a simpler security proof for 6-state QKD that entirely avoids R\\'{e}nyi entropies. This is achieved by applying state smoothing directly in the Bell basis. We obtain the well known asymptotic rate, but with slightly more favorable finite-size terms. We furthermore show that the same proof technique can be used for 6-state quantum key recycling.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"42 1","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A simpler security proof for 6-state quantum key distribution\",\"authors\":\"Kaan Akyuz, Boris Skoric\",\"doi\":\"10.26421/qic23.11-12-4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Six-state Quantum Key Distribution (QKD) achieves the highest key rate in the class of qubit-based QKD schemes. The standard security proof, which has been developed since 2005, invokes complicated theorems involving smooth R\\\\'{e}nyi entropies. In this paper we present a simpler security proof for 6-state QKD that entirely avoids R\\\\'{e}nyi entropies. This is achieved by applying state smoothing directly in the Bell basis. We obtain the well known asymptotic rate, but with slightly more favorable finite-size terms. We furthermore show that the same proof technique can be used for 6-state quantum key recycling.\",\"PeriodicalId\":54524,\"journal\":{\"name\":\"Quantum Information & Computation\",\"volume\":\"42 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum Information & Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.26421/qic23.11-12-4\",\"RegionNum\":4,\"RegionCategory\":\"物理与天体物理\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information & Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.26421/qic23.11-12-4","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
A simpler security proof for 6-state quantum key distribution
Six-state Quantum Key Distribution (QKD) achieves the highest key rate in the class of qubit-based QKD schemes. The standard security proof, which has been developed since 2005, invokes complicated theorems involving smooth R\'{e}nyi entropies. In this paper we present a simpler security proof for 6-state QKD that entirely avoids R\'{e}nyi entropies. This is achieved by applying state smoothing directly in the Bell basis. We obtain the well known asymptotic rate, but with slightly more favorable finite-size terms. We furthermore show that the same proof technique can be used for 6-state quantum key recycling.
期刊介绍:
Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.