Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866929393524277248 |
|---|---|
| author | Seidel, Raphael Bock, Sebastian Zander, René Petrič, Matic Steinmann, Niklas Tcholtchev, Nikolay Hauswirth, Manfred |
| author_facet | Seidel, Raphael Bock, Sebastian Zander, René Petrič, Matic Steinmann, Niklas Tcholtchev, Nikolay Hauswirth, Manfred |
| contents | While significant progress has been made on the hardware side of quantum computing, support for high-level quantum programming abstractions remains underdeveloped compared to classical programming languages. In this article, we introduce Qrisp, a framework designed to bridge several gaps between high-level programming paradigms in state-of-the-art software engineering and the physical reality of today's quantum hardware. The framework aims to provide a systematic approach to quantum algorithm development such that they can be effortlessly implemented, maintained and improved. We propose a number of programming abstractions that are inspired by classical paradigms, yet consistently focus on the particular needs of a quantum developer. Unlike many other high-level language approaches, Qrisp's standout feature is its ability to compile programs to the circuit level, making them executable on most existing physical backends. The introduced abstractions enable the Qrisp compiler to leverage algorithm structure for increased compilation efficiency. Finally, we present a set of code examples, including an implementation of Shor's factoring algorithm. For the latter, the resulting circuit shows significantly reduced quantum resource requirements, strongly supporting the claim that systematic quantum algorithm development can give quantitative benefits. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_14792 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers Seidel, Raphael Bock, Sebastian Zander, René Petrič, Matic Steinmann, Niklas Tcholtchev, Nikolay Hauswirth, Manfred Quantum Physics Programming Languages While significant progress has been made on the hardware side of quantum computing, support for high-level quantum programming abstractions remains underdeveloped compared to classical programming languages. In this article, we introduce Qrisp, a framework designed to bridge several gaps between high-level programming paradigms in state-of-the-art software engineering and the physical reality of today's quantum hardware. The framework aims to provide a systematic approach to quantum algorithm development such that they can be effortlessly implemented, maintained and improved. We propose a number of programming abstractions that are inspired by classical paradigms, yet consistently focus on the particular needs of a quantum developer. Unlike many other high-level language approaches, Qrisp's standout feature is its ability to compile programs to the circuit level, making them executable on most existing physical backends. The introduced abstractions enable the Qrisp compiler to leverage algorithm structure for increased compilation efficiency. Finally, we present a set of code examples, including an implementation of Shor's factoring algorithm. For the latter, the resulting circuit shows significantly reduced quantum resource requirements, strongly supporting the claim that systematic quantum algorithm development can give quantitative benefits. |
| title | Qrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantum Computers |
| topic | Quantum Physics Programming Languages |
| url | https://arxiv.org/abs/2406.14792 |