Poster Type: Research Posters
Author: Kareem El-Araby (University of Kansas), Thom Popovic (Lawrence Berkeley National Laboratory (LBNL)), Alvir Nobel (University of Kansas), Sunday Ogundele (University of Kansas), Katherine Klymko (Lawrence Berkeley National Laboratory (LBNL)), Daan Camps (Lawrence Berkeley National Laboratory (LBNL)), Anastasiia Butko (Lawrence Berkeley National Laboratory (LBNL)), Esam El-Araby (University of Kansas)
Supervisor:
Abstract: Quantum computing promises exponential speedups over classical computing by leveraging quantum-mechanical properties like superposition and entanglement. As quantum algorithms grow in complexity, classical simulation remains essential for evaluating correctness, scalability, and resource demands. This work focuses on studying the scalability of structured quantum algorithms such as the Quantum Haar Transform (QHT), usually used for reducing data dimensionality in signal/image processing and remote-sensing hyperspectral imagery. We simulate QHT circuits on high performance computing (HPC) systems by constructing unitary models that mirror the transform’s hierarchical decomposition. Simulations track performance metrics such as circuit width, circuit depth, and execution time. Our results provide insight into the practical implementation of structured quantum circuits and serve as a reference for validating algorithmic correctness and guiding future quantum algorithm design.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF