Forked from Quantum Computing Functions (QCF). This fork includes more algorithms and more memory efficient functions to solve larger sized problems. The Shor, Simon, Bernstein-Vazirani, Phase ...

When writing recursive functions, pay attention to the type of what you are recurring on, as well as to the type of what you want your result to be. That information ...

This paper defines boolean monadic recursive schemes (BMRSs), a restriction on recursive programs, and shows that when interpreted as transductions on strings they describe exactly the subsequential ...