1 I. V. Hoof, "Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count"
2 R. Feynman, "Simulating Physics with Computers" 21 : 467-, 1982
3 C. A. Melchor, "ROLLO: Rank-Ouroboros, Lake & Locker"
4 S. Kepley, "Quantum circuits for multiplication with subquadratic gate count" 14 (14): 2373-2386, 2015
5 V. Shende, "Quantum Information and Computation" 2008
6 D. S. Steiger, "ProjectQ: An Open Source Software Framework for Quantum Computing. Quantum"
7 D. Cheung, "On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography" 96-104, 2008
8 Join Extra Crunch, "IBM unveils its first commercial quantum computer"
9 D. J. Bernstein, "Classic McEliece:conservative code-based cryptography"
10 A. G. Aruna, "A Study on Reversible Logic Gates of Quantum Computing" 7 (7): 427-432, 2016
1 I. V. Hoof, "Space-efficient quantum multiplication of polynomials for binary finite fields with sub-quadratic Toffoli gate count"
2 R. Feynman, "Simulating Physics with Computers" 21 : 467-, 1982
3 C. A. Melchor, "ROLLO: Rank-Ouroboros, Lake & Locker"
4 S. Kepley, "Quantum circuits for multiplication with subquadratic gate count" 14 (14): 2373-2386, 2015
5 V. Shende, "Quantum Information and Computation" 2008
6 D. S. Steiger, "ProjectQ: An Open Source Software Framework for Quantum Computing. Quantum"
7 D. Cheung, "On the design and optimization of a quantum polynomial-time attack on elliptic curve cryptography" 96-104, 2008
8 Join Extra Crunch, "IBM unveils its first commercial quantum computer"
9 D. J. Bernstein, "Classic McEliece:conservative code-based cryptography"
10 A. G. Aruna, "A Study on Reversible Logic Gates of Quantum Computing" 7 (7): 427-432, 2016