Youssef Moawad

Mr. Youssef Moawad


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
4 October 2022 in Frontiers in Mechanical Engineering
Verified
Journal Article
Open access
YMYoussef Moawad
Youssef Moawad
WVWim Vanderbauwhede
Wim Vanderbauwhede
RSRené Steijl
René Steijl
Among the many computational models for quantum computing, the Quantum Circuit Model is the most well-known and used model for interacting with current quantum hardware. The practical implementation of quantum computers is a very active research field. Despite this progress, access to physical quantum computers remains relatively limited. Furthermore, the existing machines are susceptible to random errors due to quantum decoherence, as well as being limited in number of qubits, connectivity and built-in error correction. Simulation on classical hardware is therefore essential to allow quantum algorithm researchers to test and validate new algorithms in a simulated-error environment. Computing systems are becoming increasingly heterogeneous, using a variety of hardware accelerators to speed up computational tasks. One such type of accelerators, Field Programmable Gate Arrays (FPGAs), are reconfigurable circuits that can be programmed using standardized high-level programming models such as OpenCL and SYCL. FPGAs allow to create specialized highly-parallel circuits capable of mimicking the quantum parallelism properties of quantum gates, in particular for the class of quantum algorithms where many different computations can be performed concurrently or as part of a deep pipeline. They also benefit from very high internal memory bandwidth. This paper focuses on the analysis of quantum algorithms for applications in computational fluid dynamics. In this work we introduce novel quantum-circuit implementations of model lattice-based formulations for fluid dynamics, specifically the D1Q3 model using quantum computational basis encoding, as well as, efficient simulation of the circuits using FPGAs. This work forms a step toward quantum circuit formulation of the Lattice Boltzmann Method (LBM). For the quantum circuits implementing the nonlinear equilibrium distribution function in the D1Q3 lattice model, it is shown how circuit transformations can be introduced that facilitate the efficient simulation of the circuits on FPGAs, exploiting their fine-grained parallelism. We show that these transformations allow us to exploit more parallelism on the FPGA and improve memory locality. Preliminary results show that for this class of circuits the introduced transformations improve circuit execution time. We show that FPGA simulation of the reduced circuits results in more than 3× improvement in performance per Watt compared to the CPU simulation. We also present results from evaluating the same kernels on a GPU.

4 March 2026 in Future Generation Computer Systems
Verified
Journal Article
Open access
KWKathleen West
Kathleen West
YMYoussef Moawad
Youssef Moawad
FLFabian Lehmann
Fabian Lehmann
VBVasilis Bountris
Vasilis Bountris
ULUlf Leser
Ulf Leser
LTLauritz Thamsen
Lauritz Thamsen

5 March 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
GAGiulio Attenni
Giulio Attenni
YMYoussef Moawad
Youssef Moawad
NBNovella Bartolini
Novella Bartolini
LTLauritz Thamsen
Lauritz Thamsen
In this paper, we investigate the potential of spatial and temporal cloud workload shifting to reduce carbon, water, and land use footprints. Specifically, we perform a simulation study leveraging publicly available data on the cloud infrastructure of major providers (AWS and Azure) as well as real-world workload traces (big data analytics and FaaS) and grid mix data to consider two different scenarios. Our simulation results indicate that spatial shifting can substantially lower carbon, water, and land use footprints. In the FaaS applications, shifting the spatiotemporal workload achieves carbon savings of up to 85%, water savings of around 50%, and reductions in land use of up to 45%, all while optimizing for the respective factors. Mixed optimization yields results comparable to those of land use alone. For big data workloads, spatiotemporal shifting delivers reductions of up to 45% in carbon emissions, 40% in water consumption, and nearly 40% in land use when optimized for the respective factors. Temporal shifting also decreases the footprint, though to a lesser extent. When applied together, the two strategies yield the greatest overall reduction, driven mainly by spatial shifting with temporal adjustments providing an additional, incremental benefit. Sensitivity analysis demonstrates that such shifting is robust to prediction errors in grid mix data and to variations across different seasons.

5 May 2023 in Algorithms
Verified
Journal Article
Open access
PDF file
YMYoussef Moawad
Youssef Moawad
WVWim Vanderbauwhede
Wim Vanderbauwhede
RSRene Steijl
Rene Steijl
As quantum computing technology continues to develop, the need for research into novel quantum algorithms is growing. However, such algorithms cannot yet be reliably tested on actual quantum hardware, which is still limited in several ways, including qubit coherence times, connectivity, and available qubits. To facilitate the development of novel algorithms despite this, simulators on classical computing systems are used to verify the correctness of an algorithm, and study its behaviour under different error models. In general, this involves operating on a memory space that grows exponentially with the number of qubits. In this work, we introduce quantum circuit transformations that allow for the construction of parameterised circuits for quantum algorithms. The parameterised circuits are in an ideal form to be processed by quantum compilation tools, such that the circuit can be partially evaluated prior to simulation, and a smaller specialised circuit can be constructed by eliminating fixed input qubits. We show significant reduction in the number of qubits for various quantum arithmetic circuits. Divide-by-n-bits quantum integer dividers are used as an example demonstration. It is shown that the complexity reduces from 4n+2 to 3n+2 qubits in the specialised versions. For quantum algorithms involving divide-by-8 arithmetic operations, a reduction by 28=256 in required memory is achieved for classical simulation, reducing the memory required from 137 GB to 0.53 GB.