Quantum Modular Adder over GF(2n − 1) without Saving the Final Carry
Round 1
Reviewer 1 Report
In the article entitled "Quantum Modular Adder over GF(2^n-1) without Saving Final Carry" authors designed, optimized, and simulated quantum addition circuit. I found the article well designed, it's easy to read. Conclusions and economic value of proposed solutions are important and clearly presented.
I have just two comments on the article:
1. Can authors slightly expand simulation results. There is just one sentence in lines 199-200 describing the results of the simulation.
2. The is one missing number of Figure in line 105:
"steps 4 to 7 through the Not gate and the CNOT (CONTROL-NOT) gate, as shown in Figure??."
Author Response
Please see the attachment.
Author Response File: 
Author Response.pdf
Reviewer 2 Report
I found a paper of the authors related to the present work is recently published. See "Quantum Modular Multiplication" IEEE Access 8, 213244 (2020). However, the authors did not cite this paper and discuss the relations between them. I think the authors need to detail the similarity and connections of the concepts and methods of these two works. The idea, result, and method presented in this paper are not clearly shown in the present manuscript. Therefore, I suggest that the authors clarify this point before a decision on their work can be made.
Author Response
Please see the attachment.
Author Response File: Author Response.pdf
