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

arXiv:quant-ph/0611007

Quantum Booth's array multiplier

J. J. Álvarez-Sánchez, J.V. Alvarez-Bravo, Luis Miguel Morales Nieto

Published Oct 31, 2006• 2 citations
arXivHTMLPDF

Abstract

A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final product in 2's-complement representation.
DOI
10.48550/arxiv.quant-ph/0611007

Related papers

A quantum architecture for multiplying signed integers

J. J. Álvarez-Sánchez, J.V. Alvarez-Bravo, Luis Miguel Nieto

A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final product in 2's-complement representation.

Journal of Physics Conference Series•Aug 1, 2008•26 citations

Quantum Arithmetic for Real-Number 2’s Complement Multiplication

Wiwat Asawalertsak, Rajchawit Sarochawikasit, Prapong Prechaprapranwong

In classical computing, 2’s complement representation is essential for handling signed binary arithmetic, enabling efficient operations for both positive and negative numbers. However, many quantum multiplication circuits typically lack native support for 2’s complement, limiting their application to signed arithmetic tasks. Prior quantum multiplication algorithms capable of handling 2’s complement often demand an impractically large number of qubits. This paper introduces 3 novel quantum circuit designs for real-number 2’s complement multiplication, inspired by classical signed multiplication algorithms. These designs achieve a quadratic time complexity, comparable to RCA-based quantum unsigned multiplication algorithms, while significantly reducing qubit requirements compared to prior quantum signed multiplication schemes. The first model requires the largest number of qubits but applies to a broad range of cases; the second uses fewer qubits but requires specific multiplier conditions; and the third uses the fewest qubits but operates under stricter multiplier constraints and circuit positioning conditions. Benchmarking results demonstrate their ability to perform 2’s complement multiplication correctly. This work advances qubit-efficient solutions, laying a foundation for further development of 2’s complement-based quantum algorithms.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•0 citations

A novel reversible synthesis of array multiplier

Dipak Kumar Kole, Hafizur Rahaman, Debesh Kumar Das +2 more

Quantum computation has seen immense progress which has popularised logic synthesis with the help of reversible circuits. A reversible circuit is implemented with multiple special types of quantum gates, known as k-CNOT gates. Ion trapping or nuclear magnetic resonance are newer technologies required to emulate quantum gates. This paper presents a reversible synthesis of array multipliers based on Booths Algorithm implemented with reversible k-CNOT gates. Our work has been simulated using the online quantum simulator davyw and its features have been compared with existing reversible array multipliers.

International Symposium on Devices, Circuits and Systems (ISDCS)•Mar 1, 2018•0 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

Approximate Quantum Array Multiplier

Aden Crimmins, Sonia López Alarcón

Multiplication is a frequent computation in many algorithms, classical and quantum. This paper targets the im-plementation of quantum integer multiplication. Quantum array multipliers take inspiration from classical array multipliers, with the result of reduced circuit depth. They take advantage of the quantum phase domain, through rotations controlled by the mul-tiplier's qubits. This work further explores this implementation by applying approximate rotations. Although this approach can have an impact on the accuracy of the result, the reduction in depth can result in better outcomes when noise is involved.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•3 citations

Design Of Parity-Preserving Reversible Logic Signed Array Multipliers

Mojtaba Valinataj

Reversible logic as a new favorable design domain can be used for various fields especially creating quantum computers because of its speed and intangible power consumption. However, its susceptibility to a variety of environmental effects may lead to yield the incorrect results. In this paper, because of the importance of multiplication operation in various computing systems, some novel reversible logic array multipliers are proposed with error detection capability by incorporating the parity-preserving gates. The new designs are presented for two main parts of array multipliers, partial product generation and multi-operand addition, by exploiting the new arrangements of existing gates, which results in two signed parity-preserving array multipliers. The experimental results reveal that the best proposed 4×4 multiplier in this paper reaches 12%, 24%, and 26% enhancements in the number of constant inputs, number of required gates, and quantum cost, respectively, compared to previous design. Moreover, the best proposed design is generalized for n×n multipliers with general formulations to estimate the main reversible logic criteria as the functions of the multiplier size.

World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering•May 1, 2017•2 citations
In classical computing, 2’s complement representation is essential for handling signed binary arithmetic, enabling efficient operations for both positive and negative numbers. However, many quantum multiplication circuits typically lack native support for 2’s complement, limiting their application to signed arithmetic tasks. Prior quantum multiplication algorithms capable of handling 2’s complement often demand an impractically large number of qubits. This paper introduces 3 novel quantum circuit designs for real-number 2’s complement multiplication, inspired by classical signed multiplication algorithms. These designs achieve a quadratic time complexity, comparable to RCA-based quantum unsigned multiplication algorithms, while significantly reducing qubit requirements compared to prior quantum signed multiplication schemes. The first model requires the largest number of qubits but applies to a broad range of cases; the second uses fewer qubits but requires specific multiplier conditions; and the third uses the fewest qubits but operates under stricter multiplier constraints and circuit positioning conditions. Benchmarking results demonstrate their ability to perform 2’s complement multiplication correctly. This work advances qubit-efficient solutions, laying a foundation for further development of 2’s complement-based quantum algorithms.
Quantum computation has seen immense progress which has popularised logic synthesis with the help of reversible circuits. A reversible circuit is implemented with multiple special types of quantum gates, known as k-CNOT gates. Ion trapping or nuclear magnetic resonance are newer technologies required to emulate quantum gates. This paper presents a reversible synthesis of array multipliers based on Booths Algorithm implemented with reversible k-CNOT gates. Our work has been simulated using the online quantum simulator davyw and its features have been compared with existing reversible array multipliers.
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.
Multiplication is a frequent computation in many algorithms, classical and quantum. This paper targets the im-plementation of quantum integer multiplication. Quantum array multipliers take inspiration from classical array multipliers, with the result of reduced circuit depth. They take advantage of the quantum phase domain, through rotations controlled by the mul-tiplier's qubits. This work further explores this implementation by applying approximate rotations. Although this approach can have an impact on the accuracy of the result, the reduction in depth can result in better outcomes when noise is involved.
Reversible logic as a new favorable design domain can be used for various fields especially creating quantum computers because of its speed and intangible power consumption. However, its susceptibility to a variety of environmental effects may lead to yield the incorrect results. In this paper, because of the importance of multiplication operation in various computing systems, some novel reversible logic array multipliers are proposed with error detection capability by incorporating the parity-preserving gates. The new designs are presented for two main parts of array multipliers, partial product generation and multi-operand addition, by exploiting the new arrangements of existing gates, which results in two signed parity-preserving array multipliers. The experimental results reveal that the best proposed 4×4 multiplier in this paper reaches 12%, 24%, and 26% enhancements in the number of constant inputs, number of required gates, and quantum cost, respectively, compared to previous design. Moreover, the best proposed design is generalized for n×n multipliers with general formulations to estimate the main reversible logic criteria as the functions of the multiplier size.