arXiv subjects

Moritz Weber

Publications and source records attributed to Moritz Weber.

At least 19 recordsLinked to original sources

arXiv2024

Communication Complexity of Graph Isomorphism, Coloring, and Distance Games

In quantum information, nonlocal games are particularly useful for differentiating classical, quantum, and non-signalling correlations. An example of differentiation is given by the principle of no-collapse of communication complexity, which is often interpreted as necessary for a feasible physical theory. It is satisfied by quantum correlations but violated by some non-signalling ones. In this work, we investigate this principle in the context of three nonlocal games related to graph theory, starting from the well-known graph isomorphism and graph coloring games, and introducing a new game, the vertex distance game, with a parameter $D\in\mathbb N$, that generalizes the former two to some extent. For these three games, we prove that perfect non-signalling strategies collapse communication complexity under favorable conditions. We also define a refinement of fractional isomorphism of graphs, namely D-fractional isomorphisms, and we show that this characterizes perfect non-signalling strategies for the vertex distance game. Surprisingly, we observe that non-signalling strategies provide a finer distinction for the new game compared to classical and quantum strategies since the parameter D is visible only in the non-signalling setting.

quant-ph↗

arXiv2024

Nuclearity of Hypergraph C*-Algebras

We partially characterize nuclearity for the recently introduced class of hypergraph C*-algebras using a tailor-made hypergraph minor relation. The latter is generated by certain operations on hypergraphs which resemble the moves on directed graphs used by Eilers, Restorff, Ruiz and S{\o}rensen to classify unital graph C*-algebras. In particular, we obtain a new proof of the fact that every graph C*-algebra associated to a finite graph is nuclear.

math.OA↗

arXiv2024

Hypergraph C*-algebras

We give a definition of hypergraph C*-algebras. These generalize the well-known graph C*-algebras as well as ultragraph C*-algebras. In contrast to those objects, hypergraph C*-algebras are not always nuclear. We provide a number of non-nuclear examples, we prove a Gauge-Invariant Uniqueness Theorem for a subclass of hypergraph C*-algebras and we study moves on hypergraphs which generalize the moves in the theory of graph C*-algebras.

math.OA↗

arXiv2024

Discrete quantum subgroups of free unitary quantum groups

We classify all compact quantum groups whose C*-algebra sits inside that of the free unitary quantum groups $U_{N}^{+}$. In other words, we classify all discrete quantum subgroups of $\widehat{U}_{N}^{+}$, thereby proving a quantum variant of Kurosh's theorem to some extent. This yields interesting families which can be described using free wreath products and free complexifications. They can also be seen as quantum automorphism groups of specific quantum graphs which generalize finite rooted regular trees, providing explicit examples of quantum trees.

math.OA↗

arXiv2023

Quantum automorphisms of matroids

Motivated by the vast literature of quantum automorphism groups of graphs, we define and study quantum automorphism groups of matroids. A key feature of quantum groups is that there are many quantizations of a classical group, and this phenomenon manifests in the cryptomorphic characterizations of matroids. Our primary goals are to understand, using theoretical and computational techniques, the relationship between these quantum groups and to find when these quantum groups exhibit quantum symmetry. Finally, we prove a matroidal analog of Lov\'asz's theorem characterizing graph isomorphisms in terms of homomorphism counts.

math.QA↗

arXiv2023

Open Data-Driven Automation of Residential Distribution Grid Modeling with Minimal Data Requirements

In the present paper, we introduce a new method for the automated generation of residential distribution grid models based on novel building load estimation methods and a two-stage optimization for the generation of the 20 kV and 400 V grid topologies. Using the introduced load estimation methods, various open or proprietary data sources can be utilized to estimate the load of residential buildings. These data sources include available building footprints from OpenStreetMap, 3D building data from OSM Buildings, and the number of electricity meters per address provided by the respective distribution system operator (DSO). For the evaluation of the introduced methods, we compare the resulting grid models by utilizing different available data sources for a specific suburban residential area and the real grid topology provided by the DSO. This evaluation yields two key findings: First, the automated 20 kV network generation methodology works well when compared to the real network. Second, the utilization of public 3D building data for load estimation significantly increases the resulting model accuracy compared to 2D data and enables results similar to models based on DSO-supplied meter data. This substantially reduces the dependence on such normally proprietary data.

cs.CE↗

arXiv2023

A Concrete Model for the Quantum Permutation Group on 4 Points

In 2019, Jung-Weber gave an example of a concrete magic unitary $M$, which defines a $C^*$-algebraic model of the quantum permutation group $S_4^+$. We show with the help of a computer that there exist no polynomials up to degree $50$ separating the entries of $M$ from the generators of $C(S_4^+)$. This indicates that the magic unitary $M$ might already define a faithful model of $S_4^+$.

math.QA↗

arXiv2022

De Finetti Theorems for the Unitary Dual Group

We prove several de Finetti theorems for the unitary dual group, also called the Brown algebra. Firstly, we provide a finite de Finetti theorem characterizing $R$-diagonal elements with an identical distribution. This is surprising, since it applies to finite sequences in contrast to the de Finetti theorems for classical and quantum groups; also, it does not involve any known independence notion. Secondly, considering infinite sequences in $W^*$-probability spaces, our characterization boils down to operator-valued free centered circular elements, as in the case of the unitary quantum group $U_n^+$. Thirdly, the above de Finetti theorems build on dual group actions, the natural action when viewing the Brown algebra as a dual group. However, we may also equip the Brown algebra with a bialgebra action, which is closer to the quantum group setting in a way. But then, we obtain a no-go de Finetti theorem: invariance under the bialgebra action of the Brown algebra yields zero sequences, in $W^*$-probability spaces. On the other hand, if we drop the assumption of faithful states in $W^*$-probability spaces, we obtain a non-trivial half a de Finetti theorem similar to the case of the dual group action.

math.OA↗

arXiv2021

On $q$-tensor products of Cuntz algebras

We consider the $C^*$-algebra $\mathcal{E}_{n,m}^q$, which is a $q$-twist of two Cuntz-Toeplitz algebras. For the case $|q|<1$, we give an explicit formula which untwists the $q$-deformation showing that the isomorphism class of $\mathcal{E}_{n,m}^q$ does not depend on $q$. For the case $|q|=1$, we give an explicit description of all ideals in $\mathcal{E}_{n,m}^q$. In particular, we show that $\mathcal{E}_{n,m}^q$ contains a unique largest ideal $\mathcal{M}_q$. We identify $\mathcal{E}_{n,m}^q / \mathcal{M}_q$ with the Rieffel deformation of $\mathcal{O}_n \otimes \mathcal{O}_m$ and use a K-theoretical argument to show that the isomorphism class does not depend on $q$. The latter result holds true in a more general setting of multiparameter deformations.

math.OA↗

arXiv2021

Data-Driven Copy-Paste Imputation for Energy Time Series

A cornerstone of the worldwide transition to smart grids are smart meters. Smart meters typically collect and provide energy time series that are vital for various applications, such as grid simulations, fault-detection, load forecasting, load analysis, and load management. Unfortunately, these time series are often characterized by missing values that must be handled before the data can be used. A common approach to handle missing values in time series is imputation. However, existing imputation methods are designed for power time series and do not take into account the total energy of gaps, resulting in jumps or constant shifts when imputing energy time series. In order to overcome these issues, the present paper introduces the new Copy-Paste Imputation (CPI) method for energy time series. The CPI method copies data blocks with similar properties and pastes them into gaps of the time series while preserving the total energy of each gap. The new method is evaluated on a real-world dataset that contains six shares of artificially inserted missing values between 1 and 30%. It outperforms by far the three benchmark imputation methods selected for comparison. The comparison furthermore shows that the CPI method uses matching patterns and preserves the total energy of each gap while requiring only a moderate run-time.

cs.LG↗

arXiv2020

Quantum Cuntz-Krieger algebras

Motivated by the theory of Cuntz-Krieger algebras we define and study $ C^\ast $-algebras associated to directed quantum graphs. For classical graphs the $ C^\ast $-algebras obtained this way can be viewed as free analogues of Cuntz-Krieger algebras, and need not be nuclear. We study two particular classes of quantum graphs in detail, namely the trivial and the complete quantum graphs. For the trivial quantum graph on a single matrix block, we show that the associated quantum Cuntz-Krieger algebra is neither unital, nuclear nor simple, and does not depend on the size of the matrix block up to $ KK $-equivalence. In the case of the complete quantum graphs we use quantum symmetries to show that, in certain cases, the corresponding quantum Cuntz-Krieger algebras are isomorphic to Cuntz algebras. These isomorphisms, which seem far from obvious from the definitions, imply in particular that these $ C^\ast $-algebras are all pairwise non-isomorphic for complete quantum graphs of different dimensions, even on the level of $ KK $-theory. We explain how the notion of unitary error basis from quantum information theory can help to elucidate the situation. We also discuss quantum symmetries of quantum Cuntz-Krieger algebras in general.

math.OA↗

arXiv2020

Non-Hyperoctahedral Categories of Two-Colored Partitions, Part II: All Possible Parameter Values

This article is part of a series with the aim of classifying all non-hyperoctahedral categories of two-colored partitions. Those constitute by some Tannaka-Krein type result the co-representation categories of a specific class of quantum groups. However, our series of articles is purely combinatorial. In Part I we introduced a class of parameters which gave rise to many new non-hyperoctahedral categories of partitions. In the present article we show that this class actually contains all possible parameter values of all non-hyperoctahedral categories of partitions. This is an important step towards the classification of all non-hyperoctahedral categories.

math.CO↗

arXiv2019

Uniformly vertex-transitive graphs

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph $D(\Gamma)$ of a given graph $\Gamma$ to show that the uniform vertex-transitivity of $\Gamma$ is equivalent to the existence of cliques of sufficient size in $D(\Gamma)$. Using this method, we find examples of graphs that are vertex-transitive but not uniformly vertex-transitive, settling a previously open question. Furthermore, we develop sufficient criteria for uniform vertex-transitivity in the situation of a graph with an imprimitive automorphism group. We classify the non-Cayley uniformly vertex-transitive graphs on less than 30 vertices outside of two complementary pairs of graphs.

math.CO↗

arXiv2019

Sinkhorn algorithm for quantum permutation groups

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a set of linear relations. We use it for experiments on the representation theory of the quantum permutation group and quantum subgroups of it. We apply it to the question whether a given finite graph (without multiple edges) has quantum symmetries in the sense of Banica. In order to do so, we run our Sinkhorn algorithm and check whether or not the resulting projections commute. We discuss the produced data and some questions for future research arising from it.

math.QA↗

arXiv2019

Almost all trees have quantum symmetry

From the work of Erd\H{o}s and R\'{e}nyi from 1963 it is known that almost all graphs have no symmetry. In 2017, Lupini, Man\v{c}inska and Roberson proved a quantum counterpart: Almost all graphs have no quantum symmetry. Here, the notion of quantum symmetry is phrased in terms of Banica's definition of quantum automorphism groups of finite graphs from 2005, in the framework of Woronowicz's compact quantum groups. Now, Erd\H{o}s and R\'{e}nyi also proved a complementary result in 1963: Almost all trees do have symmetry. The crucial point is the almost sure existence of a cherry in a tree. But even more is true: We almost surely have two cherries in a tree - and we derive that almost all trees have quantum symmetry. We give an explicit proof of this quantum counterpart of Erd\H{o}s and R\'{e}nyi's result on trees.

math.QA↗

arXiv2019

Non-Hyperoctahedral Categories of Two-Colored Partitions, Part I: New Categories

Compact quantum groups can be studied by investigating their co-representation categories in analogy to the Schur-Weyl/Tannaka-Krein approach. For the special class of (unitary) "easy" quantum groups these categories arise from a combinatorial structure: Rows of two-colored points form the objects, partitions of two such rows the morphisms; vertical/horizontal concatenation and reflection give composition, monoidal product and involution. Of the four possible classes $\mathcal{O}$, $\mathcal{B}$, $\mathcal{S}$ and $\mathcal{H}$ of such categories (inspired respectively by the classical orthogonal, bistochastic, symmetric and hyperoctahedral groups) we treat the first three -- the non-hyperoctahedral ones. We introduce many new examples of such categories. They are defined in terms of subtle combinations of block size, coloring and non-crossing conditions. This article is part of an effort to classify all non-hyperoctahedral categories of two-colored partitions. The article is purely combinatorial in nature; The quantum group aspects are left out.

math.CO↗

arXiv2019

New products and $\mathbb{Z}_2$-extensions of compact matrix quantum groups

There are two very natural products of compact matrix quantum groups: the tensor product $G\times H$ and the free product $G*H$. We define a number of further products interpolating these two. We focus more in detail to the case where $G$ is an easy quantum group and $H=\hat{\mathbb{Z}}_2$, the dual of the cyclic group of order two. We study subgroups of $G*\hat{\mathbb{Z}}_2$ using categories of partitions with extra singletons. Closely related are many examples of non-easy bistochastic quantum groups.

math.QA↗

arXiv2019

Existence of quantum symmetries for graphs on up to seven vertices: a computer based approach

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In general, there are more quantum symmetries than symmetries and it is a non-trivial task to determine when this is the case for a given graph: The question is whether or not the algebra associated to the quantum automorphism group is commutative. We use Gr\"obner base computations in order to tackle this problem; the implementation uses GAP and the SINGULAR package LETTERPLACE. We determine the existence of quantum symmetries for all connected, undirected graphs without multiple edges and without self-edges, for up to seven vertices. As an outcome, we infer within our regime that a classical automorphism group of order one or two is an obstruction for the existence of quantum symmetries.

math.QA↗