Abstract
Implementation of floating-point arithmetic with consistent rounding is a critical component of many quantum algorithms. Quantum circuit implementations for squaring and division serve as examples here. This work was motivated by ongoing work in developing quantum algorithms for scientific and engineering computing applications, where this type of arithmetic often forms part of the algorithm. A key feature of the work is the use of a reduced-precision floating-point representation of real data specifically designed for near-term future quantum computing hardware with a limited number of qubits (e.g., less than 100) and with an increased level of fault tolerance as compared to current quantum computing hardware. The quantum circuit implementations of the squaring of a floating-point number and the division of two floating-point numbers are detailed here, highlighting similarities in the quantum circuit implementation for the logical steps required for rounding-to-nearest in line with the IEEE 754 standard for the two arithmetic operations. This similarity is an important feature regarding future work where an automated generation of this type of quantum circuit from a set of standard modules and circuit templates is employed.
Reference20 articles.
1. Nielsen MA, Chuang IL. Quantum Computation and Quantum Information: 10th Anniversary Edition. 2nd ed. Cambridge: Cambridge University Press; 2010
2. Preskill J. Quantum computing in the NISQ era and beyond. Quantum. 2018;:79. DOI: 10.22331/q-2018-08-06-79
3. Draper TG. Addition on a quantum computer. 2000; 0008033. was cited in original version
4. Cuccaro SA, Draper TG, Kutin SA, Moulton DP. A new quantum ripple-carry addition circuit. 2004; 0410184. No journal version available
5. Ruiz-Perez L, Garcia-Escartin JC. Quantum arithmetic with the quantum Fourier transform. Quantum Information Processing. 2017;(6):152. DOI: 10.1007/s11128-017-1603-0