Frank Wilhelm-Mauch

Frank Wilhelm-Mauch

Auto-generated profile, based on publicly available information

Frank Wilhelm-Mauch

Theoretical Physics, Saarland University, 66123 Saarbrücken, Germany

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
4 November 2024 in KI - Künstliche Intelligenz
Verified
Journal Article
Open access
PDF file
MKMatthias Klusch
Matthias Klusch
JLJörg Lässig
Jörg Lässig
DMDaniel Müssig
Daniel Müssig
AMAntonio Macaluso
Antonio Macaluso
FWFrank K. Wilhelm
Frank K. Wilhelm
Quantum Artificial Intelligence (QAI) is the intersection of quantum computing and AI, a technological synergy with expected significant benefits for both. In this paper, we provide a brief overview of what has been achieved in QAI so far and point to some open questions for future research. In particular, we summarize some major key findings on the feasability and the potential of using quantum computing for solving computationally hard problems in various subfields of AI, and vice versa, the leveraging of AI methods for building and operating quantum computing devices.

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.

28 July 2003 in Physical Review B
Verified
Journal Article
Open access
PDF file
MGM. C. Goorden
M. C. Goorden
FWF. K. Wilhelm
F. K. Wilhelm
We study a realistic model for driven qubits using the numerical solution of the Bloch-Redfield equation as well as analytical approximations using a high-frequency scheme. Unlike in idealized rotating-wave models suitable for NMR or quantum optics, we study a driving term which neither is orthogonal to the static term nor leaves the adiabatic energy value constant. We investigate the underlying dynamics and analyze the spectroscopy peaks obtained in recent experiments. We show, that unlike in the rotating-wave case, this system exhibits nonlinear driving effects. We study the width of spectroscopy peaks and show, how a full analysis of the parameters of the system can be performed by comparing the first and second resonance. We outline the limitations of the NMR linewidth formula at low temperature and show, that spectroscopic peaks experience a strong shift which goes much beyond the Bloch-Siegert shift of the eigenfrequency.

18 March 2019 in Physical Review A
Verified
Journal Article
Open access
PDF file
AMA. Messinger
A. Messinger
BTB. G. Taketani
B. G. Taketani
FWF. K. Wilhelm
F. K. Wilhelm
Quantum simulation is a promising field where a controllable system is used to mimic another system of interest, whose properties one wants to investigate. One of the key issues for such simulation is the ability to control the environment the system couples to, be it to isolate the system or to engineer a tailored environment of interest. One strategy recently put forward for environment engineering is the use of metamaterials with negative indices of refraction. Here we build on this concept and propose a circuit-QED simulation of many-body Hamiltonians using superlattice metamaterials. We give a detailed description of a superlattice transmission line coupled to an embedded qubit, and show how this system can be used to simulate the spin-boson model in regimes where analytical and numerical methods usually fail, e.g., the strong coupling regime.

13 June 2025 in Physical Review Research
Verified
Journal Article
Open access
SDSven Danz
Sven Danz
MBMario Berta
Mario Berta
SSStefan Schröder
Stefan Schröder
PKPascal Kienast
Pascal Kienast
FWFrank K. Wilhelm
Frank K. Wilhelm
ACAlessandro Ciani
Alessandro Ciani
We study the problem of estimating frequency response functions of systems of coupled, classical harmonic oscillators using a quantum computer. The functional form of these response functions can be mapped to a corresponding eigenproblem of a Hermitian matrix H , thus suggesting the use of quantum phase estimation. Our proposed quantum algorithm operates in the standard s -sparse, oracle-based query access model. For a network of N oscillators with maximum norm ∥ H ∥ max , and when the eigenvalue tolerance ɛ is much smaller than the minimum eigenvalue gap, we use O ( log ( N s ∥ H ∥ max / ɛ ) algorithmic qubits and obtain a rigorous worst-case query complexity upper bound O ( s ∥ H ∥ max / ( δ 2 ɛ ) ) up to logarithmic factors, where δ denotes the desired precision on the coefficients appearing in the response functions. Crucially, our proposal does not suffer from the infamous state preparation bottleneck and can as such potentially achieve large quantum speedups compared to relevant classical methods. As a proof-of-principle of exponential quantum speedup, we show that a simple adaptation of our algorithm solves the random glued-trees problem in polynomial time. We discuss practical limitations as well as potential improvements for quantifying finite-size, end-to-end complexities for application to relevant instances. Published by the American Physical Society 2025

12 July 2024 in Physical Review A
Verified
Journal Article
Closed access
PDF file
TBTim Bode
Tim Bode
FWFrank K. Wilhelm
Frank K. Wilhelm
The correspondence between long-range interacting quantum spin glasses and combinatorial optimization problems underpins the physical motivation for adiabatic quantum computing. On one hand, in disordered (quantum) spin systems, the focus is on exact methods such as the replica trick that allow the calculation of system quantities in the limit of infinite system and ensemble size. On the other hand, when solving a given instance of an optimization problem, disorder-averaged quantities are of no relevance, as one is solely interested in instance-specific, finite-size properties, in particular the optimal solution. Here, we apply the nonequilibrium Green's function formalism to the spin coherent-state path integral to obtain the statistical fluctuations and the collective-excitation spectrum along the annealing path. For the example of the quantum Sherrington-Kirkpatrick spin glass, by comparing to extensive numerically exact results, we show that this method provides access to the instance-specific bottlenecks of the annealing protocol.