Optimal Toffoli-Depth Quantum Adder (2405.02523v1)
Abstract: Efficient quantum arithmetic circuits are commonly found in numerous quantum algorithms of practical significance. Till date, the logarithmic-depth quantum adders includes a constant coefficient k >= 2 while achieving the Toffoli-Depth of klog n + O(1). In this work, 160 alternative compositions of the carry-propagation structure are comprehensively explored to determine the optimal depth structure for a quantum adder. By extensively studying these structures, it is shown that an exact Toffoli-Depth of log n + O(1) is achievable. This presents a reduction of Toffoli-Depth by almost 50% compared to the best known quantum adder circuits presented till date. We demonstrate a further possible design by incorporating a different expansion of propagate and generate forms, as well as an extension of the modular framework. Our paper elaborates on these designs, supported by detailed theoretical analyses and simulation-based studies, firmly substantiating our claims of optimality. The results also mirror similar improvements, recently reported in classical adder circuit complexity.
- Richard Brent and Hsiang Kung. 2004. A Regular Layout for Parallel Adders. IEEE Trans. Comput. 31 (06 2004). https://doi.org/10.1109/TC.1982.1675982
- A new quantum ripple-carry addition circuit. arXiv:quant-ph/0410184 [quant-ph]
- A logarithmic-depth quantum carry-lookahead adder. Quantum Information and Computation 6 (07 2004). https://doi.org/10.26421/QIC6.4-5-4
- Craig Gidney. 2018. Halving the cost of quantum addition. Quantum 2 (June 2018), 74. https://doi.org/10.22331/q-2018-06-18-74
- Stephan Held and Sophie Theresa Spirkl. 2017. Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two. ACM Trans. Algorithms 14, 1, Article 4 (dec 2017), 18 pages. https://doi.org/10.1145/3147215
- Peter M. Kogge and Harold S. Stone. 1973. A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations. IEEE Trans. Comput. C-22, 8 (1973), 786–793. https://doi.org/10.1109/TC.1973.5009159
- Optimized Quantum Circuit Implementation of Payoff Function. 1–6. https://doi.org/10.1109/VLSI-SoC57769.2023.10321843
- Huei Ling. 1966. High Speed Binary Parallel Adder. IEEE Transactions on Electronic Computers EC-15, 5 (1966), 799–802. https://doi.org/10.1109/PGEC.1966.264571
- T-Count Optimized Wallace Tree Integer Multiplier for Quantum Computing. International Journal of Theoretical Physics 60 (08 2021), 1–13. https://doi.org/10.1007/s10773-021-04864-3
- Peter Shor. 1996. Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings of 35th Annual Symposium on Foundations of Computer Science (10 1996). https://doi.org/10.1109/SFCS.1994.365700
- J. Sklansky. 1960. Conditional-Sum Addition Logic. Electronic Computers, IRE Transactions on EC-9 (07 1960), 226 – 231. https://doi.org/10.1109/TEC.1960.5219822
- Yasuhiro Takahashi and Noboru Kunihiro. 2008. A fast quantum circuit for addition with few qubits. Quantum Information and Computation 8 (07 2008), 636–649. https://doi.org/10.26421/QIC8.6-7-5
- Quantum Addition Circuits and Unbounded Fan-Out. Quantum Information and Computation 10 (10 2009). https://doi.org/10.26421/QIC10.9-10-12
- Quantum Networks for Elementary Arithmetic Operations. Physical Review A 54 (11 1995). https://doi.org/10.1103/PhysRevA.54.147
- Improved quantum ripple-carry addition circuit. Science China Information Sciences 59 (02 2016). https://doi.org/10.1007/s11432-015-5411-x
- A Higher Radix Architecture for Quantum Carry-lookahead Adder. Scientific Reports 13 (09 2023). https://doi.org/10.1038/s41598-023-41122-4
- Siyi Wang and Anupam Chattopadhyay. 2023. Reducing Depth of Quantum Adder using Ling Structure. In VLSI-SoC.
- Boosting the Efficiency of Quantum Divider through Effective Design Space Exploration. arXiv:2403.01206 [quant-ph]