Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-195
A. Grudka, J. Modlawska
{"title":"Nonmultiplicativity of probability of faithful teleportation in the Knill-Laflamme-Milburn scheme","authors":"A. Grudka, J. Modlawska","doi":"10.3233/978-1-60750-547-1-195","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-195","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124760170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-66
R. Renner
Devices and protocols for information processing are often required to work for arbitrary inputs. For example, in channel coding theory, one demands that a coding scheme transmits any possible input state reliably over a given noisy channel. Similarly, in quantum cryptography, security of a protocol should hold independently of the inputs, even if they are chosen maliciously. In this short paper, we review the Post-Selection Technique introduced in (Phys. Rev. Lett. 102:020504, 2009). Its main purpose is to simplify the analysis of information processing schemes so that only one single input needs to be considered. If a scheme satisfies a desired criterion when acting on this particular input, then—under certain symmetry conditions—the same criterion is automatically met for arbitrary inputs. We illustrate the Post-Selection Technique at the example of quantum cryptography. Here, it can be used to show that security of a Quantum Key Distribution scheme against general attacks—somewhat surprisingly—follows from its security against one specific attack. This not only simplifies security proofs, but also has other remarkable implications, e.g., that no randomness is needed for privacy amplification.
{"title":"Simplifying information-theoretic arguments by post-selection","authors":"R. Renner","doi":"10.3233/978-1-60750-547-1-66","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-66","url":null,"abstract":"Devices and protocols for information processing are often required to work for arbitrary inputs. For example, in channel coding theory, one demands that a coding scheme transmits any possible input state reliably over a given noisy channel. Similarly, in quantum cryptography, security of a protocol should hold independently of the inputs, even if they are chosen maliciously. In this short paper, we review the Post-Selection Technique introduced in (Phys. Rev. Lett. 102:020504, 2009). Its main purpose is to simplify the analysis of information processing schemes so that only one single input needs to be considered. If a scheme satisfies a desired criterion when acting on this particular input, then—under certain symmetry conditions—the same criterion is automatically met for arbitrary inputs. We illustrate the Post-Selection Technique at the example of quantum cryptography. Here, it can be used to show that security of a Quantum Key Distribution scheme against general attacks—somewhat surprisingly—follows from its security against one specific attack. This not only simplifies security proofs, but also has other remarkable implications, e.g., that no randomness is needed for privacy amplification.","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124795879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-83
S. Straupe, S. Kulik
{"title":"On practical implementations of qudit-based quantum key distribution protocols","authors":"S. Straupe, S. Kulik","doi":"10.3233/978-1-60750-547-1-83","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-83","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121384819","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-161
I. Agafonov, M. Chekhova, T. Iskhakov, G. Leuchs
{"title":"Multimode detection of broadband squeezed vacuum","authors":"I. Agafonov, M. Chekhova, T. Iskhakov, G. Leuchs","doi":"10.3233/978-1-60750-547-1-161","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-161","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125189560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-3
R. Demkowicz-Dobrzański
{"title":"Optimal local protocols for processing of entangled states - local cloning and eavesdropping","authors":"R. Demkowicz-Dobrzański","doi":"10.3233/978-1-60750-547-1-3","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-3","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134352879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-224
M. Pawłowski, K. Horodecki, P. Horodecki, R. Horodecki
{"title":"Local bounds for general Bell inequalities with the reduced entropy of the settings","authors":"M. Pawłowski, K. Horodecki, P. Horodecki, R. Horodecki","doi":"10.3233/978-1-60750-547-1-224","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-224","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131179610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-31
N. Lütkenhaus
{"title":"Tools for optical implementations of quantum communication protocols with application to quantum key distribution","authors":"N. Lütkenhaus","doi":"10.3233/978-1-60750-547-1-31","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-31","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130321194","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.3233/978-1-60750-547-1-239
C. V. Usenko
{"title":"Observable measures of entanglement","authors":"C. V. Usenko","doi":"10.3233/978-1-60750-547-1-239","DOIUrl":"https://doi.org/10.3233/978-1-60750-547-1-239","url":null,"abstract":"","PeriodicalId":116912,"journal":{"name":"Quantum Cryptography and Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129606274","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}