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/0403048

Quantum implementation of elementary arithmetic operations

Giuseppe Florio, DOMENICO PICCA

Published Mar 5, 2004• 19 citations
arXivHTMLPDF

Abstract

Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have tried to conceive some implementations for quantum algorithms. We present here some explicit schemes for executing elementary arithmetic operations.

DOI
10.48550/arxiv.quant-ph/0403048

Related papers

A comprehensive study of quantum arithmetic circuits

Siyi Wang, Xiufan Li, Wei Lee +3 more

In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared with their classical counterparts, with Shor's algorithm serving as a prominent illustration. Quantum arithmetic circuits, which are the fundamental building blocks in numerous quantum algorithms, have attracted much attention. Despite extensive exploration of various designs in the existing literature, researchers remain keen to develop novel designs and improve existing ones. In this review article, we aim to provide a systematically organized and easily comprehensible overview of the current state of the art in quantum arithmetic circuits. Specifically, this study covers fundamental operations such as addition, subtraction, multiplication, division and modular exponentiation. We delve into the detailed quantum implementations of these prominent designs and evaluate their efficiency considering various objectives. We also discuss potential applications of the presented arithmetic circuits and suggest future research directions.This article is part of the theme issue 'Emerging technologies for future secure computing platforms'.

arXiv:2406.03867•Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 16, 2025•41 citations

Quantum Arithmetic Circuits: A Survey

Yasuhiro Takahashi

Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2009•34 citations

QUANTUM COMPUTATION: AN INTRODUCTION

Adriano Barenco

When applied to computation, quantum mechanics opens completely new perspectives; by exploiting quantum mechanical features such as entanglement or super-position, one can solve some problems much more efficiently than with classical computers. One of the most striking examples is the factoring problem. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. In this contribution, we present the basic notion of quantum computation and review the most common quantum algorithms discovered so far.

WORLD SCIENTIFIC eBooks•Oct 1, 1998•13 citations

Practical Quantum Computing: Solving the Wave Equation Using a Quantum Approach

Adrien Suau, Gabriel Staffelbach, Henri Calandra

In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.

arXiv:2003.12458•ACM Transactions on Quantum Computing•Feb 10, 2021•62 citations

Arithmetic circuits for quantum computing: a software library

Lorenzo Raggi

Nowadays, quantum computers are capturing the attention of researchers because of their potential capability to solve problems otherwise not solvable with classical computers. In parallel to the constant research aimed at solving problems related to the physical implementation of such computers, there is also another branch of research trying to develop quantum algorithms. Many of the existing algorithms today need to perform arithmetic operations. In this thesis, the development of a software library of quantum arithmetic circuits - capable of interfacing with the main languages related to the world of Quantum Computing, such as Qiskit, Cirq and T-ket - is presented. With the aim of implementing this software library, the basics of quantum computation were first studied and subsequently an extensive bibliographic research was carried out, aimed at identifying the best performing arithmetic circuits currently available. After determining the circuits to be implemented, the software development has begun using the Python language. During the development of the library, with the aim of making simpler future development, code's modularity - by organizing the general package in many subpackages - and readability - by respecting the guidelines proposed in the PEP8 style guide - were looked for. In addition to what has already been said, a detailed documentation has been produced using Sphinx. Once the development of the library was completed, the functionality of each circuit was tested with simulations on classical computers; moreover, some components were tested on real free-accessible quantum computers, in order to characterize their behavior. Even though the results obtained on real hardware proved that many of the circuits implemented in this library will be reliably executed by more sophisticated and performing quantum computers, this library can be currently employed in an effective way in the simulation of quantum circuits on classical computers.

•Oct 23, 2020•0 citations

Efficient implementation of quantum arithmetic operation circuits

Heng Fan

Science China Physics Mechanics and Astronomy•Nov 26, 2020•2 citations
Quantum computation has received great attention in recent years for its possible application to difficult problem in classical calculation. Despite the experimental problems of implementing quantum devices, theoretical physicists have tried to conceive some implementations for quantum algorithms. We present here some explicit schemes for executing elementary arithmetic operations.
In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared with their classical counterparts, with Shor's algorithm serving as a prominent illustration. Quantum arithmetic circuits, which are the fundamental building blocks in numerous quantum algorithms, have attracted much attention. Despite extensive exploration of various designs in the existing literature, researchers remain keen to develop novel designs and improve existing ones. In this review article, we aim to provide a systematically organized and easily comprehensible overview of the current state of the art in quantum arithmetic circuits. Specifically, this study covers fundamental operations such as addition, subtraction, multiplication, division and modular exponentiation. We delve into the detailed quantum implementations of these prominent designs and evaluate their efficiency considering various objectives. We also discuss potential applications of the presented arithmetic circuits and suggest future research directions.This article is part of the theme issue 'Emerging technologies for future secure computing platforms'.
Quantum circuits for elementary arithmetic operations are important not only for implementing Shor's factoring algorithm on a quantum computer but also for understanding the computational power of small quantum circuits, such as linear-size or logarithmic-depth quantum circuits. This paper surveys some recent approaches to constructing efficient quantum circuits for elementary arithmetic operations and their applications to Shor's factoring algorithm. It covers addition, comparison, and the quantum Fourier transform used for addition.
When applied to computation, quantum mechanics opens completely new perspectives; by exploiting quantum mechanical features such as entanglement or super-position, one can solve some problems much more efficiently than with classical computers. One of the most striking examples is the factoring problem. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. In this contribution, we present the basic notion of quantum computation and review the most common quantum algorithms discovered so far.
In the last few years, several quantum algorithms that try to address the problem of partial differential equation solving have been devised: on the one hand, “direct” quantum algorithms that aim at encoding the solution of the PDE by executing one large quantum circuit; on the other hand, variational algorithms that approximate the solution of the PDE by executing several small quantum circuits and making profit of classical optimisers. In this work, we propose an experimental study of the costs (in terms of gate number and execution time on a idealised hardware created from realistic gate data) associated with one of the “direct” quantum algorithm: the wave equation solver devised in [32]. We show that our implementation of the quantum wave equation solver agrees with the theoretical big-O complexity of the algorithm. We also explain in great detail the implementation steps and discuss some possibilities of improvements. Finally, our implementation proves experimentally that some PDE can be solved on a quantum computer, even if the direct quantum algorithm chosen will require error-corrected quantum chips, which are not believed to be available in the short-term.
Nowadays, quantum computers are capturing the attention of researchers because of their potential capability to solve problems otherwise not solvable with classical computers. In parallel to the constant research aimed at solving problems related to the physical implementation of such computers, there is also another branch of research trying to develop quantum algorithms. Many of the existing algorithms today need to perform arithmetic operations. In this thesis, the development of a software library of quantum arithmetic circuits - capable of interfacing with the main languages related to the world of Quantum Computing, such as Qiskit, Cirq and T-ket - is presented. With the aim of implementing this software library, the basics of quantum computation were first studied and subsequently an extensive bibliographic research was carried out, aimed at identifying the best performing arithmetic circuits currently available. After determining the circuits to be implemented, the software development has begun using the Python language. During the development of the library, with the aim of making simpler future development, code's modularity - by organizing the general package in many subpackages - and readability - by respecting the guidelines proposed in the PEP8 style guide - were looked for. In addition to what has already been said, a detailed documentation has been produced using Sphinx. Once the development of the library was completed, the functionality of each circuit was tested with simulations on classical computers; moreover, some components were tested on real free-accessible quantum computers, in order to characterize their behavior. Even though the results obtained on real hardware proved that many of the circuits implemented in this library will be reliably executed by more sophisticated and performing quantum computers, this library can be currently employed in an effective way in the simulation of quantum circuits on classical computers.