Searcharxiv⌕ Search

arXiv subjects

Shriram Pragash M

Publications and source records attributed to Shriram Pragash M.

2 recordsLinked to original sources

Study of Randomness in Quantum Random Number Generator using Bayesian Neural Networks

We propose a Bayesian neural network (BNN) framework to quantify the intrinsic (aleatoric) uncertainty in a continuous-variable quantum random number generator (CV-QRNG). This provides a direct data-driven measure of the QRNG's randomness generation. The BNN is trained on raw homodyne voltage time-series data from a fiber-coupled vacuum-fluctuation QRNG (VFQRNG). For each voltage data segment, the network predicts a Gaussian distribution (mean and variance) for the next sample, and the ensemble-averaged predicted variance is used as a diagnostic of entropy-related behavior under assumptions of our quantum source model. Thus, the predicted variance serves as a BNN model-based monitor of the randomness-generation process. We validate that the BNN metric increases with the local-oscillator (LO) power, consistent with theoretical min-entropy (extractable randomness). We also show the metric is sensitive to practical imperfections, coarse-graining (simulating limited analog-to-digital converter (ADC) sampling) or reducing ADC bit depth causes a clear drop in predicted aleatoric uncertainty, consistent with the source min-entropic model. These results establish the BNN-based metric as a complementary, physically motivated diagnostic tool for QRNG characterization. Unlike conventional tests (e.g. autocorrelation) that miss hardware issues like low ADC resolution, our method provides a direct real-time monitor of the VFRNG performance. Therefore, this metric is useful for real-time monitoring of CV-QRNG conditions, including drifts and other imperfections.

quant-ph↗

Decoherence Mitigation with Local NOT Gates in Multipartite Systems

We study the entanglement dynamics of $n=2,3,4$-qubit Bell- and GHZ-type states under an amplitude-damping channel (ADC). We quantify multipartite entanglement using the genuine multipartite concurrence (GMC) and evaluate its utility through the optimal teleportation fidelity. For $2$-qubit states, we analyze the standard (Bennett) teleportation protocol. For $3$- and $4$-qubit states, we study controlled quantum teleportation (CQT) with one and two \emph{controllers}, respectively. Entanglement sudden death (ESD) denotes the abrupt, finite-time disappearance of entanglement caused by decoherence in contrast to asymptotic decay. To counteract ESD, we apply local NOT ($\hatσ_x$) operations on $m$ of the $n$ qubits ($m \leq n$) and derive analytic formulae, revealing that a single-NOT operation often suffices to alter ESD into asymptotic decay when handling GMC. In contrast, teleportation fidelity can decay more rapidly for single-NOT flipped states, whereas flipping all qubits is more useful for preserving teleportation fidelity in certain regimes, highlighting that the amount of entanglement alone does not guarantee teleportation utility. Remarkably, in the case of GHZ-type states, ADC-evolved mixed biseparable states can be exploited successfully in the CQT protocol. Further, using the GHZ-symmetric parametrization, we map the 2- and 3-qubit ADC-evolved mixed states onto a $(x,y)$ plane, revealing their SLOCC (Stochastic Local Operations and Classical Communication) entanglement classes. We also explicitly check the Bell-CHSH nonlocality hierarchy in the 2-qubit teleportation alongside localizable-entanglement diagnostics for 3-qubit CQT. Our results clarify the distinct roles of global versus localizable bipartite correlations and suggest simple, experimentally accessible unitary controls for preserving useful quantum resources in noisy channels.

quant-ph↗