2018/12/19 by Stefan Bäuml, Siddhartha Das, Mark M. Wilde · 41 citations
Computer Science · Mathematics · Physics and Astronomy · #Bipartite graph #Computer science #Open quantum system #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum capacity #Quantum cryptography #Quantum entanglement #Quantum information #Quantum information science #Quantum mechanics #Quantum network #Quantum technology #Theoretical computer science #cs.CR #cs.IT #hep-th #math.IT #quant-ph
paper · pdf · doi:10.1103/physrevlett.121.250504
published in Physical Review Letters 121(25), 250504 (American Physical Society) · see companion paper at arXiv:1712.00827
arxiv created 2018/12/19 · openalex publication_date 2018/12/19 · arxiv updated 2018/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
Bipartite quantum interactions have applications in a number of different areas of quantum physics, reaching from fundamental areas such as quantum thermodynamics and the theory of quantum measurements to other applications such as quantum computers, quantum key distribution, and other information processing protocols. A particular aspect of the study of bipartite interactions is concerned with the entanglement that can be created from such interactions. In this Letter, we present our work on two basic building blocks of bipartite quantum protocols, namely, the generation of maximally entangled states and secret key via bipartite quantum interactions. In particular, we provide a nontrivial, efficiently computable upper bound on the positive-partial-transpose-assisted quantum capacity of a bipartite quantum interaction. In addition, we provide an upper bound on the secret-key-agreement capacity of a bipartite quantum interaction assisted by local operations and classical communication. As an application, we introduce a cryptographic protocol for the readout of a digital memory device that is secure against a passive eavesdropper.