Related papers: The SpinParser software for pseudofermion function…
We present algorithms to compute the Smith Normal Form of matrices over two families of local rings. The algorithms use the \emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of…
A recently proposed renormalization group approach to dimensional crossover in quasi-one-dimensional quantum antiferromagnets is improved and then shown to give identical results, in some cases, to those obtained earlier.
We present a binary code for spinors and Clifford multiplication using non-negative integers and their binary expressions, which can be easily implemented in computer programs for explicit calculations. As applications, we present explicit…
We study the renormalization of (softly) broken supersymmetric theories at the one loop level in detail. We perform this analysis in a superspace approach in which the supersymmetry breaking interactions are parameterized using spurion…
We present SymForce, a library for fast symbolic computation, code generation, and nonlinear optimization for robotics applications like computer vision, motion planning, and controls. SymForce combines the development speed and flexibility…
We present a tool for batch generation of input scripts and multi-type Fourier analysis from simulation results for the micromagnetic software MuMax3. The introduction of graphical user interface and parameter-sweeping functionality…
Quantum computing is expected to provide new promising approaches for solving the most challenging problems in material science, communication, search, machine learning and other domains. However, due to the decoherence and gate…
We propose the use of low bit-depth Sigma-Delta and distributed noise-shaping methods for quantizing the Random Fourier features (RFFs) associated with shift-invariant kernels. We prove that our quantized RFFs -- even in the case of $1$-bit…
Probabilistic machine learning models are distinguished by their ability to integrate prior knowledge of noise statistics, smoothness parameters, and training data uncertainty. A common approach involves modeling data with Gaussian…
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient…
Simulating fermionic systems on a quantum computer requires representing fermionic states using qubits. The complexity of many simulation algorithms depends on the complexity of implementing rotations generated by fermionic…
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting structured frequency support. These functions…
As state of the art neural networks (NNs) continue to grow in size, their resource-efficient implementation becomes ever more important. In this paper, we introduce a compression scheme that reduces the number of computations required for…
Although the functional renormalization group (fRG) is by now a well-established method for investigating correlated electron systems, it is still undergoing significant technical and conceptual improvements. In particular, the motivation…
Most research in quantum computing today is performed against simulations of quantum computers rather than true quantum computers. Simulating a quantum computer entails implementing all of the unitary operators corresponding to the quantum…
Simulation of stabilizer circuits is a well-studied problem in quantum information processing, with a number of highly optimized algorithms available. Yet, we argue that further improvements can arise from the theoretical structure of…
The study of quantum circuit simulation using classical computers is a key research topic that helps define the boundary of verifiable quantum advantage, solve quantum many-body problems, and inform development of quantum hardware and…
This article presents some aspects and experience in the use of algebraic manipulation software applied to general relativity. Some years ago certain results were reported using computer algebra platforms, but the growing popularity of…
We demonstrate a fast spin-s spherical harmonic transform algorithm, which is flexible and exact for band-limited functions. In contrast to previous work, where spin transforms are computed independently, our algorithm permits the…
The conceptual framework provided by the functional Renormalization Group (fRG) has become a formidable tool to study correlated electron systems on lattices which, in turn, provided great insights to our understanding of complex many-body…