191 citations · 404 across the 40 of their papers we have counts for
41 papers
IF-QAOA: A Penalty-Free Approach to Accelerating Constrained Quantum Optimization
David Bucher, Jonas Stein, Sebastian Feld +1
Traditional methods for handling (inequality) constraints in the Quantum Approximate Optimization Ansatz (QAOA) typically rely on penalty terms and slack variables, which increase…
Reducing QUBO Density by Factoring Out Semi-Symmetries
Jonas Nüßlein, Leo Sünkel, Jonas Stein +6
Quantum Approximate Optimization Algorithm (QAOA) and Quantum Annealing are prominent approaches for solving combinatorial optimization problems, such as those formulated as Quadra…
Reducing QAOA Circuit Depth by Factoring out Semi-Symmetries
Jonas Nüßlein, Leo Sünkel, Jonas Stein +4
QAOA is a quantum algorithm for solving combinatorial optimization problems. It is capable of searching for the minimizing solution vector of a QUBO problem . The number…
Solving Max-3SAT Using QUBO Approximation
Sebastian Zielinski, Jonas Nüßlein, Michael Kölle +3
As contemporary quantum computers do not possess error correction, any calculation performed by these devices can be considered an involuntary approximation. To solve a problem on…
Using an Evolutionary Algorithm to Create (MAX)-3SAT QUBOs
Sebastian Zielinski, Maximilian Zorn, Thomas Gabor +2
A common way of solving satisfiability instances with quantum methods is to transform these instances into instances of QUBO, which in itself is a potentially difficult and expensi…
Challenges for Reinforcement Learning in Quantum Circuit Design
Philipp Altmann, Jonas Stein, Michael Kölle +5
Quantum computing (QC) in the current NISQ era is still limited in size and precision. Hybrid applications mitigating those shortcomings are prevalent to gain early insight and adv…
qgym: A Gym for Training and Benchmarking RL-Based Quantum Compilation
Stan van der Linde, Willem de Kok, Tariq Bontekoe +1
Compiling a quantum circuit for specific quantum hardware is a challenging task. Moreover, current quantum computers have severe hardware limitations. To make the most use of the l…
Approximative lookup-tables and arbitrary function rotations for facilitating NISQ-implementations of the HHL and beyond
Petros Stougiannidis, Jonas Stein, David Bucher +3
Many promising applications of quantum computing with a provable speedup center around the HHL algorithm. Due to restrictions on the hardware and its significant demand on qubits a…
Mapping quantum circuits to modular architectures with QUBO
Medina Bandic, Luise Prielinger, Jonas Nüßlein +8
Modular quantum computing architectures are a promising alternative to monolithic QPU (Quantum Processing Unit) designs for scaling up quantum devices. They refer to a set of inter…
Pattern QUBOs: Algorithmic construction of 3SAT-to-QUBO transformations
Sebastian Zielinski, Jonas Nüßlein, Jonas Stein +3
3SAT instances need to be transformed into instances of Quadratic Unconstrained Binary Optimization (QUBO) to be solved on a quantum annealer. Although it has been shown that the c…
Low-Depth Flag-Style Syndrome Extraction for Small Quantum Error-Correction Codes
Dhruv Bhatnagar, Matthew Steinberg, David Elkouss +2
Flag-style fault-tolerance has become a linchpin in the realization of small fault-tolerant quantum-error correction experiments. The flag protocol's utility hinges on low qubit ov…
Influence of Different 3SAT-to-QUBO Transformations on the Solution Quality of Quantum Annealing: A Benchmark Study
Sebastian Zielinski, Jonas Nüßlein, Jonas Stein +3
To solve 3SAT instances on quantum annealers they need to be transformed to an instance of Quadratic Unconstrained Binary Optimization (QUBO). When there are multiple transformatio…
Holographic Codes from Hyperinvariant Tensor Networks
Matthew Steinberg, Sebastian Feld, Alexander Jahn
Holographic quantum-error correcting codes are models of bulk/boundary dualities such as the anti-de Sitter/conformal field theory (AdS/CFT) correspondence, where a higher-dimensio…
Mapping quantum algorithms to multi-core quantum computing architectures
Anabel Ovide, Santiago Rodrigo, Medina Bandic +5
Current monolithic quantum computer architectures have limited scalability. One promising approach for scaling them up is to use a modular or multi-core architecture, in which diff…
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
Jonas Nüßlein, Sebastian Zielinski, Thomas Gabor +2
We introduce a novel approach to translate arbitrary 3-SAT instances to Quadratic Unconstrained Binary Optimization (QUBO) as they are used by quantum annealing (QA) or the quantum…
Clever Design, Unexpected Obstacles: Insights on Implementing a Quantum Boltzmann Machine
Felix Paul, Michael Falkenthal, Sebastian Feld
We have implemented a gated-based quantum version of a restricted Boltzmann machine for approximating the ground state of a Pauli-decomposed qubit Hamiltonian. During the implement…
SpinQ: Compilation strategies for scalable spin-qubit architectures
Nikiforos Paraskevopoulos, Fabio Sebastiano, Carmen G. Almudever +1
Despite NISQ devices being severely constrained, hardware- and algorithm-aware quantum circuit mapping techniques have been developed to enable successful algorithm executions. Not…
NISQ-ready community detection based on separation-node identification
Jonas Stein, Dominik Ott, Jonas Nüßlein +3
The analysis of network structure is essential to many scientific areas, ranging from biology to sociology. As the computational task of clustering these networks into partitions,…
Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques
Medina Bandić, Carmen G. Almudever, Sebastian Feld
To execute quantum circuits on a quantum processor, they must be modified to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, resu…
Characterizing Qubit Traffic of a Quantum Intranet aiming at Modular Quantum Computers
Santiago Rodrigo, Domenico Spanò, Medina Bandic +6
Quantum many-core processors are envisioned as the ultimate solution for the scalability of quantum computers. Based upon Noisy Intermediate-Scale Quantum (NISQ) chips interconnect…
Black Box Optimization Using QUBO and the Cross Entropy Method
Jonas Nüßlein, Christoph Roch, Thomas Gabor +3
Black-box optimization (BBO) can be used to optimize functions whose analytic form is unknown. A common approach to realising BBO is to learn a surrogate model which approximates t…
Algorithmic QUBO Formulations for k-SAT and Hamiltonian Cycles
Jonas Nüßlein, Thomas Gabor, Claudia Linnhoff-Popien +1
Quadratic unconstrained binary optimization (QUBO) can be seen as a generic language for optimization problems. QUBOs attract particular attention since they can be solved with qua…
How to Approximate any Objective Function via Quadratic Unconstrained Binary Optimization
Thomas Gabor, Marian Lingsch Rosenfeld, Sebastian Feld +1
Quadratic unconstrained binary optimization (QUBO) has become the standard format for optimization using quantum computers, i.e., for both the quantum approximate optimization algo…
Full-stack quantum computing systems in the NISQ era: algorithm-driven and hardware-aware compilation techniques
Medina Bandic, Sebastian Feld, Carmen G. Almudever
The progress in developing quantum hardware with functional quantum processors integrating tens of noisy qubits, together with the availability of near-term quantum algorithms has…