Quantum arithmetic with the quantum Fourier transform

  title={Quantum arithmetic with the quantum Fourier transform},
  author={Lidia Ruiz-Perez and Juan Carlos Garc{\'i}a-Escart{\'i}n},
  journal={Quantum Information Processing},
The quantum Fourier transform offers an interesting way to perform arithmetic operations on a quantum computer. We review existing quantum Fourier transform adders and multipliers and comment some simple variations that extend their capabilities. These modified circuits can perform modular and non-modular arithmetic operations and work with signed integers. Among the operations, we discuss a quantum method to compute the weighted average of a series of inputs in the transform domain. One of the… 
Integer numeric multiplication using quantum Fourier transform
A generic structure for the multiplication of any two integers using quantum Fourier transform is proposed, applicable for different quantum applications.
Quantum arithmetic operations based on quantum Fourier transform on signed integers
The proposed arithmetic operations can perform non-modular operations on all signed numbers without any limitation by using less resources and are compared with the nearest quantum arithmetic operations.
Quantum arithmetic operations based on quantum fourier transform on signed integers
  • E. cSahin
  • Physics
    International Journal of Quantum Information
  • 2020
Novel quantum circuits of two’s complement, absolute value and comparison operations are presented by using the proposed QFT based addition and subtraction operations.
Quantum Amplitude Arithmetic
Quantum algorithm involves the manipulation of amplitudes and computational basis, of which manipulating basis is largely a quantum analogue of classical computing that is always a major contributor
The multiplier based on quantum Fourier transform
The circuit analysis shows that the proposed multiplier could reduce the number of qubits in ancillary, and the multiplication result of finite qubits can be directly obtained by using fewer quantum gates, which has reduced the resource cost of quantum multiplier greatly.
Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic
  • R. Basili, W. Qian, J. Vary
  • Computer Science
    2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  • 2022
Efficient techniques to implement QFT-based integer addition and multiplications, fundamental to various quantum applications including Shor's algorithm, weighted sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products are utilized.
3-Qubit Circular Quantum Convolution Computation using Fourier Transform with Illustrative Examples
In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of
Quantum Fourier Operators and Their Application
  • E. Sakk
  • Computer Science
    Real Perspective of Fourier Transforms and Current Developments in Superconductivity
  • 2021
This work reviews the structure of the quantum Fourier transform and its implementation, and provides a permutation structure for putting the QFT within the context of universal computation.
Quantum Fourier transform in computational basis
A new quantum scheme to encode Fourier coefficients in the computational basis, with fidelity 1 - \delta $$1-δ and digit accuracy ϵ for each Fourier coefficient is detailed.
Applications of Universal Parity Quantum Computation
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the Quantum Fourier


Quantum networks for elementary arithmetic operations.
  • Vedral, Barenco, Ekert
  • Computer Science
    Physical review. A, Atomic, molecular, and optical physics
  • 1996
This work provides an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation, and shows that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized.
Addition on a Quantum Computer
A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for
Quantum computation and quantum information
  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal
Quantum Carry-Save Arithmetic
This paper shows how to design efficient arithmetic elements out of quantum gates using "carry-save" techniques borrowed from classical computer design, which reduces the quantum gate delay from O(N^3) to O( N log N) at a cost of increasing the number of qubits required.
Quantum Arithmetic on Galois Fields
The controlled-multiplication operation, which is the only group-specific operation in Shor's algorithms for factoring and solving the Discrete Log Problem, is described, and the detailed size, width and depth complexity of such circuits are given, which ultimately will allow us to obtain detailed upper bounds on the amount of quantum resources needed to solve instances of the DLP.
Fast quantum modular exponentiation architecture for Shor's factoring algorithm
We present a novel and efficient, in terms of circuit depth, design for Shor's quantum factorization algorithm. The circuit effectively utilizes a diverse set of adders based on the Quantum Fourier
Quantum arithmetic and numerical analysis using Repeat-Until-Success circuits
We develop a method for approximate synthesis of single--qubit rotations of the form $e^{-i f(\phi_1,\ldots,\phi_k)X}$ that is based on the Repeat-Until-Success (RUS) framework for quantum circuit
Arithmetic on a distributed-memory quantum multicomputer
It is shown that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized.
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • P. Shor
  • Computer Science
    SIAM Rev.
  • 1999
Efficient randomized algorithms are given for factoring integers and finding discrete logarithms, two problems that are generally thought to be hard on classical computers and that have been used as the basis of several proposed cryptosystems.
Circuit for Shor's algorithm using 2n+3 qubits
A circuit which uses 2n + 3 qubits and 0(n3lg(n)) elementary quantum gates in a depth of 0( n3) to implement the factorization algorithm using Shor's algorithm on a quantum computer.