Nouhaila Innan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nouhaila Innan has a total of 93 co-authors. Here are the top co-authors by number of shared publications:
- Muhammad Shafique
New York University Abu Dhabi (NYUAD)
22 shared publications - Mohamed Bennai
Quantum Physics and Magnetism Team, LPMC, Faculty of Science Ben M’sik, Casablanca Hassan II University, Casablanca, Morocco
17 shared publications - Alberto Marchisio
Division of Engineering eBrain Lab New York University Abu Dhabi PO Box 129188 Abu Dhabi UAE
12 shared publications - Muhammad Al-Zafar Khan
Quantum Formalism Fellow, Zaiku Group Ltd, Liverpool, UK
10 shared publications - Muhammad Kashif
Division of Engineering eBRAIN Lab New York University Abu Dhabi (NYUAD) Abu Dhabi UAE
5 shared publications - Ahmed Farouk
College of Science and Engineering, Qatar Center for Quantum Computing, Hamad Bin Khalifa University, Doha, Qatar
4 shared publications
Latest Publications
- Open Access
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Late Breaking Results: Hardware-Efficient Quantum Reservoir Computing via Quantized Readout
- 26 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessLate Breaking Results: Hardware-Efficient Quantum Reservoir Computing via Quantized Readout
- Top Cited Papers
- 27 April 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (1) , 55
HQNN-FSP: A hybrid classical-quantum neural network for regression-based financial stock market prediction
- 27 April 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (1) , 55
Top Cited PapersHQNN-FSP: A hybrid classical-quantum neural network for regression-based financial stock market prediction
- Top Cited Papers
- 11 February 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (3) , 83
Comparative performance analysis of quantum machine learning architectures for credit card fraud detection
- 11 February 2026
- Published by Springer Nature in Applied Intelligence
- Vol. 56 (3) , 83
Top Cited PapersComparative performance analysis of quantum machine learning architectures for credit card fraud detection
- Open Access
FiD-QAE: A Fidelity-Driven Quantum Autoencoder for Credit Card Fraud Detection
Credit card fraud detection is a critical task in financial security, as fraudulent transactions are rare, highly imbalanced, and often resemble legitimate ones. A wide range of classical machine learning methods, as well as more recent quantum machine learning approaches, have been investigated to address this challenge, each providing valuable progress but also leaving open questions regarding scalability, robustness, and adaptability to evolving fraud patterns. In this work, we introduce the Fidelity-based Quantum Autoencoder (FiD-QAE), a quantum architecture that employs fidelity estimation as the decision criterion for anomaly detection. Transactions are encoded into quantum states, compressed through a variational quantum circuit, and evaluated using the SWAP test to distinguish legitimate from fraudulent transactions. We conduct a comprehensive evaluation of FiD-QAE, including statistical analyses, multiple performance metrics, and robustness tests under quantum noise models. The results show that FiD-QAE maintains consistent performance across different imbalance levels and preserves robustness in noisy conditions. Moreover, validation on IBM Quantum hardware backends confirms the feasibility of our approach on real devices, with outcomes consistent with simulation. These findings position quantum fidelity as a powerful criterion for anomaly detection and highlight FiD-QAE as a promising direction that complements existing classical and quantum approaches, offering robustness and generalizability for financial fraud detection in realistic environments.
Open AccessFiD-QAE: A Fidelity-Driven Quantum Autoencoder for Credit Card Fraud Detection
Credit card fraud detection is a critical task in financial security, as fraudulent transactions are rare, highly imbalanced, and often resemble legitimate ones. A wide range of classical machine learning methods, as well as more recent quantum machine learning approaches, have been investigated to address this challenge, each providing valuable progress but also leaving open questions regarding scalability, robustness, and adaptability to evolving fraud patterns. In this work, we introduce the Fidelity-based Quantum Autoencoder (FiD-QAE), a quantum architecture that employs fidelity estimation as the decision criterion for anomaly detection. Transactions are encoded into quantum states, compressed through a variational quantum circuit, and evaluated using the SWAP test to distinguish legitimate from fraudulent transactions. We conduct a comprehensive evaluation of FiD-QAE, including statistical analyses, multiple performance metrics, and robustness tests under quantum noise models. The results show that FiD-QAE maintains consistent performance across different imbalance levels and preserves robustness in noisy conditions. Moreover, validation on IBM Quantum hardware backends confirms the feasibility of our approach on real devices, with outcomes consistent with simulation. These findings position quantum fidelity as a powerful criterion for anomaly detection and highlight FiD-QAE as a promising direction that complements existing classical and quantum approaches, offering robustness and generalizability for financial fraud detection in realistic environments.
- Open Access
Investigating Different Barren Plateaus Mitigation Strategies in Variational Quantum Eigensolver
Variational Quantum Eigensolver (VQE) algorithms suffer from barren plateaus, where gradients vanish with system size and circuit depth. Although many mitigation strategies exist, their connection to convergence performance under different iteration budgets remains unclear. Moreover, a systematic analysis identifying which state-of-the-art mitigation techniques perform best under specific scenarios is also lacking. We benchmark four approaches, Local-Global, Adiabatic, State Efficient Ansatz (SEA), and Pretrained VQE, against standard VQE on molecular systems from 4 to 14 qubits, analyzing gradient variance up to 50 layers and convergence over 1000 iterations. Our results show that the impact of gradient preservation is iteration-dependent. In the 14-qubit BeH2 system, Pretrained VQE outperforms SEA at 100 iterations despite lower gradient variance, but SEA becomes 2.2x more accurate at 1000 iterations. For smaller systems, SEA achieves near-exact energies (H2: 10^-5 Ha, LiH: 2x10^-4 Ha) with fidelities 0.999, while standard methods plateau early. The results demonstrate that robust barren plateau mitigation depends on aligning the chosen strategy with both system size and available computational budget, rather than treating gradient variance as the sole predictor of performance.
Open AccessInvestigating Different Barren Plateaus Mitigation Strategies in Variational Quantum Eigensolver
Variational Quantum Eigensolver (VQE) algorithms suffer from barren plateaus, where gradients vanish with system size and circuit depth. Although many mitigation strategies exist, their connection to convergence performance under different iteration budgets remains unclear. Moreover, a systematic analysis identifying which state-of-the-art mitigation techniques perform best under specific scenarios is also lacking. We benchmark four approaches, Local-Global, Adiabatic, State Efficient Ansatz (SEA), and Pretrained VQE, against standard VQE on molecular systems from 4 to 14 qubits, analyzing gradient variance up to 50 layers and convergence over 1000 iterations. Our results show that the impact of gradient preservation is iteration-dependent. In the 14-qubit BeH2 system, Pretrained VQE outperforms SEA at 100 iterations despite lower gradient variance, but SEA becomes 2.2x more accurate at 1000 iterations. For smaller systems, SEA achieves near-exact energies (H2: 10^-5 Ha, LiH: 2x10^-4 Ha) with fidelities 0.999, while standard methods plateau early. The results demonstrate that robust barren plateau mitigation depends on aligning the chosen strategy with both system size and available computational budget, rather than treating gradient variance as the sole predictor of performance.
- Open Access
Graph-Based Bayesian Optimization for Quantum Circuit Architecture Search with Uncertainty Calibrated Surrogates
Quantum circuit design is a key bottleneck for practical quantum machine learning on complex, real-world data. We present an automated framework that discovers and refines variational quantum circuits (VQCs) using graph-based Bayesian optimization with a graph neural network (GNN) surrogate. Circuits are represented as graphs and mutated and selected via an expected improvement acquisition function informed by surrogate uncertainty with Monte Carlo dropout. Candidate circuits are evaluated with a hybrid quantum-classical variational classifier on the next generation firewall telemetry and network internet of things (NF-ToN-IoT-V2) cybersecurity dataset, after feature selection and scaling for quantum embedding. We benchmark our pipeline against an MLP-based surrogate, random search, and greedy GNN selection. The GNN-guided optimizer consistently finds circuits with lower complexity and competitive or superior classification accuracy compared to all baselines. Robustness is assessed via a noise study across standard quantum noise channels, including amplitude damping, phase damping, thermal relaxation, depolarizing, and readout bit flip noise. The implementation is fully reproducible, with time benchmarking and export of best found circuits, providing a scalable and interpretable route to automated quantum circuit discovery.
Open AccessGraph-Based Bayesian Optimization for Quantum Circuit Architecture Search with Uncertainty Calibrated Surrogates
Quantum circuit design is a key bottleneck for practical quantum machine learning on complex, real-world data. We present an automated framework that discovers and refines variational quantum circuits (VQCs) using graph-based Bayesian optimization with a graph neural network (GNN) surrogate. Circuits are represented as graphs and mutated and selected via an expected improvement acquisition function informed by surrogate uncertainty with Monte Carlo dropout. Candidate circuits are evaluated with a hybrid quantum-classical variational classifier on the next generation firewall telemetry and network internet of things (NF-ToN-IoT-V2) cybersecurity dataset, after feature selection and scaling for quantum embedding. We benchmark our pipeline against an MLP-based surrogate, random search, and greedy GNN selection. The GNN-guided optimizer consistently finds circuits with lower complexity and competitive or superior classification accuracy compared to all baselines. Robustness is assessed via a noise study across standard quantum noise channels, including amplitude damping, phase damping, thermal relaxation, depolarizing, and readout bit flip noise. The implementation is fully reproducible, with time benchmarking and export of best found circuits, providing a scalable and interpretable route to automated quantum circuit discovery.
- Open Access
Benchmarking VQE Configurations: Architectures, Initializations, and Optimizers for Silicon Ground State Energy
Quantum computing presents a promising path toward precise quantum chemical simulations, particularly for systems that challenge classical methods. This work investigates the performance of the Variational Quantum Eigensolver (VQE) in estimating the ground-state energy of the silicon atom, a relatively heavy element that poses significant computational complexity. Within a hybrid quantum-classical optimization framework, we implement VQE using a range of ansatz, including Double Excitation Gates, ParticleConservingU2, UCCSD, and k-UpCCGSD, combined with various optimizers such as gradient descent, SPSA, and ADAM. The main contribution of this work lies in a systematic methodological exploration of how these configuration choices interact to influence VQE performance, establishing a structured benchmark for selecting optimal settings in quantum chemical simulations. Key findings show that parameter initialization plays a decisive role in the algorithm's stability, and that the combination of a chemically inspired ansatz with adaptive optimization yields superior convergence and precision compared to conventional approaches.
Open AccessBenchmarking VQE Configurations: Architectures, Initializations, and Optimizers for Silicon Ground State Energy
Quantum computing presents a promising path toward precise quantum chemical simulations, particularly for systems that challenge classical methods. This work investigates the performance of the Variational Quantum Eigensolver (VQE) in estimating the ground-state energy of the silicon atom, a relatively heavy element that poses significant computational complexity. Within a hybrid quantum-classical optimization framework, we implement VQE using a range of ansatz, including Double Excitation Gates, ParticleConservingU2, UCCSD, and k-UpCCGSD, combined with various optimizers such as gradient descent, SPSA, and ADAM. The main contribution of this work lies in a systematic methodological exploration of how these configuration choices interact to influence VQE performance, establishing a structured benchmark for selecting optimal settings in quantum chemical simulations. Key findings show that parameter initialization plays a decisive role in the algorithm's stability, and that the combination of a chemically inspired ansatz with adaptive optimization yields superior convergence and precision compared to conventional approaches.
- Open Access
IQNN-CS: Interpretable Quantum Neural Network for Credit Scoring
Credit scoring is a high-stakes task in financial services, where model decisions directly impact individuals' access to credit and are subject to strict regulatory scrutiny. While Quantum Machine Learning (QML) offers new computational capabilities, its black-box nature poses challenges for adoption in domains that demand transparency and trust. In this work, we present IQNN-CS, an interpretable quantum neural network framework designed for multiclass credit risk classification. The architecture combines a variational QNN with a suite of post-hoc explanation techniques tailored for structured data. To address the lack of structured interpretability in QML, we introduce Inter-Class Attribution Alignment (ICAA), a novel metric that quantifies attribution divergence across predicted classes, revealing how the model distinguishes between credit risk categories. Evaluated on two real-world credit datasets, IQNN-CS demonstrates stable training dynamics, competitive predictive performance, and enhanced interpretability. Our results highlight a practical path toward transparent and accountable QML models for financial decision-making.
Open AccessIQNN-CS: Interpretable Quantum Neural Network for Credit Scoring
Credit scoring is a high-stakes task in financial services, where model decisions directly impact individuals' access to credit and are subject to strict regulatory scrutiny. While Quantum Machine Learning (QML) offers new computational capabilities, its black-box nature poses challenges for adoption in domains that demand transparency and trust. In this work, we present IQNN-CS, an interpretable quantum neural network framework designed for multiclass credit risk classification. The architecture combines a variational QNN with a suite of post-hoc explanation techniques tailored for structured data. To address the lack of structured interpretability in QML, we introduce Inter-Class Attribution Alignment (ICAA), a novel metric that quantifies attribution divergence across predicted classes, revealing how the model distinguishes between credit risk categories. Evaluated on two real-world credit datasets, IQNN-CS demonstrates stable training dynamics, competitive predictive performance, and enhanced interpretability. Our results highlight a practical path toward transparent and accountable QML models for financial decision-making.