For those that might prefer a more functional/strongly typed approach, see Quipper (embedded in Haskell): http://www.mathstat.dal.ca/~selinger/quipper/ http://

For those that might prefer a more functional/strongly typed approach, see Quipper (embedded in Haskell): http://www.mathstat.dal.ca/~selinger/quipper/ http://www.mathstat.dal.ca/~selinger/quipper/ Unfortunately, the examples in the documentation aren't as well known as Shor's or Grover's algorithm. For Shor's, I think this is due to the difficulty of encoding the modular exponentiation within the framework.