Universität Stuttgart
Permanent URI for this communityhttps://elib.uni-stuttgart.de/handle/11682/1
Browse
4 results
Search Results
Item Open Access Rigorous compilation for near-term quantum computers(2024) Brandhofer, Sebastian; Polian, Ilia (Prof.)Quantum computing promises an exponential speedup for computational problems in material sciences, cryptography and drug design that are infeasible to resolve by traditional classical systems. As quantum computing technology matures, larger and more complex quantum states can be prepared on a quantum computer, enabling the resolution of larger problem instances, e.g. breaking larger cryptographic keys or modelling larger molecules accurately for the exploration of novel drugs. Near-term quantum computers, however, are characterized by large error rates, a relatively low number of qubits and a low connectivity between qubits. These characteristics impose strict requirements on the structure of quantum computations that must be incorporated by compilation methods targeting near-term quantum computers in order to ensure compatibility and yield highly accurate results. Rigorous compilation methods have been explored for addressing these requirements as they exactly explore the solution space and thus yield a quantum computation that is optimal with respect to the incorporated requirements. However, previous rigorous compilation methods demonstrate limited applicability and typically focus on one aspect of the imposed requirements, i.e. reducing the duration or the number of swap gates in a quantum computation. In this work, opportunities for improving near-term quantum computations through compilation are explored first. These compilation opportunities are included in rigorous compilation methods to investigate each aspect of the imposed requirements, i.e. the number of qubits, connectivity of qubits, duration and incurred errors. The developed rigorous compilation methods are then evaluated with respect to their ability to enable quantum computations that are otherwise not accessible with near-term quantum technology. Experimental results demonstrate the ability of the developed rigorous compilation methods to extend the computational reach of near-term quantum computers by generating quantum computations with a reduced requirement on the number and connectivity of qubits as well as reducing the duration and incurred errors of performed quantum computations. Furthermore, the developed rigorous compilation methods extend their applicability to quantum circuit partitioning, qubit reuse and the translation between quantum computations generated for distinct quantum technologies. Specifically, a developed rigorous compilation method exploiting the structure of a quantum computation to reuse qubits at runtime yielded a reduction in the required number of qubits of up to 5x and result error by up to 33%. The developed quantum circuit partitioning method optimally distributes a quantum computation to distinct separate partitions, reducing the required number of qubits by 40% and the cost of partitioning by 41% on average. Furthermore, a rigorous compilation method was developed for quantum computers based on neutral atoms that combines swap gate insertions and topology changes to reduce the impact of limited qubit connectivity on the quantum computation duration by up to 58% and on the result fidelity by up to 29%. Finally, the developed quantum circuit adaptation method enables to translate between distinct quantum technologies while considering heterogeneous computational primitives with distinct characteristics to reduce the idle time of qubits by up to 87% and the result fidelity by up to 40%.Item Open Access Über die Lösung der Navier-Stokes-Gleichungen mit Hilfe der Moore-Penrose-Inversen des Laplace-Operators im Vektorraum der Polynomkoeffizienten(2024) Große-Wöhrmann, Bärbel; Resch, Michael (Prof. Dr.-Ing.)Die bekannten numerischen Standard-Verfahren zur Lösung partieller Differentialgleichungen basieren auf einer räumlichen Diskretisierung des Berechnungsgebiets. Ihre Performance und Skalierbarkeit auf modernen massiv-parallelen Höchstleistungsrechnern ist von der Verfügbarkeit effizienter numerischer Verfahren zur Lösung linearer Gleichungssysteme abhängig. Angesichts grundlegender Herausforderungen erscheint die Entwicklung neuer Lösungsansätze sinnvoll. Ich stelle in dieser Arbeit einen Polynomansatz zur Lösung partieller Differentialgleichungen vor, der nicht auf einer räumlichen Diskretisierung beruht und mit Hilfe der Moore-Penrose-Inversen des Laplace-Operators die Entkopplung der Navier-Stokes-Gleichungen ermöglicht. Dabei ist der Grad der Polynome nicht grundsätzlich beschränkt, so dass eine hohe räumliche Auflösung erreicht werden kann.Item Open Access Stochastic model comparison and refinement strategies for gas migration in the subsurface(Stuttgart : Eigenverlag des Instituts für Wasser- und Umweltsystemmodellierung der Universität Stuttgart, 2023) Banerjee, Ishani; Nowak, Wolfgang (Prof. Dr.-Ing.)Gas migration in the subsurface, a multiphase flow in a porous-medium system, is a problem of environmental concern and is also relevant for subsurface gas storage in the context of the energy transition. It is essential to know and understand the flow paths of these gases in the subsurface for efficient monitoring, remediation or storage operations. On the one hand, laboratory gas-injection experiments help gain insights into the involved processes of these systems. On the other hand, numerical models help test the mechanisms observed and inferred from the experiments and then make useful predictions for real-world engineering applications. Both continuum and stochastic modelling techniques are used to simulate multiphase flow in porous media. In this thesis, I use a stochastic discrete growth model: the macroscopic Invasion Percolation (IP) model. IP models have the advantages of simplicity and computational inexpensiveness over complex continuum models. Local pore-scale changes dominantly affect the flow processes of gas flow in water-saturated porous media. IP models are especially favourable for these multi-scale systems because using continuum models to simulate them can be extremely computationally difficult. Despite offering a computationally inexpensive way to simulate multiphase flow in porous media, only very few studies have compared their IP model results to actual laboratory experimental image data. One reason might be the fact that IP models lack a notion of experimental time but only have an integer counter for simulation steps that imply a time order. The few existing experiments-to-model comparison studies have used perceptual similarity or spatial moments as comparison measures. On the one hand, perceptual comparison between the model and experimental images is tedious and non-objective. On the other hand, comparing spatial moments of the model and experimental images can lead to misleading results because of the loss of information from the data. In this thesis, an objective and quantitative comparison method is developed and tested that overcomes the limitations of these traditional approaches. The first step involves volume-based time-matching between real-time experimental data and IP-model outputs. This is followed by using the (Diffused) Jaccard coefficient to evaluate the quality of the fit. The fit between the images from the models and experiments can be checked across various scales by varying the extent of blurring in the images. Numerical model predictions for sparsely known systems (like the gas flow systems) suffer from high conceptual uncertainties. In literature, numerous versions of IP models, differing in their underlying hypotheses, have been used for simulating gas flow in porous media. Besides, the gas-injection experiments belong to continuous, transitional, or discontinuous gas flow regimes, depending on the gas flow rate and the porous medium's nature. Literature suggests that IP models are well suited for the discontinuous gas flow regime; other flow regimes have not been explored. Using the abovementioned method, in this thesis, four macroscopic IP model versions are compared against data from nine gas-injection experiments in transitional and continuous gas flow regimes. This model inter-comparison helps assess the potential of these models in these unexplored regimes and identify the sources of model conceptual uncertainties. Alternatively, with a focus on parameter uncertainty, Bayesian Model Selection is a standard statistical procedure for systematically and objectively comparing different model hypotheses by computing the Bayesian Model Evidence (BME) against test data. BME is the likelihood of a model producing the observed data, given the prior distribution of its parameters. Computing BME can be challenging: exact analytical solutions require strong assumptions; mathematical approximations (information criteria) are often strongly biased; assumption-free numerical methods (like Monte Carlo) are computationally impossible for large data sets. In this thesis, a BME-computation method is developed to use BME as a ranking criterion for such infeasible scenarios: The \emph{Method of Forced Probabilities} for extensive data sets and Markov-Chain models. In this method, the direction of evaluation is swapped: instead of comparing thousands of model runs on random model realizations with the observed data, the model is forced to reproduce the data in each time step, and the individual probabilities of the model following these exact transitions are recorded. This is a fast, accurate and exact method for calculating BME for IP models which exhibit the Markov chain property and for complete "atomic" data. The analysis results obtained using the methods and tools developed in this thesis help identify the strengths and weaknesses of the investigated IP model concepts. This further aids model development and refinement efforts for predicting gas migration in the subsurface. Also, the gained insights foster improved experimental methods. These tools and methods are not limited to gas flow systems in porous media but can be extended to any system involving raster outputs.Item Open Access Learning structured models for active planning : beyond the Markov paradigm towards adaptable abstractions(2018) Lieck, Robert; Toussaint, Marc (Prof. Dr.)