Christian Bauckhage
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Christian Bauckhage has a total of 292 co-authors. Here are the top co-authors by number of shared publications:
Christian Thurau
The Unbelievable Machine Company, Berlin, Germany
28 shared publications- Rafet Sifa
Fraunhofer Institute for Intelligent Analysis and Information Systems IAIS
22 shared publications Kristian Kersting
TU Darmstadt
20 shared publicationsRafet Sifa
14 shared publications- Tansu Alpcan
University of Melbourne
14 shared publications - Anders Drachen
SDU Metaverse Lab, University of Southern Denmark, Odense, Denmark
10 shared publications
Latest Publications
- 1 April 2026
- Published by Scientific Societies in Phytopathology®
- Vol. 116 (4) , 561-578
Hybrid Modeling of Cercospora Leaf Spot Epidemiology: Integrating Mechanistic and Machine Learning Approaches Using Remote-Sensing and Environmental Data
Despite advances in modeling and sensing, no study has previously integrated mechanistic, meteorological, and uncrewed aerial vehicle (UAV) data into a unified predictive framework for Cercospora leaf spot. From 2020 to 2022, field trials with a susceptible variety under contrasting fungicide regimes and artificial inoculation were monitored for disease severity, airborne inoculum, and yield. Significant treatment differences emerged 44 days after sowing, with incubation lasting 7 to 12 days and spore peaks occurring from day 77, preceding rapid severity increases. Dissemination showed no prevailing direction but was favored by light, variable winds under conducive microclimates. Yield loss reached up to 0.0123 kg root fresh weight per plant per severity point, and both yield and sugar content decreased with earlier onset and higher final severity. Hybrid models were implemented at multiple levels, integrating multisource data. Severity was best predicted by climatic variables with UAV spectral–structural indices; fructification by humidity–temperature thresholds with stress traits; dissemination by wind-variability metrics with sporulation indicators; and yield and sugar content by UAV indices supplemented with mechanistic covariates. High-level hybridization reduced the root mean square error to 0.615 (on a 0 to 10 severity scale), 0.067 ng of Cercospora beticola DNA for actual spores, 2.033 ng for cumulative spores, 1.769° for dissemination direction, 0.015 ng day −1 for dissemination magnitude, 0.235% for sugar content, and 0.051 kg plant −1 for root fresh weight, achieving up to a 39% improvement over lower-level configurations. These results enhance disease prediction, improve the understanding of disease epidemiology, and could support more effective plant disease management. [ ] Copyright © 2026 The Author(s). This is an open access article distributed under the CC BY 4.0 International license .
- 1 April 2026
- Published by Scientific Societies in Phytopathology®
- Vol. 116 (4) , 561-578
Hybrid Modeling of Cercospora Leaf Spot Epidemiology: Integrating Mechanistic and Machine Learning Approaches Using Remote-Sensing and Environmental Data
Despite advances in modeling and sensing, no study has previously integrated mechanistic, meteorological, and uncrewed aerial vehicle (UAV) data into a unified predictive framework for Cercospora leaf spot. From 2020 to 2022, field trials with a susceptible variety under contrasting fungicide regimes and artificial inoculation were monitored for disease severity, airborne inoculum, and yield. Significant treatment differences emerged 44 days after sowing, with incubation lasting 7 to 12 days and spore peaks occurring from day 77, preceding rapid severity increases. Dissemination showed no prevailing direction but was favored by light, variable winds under conducive microclimates. Yield loss reached up to 0.0123 kg root fresh weight per plant per severity point, and both yield and sugar content decreased with earlier onset and higher final severity. Hybrid models were implemented at multiple levels, integrating multisource data. Severity was best predicted by climatic variables with UAV spectral–structural indices; fructification by humidity–temperature thresholds with stress traits; dissemination by wind-variability metrics with sporulation indicators; and yield and sugar content by UAV indices supplemented with mechanistic covariates. High-level hybridization reduced the root mean square error to 0.615 (on a 0 to 10 severity scale), 0.067 ng of Cercospora beticola DNA for actual spores, 2.033 ng for cumulative spores, 1.769° for dissemination direction, 0.015 ng day −1 for dissemination magnitude, 0.235% for sugar content, and 0.051 kg plant −1 for root fresh weight, achieving up to a 39% improvement over lower-level configurations. These results enhance disease prediction, improve the understanding of disease epidemiology, and could support more effective plant disease management. [ ] Copyright © 2026 The Author(s). This is an open access article distributed under the CC BY 4.0 International license .
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 225-252
Exploring Quantum Weirdness
In this chapter, we familiarize ourselves with certain aspects of quantum weirdness, namely energy quantization, quantum tunneling, and quantum superposition. To this end, we consider three didactic examples of quantum systems, solve the respective scenario specific Schrödinger equations, and (mathematically and graphically) analyze and interpret the results we obtain therefrom. Despite of the utter simplicity of our scenarios, two of them already defy analytic solutions. Since this is not uncommon when trying to solve Schrödinger equations for specific settings, we also discuss simple numerical methods for Schrödinger equation solving and present code examples which implement those.
- 18 November 2025
- Published by Springer Nature
- p. 225-252
Open AccessExploring Quantum Weirdness
In this chapter, we familiarize ourselves with certain aspects of quantum weirdness, namely energy quantization, quantum tunneling, and quantum superposition. To this end, we consider three didactic examples of quantum systems, solve the respective scenario specific Schrödinger equations, and (mathematically and graphically) analyze and interpret the results we obtain therefrom. Despite of the utter simplicity of our scenarios, two of them already defy analytic solutions. Since this is not uncommon when trying to solve Schrödinger equations for specific settings, we also discuss simple numerical methods for Schrödinger equation solving and present code examples which implement those.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 203-223
Quantum Mechanics in a Nutshell
With this chapter, we begin to transit from digital information processing to quantum information processing. However, to be able to master this transition, we first need to familiarize ourselves with quantum mechanical principles and the mathematics used to describe them. Since we already know about abstract state spaces, tensor products, and Hamiltonian operators and their eigenvectors and eigenvalues, this should not be too difficult or too alien. And yet, there remain a few challenges: Mathematical descriptions of quantum states usually involve the Dirac notation, require complex linear algebra in high dimensional spaces, and encode unintuitive probabilistic interpretations. Rising to these challenges, we briefly study the notion of Hilbert spaces, introduce the Dirac notation, and discuss the axioms of quantum mechanics and some of their consequences. All this will admittedly be dense and abstract but prepare us for everything that is still to follow. Our main goal is to emphasize that quantum mechanics and therefore quantum computing is just complex linear algebra in very high dimensional spaces so that quantum computing needs a different kind of thinking than we are used to in digital computing.
- 18 November 2025
- Published by Springer Nature
- p. 203-223
Open AccessQuantum Mechanics in a Nutshell
With this chapter, we begin to transit from digital information processing to quantum information processing. However, to be able to master this transition, we first need to familiarize ourselves with quantum mechanical principles and the mathematics used to describe them. Since we already know about abstract state spaces, tensor products, and Hamiltonian operators and their eigenvectors and eigenvalues, this should not be too difficult or too alien. And yet, there remain a few challenges: Mathematical descriptions of quantum states usually involve the Dirac notation, require complex linear algebra in high dimensional spaces, and encode unintuitive probabilistic interpretations. Rising to these challenges, we briefly study the notion of Hilbert spaces, introduce the Dirac notation, and discuss the axioms of quantum mechanics and some of their consequences. All this will admittedly be dense and abstract but prepare us for everything that is still to follow. Our main goal is to emphasize that quantum mechanics and therefore quantum computing is just complex linear algebra in very high dimensional spaces so that quantum computing needs a different kind of thinking than we are used to in digital computing.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 55-72
Kronecker Products
Tensor products or, more specifically, Kronecker products play a fundamental role in quantum computing and can also help with modeling certain combinatorial problems. In this chapter, we therefore discuss Kronecker products and their properties. To segue into this discussion, we first introduce the important notion of pseudo Boolean functions and look at their relations to multilinear algebra. Given this use case, we can easily understand the role of different kinds of tensor products and investigate algebraic properties especially of Kronecker products.
- 18 November 2025
- Published by Springer Nature
- p. 55-72
Open AccessKronecker Products
Tensor products or, more specifically, Kronecker products play a fundamental role in quantum computing and can also help with modeling certain combinatorial problems. In this chapter, we therefore discuss Kronecker products and their properties. To segue into this discussion, we first introduce the important notion of pseudo Boolean functions and look at their relations to multilinear algebra. Given this use case, we can easily understand the role of different kinds of tensor products and investigate algebraic properties especially of Kronecker products.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 183-200
Hopfield Nets and Quantum Mechanics
Previously, we viewed Hopfield nets from the point of view of statistical mechanics. In this chapter, we widen our perspective one again and view them from the point of view of quantum mechanics. This requires us to introduce completely different representations of the states and energy functions of Hopfield nets and relate them to the kind of tensor product spaces we studied earlier. At this point, this different perspective on Hopfield nets is of purely theoretical interest because it generally defies practical implementations on digital computers. However, it establishes a connection between Hopfield nets and important quantum mechanical concepts. In particular, we will get to know the notion of the Hamiltonian of a physical system, its eigenstates, and eigenvalues. Since the material in this chapter is more abstract and less intuitive than in previous chapters, we develop our ideas by looking at an exemplary simple Hopfield net and support our technical claims through practical computations and code examples.
- 18 November 2025
- Published by Springer Nature
- p. 183-200
Open AccessHopfield Nets and Quantum Mechanics
Previously, we viewed Hopfield nets from the point of view of statistical mechanics. In this chapter, we widen our perspective one again and view them from the point of view of quantum mechanics. This requires us to introduce completely different representations of the states and energy functions of Hopfield nets and relate them to the kind of tensor product spaces we studied earlier. At this point, this different perspective on Hopfield nets is of purely theoretical interest because it generally defies practical implementations on digital computers. However, it establishes a connection between Hopfield nets and important quantum mechanical concepts. In particular, we will get to know the notion of the Hamiltonian of a physical system, its eigenstates, and eigenvalues. Since the material in this chapter is more abstract and less intuitive than in previous chapters, we develop our ideas by looking at an exemplary simple Hopfield net and support our technical claims through practical computations and code examples.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 93-117
QUBO Models
Having previously studied general aspects of QUBO models, we now study application specific examples and how to derive or set them up. Our application examples will consider problems in areas like combinatorial optimization, constraint satisfaction, data mining, and machine learning and are supposed to illustrate that QUBOs provide us with a surprisingly versatile and widely applicable modeling framework. Put differently, our overall goal with this chapter is to demonstrate how to rethink familiar, seemingly unrelated problems in terms of an overarching formalism that will later allow for running Hopfield nets and quantum implementations. This will largely be an exercise in applied linear algebra since we will extensively work with matrix-vector formulations of QUBOs for which we will point out and discuss simplifying modeling assumptions whenever necessary.
- 18 November 2025
- Published by Springer Nature
- p. 93-117
Open AccessQUBO Models
Having previously studied general aspects of QUBO models, we now study application specific examples and how to derive or set them up. Our application examples will consider problems in areas like combinatorial optimization, constraint satisfaction, data mining, and machine learning and are supposed to illustrate that QUBOs provide us with a surprisingly versatile and widely applicable modeling framework. Put differently, our overall goal with this chapter is to demonstrate how to rethink familiar, seemingly unrelated problems in terms of an overarching formalism that will later allow for running Hopfield nets and quantum implementations. This will largely be an exercise in applied linear algebra since we will extensively work with matrix-vector formulations of QUBOs for which we will point out and discuss simplifying modeling assumptions whenever necessary.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 277-296
An Outlook to Quantum Gate Computing
Having spent almost an entire book on working out that Hopfield nets and adiabatic quantum computing are closely related concepts, this chapter departs from our main story line of problem solving as energy minimization and concludes our study with an outlook to the possibilities of quantum gate computing. Indeed, the central ideas behind quantum gate computing differ from most of what we studied so far but our study still has us prepared for getting to grips with the basics of this paradigm. As this paradigm posits that quantum algorithms are sequences of unitary operators which each act on the joint state of a qubit system, we will look at the circuit model of quantum computing and see that quantum circuits consist of quantum gates which are interconnected by quantum wires where the latter represent the states of qubits on which the former perform unitary operations. As a practical example, we discuss how such circuits could compute univariate Boolean functions. This then seamlessly allows us to finally study Deutsch’s problem and algorithm and therefore to see an instance of a computational problem for which quantum computing algorithms can be exponentially faster than their classical counterparts.
- 18 November 2025
- Published by Springer Nature
- p. 277-296
Open AccessAn Outlook to Quantum Gate Computing
Having spent almost an entire book on working out that Hopfield nets and adiabatic quantum computing are closely related concepts, this chapter departs from our main story line of problem solving as energy minimization and concludes our study with an outlook to the possibilities of quantum gate computing. Indeed, the central ideas behind quantum gate computing differ from most of what we studied so far but our study still has us prepared for getting to grips with the basics of this paradigm. As this paradigm posits that quantum algorithms are sequences of unitary operators which each act on the joint state of a qubit system, we will look at the circuit model of quantum computing and see that quantum circuits consist of quantum gates which are interconnected by quantum wires where the latter represent the states of qubits on which the former perform unitary operations. As a practical example, we discuss how such circuits could compute univariate Boolean functions. This then seamlessly allows us to finally study Deutsch’s problem and algorithm and therefore to see an instance of a computational problem for which quantum computing algorithms can be exponentially faster than their classical counterparts.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 253-276
Adiabatic Quantum Computing
In this chapter, we finally have our first look at quantum computing. In particular, we consider adiabatic quantum computing which is a paradigm tailored to the general problem of bipolar QUBO solving. Given our study up to this point, its basic principles will be easy to understand since Hopfield nets for problem solving and adiabatic quantum computing are closely related concepts. Indeed, we already know about tensor products, Hopfield energies and their representation in terms of Hamiltonians, annealing, the axioms of quantum mechanics, the Schrödinger equation, and quantum superposition. All these concepts will now be jointly put to use and brought together with yet another quantum mechanical principle, namely the adiabatic theorem. Based on two examples of simple QUBO problems, we demonstrate how adiabatic quantum computers can explore their exponentially large search spaces in parallel and thus achieve quadratic speedup over classical exhaustive search procedures.
- 18 November 2025
- Published by Springer Nature
- p. 253-276
Open AccessAdiabatic Quantum Computing
In this chapter, we finally have our first look at quantum computing. In particular, we consider adiabatic quantum computing which is a paradigm tailored to the general problem of bipolar QUBO solving. Given our study up to this point, its basic principles will be easy to understand since Hopfield nets for problem solving and adiabatic quantum computing are closely related concepts. Indeed, we already know about tensor products, Hopfield energies and their representation in terms of Hamiltonians, annealing, the axioms of quantum mechanics, the Schrödinger equation, and quantum superposition. All these concepts will now be jointly put to use and brought together with yet another quantum mechanical principle, namely the adiabatic theorem. Based on two examples of simple QUBO problems, we demonstrate how adiabatic quantum computers can explore their exponentially large search spaces in parallel and thus achieve quadratic speedup over classical exhaustive search procedures.
- Open Access
- 18 November 2025
- Published by Springer Nature
- p. 145-163
Hopfield Nets in Action
In this chapter, we introduce the notion of the gradients of Hopfield energy functions and discuss how to employ them for efficient informed asynchronous updates of a Hopfield net. Armed with the corresponding algorithm, we will then demonstrate the use of Hopfield nets as problem solvers. In particular, we will consider a constraint satisfaction problem and a combinatorial optimization problem, show how to set up respective Hopfield net parameters, and then practically evaluate the the problem solving capabilities of Hopfield nets under different initializations and parameterizations. In preparation for things still to come, we finally discuss the characteristics of local search procedures and how more global procedures may overcome some of their limitations.
- 18 November 2025
- Published by Springer Nature
- p. 145-163
Open AccessHopfield Nets in Action
In this chapter, we introduce the notion of the gradients of Hopfield energy functions and discuss how to employ them for efficient informed asynchronous updates of a Hopfield net. Armed with the corresponding algorithm, we will then demonstrate the use of Hopfield nets as problem solvers. In particular, we will consider a constraint satisfaction problem and a combinatorial optimization problem, show how to set up respective Hopfield net parameters, and then practically evaluate the the problem solving capabilities of Hopfield nets under different initializations and parameterizations. In preparation for things still to come, we finally discuss the characteristics of local search procedures and how more global procedures may overcome some of their limitations.