union find in haskell, based on ST Monad, made it easy to use

This is how I decompose, analyze and reproduce the packages related to the idea of letting Monad handle computational effects (e.g. qio-haskell and monad-bayes).

a simple string formatting function for haskell, works in the similar way to python's ("{}".format(x))

naive implementation of tensor data structure in `Haskell`

`Haskell` implementation of probabilistic programming languages(`PPL`), make it easy to use && easy to follow

Vector{Vector{...}} style is convenient. Representing Multi-dimentional Array in a nested vector form.

Interface for Monad utility.

Easy way to build a docker image

"{}".format rules made string/path formatting easy in julia

MaybeTensor is just nested vectors, where every level could be Nothing or some value. Note that performance(speed) is not the core target of this project, but the flexibility. I actually tried some…

general reduction kernel motivated by keops

some useful showcase for the usage of CUDA.jl

rewriting ELBO: variational inference using symbolic rewriting techniques

precondioner optimizer for Yao.jl, include variational imaginary time evolution, quantum natural gradient, and so on

personal trial of Differentiable Architecture Search

Symbolic system for Qauntum computing, using term rewriting & equality saturation technique to manipulate quantum circuit

Ansatz-based imaginary time evolution method for quantum computing, implemented using mindquantum

This project implement the hybrid tensor network idea for quantum computing