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

Journal of Physics Conference Series

Four Arithmetic Operations on the Quantum Computer

Yong Zhang

Published Jun 1, 2020• 10 citations
Publisher

Abstract

Abstract Quantum computer has been proved to be superior to electronic computer in solving some NP problems. Based on the former quantum adder, this paper proposes a new quantum adder and quantum subtracter, and then designs a fixed-point quantum multiplier and a fixed-point quantum divider based on fixed-point number operations. Four arithmetic units are presented using quantum gate circuits. These researches lay a foundation for the quantum implementation of digital filters.

DOI
10.1088/1742-6596/1575/1/012037

Related papers

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 Computer Arithmetic Logic Unit

Amit Kumar Dutta

The feasibility of Quantum Computer with Super Computing capability is addressed here. We describe a Arithmetic Logic Unit for Quantum Computer and show how the algebra is modified if the information is kept in phase for Radix-4 operation. We formulate Quaternary adder, subtractor, multiplier and divider circuits using basic quantum gates.

•Jan 1, 2014•0 citations

A Feasible Design of Elementary Quantum Arithmetic Logic Units for Near-Term Quantum Computers

Junxu Li

Quantum arithmetic logic units (QALUs) constitute a fundamental component of quantum computing. However, the implementation of QALUs on near-term quantum computers remains a substantial challenge, largely due to the limited connectivity of qubits. In this paper, we propose feasible QALUs, including quantum binary adders, subtractors, multipliers, and dividers, which are designed for near-term quantum computers with qubits arranged in two-dimensional arrays. Additionally, we introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. The proposed QALUs utilize only Pauli-X gates, CNOT gates, and $C\sqrt{X}$ (CSX) gates, and all two-qubit gates are operated between nearest neighbor qubits. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.

arXiv:2408.06561•Aug 13, 2024•0 citations

Designing reversible arithmetic, logic circuit to implement micro-operation in quantum computation

Gunajit Kalita, Navajit Saikia

The futuristic computing is desired to be more power full with low-power consumption.That is why quantum computing has been a key area of research for quite some time and is getting more and more attention.Quantum logic being reversible, a significant amount of contributions has been reported on reversible logic in recent times.Reversible circuits are essential parts of quantum computers, and hence their designs are of great importance.In this paper, designs of reversible circuits are proposed using a recently proposed reversible gate for arithmetic and logic operations to implement various micro-operations (simple add and subtract, add with carry, subtract with borrow, transfer, incrementing, decrementing etc., and logic operations like XOR, XNOR, complementing etc.) in a reversible computer like quantum computer.The two new reversible designs proposed here for half adder and full adders are also used in the presented reversible circuits to implement various microoperations.The quantum costs of these designs are comparable.Many of the implemented micro-operations are not seen in previous literatures.The performances of the proposed circuits are compared with existing designs wherever available.

Journal of Physics Conference Series•Oct 1, 2016•1 citation

The implementation of the enhanced quantum floating-point adder

Shantao Zhao, Hai-Sheng Li, Guiqiong Li +1 more

The quantum adder is a vital arithmetic operation for quantum algorithms. However, the existing quantum floating-point adders only considered the case of two normal numbers. In this paper, we propose an enhanced quantum floating-point adder based on IEEE 754 standard. First, we divide quantum floating-point adders into four cases: the normal case, subnormal case, mixed case, and special case. Then, we propose a result-sign and mantissa-sign determining unit to avoid conversion from sign-magnitude to two complements. Moreover, we design a new quantum leading zero detector with the optimized T-depth and T-count. Comparison results reveal that the proposed floating-point adder has lower circuit width, T-depth, and T-count than the current works.

Modern Physics Letters A•Aug 30, 2022•3 citations

Quantum logic gates and circuits

Vinod Kumar Khanna

A quantum gate is the quantum analog of the classical logic gate of digital computers. It is a basic structural unit of a quantum circuit which operates on a small number of qubits to deliver a predefined output. A quantum circuit is a graphical representation of the sequence of the quantum gates used and the measurements performed in a quantum computation. Various quantum logic gates, namely, the Hadamard, T phase, NOT, Pauli-X, controlled NOT (CNOT), controlled-Z, SWAP and controlled phase gates as well as higher-level Toffoli and Fredkin gates are described. Conventions of reading quantum circuit diagrams are explained. Operation of a quantum full adder consisting of registers and gates is discussed, elaborating the role of the NOT gate, the sum calculation with CNOTgates and the carry C-out calculation with Toffoli gates. A primary tool used for performing arithmetic operations on a quantum computer is the quantum Fourier transform (QFT). The QFT adder and multiplier circuits are presented.

Institute of Physics eBooks•Jan 1, 2025•0 citations
Abstract Quantum computer has been proved to be superior to electronic computer in solving some NP problems. Based on the former quantum adder, this paper proposes a new quantum adder and quantum subtracter, and then designs a fixed-point quantum multiplier and a fixed-point quantum divider based on fixed-point number operations. Four arithmetic units are presented using quantum gate circuits. These researches lay a foundation for the quantum implementation of digital filters.
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.
Quantum arithmetic logic units (QALUs) constitute a fundamental component of quantum computing. However, the implementation of QALUs on near-term quantum computers remains a substantial challenge, largely due to the limited connectivity of qubits. In this paper, we propose feasible QALUs, including quantum binary adders, subtractors, multipliers, and dividers, which are designed for near-term quantum computers with qubits arranged in two-dimensional arrays. Additionally, we introduce a feasible quantum arithmetic operation to compute the two's complement representation of signed integers. The proposed QALUs utilize only Pauli-X gates, CNOT gates, and CXC\sqrt{X}CX​ (CSX) gates, and all two-qubit gates are operated between nearest neighbor qubits. Our work demonstrates a viable implementation of QALUs on near-term quantum computers, advancing towards scalable and resource-efficient quantum arithmetic operations.
The futuristic computing is desired to be more power full with low-power consumption.That is why quantum computing has been a key area of research for quite some time and is getting more and more attention.Quantum logic being reversible, a significant amount of contributions has been reported on reversible logic in recent times.Reversible circuits are essential parts of quantum computers, and hence their designs are of great importance.In this paper, designs of reversible circuits are proposed using a recently proposed reversible gate for arithmetic and logic operations to implement various micro-operations (simple add and subtract, add with carry, subtract with borrow, transfer, incrementing, decrementing etc., and logic operations like XOR, XNOR, complementing etc.) in a reversible computer like quantum computer.The two new reversible designs proposed here for half adder and full adders are also used in the presented reversible circuits to implement various microoperations.The quantum costs of these designs are comparable.Many of the implemented micro-operations are not seen in previous literatures.The performances of the proposed circuits are compared with existing designs wherever available.
The quantum adder is a vital arithmetic operation for quantum algorithms. However, the existing quantum floating-point adders only considered the case of two normal numbers. In this paper, we propose an enhanced quantum floating-point adder based on IEEE 754 standard. First, we divide quantum floating-point adders into four cases: the normal case, subnormal case, mixed case, and special case. Then, we propose a result-sign and mantissa-sign determining unit to avoid conversion from sign-magnitude to two complements. Moreover, we design a new quantum leading zero detector with the optimized T-depth and T-count. Comparison results reveal that the proposed floating-point adder has lower circuit width, T-depth, and T-count than the current works.
A quantum gate is the quantum analog of the classical logic gate of digital computers. It is a basic structural unit of a quantum circuit which operates on a small number of qubits to deliver a predefined output. A quantum circuit is a graphical representation of the sequence of the quantum gates used and the measurements performed in a quantum computation. Various quantum logic gates, namely, the Hadamard, T phase, NOT, Pauli-X, controlled NOT (CNOT), controlled-Z, SWAP and controlled phase gates as well as higher-level Toffoli and Fredkin gates are described. Conventions of reading quantum circuit diagrams are explained. Operation of a quantum full adder consisting of registers and gates is discussed, elaborating the role of the NOT gate, the sum calculation with CNOTgates and the carry C-out calculation with Toffoli gates. A primary tool used for performing arithmetic operations on a quantum computer is the quantum Fourier transform (QFT). The QFT adder and multiplier circuits are presented.