Addition on a Quantum Computer

Abstract

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 temporary carry bits. This approach also allows the addition of a classical number to a quantum superposition without encoding the classical number in the quantum register. This method also allows for massive parallelization in its execution.

8 pages, 5 figures

References in corpus (8)

• Quantum Computing
• Quantum Algorithms Revisited
• Quantum Networks for Elementary Arithmetic Operations
• Efficient Networks for Quantum Factoring
• Approximate Quantum Fourier Transform and Decoherence
• Fast versions of Shor's quantum factoring algorithm
• Factoring in a Dissipative Quantum Computer
• Quantum Carry-Save Arithmetic

Cited by in corpus (73)

• A new quantum ripple-carry addition circuit
• Quantum Risk Analysis
• The Bitter Truth About Quantum Algorithms in the NISQ Era
• Automated optimization of large quantum circuits with continuous parameters
• Fast Quantum Modular Exponentiation
• A Software Methodology for Compiling Quantum Programs
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• Toward an architecture for quantum programming
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Performing Quantum Computing Experiments in the Cloud
• Massively parallel quantum computer simulator, eleven years later
• Approximate Quantum Fourier Transform with $O(n\log (n))$ T gates
• Benchmarking gate-based quantum computers
• Oracles for Gauss's law on digital quantum computers
• An Introduction to Quantum Programming in Quipper
• Time-Sliced Quantum Circuit Partitioning for Modular Architectures
• Classification with Quantum Machine Learning: A Survey
• Optimizing Quantum Circuits for Arithmetic
• Shor's algorithm on a nearest-neighbor machine
• Practical Quantum Computing: solving the wave equation using a quantum approach
• Arithmetic Circuits for Multilevel Qudits Based on Quantum Fourier Transform
• Resource-Efficient Quantum Computing by Breaking Abstractions
• Quantum Algorithms for Solving Ordinary Differential Equations via Classical Integration Methods
• Quantum arithmetic operations based on quantum Fourier transform on signed integers
• The Efficient Preparation of Normal Distributions in Quantum Registers
• Quantum Computation Beyond the Circuit Model
• Mapping quantum circuits to modular architectures with QUBO
• Quantum circuit for the fast Fourier transform
• An $\Theta (\sqrt{n})$-depth Quantum Adder on a 2D NTC Quantum Computer Architecture
• Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs
• Tower: Data Structures in Quantum Superposition
• Fast optimization algorithms and the cosmological constant
• Reversible addition circuit using one ancillary bit with application to quantum computing
• Towards an Automated Framework for Realizing Quantum Computing Solutions
• Shor's algorithm with fewer (pure) qubits
• Shor's discrete logarithm quantum algorithm for elliptic curves
• Accelerating Grover Adaptive Search: Qubit and Gate Count Reduction Strategies with Higher-Order Formulations
• Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates
• Quantum Plain and Carry Look-Ahead Adders
• Towards Large-Scale Quantum Computation
• Secure and Efficient Two-party Quantum Scalar Product Protocol With Application to Privacy-preserving Matrix Multiplication
• Logic Synthesis for Fault-Tolerant Quantum Computers
• A space-efficient quantum computer simulator suitable for high-speed FPGA implementation
• The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
• Quantum implementation of elementary arithmetic operations
• A Benchmarking Study of Quantum Algorithms for Combinatorial Optimization
• Circuit for Shor's algorithm using 2n+3 qubits
• First-quantized eigensolver for ground and excited states of electrons under a uniform magnetic field
• Space-Efficient Simulation of Quantum Computers
• Quantum Addition Circuits and Unbounded Fan-Out
• A quantum algorithm for solving 0-1 Knapsack problems
• Optimal Estimation of States in Quantum Image Processing
• Advantages of a modular high-level quantum programming framework
• Ancilla-free Quantum Adder with Sublinear Depth
• Practical considerations for the preparation of multivariate Gaussian states on quantum computers
• QuTracer: Mitigating Quantum Gate and Measurement Errors by Tracing Subsets of Qubits
• Quantum locally linear embedding for nonlinear dimensionality reduction
• Integer Arithmetic With Hybrid Quantum-Classical Circuits
• Cosine series quantum sampling method with applications in signal and image processing
• Circuit-based Modular Implementation of Quantum Ghost Imaging
• Approximate real-time evolution operator for potential with one ancillary qubit and application to first-quantized Hamiltonian simulation
• Approximative lookup-tables and arbitrary function rotations for facilitating NISQ-implementations of the HHL and beyond
• Quantum block lookahead adders and the wait for magic states
• Efficient quantum circuits for dense and non-unitary operators
• A Quantum Performance Simulator based on fidelity and fault-path counting
• Approximation Errors
• Quantum circuit to estimate pi using quantum amplitude estimation
• Implementing Quantum Gates Using Length-3 Dynamic Quantum Walks
• Quantum Image Rotation by an arbitrary angle
• Noise robustness of a multiparty quantum summation protocol
• Benchmarking Supercomputers with the Jülich Universal Quantum Computer Simulator
• A Programming Language For Quantum Oracle Construction
• Halving the width of Toffoli based constant modular addition to n+3 qubits