pith. sign in

arxiv: quant-ph/0008033 · v1 · submitted 2000-08-07 · 🪐 quant-ph

Addition on a Quantum Computer

classification 🪐 quant-ph
keywords quantumadditionnumberallowsclassicalcomputermethodapproach
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Accelerating Inference for Multilayer Neural Networks with Quantum Computers

    quant-ph 2025-10 unverdicted novelty 7.0

    Quantum circuits for coherent multilayer neural network inference achieve quadratic to polylogarithmic speedups over classical methods depending on quantum data access models for inputs and weights.

  2. A Quantum Spectral Method for Non-Periodic Boundary Value Problems

    math.NA 2025-11 unverdicted novelty 6.0

    Quantum spectral method solves non-periodic Dirichlet boundary value problems with polylogarithmic complexity by extending Fourier discretization with domain doubling, antisymmetric reflection, and quantum sine transform.

  3. On the practicality of quantum sieving algorithms for the shortest vector problem

    quant-ph 2024-10 unverdicted novelty 6.0

    Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.

  4. Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies

    quant-ph 2026-04 unverdicted novelty 5.0

    Crosstalk patterns between quantum circuits on IBM processors are predictable by circuit type and hardware architecture, with high intra-revision consistency and topological decoupling between lattice types.

  5. Universal Matrix Multiplication on Quantum Computer

    quant-ph 2024-08 unverdicted novelty 5.0

    Proposes a QFT-based quantum matrix multiplication framework claiming O(n) adder and O(n²) multiplier gate complexity plus a quantum Strassen variant for potential ML acceleration.

  6. Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture

    quant-ph 2025-11 unverdicted novelty 4.0

    JUQCS-50 achieves the first 50-qubit universal quantum computer simulation on the JUPITER supercomputer via CPU-GPU memory extension, adaptive encoding, and network optimization, delivering a 16.6-fold speedup over th...

  7. Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges

    quant-ph 2026-04 unverdicted novelty 3.0

    Encoding strategies for quantum fluid simulations trade off compactness against practicality in state preparation, measurement, boundary conditions, and nonlinear operations, with no single approach being universally optimal.