References

  1. Matthew Amy, Andrew N. Glaudell & Neil J. Ross (2020): Number-theoretic characterizations of some restricted Clifford+T circuits. Quantum 4, pp. 252, doi:10.22331/q-2020-04-06-252. Also available from arXiv:1908.06076.
  2. Matthew Amy & Michele Mosca (2019): T-count optimization and Reed-Muller codes. IEEE Transactions on Information Theory 65(8), pp. 4771–4784, doi:10.1109/TIT.2019.2906374. Also available from arXiv:1601.07363.
  3. Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Fast and effective techniques for T-count reduction via spider nest identities. In: Steven T. Flammia: 15th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2020), Leibniz International Proceedings in Informatics (LIPIcs) 158. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 11:1–11:23, doi:10.4230/LIPIcs.TQC.2020.11. Also available from arXiv:2004.05164.
  4. Niel de Beaudrap, Xiaoning Bian & Quanlong Wang (2020): Techniques to reduce π/4-parity-phase circuits, motivated by the ZX calculus. In: Proceedings of the 16th International Conference on Quantum Physics and Logic, QPL 2019, Electronic Proceedings in Theoretical Computer Science 318, pp. 131149, doi:10.4204/eptcs.318.9. Also available from arXiv:1911.09039.
  5. Brett Giles & Peter Selinger (2013): Exact synthesis of multiqubit Clifford+T circuits. Physical Review A 87, pp. 032332 (7 pages), doi:10.1103/PhysRevA.87.032332. Also available from arXiv:1212.0506.
  6. Seth E. M. Greylyn (2014): Generators and relations for the group U_4(Z[12,i]). M.Sc.\@m thesis. Dalhousie University. Available from arXiv:1408.6204.
  7. Luke E. Heyfron & Earl T. Campbell (2018): An efficient quantum compiler that reduces T count. Quantum Science and Technology 4(1), pp. 015004, doi:10.1088/2058-9565/aad604. Also available from http://arxiv.org/abs/1712.01557arXiv:1712.01557.
  8. Kenneth Ireland & Michael Rosen (1982): A Classical Introduction to Modern Number Theory. Graduate Texts in Mathematics 84. Springer, doi:10.1007/978-1-4757-2103-4.
  9. Aleks Kissinger & John van de Wetering (2020): Reducing the number of non-Clifford gates in quantum circuits. Phys. Rev. A 102, pp. 022406, doi:10.1103/PhysRevA.102.022406.
  10. Sarah Meng Li, Neil J. Ross & Peter Selinger (2021): Generators and relations for the group O_n(Z[1/2]). In: Proceedings of the 18th International Conference on Quantum Physics and Logic, QPL 2021, Electronic Proceedings in Theoretical Computer Science. Also available from http://arxiv.org/abs/2106.01175arXiv:2106.01175.
  11. Yunseong Nam, Neil J. Ross, Yuan Su, Andrew M. Childs & Dmitri Maslov (2018): Automated optimization of large quantum circuits with continuous parameters. Npj Quantum Information 4(1), doi:10.1038/s41534-018-0072-4. Also available from http://arxiv.org/abs/1710.07345arXiv:1710.07345.
  12. Fang Zhang & Jianxin Chen (2019): Optimizing T gates in Clifford+T circuit as π/4 rotations around Paulis. Available from http://arxiv.org/abs/1903.12456arXiv:1903.12456.

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org