Name
Abstract | ||
|---|---|---|
In this paper, we report efficient quantum circuits for integer multiplication using the Toom-Cook algorithm. By analyzing the recursive tree structure of the algorithm, we obtained a bound on the count of Toffoli gates and qubits. These bounds are further improved by employing reversible pebble games through uncomputing the intermediate results. The asymptotic bounds for different performance metrics of the proposed quantum circuit are superior to the prior implementations of multiplier circuits using schoolbook and Karatsuba algorithms. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1103/PhysRevA.98.012311 | PHYSICAL REVIEW A |
Field | DocType | Volume |
Quantum circuit,Toom–Cook multiplication,Quantum mechanics,Arithmetic,Multiplier (economics),Electronic circuit,Recursive tree,Qubit,Toffoli gate,Physics,Karatsuba algorithm | Journal | 98 |
Issue | ISSN | Citations |
1 | 2469-9926 | 1 |
PageRank | References | Authors |
0.38 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Srijit Dutta | 1 | 1 | 0.72 |
| Debjyoti Bhattacharjee | 2 | 26 | 9.84 |
| Anupam Chattopadhyay | 3 | 6 | 4.23 |