Scalable Memory Recycling for Large Quantum Programs
Abstract
As quantum computing technology advances, the complexity of quantum algorithms increases, necessitating a shift from low-level circuit descriptions to high-level programming paradigms. This paper addresses the challenges of developing a compilation algorithm that optimizes memory management and scales well for bigger, more complex circuits. Our approach models the high-level quantum code as a control flow graph and presents a workflow that searches for a topological sort that maximizes opportunities for qubit reuse. Various heuristics for qubit reuse strategies handle the trade-off between circuit width and depth. We also explore scalability issues in large circuits, suggesting methods to mitigate compilation bottlenecks. By analyzing the structure of the circuit, we are able to identify sub-problems that can be solved separately, without a significant effect on circuit quality, while reducing runtime significantly. This method lays the groundwork for future advancements in quantum programming and compiler optimization by incorporating scalability into quantum memory management.
Cite
@article{arxiv.2503.00822,
title = {Scalable Memory Recycling for Large Quantum Programs},
author = {Israel Reichental and Ravid Alon and Lior Preminger and Matan Vax and Amir Naveh},
journal= {arXiv preprint arXiv:2503.00822},
year = {2025}
}