Evolving Distributed Algorithms with Genetic Programming

Distributed systems are one of the most vital components of the economy. The most prominent example is probably the internet, a constituent element of our knowledge society. During the recent years, the number of novel network types has steadily increased. Amongst others, sensor networks, distributed systems composed of tiny computational devices with scarce resources, have emerged. The further development and heterogeneous connection of such systems imposes new requirements on the software development process. Mobile and wireless networks, for instance, have to organize themselves autonomously and must be able to react to changes in the environment and to failing nodes alike. Researching new approaches for the design of distributed algorithms may lead to methods with which these requirements can be met efficiently. In this thesis, one such method is developed, tested, and discussed in respect of its practical utility. Our new design approach for distributed algorithms is based on Genetic Programming, a member of the family of evolutionary algorithms. Evolutionary algorithms are metaheuristic optimization methods which copy principles from natural evolution. They use a population of solution candidates which they try to refine step by step in order to attain optimal values for predefined objective functions. The synthesis of an algorithm with our approach starts with an analysis step in which the wanted global behavior of the distributed system is specified. From this specification, objective functions are derived which steer a Genetic Programming process where the solution candidates are distributed programs. The objective functions rate how close these programs approximate the goal behavior in multiple randomized network simulations. The evolutionary process step by step selects the most promising solution candidates and modifies and combines them with mutation and crossover operators. This way, a description of the global behavior of a distributed system is translated automatically to programs which, if executed locally on the nodes of the system, exhibit this behavior. In our work, we test six different ways for representing distributed programs, comprising adaptations and extensions of well-known Genetic Programming methods (SGP, eSGP, and LGP), one bio-inspired approach (Fraglets), and two new program representations called Rule-based Genetic Programming (RBGP, eRBGP) designed by us. We breed programs in these representations for three well-known example problems in distributed systems: election algorithms, the distributed mutual exclusion at a critical section, and the distributed computation of the greatest common divisor of a set of numbers. Synthesizing distributed programs the evolutionary way does not necessarily lead to the envisaged results. In a detailed analysis, we discuss the problematic features which make this form of Genetic Programming particularly hard. The two Rule-based Genetic Programming approaches have been developed especially in order to mitigate these difficulties. In our experiments, at least one of them (eRBGP) turned out to be a very efficient approach and in most cases, was superior to the other representations.

Efficient Characterisation and Optimal Control of Open Quantum Systems - Mathematical Foundations and Physical Applications

Since no physical system can ever be completely isolated from its environment, the study of open quantum systems is pivotal to reliably and accurately control complex quantum systems. In practice, reliability of the control field needs to be confirmed via certification of the target evolution while accuracy requires the derivation of high-fidelity control schemes in the presence of decoherence. In the first part of this thesis an algebraic framework is presented that allows to determine the minimal requirements on the unique characterisation of arbitrary unitary gates in open quantum systems, independent on the particular physical implementation of the employed quantum device. To this end, a set of theorems is devised that can be used to assess whether a given set of input states on a quantum channel is sufficient to judge whether a desired unitary gate is realised. This allows to determine the minimal input for such a task, which proves to be, quite remarkably, independent of system size. These results allow to elucidate the fundamental limits regarding certification and tomography of open quantum systems. The combination of these insights with state-of-the-art Monte Carlo process certification techniques permits a significant improvement of the scaling when certifying arbitrary unitary gates. This improvement is not only restricted to quantum information devices where the basic information carrier is the qubit but it also extends to systems where the fundamental informational entities can be of arbitary dimensionality, the so-called qudits. The second part of this thesis concerns the impact of these findings from the point of view of Optimal Control Theory (OCT). OCT for quantum systems utilises concepts from engineering such as feedback and optimisation to engineer constructive and destructive interferences in order to steer a physical process in a desired direction. It turns out that the aforementioned mathematical findings allow to deduce novel optimisation functionals that significantly reduce not only the required memory for numerical control algorithms but also the total CPU time required to obtain a certain fidelity for the optimised process. The thesis concludes by discussing two problems of fundamental interest in quantum information processing from the point of view of optimal control - the preparation of pure states and the implementation of unitary gates in open quantum systems. For both cases specific physical examples are considered: for the former the vibrational cooling of molecules via optical pumping and for the latter a superconducting phase qudit implementation. In particular, it is illustrated how features of the environment can be exploited to reach the desired targets.

Kohärente transiente und effiziente Endzustandskontrolle in Atomen und Molekülen

Es ist ein lang gehegter Traum in der Chemie, den Ablauf einer chemischen Reaktion zu kontrollieren und das Aufbrechen und Bilden chemischer Bindungen zu steuern. Diesem Ziel verschreibt sich auch das Forschungsgebiet der Femtochemie. Hier werden Femtosekunden Laserpulse eingesetzt um auf dem Quantenlevel molekulare Dynamiken auf ihren intrinsischen Zeitskalen zu kontrollieren und das System selektiv und effizient von einem Anfangs- in einen Zielzustand zu überführen. Der Wunsch, mit geformten Femtosekunden Laserpulsen Kontrolle über transiente Dynamiken und finale Populationen auszuüben, zu beobachten und zu verstehen, bildet auch die Motivation für diese Arbeit. Hierzu wurden mit Hilfe der Photoelektronenspektroskopie Untersuchungen zur Wechselwirkung atomarer und molekularer Prototypsysteme mit intensiven, geformten Femtosekunden Laserpulsen durchgeführt. Die Verwendung von Modelsystemen ermöglicht es, grundlegende Mechanismen der kohärenten Kontrolle in intensiven Laserfeldern zu analysieren, ohne dass sie durch komplexe Wechselwirkungen verschleiert werden. Zunächst wurde die Wechselwirkung von Kaliumatomen mit gechirpten Femtosekunden Laserpulsen untersucht. In den Experimenten wurden sowohl transiente Dynamiken als auch die Endbesetzungen der elektronischen Zustände abgebildet. In den folgenden Experimenten wurde das Quantenkontrollszenario SPODS auf die gekoppelte Elektronen-Kern-Dynamik in Molekülen übertragen. Die Kontrolle basiert auf der Erzeugung und Manipulation von Ladungsoszillationen durch Pulssequenzen. Der letzte Teil widmet sich der Entwicklung adiabatischer Kontrollmechanismen in Molekülen. Bei den Experimenten wurden gechirpte Airypulse eingesetzt um robuste Starkfeldanregung in molekularen Systemen zu induzieren. In Zukunft wird die Erforschung immer komplexerer Moleküle im Rahmen der transienten Kontrolle im Fokus stehen. Dabei werden nicht nur die effiziente Besetzung gebundener Zustände von Interesse sein, sondern auch die gezielte Dissoziation in spezifische Fragmente, photoinduzierte Isomerisierungsreaktionen oder die Kontrolle über transiente Dynamiken, die Einfluss auf andere molekulare Eigenschaften haben. Vor dem Hintergrund dieses übergeordneten Wunsches, photochemische Reaktionen immer komplexerer Moleküle, bis hin zu großen, biologisch relevanten Molekülen, zu kontrollieren, ist es umso wichtiger, die zugrundeliegenden Anregungsmechanismen in einfachen Systemen nachzuvollziehen. In den hier präsentierten Experimenten wurde gezeigt, wie die simultane Beobachtung der bekleideten und der stationären Zustände in atomaren Systemen zu einem umfassenden Bild der lichtinduzierte Dynamiken führen kann. Die gewonnenen Erkenntnisse können auf die Steuerung gekoppelter Dynamiken übertragen werden, durch die Kontrolle auch in molekularen Systemen möglich wird.