Universität Stuttgart

Permanent URI for this communityhttps://elib.uni-stuttgart.de/handle/11682/1

Browse

Filters

2022 - 20252

Settings

Institute: search.filters.UBSInstitut.Institut für Architektur von AnwendungssystemenAuthor: search.filters.author.Leymann, FrankAuthor: search.filters.author.Truger, FelixStart date: 2020Subject: search.filters.subject.004

Search Results

Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Configurable readout error mitigation in quantum workflows
    (2022) Beisel, Martin; Barzen, Johanna; Leymann, Frank; Truger, Felix; Weder, Benjamin; Yussupov, Vladimir
    Current quantum computers are still error-prone, with measurement errors being one of the factors limiting the scalability of quantum devices. To reduce their impact, a variety of readout error mitigation methods, mostly relying on classical post-processing, have been developed. However, the application of these methods is complicated by their heterogeneity and a lack of information regarding their functionality, configuration, and integration. To facilitate their use, we provide an overview of existing methods, and evaluate general and method-specific configuration options. Quantum applications comprise many classical pre- and post-processing tasks, including readout error mitigation. Automation can facilitate the execution of these often complex tasks, as their manual execution is time-consuming and error-prone. Workflow technology is a promising candidate for the orchestration of heterogeneous tasks, offering advantages such as reliability, robustness, and monitoring capabilities. In this paper, we present an approach to abstractly model quantum workflows comprising configurable readout error mitigation tasks. Based on the method configuration, these workflows can then be automatically refined into executable workflow models. To validate the feasibility of our approach, we provide a prototypical implementation and demonstrate it in a case study from the quantum humanities domain.
  • Thumbnail Image
    ItemOpen Access
    Joint wire cutting with non‐maximally entangled states
    (2025) Bechtold, Marvin; Barzen, Johanna; Leymann, Frank; Mandl, Alexander; Truger, Felix
    Distributed quantum computing leverages multiple quantum devices collectively to perform computations exceeding each device's capabilities. A currently studied technique to enable this distributed approach is wire cutting, which decomposes a quantum circuit into smaller subcircuits by cutting connecting wires. These subcircuits can be executed on distributed devices, and their results are then classically combined to reconstruct the original computation's result. However, wire cutting requires additional circuit executions to preserve result accuracy, with their number growing exponentially with each cut. Thus, minimizing this sampling overhead is crucial for reducing execution time. Employing shared non‐maximally entangled (NME) states between distributed devices reduces this overhead for single wire cuts, approaching ideal teleportation with maximally entangled states. Extending this approach to jointly cutting multiple wires using NME states remained unexplored. This study addresses this gap by investigating the use of NME states for joint wire cuts, aiming to reduce the sampling overhead further. The three main contributions include (i) determining the minimal sampling overhead for this scenario, (ii) analyzing the overhead when using composite NME states constructed from smaller NME states, and (iii) introducing a wire cutting technique that achieves the optimal sampling overhead with pure NME states, advancing toward wire cutting with arbitrary NME states.