_version_ 1866915117209223168
author Goldfriend, Tomer
Reichental, Israel
Naveh, Amir
Gazit, Lior
Yoran, Nadav
Alon, Ravid
Ur, Shmuel
Lahav, Shahak
Cornfeld, Eyal
Elazari, Avi
Emanuel, Peleg
Harpaz, Dor
Michaeli, Tal
Erez, Nati
Preminger, Lior
Shapira, Roman
Garcell, Erik Michael
Samimi, Or
Kisch, Sara
Hallel, Gil
Kishony, Gilad
van Wingerden, Vincent
Rosenbloom, Nathaniel A.
Opher, Ori
Vax, Matan
Smoler, Ariel
Danzig, Tamuz
Schirman, Eden
Sella, Guy
Cohen, Ron
Garfunkel, Roi
Cohn, Tali
Rosemarin, Hanan
Hass, Ron
Jankiewicz, Klem
Gharra, Karam
Roth, Ori
Azar, Barak
Asban, Shahaf
Linkov, Natalia
Segman, Dror
Sahar, Ohad
Davidson, Niv
Minerbi, Nir
Naveh, Yehuda
author_facet Goldfriend, Tomer
Reichental, Israel
Naveh, Amir
Gazit, Lior
Yoran, Nadav
Alon, Ravid
Ur, Shmuel
Lahav, Shahak
Cornfeld, Eyal
Elazari, Avi
Emanuel, Peleg
Harpaz, Dor
Michaeli, Tal
Erez, Nati
Preminger, Lior
Shapira, Roman
Garcell, Erik Michael
Samimi, Or
Kisch, Sara
Hallel, Gil
Kishony, Gilad
van Wingerden, Vincent
Rosenbloom, Nathaniel A.
Opher, Ori
Vax, Matan
Smoler, Ariel
Danzig, Tamuz
Schirman, Eden
Sella, Guy
Cohen, Ron
Garfunkel, Roi
Cohn, Tali
Rosemarin, Hanan
Hass, Ron
Jankiewicz, Klem
Gharra, Karam
Roth, Ori
Azar, Barak
Asban, Shahaf
Linkov, Natalia
Segman, Dror
Sahar, Ohad
Davidson, Niv
Minerbi, Nir
Naveh, Yehuda
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2412_07372
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Design and synthesis of scalable quantum programs
Goldfriend, Tomer
Reichental, Israel
Naveh, Amir
Gazit, Lior
Yoran, Nadav
Alon, Ravid
Ur, Shmuel
Lahav, Shahak
Cornfeld, Eyal
Elazari, Avi
Emanuel, Peleg
Harpaz, Dor
Michaeli, Tal
Erez, Nati
Preminger, Lior
Shapira, Roman
Garcell, Erik Michael
Samimi, Or
Kisch, Sara
Hallel, Gil
Kishony, Gilad
van Wingerden, Vincent
Rosenbloom, Nathaniel A.
Opher, Ori
Vax, Matan
Smoler, Ariel
Danzig, Tamuz
Schirman, Eden
Sella, Guy
Cohen, Ron
Garfunkel, Roi
Cohn, Tali
Rosemarin, Hanan
Hass, Ron
Jankiewicz, Klem
Gharra, Karam
Roth, Ori
Azar, Barak
Asban, Shahaf
Linkov, Natalia
Segman, Dror
Sahar, Ohad
Davidson, Niv
Minerbi, Nir
Naveh, Yehuda
Quantum Physics
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.
title Design and synthesis of scalable quantum programs
topic Quantum Physics
url https://arxiv.org/abs/2412.07372