activity
20172026
most citedThe Bitter Truth About Quantum Algorithms in the NISQ Era

231 citations · 580 across the 29 of their papers we have counts for

collaborators

32 papers

cs.SE2026

A Methodology for Investigating AI Patterns Prevalence in Software Repositories

Srinath Perera, Hasinthaka Piyumal, Frank Leymann +1

As Artificial Intelligence(AI)-based applications take off, a clear understanding of AI patterns can uplift the quality of AI applications. Many AI patterns have been proposed in t…

quant-ph2025

Loss Behavior in Supervised Learning with Entangled States

Alexander Mandl, Johanna Barzen, Marvin Bechtold +2

Quantum Machine Learning (QML) aims to leverage the principles of quantum mechanics to speed up the process of solving machine learning problems or improve the quality of solutions…

quant-ph2025★ 2 cited

On the Differential Topology of Expressivity of Parameterized Quantum Circuits

Johanna Barzen, Frank Leymann

Parameterized quantum circuits play a key role in quantum computing. Measuring the suitability of such a circuit for solving a class of problems is needed. One such promising measu…

quant-ph2025

Simulating Quantum State Transfer between Distributed Devices using Noisy Interconnects

Marvin Bechtold, Johanna Barzen, Frank Leymann +1

Scaling beyond individual quantum devices via distributed quantum computing relies critically on high-fidelity quantum state transfers between devices, yet the quantum interconnect…

quant-ph2025

Harnessing Patterns to Support the Development of Hybrid Quantum Applications

Daniel Vietz, Martin Beisel, Johanna Barzen +3

Quantum computing provides computational advantages in various domains. To benefit from these advantages complex hybrid quantum applications must be built, which comprise both quan…

quant-ph2024

Qunicorn: A Middleware for the Unified Execution Across Heterogeneous Quantum Cloud Offerings

Benjamin Weder, Johanna Barzen, Martin Beisel +4

Quantum computers are available via a variety of different quantum cloud offerings. These offerings are heterogeneous and differ in features, such as pricing models or types of acc…

quant-ph2024★ 4 cited

Joint Wire Cutting with Non-Maximally Entangled States

Marvin Bechtold, Johanna Barzen, Frank Leymann +2

Distributed quantum computing leverages the collective power of multiple quantum devices to perform computations exceeding the capabilities of individual quantum devices. A current…

cs.CR2024★ 1 cited

Post-Quantum Security: Origin, Fundamentals, and Adoption

Johanna Barzen, Frank Leymann

Nowadays, predominant asymmetric cryptographic schemes are considered to be secure because discrete logarithms are believed to be hard to be computed. The algorithm of Shor can eff…

cs.SE2024★ 68 cited

Quantum Software Engineering: Roadmap and Challenges Ahead

Juan M. Murillo, Jose Garcia-Alonso, Enrique Moguel +13

As quantum computers advance, the complexity of the software they can execute increases as well. To ensure this software is efficient, maintainable, reusable, and cost-effective -k…

quant-ph2024★ 8 cited

Cutting a Wire with Non-Maximally Entangled States

Marvin Bechtold, Johanna Barzen, Frank Leymann +1

Distributed quantum computing supports combining the computational power of multiple quantum devices to overcome the limitations of individual devices. Circuit cutting techniques e…

quant-ph2024★ 5 cited

Warm-Starting the VQE with Approximate Complex Amplitude Encoding

Felix Truger, Johanna Barzen, Frank Leymann +1

The Variational Quantum Eigensolver (VQE) is a Variational Quantum Algorithm (VQA) to determine the ground state of quantum-mechanical systems. As a VQA, it makes use of a classica…

quant-ph2023

On Reducing the Amount of Samples Required for Training of QNNs: Constraints on the Linear Structure of the Training Data

Alexander Mandl, Johanna Barzen, Frank Leymann +1

Training classical neural networks generally requires a large number of training samples. Using entangled training samples, Quantum Neural Networks (QNNs) have the potential to sig…

quant-ph2023★ 1 cited

Circuit Cutting with Non-Maximally Entangled States

Marvin Bechtold, Johanna Barzen, Frank Leymann +1

Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. Circuit cutting techniques enable the distribu…

quant-ph2023★ 27 cited

Architectural Vision for Quantum Computing in the Edge-Cloud Continuum

Alireza Furutanpey, Johanna Barzen, Marvin Bechtold +4

Quantum processing units (QPUs) are currently exclusively available from cloud vendors. However, with recent advancements, hosting QPUs is soon possible everywhere. Existing work h…

quant-ph2023★ 2 cited

Comparing Quantum Service Offerings

Julian Obst, Johanna Barzen, Martin Beisel +3

With the emergence of quantum computing, a growing number of quantum devices is accessible via cloud offerings. However, due to the rapid development of the field, these quantum-sp…

quant-ph2023★ 8 cited

Amplitude amplification-inspired QAOA: Improving the success probability for solving 3SAT

Alexander Mandl, Johanna Barzen, Marvin Bechtold +2

The Boolean satisfiability problem (SAT), in particular 3SAT with its bounded clause size, is a well-studied problem since a wide range of decision problems can be reduced to it. D…

quant-ph2023★ 27 cited

Warm-Starting and Quantum Computing: A Systematic Mapping Study

Felix Truger, Johanna Barzen, Marvin Bechtold +4

Due to low numbers of qubits and their error-proneness, Noisy Intermediate-Scale Quantum (NISQ) computers impose constraints on the size of quantum algorithms they can successfully…

quant-ph2023★ 34 cited

Investigating the effect of circuit cutting in QAOA for the MaxCut problem on NISQ devices

Marvin Bechtold, Johanna Barzen, Frank Leymann +4

Noisy Intermediate-Scale Quantum (NISQ) devices are restricted by their limited number of qubits and their short decoherence times. An approach addressing these problems is quantum…

math.HO2022

Continued Fractions and Probability Estimations in the Shor Algorithm -- A Detailed and Self-Contained Treatise

Johanna Barzen, Frank Leymann

The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction…

cs.SE2021★ 4 cited

Quantum Software Development Lifecycle

Benjamin Weder, Johanna Barzen, Frank Leymann +1

With recent advances in the development of more powerful quantum computers, the research area of quantum software engineering is emerging, having the goal to provide concepts, prin…

quant-ph2021★ 4 cited

Hybrid Quantum Applications Need Two Orchestrations in Superposition: A Software Architecture Perspective

Frank Leymann, Johanna Barzen

Quantum applications are most often hybrid, i.e. they are not only made of implementations of pure quantum algorithms but also of classical programs as well as workflows and topolo…

cs.CR2020★ 4 cited

On the Serverless Nature of Blockchains and Smart Contracts

Vladimir Yussupov, Ghareeb Falazi, Uwe Breitenbücher +1

Although historically the term serverless was also used in the context of peer-to-peer systems, it is more frequently associated with the architectural style for developing cloud-n…

cs.SE2020★ 5 cited

Pattern Atlas

Frank Leymann, Johanna Barzen

Pattern languages are well-established in the software architecture community. Many different aspects of creating a software architecture are addressed by such languages. Thus, sev…

quant-ph2020★ 231 cited

The Bitter Truth About Quantum Algorithms in the NISQ Era

Frank Leymann, Johanna Barzen

Implementing a quantum algorithm on a NISQ device has several challenges that arise from the fact that such devices are noisy and have limited quantum resources. Thus, various fact…