Sebastian Egginger

Sebastian Egginger

Auto-generated profile, based on publicly available information

Sebastian Egginger

Department of Quantum Information and Computation at Kepler (QUICK) Johannes Kepler University Linz Linz Austria and

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
15 July 2024 in Quantum Machine Intelligence
Verified
Journal Article
Open access
PDF file
SESebastian Egginger
Sebastian Egginger
ASAlona Sakhnenko
Alona Sakhnenko
JLJeanette Miriam Lorenz
Jeanette Miriam Lorenz
Quantum kernel methods are a promising method in quantum machine learning thanks to the guarantees connected to them. Their accessibility for analytic considerations also opens up the possibility of prescreening datasets based on their potential for a quantum advantage. To do so, earlier works developed the geometric difference, which can be understood as a closeness measure between two kernel-based machine learning approaches, most importantly between a quantum kernel and a classical kernel. This metric links the quantum and classical model complexities, and it was developed to bound generalization error. Therefore, it raises the question of how this metric behaves in an empirical setting. In this work, we investigate the effects of hyperparameter choice on the model performance and the generalization gap between classical and quantum kernels. The importance of hyperparameters is well known also for classical machine learning. Of special interest are hyperparameters associated with the quantum Hamiltonian evolution feature map, as well as the number of qubits to trace out before computing a projected quantum kernel. We conduct a thorough investigation of the hyperparameters across 11 datasets, and we identify certain aspects that can be exploited. Analyzing the effects of certain hyperparameter settings on the empirical performance, as measured by cross validation accuracy, and generalization ability, as measured by geometric difference described above, brings us one step closer to understanding the potential of quantum kernel methods on classical datasets.

9 October 2026 in Physical Review Letters
Verified
Journal Article
Open access
EPElias Pescoller
Elias Pescoller
SBSantiago Beltrán-Romero
Santiago Beltrán-Romero
SESebastian Egginger
Sebastian Egginger
NJNicolas Jungwirth
Nicolas Jungwirth
MZMartino Zanetti
Martino Zanetti
PSPhilipp Schindler
Philipp Schindler
Freely propagating electrons may serve as quantum probes that can become coherently correlated with other quantum systems, offering access to advanced metrological resources. We propose a setup that coherently couples free electrons in an electron microscope to a trapped-ion quantum processor, enabling nondestructive, quantum-coherent detection and the accumulation of information across multiple electrons. Our analysis shows that single electrons can induce resolvable qubit excitations, establishing a platform for practical applications such as quantum-enhanced, dose-efficient electron microscopy.

15 October 2025 in arXiv
Verified
Preprint
Open access
PDF file
SESebastian Egginger
Sebastian Egginger
KKKristina Kirova
Kristina Kirova
SBSonja Bruckner
Sonja Bruckner
SHStefan Hillmich
Stefan Hillmich
RKRichard Kueng
Richard Kueng
The prospect of quantum solutions for complicated optimization problems is contingent on mapping the original problem onto a tractable quantum energy landscape, e.g. an Ising-type Hamiltonian. Subsequently, techniques like adiabatic optimization, quantum annealing, and the Quantum Approximate Optimization Algorithm (QAOA) can be used to find the ground state of this Hamiltonian. Quadratic Unconstrained Binary Optimization (QUBO) is one prominent problem class for which this entire pipeline is well understood and has received considerable attention over the past years. In this work, we provide novel, tractable mappings for the maxima of multiple QUBO problems. Termed Multi-Objective Quantum Approximations, or MOQA for short, our framework allows us to recast new types of classical binary optimization problems as ground state problems of a tractable Ising-type Hamiltonian. This, in turn, opens the possibility of new quantum- and quantum-inspired solutions to a variety of problems that frequently occur in practical applications. In particular, MOQA can handle various types of routing and partitioning problems, as well as inequality-constrained binary optimization problems.