Design and synthesis of scalable quantum programs
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...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | 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. |
---|---|
DOI: | 10.48550/arxiv.2412.07372 |