1. Alastair A. Abbott . 2012. The Deutsch-Jozsa problem: de-quantization and entanglement. Natural Computing, 11 ( 2012 ). Alastair A. Abbott. 2012. The Deutsch-Jozsa problem: de-quantization and entanglement. Natural Computing, 11 (2012).
2. D. Aharonov. 2003. A simple proof that Toffoli and Hadamard are qauntum universal. arXiv:quant-ph/0301040. D. Aharonov. 2003. A simple proof that Toffoli and Hadamard are qauntum universal. arXiv:quant-ph/0301040.
3. The Two-State Vector Formalism: An Updated Review
4. Towards Large-scale Functional Verification of Universal Quantum Circuits
5. Matthew Amy , Martin Roetteler , and Krysta M . Svore . 2017 . Verified Compilation of Space-Efficient Reversible Circuits. In Computer Aided Verification, Rupak Majumdar and Viktor Kunčak (Eds.). Springer International Publishing , Cham. 3–21. isbn:978-3-319-63390-9 Matthew Amy, Martin Roetteler, and Krysta M. Svore. 2017. Verified Compilation of Space-Efficient Reversible Circuits. In Computer Aided Verification, Rupak Majumdar and Viktor Kunčak (Eds.). Springer International Publishing, Cham. 3–21. isbn:978-3-319-63390-9