arXiv subjects

Sara Ayman Metwalli

Publications and source records attributed to Sara Ayman Metwalli.

5 recordsLinked to original sources

arXiv2026

The Quantum Education Ecosystem: A Review of Global Initiatives, Methods, and Challenges

Quantum information science and engineering (QISE) is advancing rapidly, creating an urgent demand for a quantum-literate, technically proficient workforce. Despite this need, quantum education initiatives remain fragmented across regions, educational levels, and instructional approaches, which constrains their scalability and overall impact. This paper offers a structured analysis of the current quantum education ecosystem by synthesizing global initiatives, pedagogical strategies, and emerging trends. Quantum education is examined through a dual framework that considers both learner progression and instructional methodology, emphasizing the evolution of educational approaches from conceptual exposure to formal reasoning and practical application. Analysis of data from international programs and academic literature reveals key challenges, including inequitable access, absence of standardized curricula, limited empirical evaluation, and discontinuities between educational stages. Quantum education is more accurately conceptualized as a non-linear ecosystem rather than a traditional pipeline, characterized by multiple entry points, feedback mechanisms, and critical transition gaps. Based on this perspective, directions are proposed for developing more coherent, inclusive, and scalable educational frameworks that align with workforce requirements and technological progress. This work presents a unified perspective on the quantum education landscape and outlines actionable strategies to enhance global quantum literacy and workforce preparedness.

physics.ed-ph↗

arXiv2024

Testing and Debugging Quantum Circuits

This paper introduces a process framework for debugging quantum circuits, focusing on three distinct types of circuit blocks: Amplitude Permutation, Phase Modulation, and Amplitude Redistribution circuit blocks. Our research addresses the critical need for specialized debugging approaches tailored to the unique properties of each circuit type. For Amplitude Permutation Circuits, we propose techniques to correct amplitude permutations mimicking classical operations. In phase modulation circuits, our proposed strategy targets the precise calibration of phase alterations essential for quantum computations. The most complex Amplitude Redistribution Circuits demand advanced methods to adjust probability amplitudes. This research bridges a vital gap in current methodologies and lays the groundwork for future advancements in quantum circuit debugging. Our contributions are twofold: We present a comprehensive unit testing tool (Cirquo) and debugging approaches tailored to the unique demands of quantum computing, and we provide empirical evidence of its effectiveness in optimizing quantum circuit performance. This work is a crucial step toward realizing robust quantum computing systems and their applications in various domains.

quant-ph↗

arXiv2022

A Tool For Debugging Quantum Circuits

As the scale of quantum programs grows to match that of classical software, the nascent field of quantum software engineering must mature and tools such as debuggers will become increasingly important. However, developing a quantum debugger is challenging due to the nature of a quantum computer; sneaking a peek at the value of a quantum state will cause either partial or complete collapse of the superposition and may destroy the necessary entanglement. As a first step to developing a full quantum circuit debugger, we have designed and implemented a quantum circuit debugging tool. The tool allows the user to divide the circuit vertically or horizontally into smaller chunks known as slices, and manage their simulation or execution for either interactive debugging or automated testing. The tool also enables developers to track gates within the overall circuit and each chunk to understand their behavior better. Feedback on usefulness and usability from early users shows that using the tool to slice and test their circuits has helped make the debugging process more time-efficient for them.

quant-ph↗

arXiv2021

QuISP: a Quantum Internet Simulation Package

We present an event-driven simulation package called QuISP for large-scale quantum networks built on top of the OMNeT++ discrete event simulation framework. Although the behavior of quantum networking devices have been revealed by recent research, it is still an open question how they will work in networks of a practical size. QuISP is designed to simulate large-scale quantum networks to investigate their behavior under realistic, noisy and heterogeneous configurations. The protocol architecture we propose enables studies of different choices for error management and other key decisions. Our confidence in the simulator is supported by comparing its output to analytic results for a small network. A key reason for simulation is to look for emergent behavior when large numbers of individually characterized devices are combined. QuISP can handle thousands of qubits in dozens of nodes on a laptop computer, preparing for full Quantum Internet simulation. This simulator promotes the development of protocols for larger and more complex quantum networks.

quant-ph↗

arXiv2020

Finding Small and Large k-Clique Instances on a Quantum Computer

Algorithms for triangle-finding, the smallest nontrivial instance of the k-clique problem, have been proposed for quantum computers. Still, those algorithms assume the use of fixed access time quantum RAM (QRAM). We present a practical gate-based approach to both the triangle-finding problem and its NP-hard k-clique generalization. We examine both constant factors for near-term implementation on a Noisy Intermediate Scale Quantum computer (NISQ) device, and the scaling of the problem to evaluate long-term use of quantum computers. We compare the time complexity and circuit practicality of the theoretical approach and actual implementation. We propose and apply two different strategies to the k-clique problem, examining the circuit size of Qiskit implementations. We analyze our implementations by simulating triangle finding with various error models, observing the effect on damping the amplitude of the correct answer, and compare to execution on six real IBMQ machines. Finally, we estimate the date when the methods proposed can run effectively on an actual device based on IBM's quantum volume exponential growth forecast and the results of our error analysis.

quant-ph↗