Presentation
Optimal Toffoli-Depth Quantum Adder
DescriptionEfficient 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). By extensively studying alternative compositions of the carry-propagation structure, we show that an exact Toffoli-depth of log(n)+O(1) is achievable, when no uncomputation is done. 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. Our designs, both with and without considering uncomputation are presented in detail. By conducting comprehensive theoretical and simulation-based studies, we firmly establish our claims of optimality. The results also mirror similar improvements, recently reported in classical adder circuit complexity.
Event Type
Work-in-Progress Poster
TimeTuesday, June 256:00pm - 7:00pm PDT
LocationLevel 2 Lobby
AI
Autonomous Systems
Cloud
Design
EDA
Embedded Systems
IP
Security