Quantum arithmetic with the Quantum Fourier Transform

Abstract

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 propose some modifications that extend their capabilities. Among the new circuits, we propose a quantum method to compute the weighted average of a series of inputs in the transform domain.

14 pages, 5 figures. Revised version with corrected and expanded results. Comments are welcome

References in corpus (4)

• Quantum support vector machine for big data classification
• An introduction to quantum machine learning
• Fast Quantum Modular Exponentiation
• Arithmetic on a Distributed-Memory Quantum Multicomputer

Cited by in corpus (41)

• Approximate Quantum Fourier Transform with $O(n\log (n))$ T gates
• Quantum Analog-Digital Conversion
• A Modular Quantum Compilation Framework for Distributed Quantum Computing
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Quantum Fourier Transform Has Small Entanglement
• Block-encoding structured matrices for data input in quantum computing
• Constrained Optimization via Quantum Zeno Dynamics
• Quantum algorithms for anomaly detection using amplitude estimation
• Quantum arithmetic operations based on quantum Fourier transform on signed integers
• A novel approach to noisy gates for simulating quantum computers
• Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
• Quantum Monte Carlo for Economics: Stress Testing and Macroeconomic Deep Learning
• A Hybrid and Universal Blind Quantum Computation
• Quantum Algorithm for Unsupervised Anomaly Detection
• Distributed Quantum Machine Learning
• Quantum Fourier Addition, Simplified to Toffoli Addition
• Applications of Universal Parity Quantum Computation
• Quantum Multiplication Algorithm Based on the Convolution Theorem
• Everything You Always Wanted to Know About Quantum Circuits
• Quantum mean estimation for lattice field theory
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits
• Quantum Simulation of the First-Quantized Pauli-Fierz Hamiltonian
• High-fidelity state transfer via quantum walks from delocalized states
• QFT based quantum arithmetic logic unit on IBM quantum computer
• Optimizing T and CNOT Gates in Quantum Ripple-Carry Adders and Comparators
• Calculating response functions of coupled oscillators using quantum phase estimation
• Approximative lookup-tables and arbitrary function rotations for facilitating NISQ-implementations of the HHL and beyond
• Quantum Computational Insurance and Actuarial Science
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Des-q: a quantum algorithm to provably speedup retraining of decision trees
• Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation
• Tradeoff between noise and banding in a quantum adder with qudits
• Quantum Global Minimum Finder based on Variational Quantum Search
• High-performance state-vector emulator of a gate-based quantum processor implemented in the Rust programming language
• Quantum Algorithms for tensor-SVD
• Performance Evaluations of Signed and Unsigned Noisy Approximate Quantum Fourier Arithmetic
• Quantum Circuit Optimization by Graph Coloring
• Quantum oracles for the finite element method
• Fully Quantum Lattice Gas Automata Building Blocks for Computational Basis State Encodings
• Noise robustness of a multiparty quantum summation protocol