collaborators

11 papers

math.NA2026

On low-rank tensor train approximability for linear nearest neighbor systems

Patrick Gelß, Sebastian Matera, Reinhold Schneider +1

Low-rank tensor methods are an important tool in the numerical treatment of equations with a high-dimensional state space. Nearest neighbor interaction systems like the Ising model…

cs.IT2026

The Weight Distribution of the Third-Order Reed-Muller Code of Length 2048

Kirill Khoruzhii, Patrick Gelß, Sebastian Pokutta

We compute the weight distribution of the third-order Reed--Muller code RM(3,11) of length 2048. The weight enumerator is assembled from the coset weight enumerators of f+RM(2,10),…

math.NT2026

Classification of Boolean Cubic Forms in Ten Variables

Kirill Khoruzhii, Patrick Gelß, Sebastian Pokutta

We classify Boolean cubic forms in ten variables up to GL(10,2)-equivalence. The catalog contains all 3691560 nonzero orbits. For every orbit we provide a representative with small…

math.OC2026

Graph Isomorphism: Mixed-Integer Convex Optimization from First-Order Methods

Wenjie Xiao, Mathieu Besançon, Patrick Gelß +3

The graph isomorphism (GI) problem, which asks whether two graphs are structurally identical, occupies a unique position in computational complexity -- it is neither known to be so…

math.DS2026

Numerical approximation of the Koopman-von Neumann equation: Operator learning and quantum computing

Stefan Klus, Feliks Nüske, Patrick Gelß

The Koopman-von Neumann equation describes the evolution of wavefunctions associated with autonomous ordinary differential equations and can be regarded as a quantum physics-inspir…

quant-ph2026

Tensor Decomposition for Non-Clifford Gate Minimization

Kirill Khoruzhii, Patrick Gelß, Sebastian Pokutta

Fault-tolerant quantum computation requires minimizing non-Clifford gates, whose implementation via magic state distillation dominates the resource costs. While -count minimizat…