@inproceedings{65474,
  author       = {{Rook, Jeroen and López-Ibáñez, Manuel}},
  booktitle    = {{Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2025, NH Malaga Hotel, Malaga, Spain, July 14-18, 2025}},
  editor       = {{Filipic, Bogdan}},
  pages        = {{1617–1642}},
  publisher    = {{ACM}},
  title        = {{{Advanced Use of Automatic Algorithm Configuration: Single- and Multi-Objective Approaches}}},
  doi          = {{10.1145/3712255.3716537}},
  year         = {{2025}},
}

@inproceedings{59895,
  abstract     = {{The generation of optically broadband Nyquist pulse sequences using an integrated Mach-Zehnder modulator (MZM) in a thin-film lithium-niobate (TFLN) platform with repetition rates of 5 to 32 GHz and optical bandwidths of up to 160 GHz is demonstrated. Nyquist pulse sequences with high optical bandwidth can be used as synchronization and control signals in quantum sources based on photon pair generation.}},
  author       = {{Kress, Christian and Mihaylov, Martin Miroslavov and Schwabe, Tobias and Silberhorn, Christine and Scheytt, J. Christoph}},
  booktitle    = {{PIERS Proceedings }},
  location     = {{Abu Dhabi}},
  publisher    = {{PhotonIcs and Electromagnetics Research Symposium (PIERS)}},
  title        = {{{Broadband Nyquist Pulse Generation on TFLN Platform for Integrated Quantum Source}}},
  doi          = {{10.1109/PIERS-Spring66516.2025.11276835}},
  year         = {{2025}},
}

@unpublished{61778,
  abstract     = {{Understanding the entanglement structure of local Hamiltonian ground spaces
is a physically motivated problem, with applications ranging from tensor
network design to quantum error-correcting codes. To this end, we study the
complexity of estimating ground state entanglement, and more generally entropy
estimation for low energy states and Gibbs states. We find, in particular, that
the classes qq-QAM [Kobayashi, le Gall, Nishimura, SICOMP 2019] (a quantum
analogue of public-coin AM) and QMA(2) (QMA with unentangled proofs) play a
crucial role for such problems, showing: (1) Detecting a high-entanglement
ground state is qq-QAM-complete, (2) computing an additive error approximation
to the Helmholtz free energy (equivalently, a multiplicative error
approximation to the partition function) is in qq-QAM, (3) detecting a
low-entanglement ground state is QMA(2)-hard, and (4) detecting low energy
states which are close to product states can range from QMA-complete to
QMA(2)-complete. Our results make progress on an open question of [Bravyi,
Chowdhury, Gosset and Wocjan, Nature Physics 2022] on free energy, and yield
the first QMA(2)-complete Hamiltonian problem using local Hamiltonians (cf. the
sparse QMA(2)-complete Hamiltonian problem of [Chailloux, Sattath, CCC 2012]).}},
  author       = {{Gharibian, Sevag and Kamminga, Jonas}},
  booktitle    = {{arXiv:2510.06796}},
  title        = {{{On the complexity of estimating ground state entanglement and free  energy}}},
  year         = {{2025}},
}

@inproceedings{62108,
  author       = {{Luchterhandt, Lars and Govindasamy, Vivek and Wang, Yutong and Scheytt, Christoph and Mueller, Wolfgang and Dömer, Rainer}},
  booktitle    = {{2025 Forum on Specification & Design Languages (FDL)}},
  publisher    = {{IEEE}},
  title        = {{{A Quantitative Guide to Navigate Speed/Accuracy Tradeoffs in System Level Design of RISC-V Processor Grids}}},
  doi          = {{10.1109/fdl68117.2025.11165408}},
  year         = {{2025}},
}

@inproceedings{65618,
  author       = {{Bröker, Mika and Menzel, Johannes and Plessl, Christian}},
  booktitle    = {{Proceedings of the 15th International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies}},
  publisher    = {{ACM}},
  title        = {{{Evaluating the Strong Scaling Potential of AI Engines for Molecular Dynamics Simulations}}},
  doi          = {{10.1145/3728179.3728187}},
  year         = {{2025}},
}

@inproceedings{50272,
  abstract     = {{Despite the fundamental role the Quantum Satisfiability (QSAT) problem has
played in quantum complexity theory, a central question remains open: At which
local dimension does the complexity of QSAT transition from "easy" to "hard"?
Here, we study QSAT with each constraint acting on a $k$-dimensional and
$l$-dimensional qudit pair, denoted $(k,l)$-QSAT. Our first main result shows
that, surprisingly, QSAT on qubits can remain $\mathsf{QMA}_1$-hard, in that
$(2,5)$-QSAT is $\mathsf{QMA}_1$-complete. In contrast, $2$-SAT on qubits is
well-known to be poly-time solvable [Bravyi, 2006]. Our second main result
proves that $(3,d)$-QSAT on the 1D line with $d\in O(1)$ is also
$\mathsf{QMA}_1$-hard. Finally, we initiate the study of 1D $(2,d)$-QSAT by
giving a frustration-free 1D Hamiltonian with a unique, entangled ground state.
  Our first result uses a direct embedding, combining a novel clock
construction with the 2D circuit-to-Hamiltonian construction of [Gosset, Nagaj,
2013]. Of note is a new simplified and analytic proof for the latter (as
opposed to a partially numeric proof in [GN13]). This exploits Unitary Labelled
Graphs [Bausch, Cubitt, Ozols, 2017] together with a new "Nullspace Connection
Lemma", allowing us to break low energy analyses into small patches of
projectors, and to improve the soundness analysis of [GN13] from
$\Omega(1/T^6)$ to $\Omega(1/T^2)$, for $T$ the number of gates. Our second
result goes via black-box reduction: Given an arbitrary 1D Hamiltonian $H$ on
$d'$-dimensional qudits, we show how to embed it into an effective null-space
of a 1D $(3,d)$-QSAT instance, for $d\in O(1)$. Our approach may be viewed as a
weaker notion of "simulation" (\`a la [Bravyi, Hastings 2017], [Cubitt,
Montanaro, Piddock 2018]). As far as we are aware, this gives the first
"black-box simulation"-based $\mathsf{QMA}_1$-hardness result, i.e. for
frustration-free Hamiltonians.}},
  author       = {{Rudolph, Dorian and Gharibian, Sevag and Nagaj, Daniel}},
  booktitle    = {{16th Innovations in Theoretical Computer Science (ITCS)}},
  number       = {{85}},
  pages        = {{1--24}},
  title        = {{{Quantum 2-SAT on low dimensional systems is $\mathsf{QMA}_1$-complete:  Direct embeddings and black-box simulation}}},
  doi          = {{10.4230/LIPIcs.ITCS.2025.85}},
  volume       = {{325}},
  year         = {{2025}},
}

@article{55037,
  abstract     = {{Estimating ground state energies of many-body Hamiltonians is a central task
in many areas of quantum physics. In this work, we give quantum algorithms
which, given any $k$-body Hamiltonian $H$, compute an estimate for the ground
state energy and prepare a quantum state achieving said energy, respectively.
Specifically, for any $\varepsilon>0$, our algorithms return, with high
probability, an estimate of the ground state energy of $H$ within additive
error $\varepsilon M$, or a quantum state with the corresponding energy. Here,
$M$ is the total strength of all interaction terms, which in general is
extensive in the system size. Our approach makes no assumptions about the
geometry or spatial locality of interaction terms of the input Hamiltonian and
thus handles even long-range or all-to-all interactions, such as in quantum
chemistry, where lattice-based techniques break down. In this fully general
setting, the runtime of our algorithms scales as $2^{cn/2}$ for $c<1$, yielding
the first quantum algorithms for low-energy estimation breaking the natural
bound based on Grover search. The core of our approach is remarkably simple,
and relies on showing that any $k$-body Hamiltonian has a low-energy subspace
of exponential dimension.}},
  author       = {{Buhrman, Harry and Gharibian, Sevag and Landau, Zeph and Gall, François Le and Schuch, Norbert and Tamaki, Suguru}},
  journal      = {{Physical Review Letters}},
  pages        = {{030601}},
  title        = {{{Beating Grover search for low-energy estimation and state preparation}}},
  doi          = {{10.1103/29qw-bssx}},
  volume       = {{135}},
  year         = {{2025}},
}

@unpublished{61776,
  abstract     = {{We investigate the role of energy, i.e. average photon number, as a resource
in the computational complexity of bosonic systems. We show three sets of
results: (1. Energy growth rates) There exist bosonic gate sets which increase
energy incredibly rapidly, obtaining e.g. infinite energy in finite/constant
time. We prove these high energies can make computing properties of bosonic
computations, such as deciding whether a given computation will attain infinite
energy, extremely difficult, formally undecidable. (2. Lower bounds on
computational power) More energy ``='' more computational power. For example,
certain gate sets allow poly-time bosonic computations to simulate PTOWER, the
set of deterministic computations whose runtime scales as a tower of
exponentials with polynomial height. Even just exponential energy and $O(1)$
modes suffice to simulate NP, which, importantly, is a setup similar to that of
the recent bosonic factoring algorithm of [Brenner, Caha, Coiteux-Roy and
Koenig (2024)]. For simpler gate sets, we show an energy hierarchy theorem. (3.
Upper bounds on computational power) Bosonic computations with polynomial
energy can be simulated in BQP, ``physical'' bosonic computations with
arbitrary finite energy are decidable, and the gate set consisting of Gaussian
gates and the cubic phase gate can be simulated in PP, with exponential bound
on energy, improving upon the previous PSPACE upper bound. Finally, combining
upper and lower bounds yields no-go theorems for a continuous-variable
Solovay--Kitaev theorem for gate sets such as the Gaussian and cubic phase
gates.}},
  author       = {{Chabaud, Ulysse and Gharibian, Sevag and Mehraban, Saeed and Motamedi, Arsalan and Naeij, Hamid Reza and Rudolph, Dorian and Sambrani, Dhruva}},
  booktitle    = {{arXiv:2510.08545}},
  title        = {{{Energy, Bosons and Computational Complexity}}},
  year         = {{2025}},
}

@unpublished{60432,
  abstract     = {{The Quantum k-SAT problem is the quantum generalization of the k-SAT problem.
It is the problem whether a given local Hamiltonian is frustration-free.
Frustration-free means that the ground state of the k-local Hamiltonian
minimizes the energy of every local interaction term simultaneously. This is a
central question in quantum physics and a canonical QMA_1-complete problem. The
Quantum k-SAT problem is not as well studied as the classical k-SAT problem in
terms of special tractable cases, approximation algorithms and parameterized
complexity. In this paper, we will give a graph-theoretic study of the Quantum
k-SAT problem with the structures core and radius. These hypergraph structures
are important to solve the Quantum k-SAT problem. We can solve a Quantum k-SAT
instance in polynomial time if the derived hypergraph has a core of size n-m+a,
where a is a constant, and the radius is at most logarithmic. If it exists, we
can find a core of size n-m+a with the best possible radius in polynomial time,
whereas finding a general minimum core with minimal radius is NP-hard.}},
  author       = {{Kremer, Simon-Luca and Rudolph, Dorian and Gharibian, Sevag}},
  booktitle    = {{arXiv:2506.17066}},
  title        = {{{Quantum k-SAT Related Hypergraph Problems}}},
  year         = {{2025}},
}

@article{63440,
  author       = {{Moritzer, Elmar and Brandes, Philipp and Westphal, Max Siegfried and Claes, Leander and Wippermann, Mareen and Düchting, Julia and Henning, Bernd}},
  journal      = {{WAK Jahresmagazin}},
  keywords     = {{Faser-Kunststoff-Verbunde (FKV), Faserverstärkte Kunststoffe (FVK), Organobleche, Ultraschall}},
  pages        = {{26–29}},
  title        = {{{Zerstörungsfreie Ultraschall-Prüfung von Organoblechen}}},
  volume       = {{2025}},
  year         = {{2025}},
}

@inproceedings{61256,
  author       = {{Illian, Marvin and Luchterhandt, Björn and Wang, Lin}},
  booktitle    = {{Proceedings of the 20th Workshop on Mobility in the Evolving Internet Architecture (MobiArch)}},
  location     = {{Hong Kong, China}},
  title        = {{{Band Switching for Mobile Energy Optimization in 5G Networks and Beyond}}},
  doi          = {{10.1145/3737897.3767294}},
  year         = {{2025}},
}

@article{59531,
  author       = {{Ahmadi, Mehdi and Knorr, Lukas and Meschede, Henning}},
  issn         = {{0960-1481}},
  journal      = {{Renewable Energy}},
  publisher    = {{Elsevier BV}},
  title        = {{{Improvement of Wind Power Utilization Through Flexible Operation of Data Center in Wind Parks}}},
  doi          = {{10.1016/j.renene.2025.123073}},
  year         = {{2025}},
}

@inproceedings{65663,
  author       = {{Prina, Matteo Giacomo and Knorr, Lukas and Schlosser, Florian and Meschede, Henning and Misconel Schreiber, Steffi and Manepace, Andrea and Sparber, Wolfram}},
  location     = {{Dubrovnik}},
  publisher    = {{SDEWES}},
  title        = {{{Graph Neural Network Surrogates for Uncertainty Quantification in Multi-Node Energy System modeling}}},
  year         = {{2025}},
}

@article{65657,
  author       = {{Hoffmann, Jan Sören and Stoppel, Hans-Jürgen}},
  journal      = {{mathematik lehren}},
  number       = {{253}},
  pages        = {{8--12}},
  title        = {{{Das Sieb des Eratosthenes}}},
  year         = {{2025}},
}

@article{65713,
  author       = {{Stoppel, Hans-Jürgen and Plangg, Simon and Büscher, Carina}},
  journal      = {{mathemathik lehren}},
  number       = {{253}},
  pages        = {{2--7}},
  publisher    = {{Friedrich Verlag}},
  title        = {{{Mathematik weiterdenken - Wie informatisches Denken die Mathematik stärkt}}},
  year         = {{2025}},
}

@inproceedings{65734,
  author       = {{Kamdem Teyou, Louis Mozart and Friedrichs, Luke and Kouagou, N'Dah Jean and Demir, Caglar and Mahmood, Yasir and Heindorf, Stefan and Ngonga Ngomo, Axel-Cyrille}},
  location     = {{Dayton-USA}},
  title        = {{{Neural Reasoning for Robust Instance Retrieval in SHOIQ}}},
  doi          = {{https://doi.org/10.1145/3731443.377134}},
  year         = {{2025}},
}

@inproceedings{62297,
  author       = {{Hölscher, Jonas and Friesen, Olga and Claes, Leander and Spieker, Carsten and Förstner, Jens and Henning, Bernd}},
  booktitle    = {{2025 International Congress on Ultrasonics}},
  keywords     = {{tet_topic_piezo}},
  pages        = {{130–133}},
  publisher    = {{AMA Service GmbH}},
  title        = {{{Multiscale thermo-piezoelectric simulations using the finite element method}}},
  doi          = {{10.5162/ultrasonic2025/a18-a2}},
  year         = {{2025}},
}

@inproceedings{62296,
  author       = {{Spieker, Carsten and Förstner, Jens and Hölscher, Jonas and Claes, Leander and Henning, Bernd}},
  booktitle    = {{2025 International Congress on Ultrasonics}},
  keywords     = {{tet_topic_piezo}},
  pages        = {{126–129}},
  publisher    = {{AMA Service GmbH}},
  title        = {{{Modeling and simulation of the behavior of piezoceramics with the discontinuous Galerkin method}}},
  doi          = {{10.5162/ultrasonic2025/a18-a1}},
  year         = {{2025}},
}

@inproceedings{61986,
  author       = {{Rasor, Anja and Vehmeyer, Julia Marie and Kirchberg, Lisa and Scholtysik, Michel and Koldewey, Christian and Dumitrescu, Roman}},
  booktitle    = {{Procedia CIRP}},
  issn         = {{2212-8271}},
  pages        = {{972--977}},
  publisher    = {{Elsevier BV}},
  title        = {{{Key performance indicator system for evaluating the circular economy along the value chain}}},
  doi          = {{10.1016/j.procir.2025.01.084}},
  volume       = {{135}},
  year         = {{2025}},
}

@inproceedings{61955,
  author       = {{Koldewey, Christian and Rohde, Malte Nick and Strobel, Gero and Vehmeyer, Julia Marie and Fichtler, Timm and Dumitrescu, Roman}},
  booktitle    = {{2025 IEEE International Conference on Engineering, Technology, and Innovation (ICE/ITMC)}},
  publisher    = {{IEEE}},
  title        = {{{Embedding Generative AI into Products – 10 Design Principles for Building Intelligent Systems}}},
  doi          = {{10.1109/ice/itmc65658.2025.11106522}},
  year         = {{2025}},
}