Michelle Richer | Searcharxiv

arXiv2026

Fanpy 2.0: Wavefunction Implementation and Analysis Tools for Flexible Ansatz Design

Fanpy is a Python library for developing new wavefunction methods. It enables users to quickly convert mathematical expressions into working code through a modular design based on the Flexible Ansatz for N-electron Configuration Interaction (FANCI) theory. This architecture facilitates a straightforward extension of the codebase. Here we present version 2.0 of the Fanpy package. This release includes several new wavefunction implementations, including coupled- cluster-inspired geminal approaches. A new analysis module enables a more detailed inspection of computational results and lays the groundwork for future features. In addition, the PySCF interface has been redesigned, and an interface to the PyCI package has been introduced to offload computationally expensive components. Finally, we introduce an improved software development environment, including automated testing and issue tracking.

physics.chem-ph↗

arXiv2025

Optimizing and benchmarking the computation of the permanent of general matrices

Evaluating the permanent of a matrix is a fundamental computation that emerges in many domains, including traditional fields like computational complexity theory, graph theory, many-body quantum theory and emerging disciplines like machine learning and quantum computing. While conceptually simple, evaluating the permanent is extremely challenging: no polynomial-time algorithm is available (unless $\textsc{P} = \textsc{NP}$). To the best of our knowledge there is no publicly available software that automatically uses the most efficient algorithm for computing the permanent. In this work we designed, developed, and investigated the performance of our software package which evaluates the permanent of an arbitrary rectangular matrix, supporting three algorithms generally regarded as the fastest while giving the exact solution (the straightforward combinatoric algorithm, the Ryser algorithm, and the Glynn algorithm) and, optionally, automatically switching to the optimal algorithm based on the type and dimensionality of the input matrix. To do this, we developed an extension of the Glynn algorithm to rectangular matrices. Our free and open-source software package is distributed via Github, at https://github.com/theochem/matrix-permanent.

quant-ph↗