Dorit Aharonov (2003):
A simple proof that Toffoli and Hadamard are quantum universal.
Available at arXiv:http://arxiv.org/abs/quant-ph/0301040quant-ph/0301040.
Matthew Amy (2019):
Towards large-scale functional verification of universal quantum circuits.
Electronic Proceedings in Theoretical Computer Science 287,
pp. 1–21,
doi:10.4204/EPTCS.287.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 at arXiv:http://arxiv.org/abs/1908.060761908.06076.
Michael J. Bremner, Richard Jozsa & Dan J. Shepherd (2011):
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
Proceedings of The Royal Society A 467(2126),
doi:10.1098/rspa.2010.0301.
Also available at arXiv:http://arxiv.org/abs/1005.14071005.1407.
Simon Forest, David Gosset, Vadym Kliuchnikov & David McKinnon (2015):
Exact synthesis of single-qubit unitaries over Clifford-Cyclotomic gate sets.
Journal of Mathematical Physics 56(8),
pp. 082201,
doi:10.1063/1.4927100.
Also available at arXiv:http://arxiv.org/abs/1501.049441501.04944.
Brett Giles & Peter Selinger (2013):
Exact synthesis of multiqubit Clifford+T circuits.
Physical Review A 87(3),
pp. 032332,
doi:10.1103/PhysRevA.87.032332.
Also available at arXiv:http://arxiv.org/abs/1212.05061212.0506.
Andrew N. Glaudell, Neil J. Ross & Jacob M. Taylor (2021):
Optimal two-qubit circuits for universal fault-tolerant quantum computation.
npj Quantum Information 7(103),
doi:10.1038/s41534-021-00424-z.
Seth E. M. Greylyn (2014):
Generators and relations for the group U_4(Z[1/2,i]).
Department of Mathematics and Statistics, Dalhousie University.
Available at arXiv:http://arxiv.org/abs/1408.62041408.6204.
Phillip Kaye, Raymond Laflamme & Michele Mosca (2007):
An Introduction to Quantum Computing.
Oxford University Press,
doi:10.1093/oso/9780198570004.001.0001.
Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler & Jon Yard (2015):
A framework for approximating qubit unitaries.
Available at arXiv:http://arxiv.org/abs/1510.038881510.03888.
Vadym Kliuchnikov, Dmitri Maslov & Michele Mosca (2013):
Fast and efficient exact synthesis of single-qubit unitaries generated by Clifford and T gates.
Quantum Information & Computation 13(7-8),
pp. 607–630,
doi:10.26421/QIC13.7-8-4.
Avaiable at arXiv:http://arxiv.org/abs/1206.52361206.5236.
Vadym Kliuchnikov, Dmitri Maslov & Michele Mosca (2016):
Practical approximation of single-qubit unitaries by single-qubit quantum Clifford and T circuits.
IEEE Transactions on Computers 65(1),
pp. 161–172,
doi:10.1109/TC.2015.2409842.
Also available at arXiv:http://arxiv.org/abs/1212.69641212.6964.
Vadym Kliuchnikov & Jon Yard (2015):
A framework for exact synthesis.
Available at arXiv:http://arxiv.org/abs/1504.043501504.04350.
Ashley Montanaro (2017):
Quantum circuits and low-degree polynomials over F_2.
Journal of Physics A 50(8),
pp. 084002,
doi:10.1088/1751-8121/aa565f.
Also available at arXiv:http://arxiv.org/abs/1607.084731607.08473.
Neil J. Ross (2015):
Optimal ancilla-Free Clifford+V approximation of z-rotations.
Quantum Information & Computation 15(11–12),
pp. 932–950,
doi:10.26421/QIC15.11-12-4.
Also available at arXiv:http://arxiv.org/abs/1409.43551409.4355.
Neil J. Ross & Peter Selinger (2016):
Optimal ancilla-free Clifford+T approximation of z-rotations.
Quantum Information & Computation 16(11–12),
pp. 901–953,
doi:10.26421/QIC16.11-12-1.
Also available at arXiv:http://arxiv.org/abs/1403.29751403.2975.
Yaoyun Shi (2003):
Both Toffoli and Controlled-NOT need little help to do universal quantum computing.
Quantum Information & Computation 3(1),
pp. 84–92,
doi:10.26421/QIC3.1-7.
Also available at arXiv:http://arxiv.org/abs/quant-ph/0205115quant-ph/0205115.
eptcs@eptcs.org