Automated Detection of Alzheimer’s via Hybrid Classical Quantum Neural Networks
Bibliographic record
Abstract
Deep Neural Networks have offered numerous innovative solutions to brain-related diseases including Alzheimer’s. However, there are still a few standpoints in terms of diagnosis and planning that can be transformed via quantum Machine Learning (QML). In this study, we present a hybrid classical–quantum machine learning model for the detection of Alzheimer’s using 6400 labeled MRI scans with two classes. Hybrid classical–quantum transfer learning is used, which makes it possible to optimally pre-process complex and high-dimensional data. Classical neural networks extract high-dimensional features and embed informative feature vectors into a quantum processor. We use resnet34 to extract features from the image and feed a 512-feature vector to our quantum variational circuit (QVC) to generate a four-feature vector for precise decision boundaries. Adam optimizer is used to exploit the adaptive learning rate corresponding to each parameter based on first- and second-order gradients. Furthermore, to validate the model, different quantum simulators (PennyLane, qiskit.aer and qiskit.basicaer) are used for the detection of the demented and non-demented images. The learning rate is set to 10−4 for and optimized quantum depth of six layers, resulting in a training accuracy of 99.1% and a classification accuracy of 97.2% for 20 epochs. The hybrid classical–quantum network significantly outperformed the classical network, as the classification accuracy achieved by the classical transfer learning model was 92%. Thus, a hybrid transfer-learning model is used for binary detection, in which a quantum circuit improves the performance of a pre-trained ResNet34 architecture. Therefore, this work offers a method for selecting an optimal approach for detecting Alzheimer’s disease. The proposed model not only allows for the automated detection of Alzheimer’s but would also speed up the process significantly in clinical settings.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".