Oumayma Ouedrhiri

Oumayma Ouedrhiri

Auto-generated profile, based on publicly available information

Oumayma Ouedrhiri

Laboratory of Computer Science Engineering and Systems Faculty of Science and Techniques Marrakesh Morocco

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 March 2022 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
OOOumayma Ouedrhiri
Oumayma Ouedrhiri
OBOumayma Banouar
Oumayma Banouar
SHSalah El Hadaj
Salah El Hadaj
SRSaid Raghay
Said Raghay

16 December 2021
Verified
Conference Paper
Closed access
OOOumayma Ouedrhiri
Oumayma Ouedrhiri
OBOumayma Banouar
Oumayma Banouar
SHSalah El Hadaj
Salah El Hadaj
SRSaid Raghay
Said Raghay
Quantum computing is certainly one of the greatest advances in the computer science field. Thanks to the parallelism and entanglement properties, it has proved to offer several advantages compared to the classical algorithms especially in the great reduction of the processing time. Quantum phase estimation (QPE) is one of the most important algorithms for quantum computing. It is known as the eigenvalue finding module for unitary operators. The Fourier transform is the key to this procedure. It has been researched and used to solve many problems such as the order finding problem, and the factoring problem. It was also applied for quantum sampling algorithms and the calculation of the eigenvalues of unitary matrices. In this paper, we study three important quantum algorithms for machine learning that use the QPE algorithm as a subroutine: the quantum principal components analysis (PCA) for data visualization, the Harrow-Hassidim-Lloyd (HHL) algorithm for solving linear systems, and the quantum singular value thresholding (SVT) for matrix completion in recommender systems. We also discuss the advantages and limits of such algorithms compared to their classical versions. Then we discuss potential ways of amelioration of such algorithms, and end with a proposed approach for further improvement.

26 May 2026 in SoftwareX
Verified
Journal Article
Open access
HTHiba Tabbaa
Hiba Tabbaa
OOOumayma Ouedrhiri
Oumayma Ouedrhiri
MKMohammed Kazaz
Mohammed Kazaz
YZYoussef Zaia
Youssef Zaia
MBMohamed Baba
Mohamed Baba
MLMohamed LACHGAR
Mohamed LACHGAR

7 May 2026 in SoftwareX
Verified
Journal Article
Open access
OOOumayma Ouedrhiri
Oumayma Ouedrhiri
HTHiba Tabbaa
Hiba Tabbaa
MLMohamed LACHGAR
Mohamed LACHGAR
KMKhaoula Ait Bel Mehdi
Khaoula Ait Bel Mehdi
NLNisrine Lachguer
Nisrine Lachguer
MTMohamedou Cheikh Tourd
Mohamedou Cheikh Tourd