1. Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 32, 818–830 (2013)
2. Barenco, A., Bennett, C.H., Cleve, R., Di Vincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52, 3457–3467 (1995)
3. Gosset, D., Kliuchnikov, V., Mosca, M., Russo, V.: An algorithm for the T-Count. arXiv quant-ph: 1308.4134v1 (2013)
4. Maslov, D., Dueck, G.W., Miller, D.M., Negrevergne, C.: Quantum circuit simplification and level compaction. IEEE Trans. CAD Integr. Circ. Syst. 27(3), 436–444 (2008)
5. Moraga, C.: Hybrid GF(2) – boolean expressions for quantum computing circuits. In: De Vos, A., Wille, R. (eds.), RC 2011, LNCS 7165, pp. 54–63. Springer, Berlin (2012)