Deep Learning for Early Alzheimer Disease Detection with MRI ScansMohammad Rafsan, Tamer Oraby, Upal Roy et al.
Alzheimer's Disease is a neurodegenerative condition characterized by dementia and impairment in neurological function. The study primarily focuses on the individuals above age 40, affecting their memory, behavior, and cognitive processes of the brain. Alzheimer's disease requires diagnosis by a detailed assessment of MRI scans and neuropsychological tests of the patients. This project compares existing deep learning models in the pursuit of enhancing the accuracy and efficiency of AD diagnosis, specifically focusing on the Convolutional Neural Network, Bayesian Convolutional Neural Network, and the U-net model with the Open Access Series of Imaging Studies brain MRI dataset. Besides, to ensure robustness and reliability in the model evaluations, we address the challenge of imbalance in data. We then perform rigorous evaluation to determine strengths and weaknesses for each model by considering sensitivity, specificity, and computational efficiency. This comparative analysis would shed light on the future role of AI in revolutionizing AD diagnostics but also paved ways for future innovation in medical imaging and the management of neurodegenerative diseases.
1.2QUANT-PHSep 8, 2025
A Quantum Bagging Algorithm with Unsupervised Base Learners for Label Corrupted DatasetsNeeshu Rathi, Sanjeev Kumar
The development of noise-resilient quantum machine learning (QML) algorithms is critical in the noisy intermediate-scale quantum (NISQ) era. In this work, we propose a quantum bagging framework that uses QMeans clustering as the base learner to reduce prediction variance and enhance robustness to label noise. Unlike bagging frameworks built on supervised learners, our method leverages the unsupervised nature of QMeans, combined with quantum bootstrapping via QRAM-based sampling and bagging aggregation through majority voting. Through extensive simulations on both noisy classification and regression tasks, we demonstrate that the proposed quantum bagging algorithm performs comparably to its classical counterpart using KMeans while exhibiting greater resilience to label corruption than supervised bagging methods. This highlights the potential of unsupervised quantum bagging in learning from unreliable data.
1.2QUANT-PHAug 14, 2020
A novel three party Quantum secret sharing scheme based on Bell state sequential measurements with application in quantum image sharingFarhan Musanna, Sanjeev Kumar
In this work, we present a quantum secret sharing scheme based on Bell state entanglement and sequential projection measurements. The protocol verifies the $n$ out of $n$ scheme and supports the aborting of the protocol in case all the parties do not divulge in their valid measurement outcomes. The operator-qubit pair forms an integral part of the scheme determining the classical secret to be shared. The protocol is robust enough to neutralize any eavesdropping on a particular qubit of the dealer. The experimental demonstration of the scheme is done on IBM-QE cloud platform with backends \texttt{IBMQ\_16\_Melbourne} and \texttt{IBMQ\_QASM\_SIMULATOR\_V0.1.547} simulator. The security analysis performed on the scheme and the comparative analysis supports our claim of a stringent and an efficient scheme as compared to some recent quantum and semi-quantum techniques of secret sharing.
1.2QUANT-PHFeb 21, 2020
Quantum secret sharing using GHZ state qubit positioning and selective qubits strategy for secret reconstructionFarhan Musanna, Sanjeev Kumar
The work presents a novel quantum secret sharing strategy based on GHZ product state sharing between three parties. The dealer, based on the classical information to be shared, toggles his qubit and shares the product state. The other parties make their Bell measurements and collude to reconstruct the secret. Unlike the other protocols, this protocol does not involve the entire initial state reconstruction, rather uses selective qubits to discard the redundant qubits at the time of reconstruction to decrypt the secret. The protocol also allows for security against malicious attacks by an adversary without affecting the integrity of the secret. The security of the protocol lies in the fact that each party's correct announcement of their measurement is required for reconstruction, failing which the reconstruction process is jeopardized, thereby ascertaining the $(3,3)$ scheme which can further be extended for a $(n,n)$ scheme.