PEPSKit.jl is a new Julia software package providing high-level algorithms for iPEPS tensor-network simulations of 2D quantum systems with symmetry support.
Society for Industrial and Applied Mathematics, 2 edition
6 Pith papers cite this work. Polarity classification is still indexing.
6
Pith papers citing it
citation-role summary
background 2
method 1
citation-polarity summary
representative citing papers
ADELIA is the first AD-enabled INLA system that computes exact hyperparameter gradients via a structure-exploiting multi-GPU backward pass, delivering 4.2-7.9x per-gradient speedups and 5-8x better energy efficiency than finite differences on models with up to 1.9 million latent variables.
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
Prefix parsing is solved by a grammar transformation that turns it into standard parsing on a slightly larger grammar.
The volume of central diagonal hyperplane sections of the unit n-cube is strictly monotonically increasing in n for n ≥ 3.
Controlled benchmarks show per-step residual correction (A2C2) as most effective for VLA asynchronous inference up to d=8 delays on Kinetix with over 90% solve rate, outperforming inpainting and conditioning while training-based simulation is most robust.
citing papers explorer
-
PEPSKit.jl: A Julia package for projected entangled-pair state simulations
PEPSKit.jl is a new Julia software package providing high-level algorithms for iPEPS tensor-network simulations of 2D quantum systems with symmetry support.
-
ADELIA: Automatic Differentiation for Efficient Laplace Inference Approximations
ADELIA is the first AD-enabled INLA system that computes exact hyperparameter gradients via a structure-exploiting multi-GPU backward pass, delivering 4.2-7.9x per-gradient speedups and 5-8x better energy efficiency than finite differences on models with up to 1.9 million latent variables.
-
LTBs-KAN: Linear-Time B-splines Kolmogorov-Arnold Networks
LTBs-KAN delivers linear-time B-spline evaluation in KANs plus parameter reduction via product-of-sums factorization, with competitive results on MNIST, Fashion-MNIST, and CIFAR-10.
-
Prefix Parsing is Just Parsing
Prefix parsing is solved by a grammar transformation that turns it into standard parsing on a slightly larger grammar.
-
Central diagonal sections of the $n$-cube
The volume of central diagonal hyperplane sections of the unit n-cube is strictly monotonically increasing in n for n ≥ 3.
-
Understanding Asynchronous Inference Methods for Vision-Language-Action Models
Controlled benchmarks show per-step residual correction (A2C2) as most effective for VLA asynchronous inference up to d=8 delays on Kinetix with over 90% solve rate, outperforming inpainting and conditioning while training-based simulation is most robust.