Quantum Non-Moduler Multiplication with QFT-Based Multi Input Parallelized Adder

• URL: http://arxiv.org/abs/2604.00272v2
• Date: Thu, 02 Apr 2026 11:42:37 GMT
• Title: Quantum Non-Moduler Multiplication with QFT-Based Multi Input Parallelized Adder
• Abstract summary: We propose an efficient quantum multiplication approach based on a QFT-assisted parallelized addition scheme.<n>The proposed design eliminates the repeated application of QFT and inverse QFT operations during intermediate summation processes.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this study, we propose an efficient quantum multiplication approach based on a QFT-assisted parallelized addition scheme. The multiplication stage is implemented using a structure composed entirely of Toffoli gates, which generate partial products. In the second stage, these partial results are accumulated using a QFT-based adder. Unlike conventional QFT-based arithmetic circuits, the proposed design eliminates the repeated application of QFT and inverse QFT (IQFT) operations during intermediate summation processes. This leads to a significant reduction in the total gate count and circuit complexity, enabling a more resource-efficient implementation. To demonstrate the feasibility of the proposed approach, a quantum circuit that performs the multiplication of two 3-bit numbers is designed. The circuit is tested and validated using IBM quantum simulators. The results indicate that the proposed method provides a more efficient alternative to traditional quantum multiplication techniques in terms of gate cost and circuit depth.

Related papers

• Verifiable quantum advantage in extremely low depth [52.51019642214249]
  We give a problem that is solvable by shallow quantum circuits, hard for computation in time under lattice-based assumptions.<n>We prove that shallow quantum circuits have sufficient structure to solve certain classically hard tasks whose solutions can be verified efficiently.
  arXiv  Detail & Related papers  (2026-09-01T15:54:34Z)
• Towards an Optimally Distributed Quantum Fourier Transform Circuit [6.651912879528297]
  partitioning quantum circuits requires preserving unitary operation implemented by the circuit.<n>We focus on partitioning the quantum Fourier transform (QFT) circuit, which is widely used as a subroutine in quantum algorithms.<n>We present a partitioning scheme based on optimal gate-packing, compare it against prior analytical partitioning schemes for the QFT, and evaluate it against partitions produced by general-purpose circuit partitioning algorithms.
  arXiv  Detail & Related papers  (2026-06-16T21:07:53Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• A novel quantum circuit for the quantum Fourier transform [0.0]
  We introduce a new quantum circuit for implementing the Quantum Fourier Transform.<n>We show that this circuit is more efficient than the conventional design.<n>We also develop alternative versions of the HHL algorithm and Shor's algorithm.
  arXiv  Detail & Related papers  (2025-07-11T15:51:27Z)
• Construction of Boolean Logic Gates Using QFT-Based Adder Architecture [0.0]
  We construct the quantum reversible counterparts of the logical AND, OR, XOR, NOR, and NAND gates.<n>We utilize a quantum Fourier transform (QFT)-based adder circuit that replicates the functionality of a digital half-adder.
  arXiv  Detail & Related papers  (2025-04-23T20:47:36Z)
• Optimized Quantum Circuit Partitioning Across Multiple Quantum Processors [0.6502950223731163]
  This paper addresses the challenge of scaling quantum computing by employing distributed quantum algorithms across multiple processors.<n>We propose a novel circuit partitioning method that leverages graph partitioning to optimize both qubit and gate teleportation.<n>We also formulate an integer linear program to further reduce entanglement requirements by mapping the logical resources of partitioned circuits to the physical constraints of the quantum network.
  arXiv  Detail & Related papers  (2025-01-24T22:16:31Z)
• Scalable quantum circuit design for QFT-based arithmetic [0.0]
  We create a scalable version of the quantum Fourier transform-based arithmetic circuit to perform addition and subtraction operations on N n-bit unsigned integers encoded in quantum registers. We present qubit- and ququart-based multi-input QFT adders, and we compare and discuss potential benefits such as circuit simplicity and noise sensitivity.
  arXiv  Detail & Related papers  (2024-10-31T23:34:06Z)
• Implementing multi-controlled X gates using the quantum Fourier transform [0.0]
  We show how a quantum arithmetic-based approach can be efficiently used to implement many complex quantum gates. We show how the depth of the circuit can be significantly reduced using only a few ancilla qubits.
  arXiv  Detail & Related papers  (2024-07-25T13:22:00Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
  We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
  arXiv  Detail & Related papers  (2022-09-30T02:36:42Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.