Design and synthesis of scalable quantum programs
Abstract
We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity. The approach is based on the true abstraction of the problem. The quantum program is expressed in terms of a high-level model together with constraints and objectives on the final program. Advanced synthesis algorithms transform the model into a low-level quantum program that meets the user's specification and is directed at a stipulated hardware. This separation of description from implementation is essential for scale. The technology adapts electronic design automation methods to quantum computing, finding feasible implementations in a virtually unlimited functional space. The results show clear superiority over the compilation and transpilation methods used today. We expect that this technological approach will take over and prevail as quantum software become more demanding, complex, and essential.
Cite
@article{arxiv.2412.07372,
title = {Design and synthesis of scalable quantum programs},
author = {Tomer Goldfriend and Israel Reichental and Amir Naveh and Lior Gazit and Nadav Yoran and Ravid Alon and Shmuel Ur and Shahak Lahav and Eyal Cornfeld and Avi Elazari and Peleg Emanuel and Dor Harpaz and Tal Michaeli and Nati Erez and Lior Preminger and Roman Shapira and Erik Michael Garcell and Or Samimi and Sara Kisch and Gil Hallel and Gilad Kishony and Vincent van Wingerden and Nathaniel A. Rosenbloom and Ori Opher and Matan Vax and Ariel Smoler and Tamuz Danzig and Eden Schirman and Guy Sella and Ron Cohen and Roi Garfunkel and Tali Cohn and Hanan Rosemarin and Ron Hass and Klem Jankiewicz and Karam Gharra and Ori Roth and Barak Azar and Shahaf Asban and Natalia Linkov and Dror Segman and Ohad Sahar and Niv Davidson and Nir Minerbi and Yehuda Naveh},
journal= {arXiv preprint arXiv:2412.07372},
year = {2025}
}