Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

CCF Transactions on High Performance Computing

The multiplier based on quantum Fourier transform

AnQi Zhang, Xuemei Wang, Shengmei Zhao

Published Jul 20, 2020• 3 citations
Publisher
DOI
10.1007/s42514-020-00040-x

Related papers

Quantum Matrix Multiplier

Hong Li, Nan Jiang, Zichen Wang +2 more

International Journal of Theoretical Physics•Jun 1, 2021•15 citations

IMPLEMENTATION OF QUANTUM ARITHMETIC OPERATIONS WITH INTEGER CHARACTERS USING THE QUANTUM FOURIER TRANSFORM

Aksultan Mukhanbet, Moldir Nakibayeva, Beimbet Daribayev

It has been proven that a quantum computer is superior to an electronic com puter in solving some NP problems. Based on quantum operations, this article proposes a new quantum sum and quantum multiplication, and then the floating point quantum multiplier and quantum sum are created on the basis of fixed point number operations. These studies lay the foundation for the quantum implementation of digital filters. This article provides a new way to calculate the summator on a quantum computer. This method uses the quantum Fourier transform (QFT) and reduces the number of qubits needed to be added by eliminating the need to temporarily transfer bits. This approach also allows you to add a classical number to a quantum superposition without encoding a classical number in a quantum register. This method also allows for mass parallelization during its execution. Adding and multiplying capabilities based on QFT are improved with some changes. The proposed operations are compared with the operations of close quantum arithmetic.

Journal of problem in computer science and information technologies•Apr 3, 2023•2 citations

Quantum Array Multiplier

Aden Crimmins, Sonia López Alarcón, Matthew Klein +2 more

This paper proposes a new and improved implementation of a quantum integer multiplier. Performing arithmetic computations is sometimes a necessary step in the implementation of quantum algorithms. In this work, Quantum Fourier Transform is used in order to perform scalable arithmetic in a generic bit-width quantum system. In the phase domain, addition can be implemented through accumulated controlled rotations on the qubits’ state. Leveraging this, and inspired by the classical implementation of an array multiplier, a new integer multiplier is fully designed and tested in a quantum environment.The depth of a quantum circuit is the number of computational steps necessary to completion, and it is a key parameter that reflects on the performance of the design. The new design reduces the quantum depth of the design from the exponential order of the previously proposed designs to polynomial order.

IEEE International Conference on Rebooting Computing (ICRC)•Dec 5, 2023•3 citations

The Quantum Fourier Transform

Marco O. Lanzagorta, Jeffrey K. Uhlmann

Synthesis lectures on quantum computing•Jan 1, 2008•3 citations

Quantum Fourier Transform

Andreas Wichert

Chapman & Hall/CRC eBooks•Nov 28, 2023•1 citation

Matrix-based perspective to quantum multiplication

Pedro Juan Roig, Salvador Alcaraz, Katja Gilly +2 more

The Quantum Fourier Transform (QFT) is a key component in many quantum circuit designs and algorithms. In this paper, a matrix-based approach is used to study the design and outcomes of an ancilla-free, QFT-based quantum circuit for multiplying a pair of 2-qubit strings. Additionally, a graphical method to calculate QFT and IQFT matrices has been proposed.

International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE)•Apr 18, 2026•0 citations
It has been proven that a quantum computer is superior to an electronic com puter in solving some NP problems. Based on quantum operations, this article proposes a new quantum sum and quantum multiplication, and then the floating point quantum multiplier and quantum sum are created on the basis of fixed point number operations. These studies lay the foundation for the quantum implementation of digital filters. This article provides a new way to calculate the summator on a quantum computer. This method uses the quantum Fourier transform (QFT) and reduces the number of qubits needed to be added by eliminating the need to temporarily transfer bits. This approach also allows you to add a classical number to a quantum superposition without encoding a classical number in a quantum register. This method also allows for mass parallelization during its execution. Adding and multiplying capabilities based on QFT are improved with some changes. The proposed operations are compared with the operations of close quantum arithmetic.
This paper proposes a new and improved implementation of a quantum integer multiplier. Performing arithmetic computations is sometimes a necessary step in the implementation of quantum algorithms. In this work, Quantum Fourier Transform is used in order to perform scalable arithmetic in a generic bit-width quantum system. In the phase domain, addition can be implemented through accumulated controlled rotations on the qubits’ state. Leveraging this, and inspired by the classical implementation of an array multiplier, a new integer multiplier is fully designed and tested in a quantum environment.The depth of a quantum circuit is the number of computational steps necessary to completion, and it is a key parameter that reflects on the performance of the design. The new design reduces the quantum depth of the design from the exponential order of the previously proposed designs to polynomial order.