Leonhard Hölscher

Leonhard Hölscher

Auto-generated profile, based on publicly available information

Leonhard Hölscher

BMW Group, 80809 Munich, Germany

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 January 2025 in Physical Review Research
Verified
Journal Article
Open access
LHLeonhard Hölscher
Leonhard Hölscher
PRPooja Rao
Pooja Rao
LMLukas Müller
Lukas Müller
JKJohannes Klepsch
Johannes Klepsch
ALAndre Luckow
Andre Luckow
FWFrank K. Wilhelm
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.

2 March 2026 in Journal of Physics A: Mathematical and Theoretical
Verified
Journal Article
Closed access
LHLeonhard Hölscher
Leonhard Hölscher
LKLukas Karch
Lukas Karch
OSOr Samimi
Or Samimi
TDTamuz Danzig
Tamuz Danzig
Engineering design processes involve iterative design evaluations requiring numerous computationally intensive numerical simulations. Quantum algorithms promise substantial speedups for specific tasks relevant to engineering simulations. However, these advantages quickly vanish when considering data input and output on quantum computers. The recently introduced Quantum Simulation-Based Optimization (QuSO) framework circumvents this limitation by treating simulations as subproblems within a larger optimization problem. Here we adapt and implement QuSO for a simplified cooling system design problem, validate correctness in statevector simulations, and present a detailed gate-level complexity analysis for a single QuSO iteration. We express the scaling in terms of problem parameters and QAOA depth and iterations. We show that the cost function can be coherently computed over a superposition of exponentially many configurations using circuits of polynomial complexity. This does not yield a speedup for a single simulation instance, but it enables potential advantages arising from the subsequent QAOA-based search over configurations. The study serves as a proof-of-concept for integrating fault-tolerant quantum subroutines with simulation-based optimization in engineering workflows, clarifying both promise and practical limitations.

23 March 2026 in Quantum Science and Technology
Verified
Journal Article
Open access
LHLeonhard Hölscher
Leonhard Hölscher
OAOliver Ahrend
Oliver Ahrend
LKLukas Karch
Lukas Karch
CLCarlotta L’EStocq
Carlotta L’EStocq
MAMarc Marfany Andreu
Marc Marfany Andreu
JKJulia Kowalski
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.