Exact and approximate synthesis of quantum circuits.
A library of algorithms for exact and approximate synthesis of quantum circuits over the Clifford+T gate set. This includes, among other things:
Quantum.Synthesis.GridSynth: an efficient single-qubit approximate synthesis algorithm. From N. J. Ross and P. Selinger, "Optimal ancilla-free Clifford+T approximation of z-rotations", http://arxiv.org/abs/1403.2975.Quantum.Synthesis.MultiQubitSynthesis: multi-qubit exact synthesis algorithms. From B. Giles and P. Selinger, "Exact synthesis of multiqubit Clifford+T circuits", Physical Review A 87, 032332, 2013, http://arxiv.org/abs/1212.0506.Quantum.Synthesis.CliffordT: the computation of Matsumoto-Amano normal forms. From K. Matsumoto and K. Amano, "Representation of Quantum Circuits with Clifford and π/8 Gates", http://arxiv.org/abs/0806.3834.Quantum.Synthesis.RotationDecomposition: an algorithm for decomposing multi-qubit unitary operators into one- and two-level unitaries. See e.g. Section 4.5.1 of M. A. Nielsen and I. L. Chuang, "Quantum Computation and Quantum Information", Cambridge University Press, 2002.
This package also provides an easy-to-use command line tool for single-qubit approximate synthesis.