Quick Navigation
Topics
Quantum Algorithms
Design and synthesis of scalable quantum programs
arXiv
Authors: Tomer Goldfriend, Israel Reichental, Amir Naveh, Lior Gazit, Nadav Yoran, Ravid Alon, Shmuel Ur, Shahak Lahav, Eyal Cornfeld, Avi Elazari, Peleg Emanuel, Dor Harpaz, Tal Michaeli, Nati Erez, Lior Preminger, Roman Shapira, Erik Michael Garcell, Or Samimi, Sara Kisch, Gil Hallel, Gilad Kishony, Vincent van Wingerden, Nathaniel A. Rosenbloom, Ori Opher, Matan Vax, Ariel Smoler, Tamuz Danzig, Eden Schirman, Guy Sella, Ron Cohen, Roi Garfunkel, Tali Cohn, Hanan Rosemarin, Ron Hass, Klem Jankiewicz, Karam Gharra, Ori Roth, Barak Azar, Shahaf Asban, Natalia Linkov, Dror Segman, Ohad Sahar, Niv Davidson, Nir Minerbi, Yehuda Naveh
Year
2024
Paper ID
6186
Status
Preprint
Abstract Read
~2 min
Abstract Words
131
Citations
N/A
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.
Why This Paper Matters
- It adds a 2024 reference point for readers tracking recent quantum research.
- We present a scalable, robust approach to creating quantum programs of arbitrary size and complexity.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.