05 Fakultät Informatik, Elektrotechnik und Informationstechnik

Permanent URI for this collectionhttps://elib.uni-stuttgart.de/handle/11682/6

Browse

Search Results

Now showing 1 - 10 of 23
  • Thumbnail Image
    ItemOpen 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%.
  • Thumbnail Image
    ItemOpen Access
    Sharp MIR plasmonic modes in gratings made of heavily doped pulsed laser-melted Ge1-xSnx
    (2023) Berkmann, Fritz; Steuer, Oliver; Ganss, Fabian; Prucnal, Slawomir; Schwarz, Daniel; Fischer, Inga Anita; Schulze, Jörg
  • Thumbnail Image
    ItemOpen Access
    Top‐down approach to study chemical and electronic properties of perovskite solar cells : sputtered depth profiling versus tapered cross‐sectional photoelectron spectroscopies
    (2021) Das, Chittaranjan; Zia, Waqas; Mortan, Claudiu; Hussain, Navid; Saliba, Michael; Ingo Flege, Jan; Kot, Małgorzata
    A study of the chemical and electronic properties of various layers across perovskite solar cell (PSC) stacks is challenging. Depth‐profiling photoemission spectroscopy can be used to study the surface, interface, and bulk properties of different layers in PSCs, which influence the overall performance of these devices. Herein, sputter depth profiling (SDP) and tapered cross‐sectional (TCS) photoelectron spectroscopies (PESs) are used to study highly efficient mixed halide PSCs. It is found that the most used SDP‐PES technique degrades the organic and deforms the inorganic materials during sputtering of the PSCs while the TCS‐PES method is less destructive and can determine the chemical and electronic properties of all layers precisely. The SDP‐PES dissociates the chemical bonding in the spiro‐MeOTAD and perovskite layer and reduces the TiO2, which causes the chemical analysis to be unreliable. The TCS‐PES revealed a band bending only at the spiro‐MeOTAD/perovskite interface of about 0.7 eV. Both the TCS and SDP‐PES show that the perovskite layer is inhomogeneous and has a higher amount of bromine at the perovskite/TiO2 interface.
  • Thumbnail Image
    ItemOpen Access
    Plasmonic gratings from highly doped Ge1-ySny films on Si
    (2021) Berkmann, Fritz; Ayasse, Markus; Schlipf, Jon; Mörz, Florian; Weißhaupt, David; Oehme, Michael; Prucnal, Slawomir; Kawaguchi, Yuma; Schwarz, Daniel; Fischer, Inga Anita; Schulze, Jörg
    Plasmonic modes in metal structures are of great interest for optical applications. While metals such as Au and Ag are highly suitable for such applications at visible wavelengths, their high Drude losses limit their usefulness at mid-infrared wavelengths. Highly n-doped Ge1-ySny alloys are interesting possible alternative materials for plasmonic applications in this wavelength range. Here, we investigate the use of highly n-doped Ge1-ySny films grown directly on Si by molecular beam epitaxy with varying Sn-content from 0% up to 7.6% for plasmonic grating structures. We compare plasma wavelengths and relaxation times obtained from electrical and optical characterization. While theoretical considerations indicate that the decreasing effective mass with increasing Sn content in Ge1-ySny films could improve performance for plasmonic applications, our optical characterization results show that the utilization of Ge1-ySny films grown directly on Si is only beneficial if material quality can be improved.
  • Thumbnail Image
    ItemOpen Access
    Boron partitioning coefficient above unity in laser crystallized silicon
    (2017) Lill, Patrick C.; Dahlinger, Morris; Köhler, Jürgen R.
  • Thumbnail Image
    ItemOpen Access
    Stable and mass-conserving high-dimensional simulations with the sparse grid combination technique for full HPC systems and beyond
    (2024) Pollinger, Theresa; Pflüger, Dirk (Prof. Dr.)
    In the light of the ongoing climate crisis, mastering controlled plasma fusion has the potential to be one of the pivotal scientific achievements of the 21st century. To understand the turbulent fields in confined fusion devices, simulation has been and continues to be both an asset and a challenge. The main limiting factor to large-scale high-fidelity predictive simulations lies in the Curse of Dimensionality, which dominates all grid-based discretizations of plasmas based on the Vlasov-Poisson and Vlasov-Maxwell equations. In the full formulation, they result in six-dimensional grids and fine scales that need to be resolved, leading to a potentially untractable number of degrees of freedom. Typical approaches to this problem - coordinate transformations such as gyrokinetics, grid adaptation, restricting oneself to limited resolutions - do not directly address the Curse of Dimensionality, but rather work around it. The sparse grid combination technique, which forms the center of this work, is a multiscale approach that alleviates the curse of dimensionality for time-stepping simulations: Multiple regular grid-based simulations are run and update each other’s information throughout the course of simulation time. The present thesis improves upon the former state-of-the-art of the combination technique in three ways: introducing conservation of mass and numerical stability through the use of better-suited multiscale basis functions, optimizing the code for large-scale HPC systems, and extending the combination technique to the widely-distributed setting. Firstly, this thesis analyzes the often-used hierarchical hat function from the viewpoint of biorthogonal wavelets, which allows to replace the hierarchical hat function by other multiscale functions (such as the mass-conserving CDF wavelets) in a straightforward manner. Numerical studies presented in the thesis show that this not only introduces conservation but also increases accuracy and avoids numerical instabilities - which previously were a major roadblock for large-scale Vlasov simulations with the combination technique. Secondly, the open-source framework DisCoTec was extended to scale the combination technique up to the available memory of entire supercomputing systems. DisCoTec is designed to wrap the combination technique around existing grid-based solvers and draws on the inherent parallelism of the combination technique. Among several other contributions, different communication-avoiding multiscale reduction schemes were developed and implemented into DisCoTec as part of this work. The scalability of the approach is asserted by an extensive set of measurements in this thesis: DisCoTec is shown to scale up to the full system size of four German supercomputers, including the three CPU-based Tier-0/Tier-1 systems. Thirdly, the combination technique was further extended to the widely-distributed setting, where two HPC systems synchronously run a joint simulation. This is enabled by file transfer as well as sophisticated algorithms for assigning the different simulation instances to the systems, two of which were developed as part of this work. By the resulting drastic reductions in the communication volume, tolerable transfer times for combination technique simulations on different HPC systems have been achieved for the first time. These three advances - improved numerical properties, scaling efficiently up to full system sizes, and the possibility to extend the simulation beyond a single system - show the sparse grid combination technique to be a promising approach for future high-fidelity simulations of higher-dimensional problems, such as plasma turbulence.
  • Thumbnail Image
    ItemOpen Access
    Ge-on-Si single-photon avalanche diode using a double mesa structure
    (2024) Wanitzek, Maurice; Schulze, Jörg; Oehme, Michael
  • Thumbnail Image
    ItemOpen Access
    Quantum support vector machines of high-dimensional data for image classification problems
    (2023) Vikas Singh, Rajput
    This thesis presents a comprehensive investigation into the efficient utilization of Quantum Support Vector Machines (QSVMs) for image classification on high-dimensional data. The primary focus is on analyzing the standard MNIST dataset and the high-dimensional dataset provided by TRUMPF SE + Co. KG. To evaluate the performance of QSVMs against classical Support Vector Machines (SVMs) for high-dimensional data, a benchmarking framework is proposed. In the current Noisy Intermediate Scale Quantum (NISQ) era, classical preprocessing of the data is a crucial step to prepare the data for classification tasks using NISQ machines. Various dimensionality reduction techniques, such as principal component analysis (PCA), t-distributed stochastic neighbor embedding (tSNE), and convolutional autoencoders, are explored to preprocess the image datasets. Convolutional autoencoders are found to outperform other methods when calculating quantum kernels on a small dataset. Furthermore, the benchmarking framework systematically analyzes different quantum feature maps by varying hyperparameters, such as the number of qubits, the use of parameterized gates, the number of features encoded per qubit line, and the use of entanglement. Quantum feature maps demonstrate higher accuracy compared to classical feature maps for both TRUMPF and MNIST data. Among the feature maps, one using 𝑅𝑧 and 𝑅𝑦 gates with two features per qubit, without entanglement, achieves the highest accuracy. The study also reveals that increasing the number of qubits leads to improved accuracy for the real-world TRUMPF dataset. Additionally, the choice of the quantum kernel function significantly impacts classification results, with the projected type quantum kernel outperforming the fidelity type quantum kernel. Subsequently, the study examines the Kernel Target Alignment (KTA) optimization method to improve the pipeline. However, for the chosen feature map and dataset, KTA does not provide significant benefits. In summary, the results highlight the potential for achieving quantum advantage by optimizing all components of the quantum classifier framework. Selecting appropriate dimensionality reduction techniques, quantum feature maps, and quantum kernel methods is crucial for enhancing classification accuracy. Further research is needed to address challenges related to kernel optimization and fully leverage the capabilities of quantum computing in machine learning applications.
  • Thumbnail Image
    ItemOpen Access
    Multiplexed pseudo-deterministic photon source with asymmetric switching elements
    (2024) Brandhofer, Sebastian; Myers, Casey R.; Devitt, Simon; Polian, Ilia
  • Thumbnail Image
    ItemOpen Access
    Auflösungserhöhung von sehr schnellen A/D- und D/A-Umsetzern
    (2004) Bittel, Andreas; Speidel, Joachim (Prof. Dr.-Ing.)
    Zur digitalen Übertragung von Breitbandkabelsignalen, wie sie in der Kopfstelle eines mit Koaxkabeln aufgebautes TV-Netzes bereit gestellt werden, wurden Untersuchungen angestellt. Dazu wurden A/D- (MAX 104 [1]) und D/A-Umsetzer (RDA 012 [2]) bei 0,5 GHz und 1 GHz Abtastrate mit nomineller Auflösung von 8 bit aufgebaut. Die Qualität der Übertragung mit diesen Bausteinen wurde durch Messung des Videofrequenz- bzw. HF-Störabstands bestimmt. Außerdem wurde die Auflösung in effektiven Bit einer nominellen 8-Bit-A/D-D/A-Umsetzung bestimmt. Um die Qualität der Übertragung zu verbessern, wurden zwei Methoden der Auflösungserhöhung der A/D-Umsetzung untersucht und verglichen: Auflösungserhöhung mit doppeltem Aussteuerbereich und die Methode der Auflösungserhöung mit einfachem Aussteuerbereich. Beide Verfahren benutzen zwei A/D-Umsetzer, wozu analytische Modelle entwickelt und mit Hilfe der Rechnersimulation überprüft wurden. So wurde die Abhängigkeit der Auflösung der beiden Methoden vom Gleichanteil des Eingangssignals der A/D-Umsetzer, ihren Referenzspannungen und ihrer Quantisierungsschwellengenauigkeit ermittelt. Weiterhin wurde für beide Methoden mit Sinussignalen die Frequenzbandbreite, in welcher eine Auflösungserhöhung erfolgt, am realen A/D-Umsetzersystem gemessen. Zur Einstellung des Gleichanteils im Eingangssignal der A/D-Umsetzer, der Referenzspannungen und der Abtastzeitpunkten bei Auflösungserhöhung mit doppeltem Aussteuerbereich wurde ein Maximum-Likelihood-Schätzer entwickelt, der Gleichanteil, Amplitude und Nullphase einer Halb-schwingung bestimmen kann.