1. Toffoli, T. Lecture Notes in Computer Science: Reversible Computing Vol. 85 (Springer, 1980).
2. Shi, Y. Both Toffoli and controlled-NOT need little help to do universal quantum computing. Quantum Inf. Comput. 3, 84–92 (2003).
3. Aharonov, D. A simple proof that Toffoli and Hadamard are quantum universal. Preprint at https://arxiv.org/abs/quant-ph/0301040 (2003).
4. Häner, T., Roetteler, M. & Svore, K. M. Factoring using 2n+2 qubits with Toffoli based modular multiplication. Quantum Inf. Comput. 17, 673 (2017).
5. Gidney, C. & Ekerå, M. How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits. Quantum 5, 433 (2021).