pith. sign in

arxiv: 1810.05145 · v1 · pith:IG534OJ5new · submitted 2018-10-11 · 🪐 quant-ph

Applications of semi-definite optimization in quantum information protocols

classification 🪐 quant-ph
keywords quantumchapterinformationprotocolsresultsapplicationsgivenimplementation
0
0 comments X
read the original abstract

This work is concerned with the issue of applications of the semi-definite programming (SDP) in the field of quantum information science. Our results of the analysis of certain quantum information protocols using this optimization technique are presented, and an implementation of a relevant numerical tool is introduced. The key method used is NPA discovered by Navascues et al. [Phys. Rev. Lett. 98, 010401 (2007)]. In chapter 1 a brief overview of mathematical methods used in this work is presented. In chapter 2 an introduction to quantum information science is given. Chapter 3 concerns the device-independent (DI) and semi-device-independent (SDI) approaches in quantum cryptography. In chapter 4 our results regarding quantum information protocols which we developed using SDP are described. The results include a new type of quantum key distribution protocol based on Hardy's paradox; several protocols for quantum random number expansion; a method of formulation of SDP relaxations of SDI protocols; and a DI Santha-Vazirani source of randomness amplification protocol. In chapter 5 an introduction to interior point methods is given. In chapter 6 the implementation of our numerical tool dedicated to problems occurring in chapter 4 are discussed and compared with other solutions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Picking NPA constraints from a randomly sampled quantum moment matrix

    quant-ph 2025-09 unverdicted novelty 5.0

    A method that obtains equality constraints for NPA-style SDP relaxations by randomly sampling quantum moment matrices to bound quantum correlations.