05 Fakultät Informatik, Elektrotechnik und Informationstechnik

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

Browse

Filters

2011 - 201912020 - 20252

Settings

Start date: 2010Publication Type: search.filters.UBSTyp.ZeitschriftenartikelSubject: search.filters.subject.510

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    ItemOpen Access
    Equation satisfiability in solvable groups
    (2022) Idziak, Paweł; Kawałek, Piotr; Krzaczkowski, Jacek; Weiß, Armin
    The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell in (Inf. Comput. 178 (1), 253-262, 10 ) where they showed that this problem is in P for nilpotent groups while it is NP -complete for non-solvable groups. Since then, several results have appeared showing that the problem can be solved in polynomial time in certain solvable groups G having a nilpotent normal subgroup H with nilpotent factor G / H . This paper shows that such a normal subgroup must exist in each finite group with equation satisfiability solvable in polynomial time, unless the Exponential Time Hypothesis fails.
  • Thumbnail Image
    ItemOpen Access
    Generalizations of the finite element method
    (2011) Schweitzer, Marc
    This paper is concerned with the generalization of the finite element method via the use of non-polynomial enrichment functions. Several methods employ this general approach, e.g. the extended finite element method and the generalized finite element method. We review these approaches and interpret them in the more general framework of the partition of unity method. Here we focus on fundamental construction principles, approximation properties and stability of the respective numerical method. To this end, we consider meshbased and meshfree generalizations of the finite element method and the use of smooth, discontinuous, singular and numerical enrichment functions.
  • Thumbnail Image
    ItemOpen Access
    On the differential topology of expressivity of parameterized quantum circuits
    (2025) Barzen, Johanna; Leymann, Frank
    Parameterized quantum circuits play a key role in quantum computing. Measuring the suitability of such a circuit for solving a class of problems is needed. One such promising measure is the expressivity of a circuit, which is defined in two main variants. The variant in focus of this contribution is the so-called dimensional expressivity, which measures the dimension of the submanifold of states produced by the circuit. Understanding this measure needs a lot of background from differential topology, which makes it hard to comprehend. In this article, we provide this background in a vivid as well as pedagogical manner. Especially, it strives towards being self-contained for understanding expressivity, e.g., the required mathematical foundations are provided, and examples are given. Also, the literature makes several statements about expressivity, the proofs of which are omitted or only indicated. In this article, we give proof for key statements from dimensional expressivity, sometimes revealing limits for generalizing them, and sketching how to proceed in practice to determine this measure.