Searcharxiv⌕ Search

arXiv subjects

Micael Andrade Dias

Publications and source records attributed to Micael Andrade Dias.

9 recordsLinked to original sources

Fixed Point Exploration For CV-QKD IR QC-MET-LDPC Toward Hardware Implementation

High-speed LDPC decoding is a major bottleneck in CV-QKD and motivates hardware acceleration with fixed-point arithmetic. This work compares SPA, MSA, and NMS under a unified low-SNR fixed-point framework using common graph, matrix, and quantization settings. Multiple formats are evaluated through FER, and average iterations. The results show that performance depends strongly on the interaction between decoder rule and numerical precision. SPA achieved the best overall performance. For reduced-complexity decoders, Q16.8 was the lowest consistent precision, with NMS outperforming MSA. Practically, SPA with Q8.4 offered the best balance between reliability and hardware efficiency for large-scale implementations.

cs.AR↗

Neural network for excess noise estimation in continuous-variable quantum key distribution under composable finite-size security

Parameter estimation is a critical step in continuous-variable quantum key distribution (CV-QKD), especially in the finite-size regime where worst-case confidence intervals can significantly reduce the achievable secret-key rate. We provide a finite-size security analysis demonstrating that neural networks can be reliably employed for parameter estimation in CV-QKD with quantifiable failure probabilities $ε_{PE}$, endowed with an operational interpretation and composable security guarantees. Using a protocol that is operationally equivalent to standard approaches, our method produces significantly tighter confidence intervals, unlocking higher key rates even under collective Gaussian attacks. The proposed approach yields tighter confidence intervals, leading to a quantifiable increase in the secret-key rate under collective Gaussian attacks. These results open up new perspectives for integrating modern machine learning techniques into quantum cryptographic protocols, particularly in practical resource-constrained scenarios.

quant-ph↗

Towards a point-to-point CV-QKD system: Implementation challenges and perspectives

This article presents an analysis of the practical challenges and implementation perspectives of point-to-point continuous-variable quantum key distribution (CV-QKD) systems over optical fiber. The study addresses the physical layer, including the design of transmitters, quantum channels, and receivers, with emphasis on impairments such as attenuation, chromatic dispersion, polarization fluctuations, and coexistence with classical channels. We further examine the role of digital signal processing (DSP) as the bridge between quantum state transmission and classical post-processing, highlighting its impact on excess noise mitigation, covariance matrix estimation, and reconciliation efficiency. The post-processing pipeline is detailed with a focus on parameter estimation in the finite-size regime, information reconciliation using LDPC-based codes optimized for low-SNR conditions, and privacy amplification employing large-block universal hashing. From a hardware perspective, we discuss modular digital architectures that integrate dedicated accelerators with programmable processors, supported by a reference software framework (CV-QKD-ModSim) for algorithm validation and hardware co-design. Finally, we outline perspectives for the deployment of CV-QKD in Brazil, starting from metropolitan testbeds and extending toward hybrid fiber/FSO and space-based infrastructures. The work establishes the foundations for the first point-to-point CV-QKD system in Brazil, while providing a roadmap for scalable and interoperable quantum communication networks.

quant-ph↗

Convergence of Density Operators and Security of Discrete Modulated CVQKD Protocols

This communication deals with the problem of bounding the approximation error on weak convergence of mixed coherent state towards a Gaussian thermal state. In the context of CVQKD with discrete modulation, we develop expressions for two specific cases. The first one is the distance between the Gaussian equivalent bipartite state and a reference Gaussian modulated (GG02) and the second one is for the trace distance between the constellation and a thermal state with same photon number. Since, in the convex set of density operators, weak convergence implies convergence in the trace norm, knowing how fast the sequence gets close to the equivalent Gaussian state has implication on the security of QKD Protocols. Here we derive two bounds on the $L_1$ distance, one of them related with an energy test that can be used in the security proof.

quant-ph↗

A method for Sampling Bernoulli Variables

We introduce new method for generating correlated or uncorrelated Bernoulli random variables by using the binary expansion of a continuous random variable with support on the unit interval. We show that when this variable has a symmetric probability density function around 12 , its binary expansion provides equiprobable bits over {0, 1}. In addition we prove that when the random variable is uniformly distributed over [0, 1], its binary expansion generates independent Bernoulli random variables. Moreover, we give examples where, by choosing some parameterized nonuniform probability density functions over [0, 1], samples of Bernoulli variables with specific correlation values are generated.

math.PR↗

Converging State Distributions for Discrete Modulated CVQKD Protocols

Consider the problem of using a finite set of coherent states to distribute secret keys over a quantum channel. It is known that computing the exact secret key rate in this scenario is intractable due to the infinite dimensionality of the Hilbert spaces and usually one computes a lower bound using a Gaussian equivalent bipartite state in the entangled based version of the protocol, which leads to underestimating the actual protocol capability of generating secret keys for the sake of security. Here, we define the QKD protocol's non-Gaussianity, a function quantifying the amount of secret key rate lost due to assuming a Gaussian model when a non-Gaussian modulation was used, and develop relevant properties for it. We show that if the set of coherent states is induced by a random variable approaching the AWGN channel capacity, then the protocol's non-Gaussianity vanishes, meaning that there is no loss of secret key rate due to the use of a Gaussian model for computing bound on the secret key rate. The numerical results show that by using a 256-QAM with Gauss-Hermite shaping, the loss of secret key rate quickly falls below $10^{-5}$ as the distance increases.

quant-ph↗

Distributional Transform Based Information Reconciliation

In this paper, we present an information reconciliation protocol designed for Continuous-Variable QKD using the Distributional Transform. By combining tools from copula and information theory, we present a method for extracting independent symmetric Bernoulli bits for Gaussian-modulated CVQKD protocols, which we called the Distributional Transform Expansion (DTE). We derived the expressions for the maximum reconciliation efficiency for both homodyne and heterodyne measurements, which, for the last, is achievable with an efficiency greater than 0.9 at a signal-to-noise ratio lower than -3.6 dB.

cs.IT↗

Amplitude-Phase Modulated CVQKD Protocol

Here we report the performance of a discrete modulated Continuous Variable Quantum Key Distribution protocol based on eight and sixteen state optimal Amplitude Phase Keying constellations with pure loss quantum channel transmission. Our constellations use the same amplitudes and state probability as in an optimal four-state unidimensional constellation model and apply amplitude/phase modulation to the quadratures of coherent states. We compare the obtained results with the performance of conventional $m$-PSK and $m$-APK constellations. The results presented show that protocols that use the proposed constellations outperform the ones based on conventional constellations in both secret key rate and link distance. In special, our protocol is able to accomplish viable SKR's in low transmittance regime, $τ<0.2$.

quant-ph↗

Evaluating the Eavesdropper Entropy via Bloch-Messiah Decomposition

We explore the Bloch-Messiah decomposition of Gaussian unitary to analyze the Entangling Cloner Attack performed by an eavesdropper on a discrete modulated continuous variable QKD scenario. Such a decomposition allows to replace the nonlinear unitary resulting from eavesdropping and tracing out Bob's mode into an architecture of single-mode operations (squeezers, phase shifters and displacements) and a two-mode beam splitter. Based on such architecture we were able to get tighter upper bounds to the eavesdropper entropy for a discrete modulated CVQKD scheme. The new bounds are justified from the Gaussian extremality property valid for entangled-based equivalent protocols.

quant-ph↗