Research#
Below, we present a collection of scientific papers and articles that have either contributed to the development of Qrisp or highlight its applications and advantages in the field of quantum computing. These citations provide a foundation for understanding the theoretical underpinnings and practical implications of Qrisp. We encourage researchers, developers, and enthusiasts to explore these resources to gain a deeper insight into the capabilities and potential of Qrisp.
Research from within the Qrisp community#
Abstract
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.
Abstract
Double-bracket quantum imaginary-time evolution (DB-QITE) is a quantum algorithm which coherently implements steps in the Riemannian steepest-descent direction for the energy cost function. DB-QITE is derived from Brockett’s double-bracket flow which exhibits saddle points where gradients vanish. In this work, we perform numerical simulations of DB-QITE and describe signatures of transitioning through the vicinity of such saddle points. We provide an explicit gate count analysis using quantum compilation programmed in Qrisp.
Abstract
Elliptic curve cryptography (ECC) is a widely established cryptographic technique, recognized for its effectiveness and reliability across a broad range of applications such as securing telecommunications or safeguarding cryptocurrency wallets. Although being more robust than RSA, ECC is, nevertheless, also threatened by attacks based on Shor’s algorithm, which made it a popular field of study in quantum information science. A variety of techniques have been proposed to perform EC arithmetic in quantum devices; however, software support for compiling these algorithms into executables is extremely limited. Within this work, we leverage the Qrisp programming language to realize one of the first fully compilable implementations of EC arithmetic and verify its correctness using Qrisp’s built-in sparse matrix simulator.
Abstract
Eclipse Qrisp is a high-level programming language designed to simplify quantum programming and make it accessible to a wider range of developers and end users. Initially developed at Fraunhofer FOKUS and now part of the Eclipse Foundation, Eclipse Qrisp abstracts complex quantum operations into user-friendly constructs, enhancing code readability structure. Currently, Eclipse Qrisp is realized as an extension of the Python programming language, in the form of an embedded Domain Specific Language (eDSL), allowing to develop hybrid quantum algorithms, while at the same time utilizing the potential of the overall Python ecosystem in terms of libraries and available developer resources. We firmly believe that the eDSL approach to high-level quantum programming will prevail over the idea of defining specific languages-with their own grammar and ecosystem-due to its ease of integration within available ICT products and services. However, in order to reach higher levels of scalability and market penetration, the Eclipse Qrisp eDSL should be available for various platforms and programming languages beyond Python, e.g. C/C++, Java or Rust. In order to provide the means for implementing Eclipse Qrisp in other programming languages, this paper specifies a meta-model, thereby outlining the pursued design philosophy, architecture, and key features, including compatibility with existing frameworks. The purpose of such a Qrisp meta-model is two-fold: On one hand it formalizes and standardizes the Eclipse Qrisp programming model. On the other hand, such a meta-model can be used to formally extend other programming languages and platforms by the capabilities and concepts specified and implemented within Eclipse Qrisp.
Abstract
Constrained optimization problems, where not all possible variable assignments are feasible solutions, comprise numerous practically relevant optimization problems such as the Traveling Salesman Problem (TSP), or portfolio optimization. Established methods such as quantum annealing or vanilla QAOA usually transform the problem statement into a QUBO (Quadratic Unconstrained Binary Optimization) form, where the constraints are enforced by auxiliary terms in the QUBO objective. Consequently, such approaches fail to utilize the additional structure provided by the constraints. In this paper, we present a method for solving the industry relevant Product Breakdown Structure problem. Our solution is based on constrained QAOA, which by construction never explores the part of the Hilbert space that represents solutions forbidden by the problem constraints. The size of the search space is thereby reduced significantly. We experimentally show that this approach has not only a very favorable scaling behavior, but also appears to suppress the negative effects of Barren Plateaus.
Abstract
The quantum backtracking algorithm proposed by Ashley Montanaro raised considerable interest, as it provides a quantum speed-up for a large class of classical optimization algorithms. It does not suffer from Barren-Plateaus and transfers well into the fault-tolerant era, as it requires only a limited number of arbitrary angle gates. Despite its potential, the algorithm has seen limited implementation efforts, presumably due to its abstract formulation. In this work, we provide a detailed instruction on implementing the quantum step operator for arbitrary backtracking instances. For a single controlled diffuser of a binary backtracking tree with depth n, our implementation requires only 6n+14 CX gates. We detail the process of constructing accept and reject oracles for Sudoku problems using our interface to quantum backtracking. The presented code is written using Qrisp, a high-level quantum programming language, making it executable on most current physical backends and simulators. Subsequently, we perform several simulator based experiments and demonstrate solving 4x4 Sudoku instances with up to 9 empty fields. This is, to the best of our knowledge, the first instance of a compilable implementation of this generality, marking a significant and exciting step forward in quantum software engineering.
Abstract
Uncomputation is an essential part of reversible computing and plays a vital role in quantum computing. Using this technique, memory resources can be safely deallocated without performing a nonreversible deletion process. For the case of quantum computing, several algorithms depend on this as they require disentangled states in the course of their execution. Thus, uncomputation is not only about resource management, but is also required from an algorithmic point of view. However, synthesizing uncomputation circuits is tedious and can be automated. In this paper, we describe the interface for automated generation of uncomputation circuits in our Qrisp framework. Our algorithm for synthesizing uncomputation circuits in Qrisp is based on an improved version of “Unqomp”, a solution presented by Paradis et. al. Our paper also presents some improvements to the original algorithm, in order to make it suitable for the needs of a high-level programming framework. Qrisp itself is a fully compilable, high-level programming language/framework for gate-based quantum computers, which abstracts from many of the underlying hardware details. Qrisp’s goal is to support a high-level programming paradigm as known from classical software development.
External research utilizing or citing Qrisp#
Title |
Authors |
Year |
|---|---|---|
QML-ESSENTIALS-A Framework for Working with Quantum Fourier Models |
M. Strobl, M. Franz, E. Kuehn, W. Mauerer, A. Streit |
2025 |
The Internet of Quantum Things (IoQT)-A New Frontier in Quantum Emulation and Simulation |
I. Kefaloukos, N. Tcholtchev, M.A. Kourtis, G. Oikonomakis |
2025 |
Verifiable End-to-End Delegated Variational Quantum Algorithms |
M. Inajetovic, P. Wallten, A. Pappa |
2025 |
Is Productivity in Quantum Programming Equivalent to Expressiveness? |
F. Corrales-Garro, D. Valerio-Ramírez, et al. |
2025 |
M. Schmidt, A. Kole, L. Wichette, R. Drechsler, F. Kirchner, E. Mounzer |
2025 |
|
I. Reichental, R. Alon, L. Preminger, M. Vax |
2025 |
|
A parameter study for LLL and BKZ with application to shortest vector problems |
T. Köppl, R. Zander, L. Henkel, N. Tcholtchev |
2025 |
E. Osaba, P. Miranda-Rodriguez, A. Oikonomakis |
2025 |
|
N. Assolini, A. Di Pierro, I. Mastroeni |
2025 |
|
CQ: A high-level imperative classical-quantum programming language |
L. Binkowski, H. Vollmer |
2025 |
N. Assolini, A. Di Pierro, I. Mastroeni |
2025 |
|
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime |
K. Hirata, C. Heunen |
2025 |
D-Wave’s Nonlinear-Program Hybrid Solver: Description and Performance Analysis |
E. Osaba, P. Miranda-Rodriguez |
2025 |
Improving Quantum Developer Experience with Kubernetes and Jupyter Notebooks |
O. Kinaen, A. D. Muñoz-Moller, V. Stirbu et al. |
2024 |
D. Rovara, L. Burgholzer, R. Wille |
2024 |
|
Resilience of lattice-based Cryptosystems to Quantum Attacks |
T. Köppl, R. Zander, N. Tcholtchev |
2024 |
Quff: A Dynamically Typed Hybrid Quantum-Classical Programming Language |
C. J. Wright, M. Luján, P. Petoumenos et al. |
2024 |
T. Varga, Y. Aragonés-Soria, M. Oriol |
2024 |
|
Towards Continuous Development for Quantum Programming in Decentralized IoT environments |
M. Kourtis, N. Tcholtchev, I.D. Gheorghe-Pop et al. |
2024 |
Testing multi-subroutine quantum programs: From unit testing to integration testing |
P. Long, J. Zhao |
2024 |
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation |
C. Yuan, M. Carbin |
2024 |
Eclipse Qrisp QAOA: description and preliminary comparison with Qiskit counterparts |
E. Osaba, M. Petrič, I.Oregi et al. |
2024 |
An Abstraction Hierarchy Toward Productive Quantum Programming |
O. Di Matteo, S. Núñez-Corrales, M. Stęchły et al. |
2024 |
A. Basermann, M. Epping et al. |
2024 |
|
D. Eichhorn, M. Schweikart, N. Poser et al. |
2024 |
|
A. Javadi-Abhari, M. Treinish, K. Krsulich et al. |
2024 |
|
UAV Swarm Management Platform for Autonomous Area and Infrastructure Inspection |
M. Batistatos; A. Mazilu et al. |
2024 |
A. Sarkar |
2024 |
|
H. Fürntratt, P. Schnabel et al. |
2024 |
|
Quantum Software Ecosystem: Stakeholders, Interactions and Challenges |
V. Stirbu, T. Mikkonen |
2024 |
B. Bichsel |
2023 |
|
C. Becker, I.D. Gheorghe-Pop, N. Tcholtchev |
2023 |