Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Petric, Matic"'
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 m
Externí odkaz:
http://arxiv.org/abs/2406.15228
Autor:
Seidel, Raphael, Bock, Sebastian, Zander, René, Petrič, Matic, Steinmann, Niklas, Tcholtchev, Nikolay, Hauswirth, Manfred
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 fra
Externí odkaz:
http://arxiv.org/abs/2406.14792
Autor:
Osaba, Eneko, Petrič, Matic, Oregi, Izaskun, Seidel, Raphael, Ruiz, Alejandra, Bock, Sebastian, Kourtis, Michail-Alexandros
This paper focuses on the presentation and evaluation of the high-level quantum programming language Eclipse Qrisp. The presented framework, used for developing and compiling quantum algorithms, is measured in terms of efficiency for its implementati
Externí odkaz:
http://arxiv.org/abs/2405.20173
Autor:
Seidel, Raphael, Zander, René, Petrič, Matic, Steinmann, Niklas, Liu, David Q., Tcholtchev, Nikolay, Hauswirth, Manfred
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 th
Externí odkaz:
http://arxiv.org/abs/2402.10060
Autor:
Kourtis, Michail Alexandros, Tcholtchev, Nikolay, Gheorghe-Pop, Ilie-Daniel, Becker, Colin Kai-Uwe, Xylouris, Georgios, Markakis, Evangelos, Petric, Matic, Seidel, Raphael, Bock, Sebastian
Publikováno v:
In Procedia Computer Science 2024 238:7-14