SearcharxivSearch

arXiv subjects

Alexander J. Heilman

Publications and source records attributed to Alexander J. Heilman.

3 recordsLinked to original sources

Point Group Equivariant Graph Neural Networks for Materials

Equivariant graph neural networks have proven effective tools for inference of material's properties directly from their structure. Traditionally, these have been applied such that they respect full $O(3)$ equivariance, so that any rotation or reflection of the input structure is respected in the model's output. While this works for general arrangements of atoms, additional symmetries of atomistic systems are left unleveraged. Furthermore, any symmetries of the filter functions are implicitly learned from the full dataset and not strictly enforced. In this work, we introduce point-group symmetry aware equivariant graph neural networks (PGEqNN) for materials science, with filter functions aligned with symmetry-aware indices for greater granularity in predictive tasks. With this architecture, we show that most of the predictive power of equivariant networks for tensorial elastic and dielectric datasets lies in the trivial subspaces of the point-group adapted bases. Exploiting this, an $A_1$-restricted variant matches or improves on its full point-group and $SO(3)$-partitioned counterparts while training fewer active parameters, yielding leaner models of equal accuracy.

cond-mat.dis-nn

Crystal Hypergraph Convolutional Networks

Graph representations of solid state materials that encode only interatomic distance lack geometrical resolution, resulting in degenerate representations that may map distinct structures to equivalent graphs. Here we propose a hypergraph representation scheme for materials that allows for the association of higher-order geometrical information with hyperedges. Hyperedges generalize edges to connected sets of more than two nodes, and may be used to represent triplets and local environments of atoms in materials. This generalization of edges requires a different approach in graph convolution, three of which are developed in this paper. Results presented here focus on the improved performance of models based on both pair-wise edges and local environment hyperedges. These results demonstrate that hypergraphs are an effective method for incorporating geometrical information in material representations.

cond-mat.mtrl-sci

Finite-Function-Encoding Quantum States

We introduce finite-function-encoding (FFE) states which encode arbitrary $d$-valued logic functions, i.e., multivariate functions over the ring of integers modulo $d$, and investigate some of their structural properties. We also point out some differences between polynomial and non-polynomial function encoding states: The former can be associated to graphical objects, that we dub tensor-edge hypergraphs (TEH), which are a generalization of hypergraphs with a tensor attached to each hyperedge encoding the coefficients of the different monomials. To complete the framework, we also introduce a notion of finite-function-encoding Pauli (FP) operators, which correspond to elements of what is known as the generalized symmetric group in mathematics. First, using this machinery, we study the stabilizer group associated to FFE states and observe how qudit hypergraph states introduced in arXiv:1612.06418v2 admit stabilizers of a particularly simpler form. Afterwards, we investigate the classification of FFE states under local unitaries (LU), and, after showing the complexity of this problem, we focus on the case of bipartite states and especially on the classification under local FP operations (LFP). We find all LU and LFP classes for two qutrits and two ququarts and study several other special classes, pointing out the relation between maximally entangled FFE states and complex Butson-type Hadamard matrices. Our investigation showcases also the relation between the properties of FFE states, especially their LU classification, and the theory of finite rings over the integers.

quant-ph