arXiv subjects

Parfait Atchade-Adelomou

Publications and source records attributed to Parfait Atchade-Adelomou.

14 recordsLinked to original sources

arXiv2026

Hydration Monitoring Using Urinary Biomarkers: A Hybrid Classical Quantum Predictive Modeling Framework

Hydration status is a key physiological indicator associated with cellular homeostasis, renal function, and overall health. Recent advances in smart sensing environments enable passive monitoring of urinary biomarkers that can provide continuous insight into hydration dynamics. In this work, we investigate predictive modeling approaches for hydration monitoring using biomarker data collected through the Predict Health Toilet (PHT) system. The problem is formulated as a regression task using urinary indicators such as urine specific gravity, conductivity, and volume. We evaluate classical machine learning models and quantum machine learning architectures based on variational quantum circuits. In particular, we introduce a modular Quantum Sequential Model (QSM) designed to construct flexible hybrid quantum classical predictive pipelines. Experimental results compare classical regression models, symmetry-constrained quantum regressors, and QSM architectures. The results provide insights into the potential role of quantum machine learning in digital health monitoring systems and highlight the opportunities and current limitations of near-term quantum computing for physiological data analysis.

quant-ph↗

arXiv2026

Classical and Quantum Machine Learning for Population-Level Prediction of Heat-Related Physiological Events

Predicting heat-related physiological events at the population level is challenging due to the complex interactions among climatic, demographic, and socioeconomic factors, as well as the strong sparsity and seasonality of observational data. In this work, we propose a unified predictive framework that integrates heterogeneous environmental and public-health datasets and evaluates two learning paradigms within a common pipeline: classical machine learning and quantum machine learning. The methodology combines data harmonization, temporal aggregation, feature engineering, and dimensionality reduction to construct a weekly county-level population dataset. On this unified representation, we train both a classical regression baseline and a variational quantum model based on parameterized quantum circuits with angle embedding and data re-uploading. Experimental evaluation on datasets from the United States and Catalonia shows that classical models currently achieve higher predictive accuracy, particularly under conditions of strong class imbalance and sparse targets. Nevertheless, the quantum models demonstrate non-trivial learning capability and capture meaningful predictive structure in several scenarios. These results provide an empirical comparison between classical and quantum learning approaches for population-level physiological prediction and establish a methodological foundation for future hybrid health modeling as quantum hardware continues to evolve.

quant-ph↗

arXiv2025

Graph RAG as Human Choice Model: Building a Data-Driven Mobility Agent with Preference Chain

Understanding human behavior in urban environments is a crucial field within city sciences. However, collecting accurate behavioral data, particularly in newly developed areas, poses significant challenges. Recent advances in generative agents, powered by Large Language Models (LLMs), have shown promise in simulating human behaviors without relying on extensive datasets. Nevertheless, these methods often struggle with generating consistent, context-sensitive, and realistic behavioral outputs. To address these limitations, this paper introduces the Preference Chain, a novel method that integrates Graph Retrieval-Augmented Generation (RAG) with LLMs to enhance context-aware simulation of human behavior in transportation systems. Experiments conducted on the Replica dataset demonstrate that the Preference Chain outperforms standard LLM in aligning with real-world transportation mode choices. The development of the Mobility Agent highlights potential applications of proposed method in urban mobility modeling for emerging cities, personalized travel behavior analysis, and dynamic traffic forecasting. Despite limitations such as slow inference and the risk of hallucination, the method offers a promising framework for simulating complex human behavior in data-scarce environments, where traditional data-driven models struggle due to limited data availability.

cs.AI↗

arXiv2025

Propagational Proxy Voting

This paper proposes a voting process in which voters allocate fractional votes to their expected utility in different domains: over proposals, other participants, and sets containing proposals and participants. This approach allows for a more nuanced expression of preferences by calculating the result and relevance within each node. We modeled this by creating a voting matrix that reflects their preference. We use absorbing Markov chains to gain the consensus, and also calculate the influence within the participating nodes. We illustrate this method in action through an experiment with 69 students using a budget allocation topic.

cs.SI↗

arXiv2024

Fourier series weight in quantum machine learning

In this work, we aim to confirm the impact of the Fourier series on the quantum machine learning model. We will propose models, tests, and demonstrations to achieve this objective. We designed a quantum machine learning leveraged on the Hamiltonian encoding. With a subtle change, we performed the trigonometric interpolation, binary and multiclass classifier, and a quantum signal processing application. We also proposed a block diagram of determining approximately the Fourier coefficient based on quantum machine learning. We performed and tested all the proposed models using the Pennylane framework.

quant-ph↗

arXiv2023

Quantum improvement in Spatial Discretization

Quantum algorithms have begun to surpass classical ones in several computation fields, yet practical application remains challenging due to hardware and software limitations. Here, we introduce a quantum algorithm that quadratically improves spatial discretization within these constraints. Implemented in the quantum software library Pennylane, our algorithm bridges the gap from theoretical models to tangible quantum circuitry. The approach promises enhanced efficiency in quantum spatial analysis, with simulations and hardware experiments validating its potential.

quant-ph↗

arXiv2023

Efficient Quantum Modular Arithmetics for the ISQ Era

As we venture into the Intermediate-Scale Quantum (ISQ) era, the proficiency of modular arithmetic operations becomes pivotal for advancing quantum cryptographic algorithms. This study presents an array of quantum circuits, each precision-engineered for modular arithmetic functions critical to cryptographic applications. Central to our exposition are quantum modular adders, multipliers, and exponential operators, whose designs are rigorously optimized for ISQ devices. We provide a theoretical framework and practical implementations in the PennyLane quantum software, bridging the gap between conceptual and applied quantum computing. Our simulations validate the efficacy of these methodologies, offering a strategic compass for developing quantum algorithms that align with the rapid progression of quantum technology.

quant-ph↗

arXiv2023

Quantum Machine Learning hyperparameter search

This paper presents a quantum-based Fourier-regression approach for machine learning hyperparameter optimization applied to a benchmark of models trained on a dataset related to a forecast problem in the airline industry. Our approach utilizes the Fourier series method to represent the hyperparameter search space, which is then optimized using quantum algorithms to find the optimal set of hyperparameters for a given machine learning model. Our study evaluates the proposed method on a benchmark of models trained to predict a forecast problem in the airline industry using a standard HyperParameter Optimizer (HPO). The results show that our approach outperforms traditional hyperparameter optimization methods in terms of accuracy and convergence speed for the given search space. Our study provides a new direction for future research in quantum-based machine learning hyperparameter optimization.

cs.LG↗

arXiv2022

Quantum Algorithms for solving Hard Constrained Optimisation Problems

The thesis deals with Quantum Algorithms for solving Hard Constrained Optimization Problems. It shows how quantum computers can solve difficult everyday problems such as finding the best schedule for social workers or the path of a robot picking and batching in a warehouse. The path to the solution has led to the definition of a new artificial intelligence paradigm with quantum computing, quantum Case-Based Reasoning (qCBR) and to a proof of concept to integrate the capacity of quantum computing within mobile robotics using a Raspberry Pi 4 as a processor (qRobot), capable of operating with leading technology players such as IBMQ, Amazon Braket (D-Wave) and Pennylane. To improve the execution time of variational algorithms in this NISQ era and the next, we have proposed EVA: a quantum Exponential Value Approximation algorithm that speeds up the VQE, and that is, to date, the flagship of the quantum computation. To improve the execution time of variational algorithms in this NISQ era and the next, we have proposed EVA: a quantum Exponential Value Approximation algorithm that speeds up the VQE, and that is, to date, the flagship of the quantum computation.

quant-ph↗

arXiv2022

GPS: A new TSP formulation for its generalizations type QUBO

We propose a new Quadratic Unconstrained Binary Optimization (QUBO) formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. After, we present a detailed study of the constraints subject to the new TSP model and benchmark it with MTZ and native formulations. Finally, we tested whether the correctness of the formulation by entering it into a QUBO problem solver. The solver chosen is a D-Wave\_2000Q6 quantum computer simulator due to the connection between Quantum Annealing and QUBO formulations.

quant-ph↗

arXiv2022

quantum Case-Based Reasoning (qCBR)

Case-Based Reasoning (CBR) is an artificial intelligence approach to problem-solving with a good record of success. This article proposes using Quantum Computing to improve some of the key processes of CBR, such that a Quantum Case-Based Reasoning (qCBR) paradigm can be defined. The focus is set on designing and implementing a qCBR based on the variational principle that improves its classical counterpart in terms of average accuracy, scalability and tolerance to overlapping. A comparative study of the proposed qCBR with a classic CBR is performed for the case of the Social Workers' Problem as a sample of a combinatorial optimization problem with overlapping. The algorithm's quantum feasibility is modelled with docplex and tested on IBMQ computers, and experimented on the Qibo framework.

cs.AI↗

arXiv2021

EVA: a quantum Exponential Value Approximation algorithm

VQE is currently one of the most widely used algorithms for optimizing problems using quantum computers. A necessary step in this algorithm is calculating the expectation value given a state, which is calculated by decomposing the Hamiltonian into Pauli operators and obtaining this value for each of them. In this work, we have designed an algorithm capable of figuring this value using a single circuit. A time cost study has been carried out, and it has been found that in certain more complex Hamiltonians, it is possible to obtain a good performance over the current methods.

quant-ph↗

arXiv2021

qRobot: A Quantum computing approach in mobile robot order picking and batching problem solver optimization

This article aims to bring quantum computing to robotics. A quantum algorithm is developed to minimize the distance travelled in warehouses and distribution centres where order picking is applied. For this, a proof of concept is proposed through a Raspberry Pi 4, generating a quantum combinatorial optimization algorithm that saves the distance travelled and the batch of orders to be made. In case of computational need, the robot will be able to parallelize part of the operations in hybrid computing (quantum + classical), accessing CPUs and QPUs distributed in a public or private cloud. Before this, we must develop a stable environment (ARM64) inside the robot (Raspberry) to run gradient operations and other quantum algorithms on IBMQ, Amazon Braket, D'wave and Pennylane locally or remotely. The proof of concept will run in such quantum environments above.

quant-ph↗

arXiv2021

Quantum Enhanced Filter: QFilter

Convolutional Neural Networks (CNN) are used mainly to treat problems with many images characteristic of Deep Learning. In this work, we propose a hybrid image classification model to take advantage of quantum and classical computing. The method will use the potential that convolutional networks have shown in artificial intelligence by replacing classical filters with variational quantum filters. Similarly, this work will compare with other classification methods and the system's execution on different servers. The algorithm's quantum feasibility is modelled and tested on Amazon Braket Notebook instances and experimented on the Pennylane's philosophy and framework.

quant-ph↗