COChristian Offen

Christian Offen

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Christian Offen has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Numerical approaches to entangling dynamics from variational principles

    by Christian Offen, Boris Wembe, Laura Ares, Jan Sperling, Sina Ober-Blöbaum

    In this work, we address the numerical identification of entanglement in dynamical scenarios. To this end, we consider different programs based on the restriction of the evolution to the set of separable (i.e., non-entangled) states, together with the discretization of the space of variables for numerical computations. As a first approach, we apply linear splitting methods to the restricted, continuous equations of motion derived from variational principles. We utilize an exchange interaction Hamiltonian to confirm that the numerical and analytical solutions coincide in the limit of small time steps. The application to different Hamiltonians shows the wide applicability of the method to detect dynamical entanglement. To avoid the derivation of analytical solutions for complex dynamics, we consider variational, numerical integration schemes, introducing a variational discretization for Lagrangians linear in velocities. Here, we examine and compare two approaches: one in which the system is discretized before the restriction is applied, and another in which the restriction precedes the discretization. We find that the "first-discretize-then-restrict" method becomes numerically unstable, already for the example of an exchange-interaction Hamiltonian, which can be an important consideration for the numerical analysis of constrained quantum dynamics. Thereby, broadly applicable numerical tools, including their limitations, for studying entanglement over time are established for assessing the entangling power of processes that are used in quantum information theory.


  • Open Access

    Multiphoton, multimode state classification for nonlinear optical circuits

    by Denis A. Kopylov, Christian Offen, Laura Ares, Boris Wembe, Sina Ober-Blöbaum, Torsten Meier, Polina R. Sharapova, Jan Sperling

    We introduce a new classification of multimode states with a fixed number of photons. This classification is based on the factorizability of homogeneous multivariate polynomials and is invariant under unitary transformations. The classes physically correspond to field excitations in terms of single and multiple photons, each of which is in an arbitrary irreducible superposition of quantized modes. We further show how the transitions between classes are rendered possible by photon addition, photon subtraction, and photon-projection nonlinearities. We explicitly put forward a design for a multilayer interferometer in which the states for different classes can be generated with state-of-the-art experimental techniques. Limitations of the proposed designs are analyzed using the introduced classification, providing a benchmark for the robustness of certain states and classes. Published by the American Physical Society 2025


  • Open Access

    Machine learning of discrete field theories with guaranteed convergence and uncertainty quantification

    by Christian Offen

    We introduce a method based on Gaussian process regression to identify discrete variational principles from observed solutions of a field theory. The method is based on the data-based identification of a discrete Lagrangian density. It is a geometric machine learning technique in the sense that the variational structure of the true field theory is reflected in the data-driven model by design. We provide a rigorous convergence statement of the method. The proof circumvents challenges posed by the ambiguity of discrete Lagrangian densities in the inverse problem of variational calculus. Moreover, our method can be used to quantify model uncertainty in the equations of motions and any linear observable of the discrete field theory. This is illustrated on the example of the discrete wave equation and Schrödinger equation. The article constitutes an extension of our previous article arXiv:2404.19626 for the data-driven identification of (discrete) Lagrangians for variational dynamics from an ode setting to the setting of discrete pdes.

  • Learning of discrete models of variational PDEs from data

    by Christian Offen, Sina Ober-Blöbaum

    We show how to learn discrete field theories from observational data of fields on a space–time lattice. For this, we train a neural network model of a discrete Lagrangian density such that the discrete Euler–Lagrange equations are consistent with the given training data. We, thus, obtain a structure-preserving machine learning architecture. Lagrangian densities are not uniquely defined by the solutions of a field theory. We introduce a technique to derive regularizers for the training process which optimize numerical regularity of the discrete field theory. Minimization of the regularizers guarantees that close to the training data the discrete field theory behaves robust and efficient when used in numerical simulations. Further, we show how to identify structurally simple solutions of the underlying continuous field theory such as traveling waves. This is possible even when traveling waves are not present in the training data. This is compared to data-driven model order reduction based approaches, which struggle to identify suitable latent spaces containing structurally simple solutions when these are not present in the training data. Ideas are demonstrated on examples based on the wave equation and the Schrödinger equation.


  • Open Access

    Learning discrete Lagrangians for variational PDEs from data and detection of travelling waves

    by Christian Offen, Sina Ober-Blöbaum

    The article shows how to learn models of dynamical systems from data which are governed by an unknown variational PDE. Rather than employing reduction techniques, we learn a discrete field theory governed by a discrete Lagrangian density $L_d$ that is modelled as a neural network. Careful regularisation of the loss function for training $L_d$ is necessary to obtain a field theory that is suitable for numerical computations: we derive a regularisation term which optimises the solvability of the discrete Euler--Lagrange equations. Secondly, we develop a method to find solutions to machine learned discrete field theories which constitute travelling waves of the underlying continuous PDE.

  • Open Access

    Hamiltonian neural networks with automatic symmetry detection

    by Eva Dierkes, Christian Offen, Sina Ober-Blöbaum, Kathrin Flaßkamp

    Recently, Hamiltonian neural networks (HNNs) have been introduced to incorporate prior physical knowledge when learning the dynamical equations of Hamiltonian systems. Hereby, the symplectic system structure is preserved despite the data-driven modeling approach. However, preserving symmetries requires additional attention. In this research, we enhance HNN with a Lie algebra framework to detect and embed symmetries in the neural network. This approach allows us to simultaneously learn the symmetry group action and the total energy of the system. As illustrating examples, a pendulum on a cart and a two-body problem from astrodynamics are considered.


  • Efficient Time-Stepping for Numerical Integration Using Reinforcement Learning

    by Michael Dellnitz, Eyke Hüllermeier, Marvin Lücke, Sina Ober-Blöbaum, Christian Offen, Sebastian Peitz, Karlson Pfannschmidt

    Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it results in prohibitively large errors or computational effort. To this end, adaptive schemes, such as solvers based on Runge–Kutta pairs, have been developed which adapt the step size based on local error estimations at each step. While the classical schemes apply very generally and are highly efficient on regular systems, they can behave suboptimally when an inefficient step rejection mechanism is triggered by structurally complex systems such as chaotic systems. To overcome these issues, we propose a method to tailor numerical schemes to the problem class at hand. This is achieved by combining simple, classical quadrature rules or ODE solvers with data-driven time-stepping controllers. Compared with learning solution operators to ODEs directly, it generalizes better to unseen initial data as our approach employs classical numerical schemes as base methods. At the same time it can make use of identified structures of a problem class and, therefore, outperforms state-of-the-art adaptive schemes. Several examples demonstrate superior efficiency. Source code is available at https://github.com/lueckem/quadrature-ML .


  • Open Access

    Backward error analysis for conjugate symplectic methods

    by Robert I McLachlan, Christian Offen

    The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward error analysis. If the original and modified equation share structural properties, then the exact and approximate solution share geometric features such as the existence of conserved quantities. Conjugate symplectic methods preserve a modified symplectic form and a modified Hamiltonian when applied to a Hamiltonian system. We show how a blended version of variational and symplectic techniques can be used to compute modified symplectic and Hamiltonian structures. In contrast to other approaches, our backward error analysis method does not rely on an ansatz but computes the structures systematically, provided that a variational formulation of the method is known. The technique is illustrated on the example of symmetric linear multistep methods with matrix coefficients.