TSTobias Stollenwerk

Tobias Stollenwerk

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tobias Stollenwerk has a total of 59 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    End-to-end quantum algorithm for topology optimization in structural mechanics

    by Leonhard Hölscher, Oliver Ahrend, Lukas Karch, Carlotta L’EStocq, Marc Marfany Andreu, Tobias Stollenwerk, Frank K Wilhelm, Julia Kowalski

    Topology optimization is a key methodology in engineering design for finding efficient and robust structures. Due to the enormous size of the design space, evaluating all possible configurations is typically infeasible. In this work, we present an end-to-end, fault-tolerant quantum algorithm for topology optimization that operates on an exponentially large Hilbert space representing the design space. We demonstrate the algorithm on the two-dimensional Messerschmitt-Bölkow-Blohm beam problem. By restricting design variables to binary values, we reformulate the compliance minimization task as a combinatorial satisfiability problem, solved using Grover’s algorithm. Within Grover’s oracle, the compliance is computed through the finite-element method using established quantum algorithms, including block-encoding of the stiffness matrix, quantum singular value transformation for matrix inversion, Hadamard test, and quantum amplitude estimation. The complete algorithm is implemented and validated using classical quantum-circuit simulations. A detailed complexity analysis shows that the method evaluates the compliance of exponentially many structures in quantum superposition in polynomial time. In the global search, our approach maintains Grover’s quadratic speedup compared to classical unstructured search. Overall, the proposed quantum workflow demonstrates how quantum algorithms can advance the field of computational science and engineering.


  • Open Access

    Measurement-driven Quantum Approximate Optimization

    by Tobias Stollenwerk, Stuart Hadfield

    Algorithms based on non-unitary evolution have attracted much interest for ground state preparation on quantum computers. One recently proposed method makes use of ancilla qubits and controlled unitary operators to implement weak measurements related to imaginary-time evolution. In this work we specialize and extend this approach to the setting of combinatorial optimization. We first generalize the algorithm from exact to approximate optimization, taking advantage of several properties unique to classical problems. In particular we show how to select parameters such that the success probability of each measurement step is bounded away from $1/2$. We then show how to adapt our paradigm to the setting of constrained optimization for a number of important classes of hard problem constraints. For this we compare and contrast both penalty-based and feasibility-preserving approaches, elucidating the significant advantages of the latter approach. Our approach is general and may be applied to easy-to-prepare initial states as a standalone algorithm, or deployed as a quantum postprocessing stage to improve performance of a given parameterized quantum circuit. We then propose a more sophisticated variant of our algorithm that adaptively applies a mixing operator or not, based on the measurement outcomes seen so far, as to speeds up the algorithm and helps the system evolution avoid slowing down or getting stuck suboptimally. In particular, we show that mixing operators from the quantum alternating operator ansatz can be imported directly, both for the necessary eigenstate scrambling operator and for initial state preparation, and discuss quantum resource tradeoffs.

  • Open Access

    Towards Quantum Algorithms for the Optimization of Spanning Trees: The Power Distribution Grids Use Case

    by Carsten Hartmann, Nil Rodellas-Gràcia, Christian Wallisch, Thiemo Pesch, Frank K. Wilhelm, Dirk Witthaut, Tobias Stollenwerk, Andrea Benigni

    Optimizing the topology of networks is an important challenge across engineering disciplines. In energy systems, network reconfiguration can substantially reduce losses and costs and thus support the energy transition. Unfortunately, many related optimization problems are NP hard, restricting practical applications. In this article, we address the problem of minimizing losses in radial networks, a problem that routinely arises in distribution grid operation. We show that even the computation of approximate solutions is computationally hard and propose quantum optimization as a promising alternative. We derive two quantum algorithmic primitives based on the Quantum Alternating Operator Ansatz (QAOA) that differ in the sampling of network topologies: a tailored sampling of radial topologies and simple sampling with penalty terms to suppress non-radial topologies. We show how to apply these algorithmic primitives to distribution grid reconfiguration and quantify the necessary quantum resources.

  • Open Access

    Quantum combinatorial optimization beyond the variational paradigm: Simple schedules for hard problems

    by Tim Bode, Krish Ramesh, Tobias Stollenwerk

    Advances in quantum algorithms suggest a tentative scaling advantage on certain combinatorial optimization problems. Recent work, however, has also reinforced the idea that barren plateaus render variational algorithms ineffective on large Hilbert spaces. Hence, finding annealing protocols by variation ultimately appears to be difficult. Similarly, the adiabatic theorem fails on hard problem instances with first-order quantum phase transitions. Here we show how to use the spin coherent-state path integral to shape the geometry of quantum adiabatic evolution, leading to annealing protocols at polynomial overhead that provide orders-of-magnitude improvements in the probability to measure optimal solutions, relative to linear protocols. These improvements are not obtained on a controllable toy problem but on randomly generated hard instances (Sherrington-Kirkpatrick and maximum 2-satisfiability), making them generic and robust. Our method works for large systems and may thus be used to improve the performance of state-of-the-art quantum devices.


  • Top Cited Papers
    Open Access

    Quantum-inspired fluid simulation of two-dimensional turbulence with GPU acceleration

    by Leonhard Hölscher, Pooja Rao, Lukas Müller, Johannes Klepsch, Andre Luckow, Tobias Stollenwerk, Frank K. Wilhelm

    Tensor network algorithms can efficiently simulate complex quantum many-body systems by utilizing knowledge of their structure and entanglement. These methodologies have been adapted recently for solving the Navier-Stokes equations, which describe a spectrum of fluid phenomena, from the aerodynamics of vehicles to weather patterns. Within this quantum-inspired paradigm, velocity is encoded as matrix product states (MPS), effectively harnessing the analogy between interscale correlations of fluid dynamics and entanglement in quantum many-body physics. This particular tensor structure is also called quantics tensor train (QTT). By utilizing NVIDIA's cuQuantum library to perform parallel tensor computations on GPUs, our adaptation speeds up simulations by up to 12.1 times. This allows us to study the algorithm in terms of its applicability, scalability, and performance. By simulating two qualitatively different but commonly encountered 2D flow problems at high Reynolds numbers up to 1 × 10 7 using a fourth-order time stepping scheme, we find that the algorithm has a potential advantage over direct numerical simulations in the turbulent regime as the requirements for grid resolution increase drastically. In addition, we derive the scaling χ = O ( poly ( 1 / ε ) ) for the maximum bond dimension χ of MPS representing turbulent flow fields, with an error ε , based on the spectral distribution of turbulent kinetic energy. Our findings motivate further exploration of related quantum algorithms and other tensor network methods.


  • Open Access

    Coherent and non-unitary errors in ZZ-generated gates

    by Thorge Müller, Tobias Stollenwerk, David Headley, Michael Epping, Frank K Wilhelm

    Variational algorithms such as the quantum approximate optimization algorithm have attracted attention due to their potential for solving problems using near-term quantum computers. The ZZ interaction typically generates the primitive two-qubit gate in such algorithms applied for a time, typically a variational parameter, γ. Different compilation techniques exist with respect to the implementation of two-qubit gates. Due to the importance of the ZZ-gate, we present an error analysis comparing the continuous-angle controlled phase gate (CP) against the fixed angle controlled Z-gate (CZ). We analyze both techniques under the influence of coherent over-rotation and depolarizing noise. We show that CP and CZ compilation techniques achieve comparable ZZ-gate fidelities if the incoherent error is below 0.03% and the coherent error is below 0.8%. Thus, we argue that for small coherent and incoherent error a non-parameterized two-qubit gate such as CZ in combination with virtual Z decomposition for single-qubit gates could lead to a significant reduction in the calibration required and, therefore, a less error-prone quantum device. We show that above a coherent error of 0.04π (2%), the CZ gate fidelity depends significantly on γ.


  • Open Access

    $\mathrm{Q(AI)}^2$: Quantum Artificial Intelligence for the Automotive Industry

    by Tobias Stollenwerk, Somtapa Bhattacharya, Michele Cattelan, Alessandro Ciani, Gabriele Compostella, David Headley, Johannes Klepsch, Matthias Klusch, Markus Leder, Antonio Macaluso, et al.

  • Measurement-Based Quantum Approximate Optimization

    by Tobias Stollenwerk, Stuart Hadfield

    Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mid-circuit measurement and adaptive control, opportunities arise for innovative algorithmic paradigms. In this work we focus on measurement-based quantum computing protocols for approximate optimization, in particular related to quantum alternating operator ansätze (QAOA), a popular quantum circuit model approach to combinatorial optimization. For the construction and analysis of our measurement-based protocols we demonstrate that diagrammatic approaches, specifically ZX-calculus and its extensions, are effective for adapting such algorithms to the measurement-based setting. In particular we derive measurement patterns for applying QAOA to the broad and important class of QUBO problems. We further outline how for constrained optimization, hard problem constraints may be directly incorporated into our protocol to guarantee the feasibility of the solution found and avoid the need for dealing with penalties. Finally we discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.


  • Open Access

    Measurement-Based Quantum Approximate Optimization

    by Tobias Stollenwerk, Stuart Hadfield

    Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mid-circuit measurement and adaptive control, opportunities arise for innovative algorithmic paradigms. In this work we focus on measurement-based quantum computing protocols for approximate optimization, in particular related to quantum alternating operator ansätze (QAOA), a popular quantum circuit model approach to combinatorial optimization. For the construction and analysis of our measurement-based protocols we demonstrate that diagrammatic approaches, specifically ZX-calculus and its extensions, are effective for adapting such algorithms to the measurement-based setting. In particular we derive measurement patterns for applying QAOA to the broad and important class of QUBO problems. We further outline how for constrained optimization, hard problem constraints may be directly incorporated into our protocol to guarantee the feasibility of the solution found and avoid the need for dealing with penalties. Finally we discuss the resource requirements and tradeoffs of our approach to that of more traditional quantum circuits.

  • Optimal Flight-Gate Assignment on a Digital Quantum Computer

    by Yahui Chai, Lena Funcke, Tobias Hartung, Karl Jansen, Stefan Kühn, Paolo Stornati, Tobias Stollenwerk

    We investigate the performance of the variational quantum eigensolver (VQE) for the problem of optimal flight-gate assignment. This is a combinatorial-optimization problem that aims at finding an optimal assignment of flights to the gates of an airport, in order to minimize the passenger travel time. To study the problem, we adopt a qubit-efficient binary encoding with a cyclic mapping, which is suitable for a digital quantum computer. Using this encoding in conjunction with the conditional value at risk (CVaR) as an aggregation function, we systematically explore the performance of the approach by classically simulating the CVaR VQE. Our results indicate that the method allows for finding a good solution with high probability and that it significantly outperforms the naive VQE approach. We examine the role of entanglement for the performance and find that ansätze with entangling gates allow for better results than pure product states. Studying the problem for various sizes, our numerical data show that the scaling of the number of cost-function calls for obtaining a good solution is not exponential for the regimes that we investigate in this work.