arXiv subjects

Micael A. Dias

Publications and source records attributed to Micael A. Dias.

4 recordsLinked to original sources

arXiv2026

Security bounds for unidimensional discrete-modulated CV-QKD: a Gaussian extremality approach

Unidimensional (1D) Gaussian-modulated continuous-variable quantum key distribution protocols have been proposed as a way to simplify implementation and reduce costs through single-quadrature modulation, requiring only one modulator while maintaining compatibility with standard optical infrastructure. Here, we determine security bounds for a 1D discrete-modulated protocol under the Gaussian extremality assumption by extending the method of Ghorai et al. [Phys. Rev. X 9, 021059 (2019)]. We establish the appropriate symmetry arguments to extend the method to the 1D discrete-modulated case, define the physicality zone in which the protocol is allowed to operate, and derive a security bound against collective attacks in the asymptotic regime via semidefinite programming. Our analysis for uniformly distributed coherent states reveals a limitation: the Gaussian extremality assumption systematically overestimates Eve's information with increasing constellation size, yielding bounds so conservative that secure key extraction becomes increasingly limited for larger constellations, even under ideal conditions. This overestimation worsens with excess noise and restricts viable modulation amplitudes to near-vacuum values. Unlike two-dimensional (2D) protocols, where Gaussian extremality improves with constellation size, 1D protocols lack the growing phase-space isotropy required for the approximation to remain tight as the constellation grows. Our results expose these limitations and highlight the necessity of alternative methods or optimized non-uniform constellation designs for this class of protocols.

quant-ph↗

arXiv2026

Arithmetic Reconciliation for CVQKD: Challenges and Feasibility

Continuous variable quantum key distribution allows two legitimate parties to share a common secret key and encompasses reconciliation protocols. A relatively new reconciliation protocol, Arithmetic Reconciliation, presents low complexity and has increasing reconciliation efficiency with lower SNRs. In this paper, we obtain reconciliation efficiencies for this protocol in realistic scenarios, by means of estimation of mutual information, and we also present rates for sequence match of secret keys by Alice and Bob. Results show that this technique is feasible and promising to continuous variable quantum key distribution applications.

quant-ph↗

arXiv2026

An introductory review of the theory of continuous-variable quantum key distribution: Fundamentals, protocols, and security

Continuous-variable quantum key distribution (CV-QKD) has emerged as a promising approach for secure quantum communication, offering advantages such as high key generation rates, compatibility with standard telecommunication infrastructure, and potential for integration on photonic chips. This review provides an accessible introduction to the theory of CV-QKD, aimed at researchers entering this rapidly developing field. We focus on fundamental concepts, key protocols, and security analysis essential for understanding CV-QKD systems, with a special emphasis on prepare-and-measure protocols using coherent states under asymptotic security conditions. We explain their equivalence to entanglement-based protocols and detail the security proof framework against collective attacks, encompassing both Gaussian and discrete modulation schemes. We also briefly address more advanced topics, including measurement-device-independent CV-QKD and finite-size security analysis. This work is motivated by Brazil's growing investment in quantum communication technologies. By presenting a clear learning path from basic concepts to advanced topics, this work aims to equip newcomers with the essential tools to engage with current research in CV-QKD, thereby supporting the training of a new generation of researchers in this strategic field.

quant-ph↗

arXiv2023

A condition for the zero-error capacity of quantum channels

In this paper, we present a condition for the zero-error capacity of quantum channels. To achieve this result we first prove that the eigenvectors (or eigenstates) common to the Kraus operators representing the quantum channel are fixed points of the channel. From this fact and assuming that these Kraus operators have at least two eigenstates in common and also considering that every quantum channel has at least one fixed point, it is proved that the zero-error capacity of the quantum channel is positive. Moreover, this zero-error capacity condition is a lower bound for the zero-error capacity of the quantum channel. This zero-error capacity condition of quantum channels has a peculiar feature that it is easy to verify when one knows the Kraus operators representing the quantum channel.

quant-ph↗