Quantum arithmetic operations based on quantum Fourier transform on signed integers

DOI10.1142/S0219749920500355MaRDI QIDQ5149408zbMATH OpenFDO

Authors Engin Şahin

Publication date 11 February 2021

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.00443

zbMATH Keywords

quantum additionquantum comparisonquantum computingquantum divisionquantum exponentiationquantum multiplicationquantum subtraction

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Abstract: The quantum Fourier transform (QFT) brings efficiency in many respects, especially usage of resource, for most operations on quantum computers. In this study, the existing QFT-based and non-QFT-based quantum arithmetic operations are examined. The capabilities of QFT-based addition and multiplication are improved with some modifications. The proposed operations are compared with the nearest quantum arithmetic operations. Furthermore, novel QFT-based subtraction, division and exponentiation operations are presented. The proposed arithmetic operations can perform nonmodular operations on all signed numbers without any limitation by using less resources. In addition, novel quantum circuits of two's complement, absolute value and comparison operations are also presented by using the proposed QFT-based addition and subtraction operations.

Recommendations

• Quantum arithmetic with the quantum Fourier transform
• The quantum Fourier transform based on quantum vision representation
• EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE
• An optimized quantum circuit for converting from sign-magnitude to two's complement
• Paired quantum Fourier transform with \(\log_2N\) Hadamard gates

Cites work

• A fast quantum circuit for addition with few qubits
• A logarithmic-depth quantum carry-lookahead adder
• Constant-optimized quantum circuits for modular multiplication and exponentiation
• scientific article; zbMATH DE number 5320330 (Why is no real title available?)
• Quantum arithmetic with the quantum Fourier transform
• Quantum computation and quantum information. 10th anniversary edition

Cited in

(8)

• Quantum arithmetic with the quantum Fourier transform
• T-count optimized Wallace tree integer multiplier for quantum computing
• An optimized quantum circuit for converting from sign-magnitude to two's complement
• Quantum fast corner detection algorithm
• An improved QFT-based quantum comparator and extended modular arithmetic using one ancilla qubit
• Integer numeric multiplication using quantum Fourier transform
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Quantum divisive hierarchical clustering based on Manhattan distance

This page was built for publication: Quantum arithmetic operations based on quantum Fourier transform on signed integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149408)