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/0105133 · Computer Physics Communications

A quantum full adder for a scalable nuclear spin quantum computer

G.P. Berman, G.D. Doolen, G.V. López, V.I. Tsifrinovich

Published Jul 1, 2002• 5 citations
arXivHTMLPDF
DOI
10.1016/s0010-4655(02)00423-x

Related papers

A Quantum Full Adder for a Scalable Nuclear Spin Quantum Computer

Berman, G P, Doolen, G D, López, G V +1 more

We demonstrate a strategy for implementation a quantum full adder in a spin chain quantum computer. As an example, we simulate a quantum full adder in a chain containing 201 spins. Our simulations also demonstrate how one can minimize errors generated by non-resonant effects.

•May 25, 2001•6 citations

Toward a Silicon-Based Nuclear-Spin Quantum Computer

R. G. Clark, P. C. Hammel, Andrew S. Dzurak +4 more

•Jan 1, 2002•1 citation

MODELING FULL ADDER IN ISING SPIN QUANTUM COMPUTER WITH 1000 QUBITS USING QUANTUM MAPS

D. I. Kamenev, G. P. Berman, Richard B. Kassman +1 more

The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.

arXiv:quant-ph/0403085•International Journal of Quantum Information•Aug 30, 2004•3 citations

A silicon-based nuclear spin quantum computer

Bruce E. Kane

Nature•May 1, 1998•3,778 citations

SILICON-BASED NUCLEAR SPIN QUANTUM COMPUTER

Hsi‐Sheng Goan

•Oct 1, 2005•6 citations

Design and Analysis of Quantum Binary Adder-Subtractor Using IBM Qiskit

Rajan Singh, S V S Prasad, Kiran Dasari +3 more

In this paper, an n-bit Quantum Binary Adder-Subtractor (QBAS) is designed using quantum logic gates using IBM Qiskit. A comprehensive understanding of the principles of quantum computing and quantum logic gates is also provided. As the fundamental module of a binary adder-subtractor circuit is a full adder, various designs of quantum full adders (QFAs) from the literature are investigated on various aspects to deliberately choose the best quantum full adder suitable for QBAS application. A QBAS circuit is thus designed using the selected QFA, analyzed and tested for its ability to replicate the output of its classical counterpart. The results obtained here will aid researchers in the design of Quantum Arithmetic Logic Units (QALUs), Quantum multipliers, dividers, and other scalable adder circuits. The proposed circuits and its results shown here expected to pave the way for design of compact and state of the art quantum adders with reduced number of qubits, quantum cost.

International Conference on Circuits, Power and Intelligent Systems (CCPIS)•Sep 1, 2023•3 citations
The quantum adder is an essential attribute of a quantum computer, just as classical adder is needed for operation of a digital computer. We model the quantum full adder as a realistic complex algorithm on a large number of qubits in an Ising spin quantum computer. Our results are an important step toward effective modeling of the quantum modular adder which is needed for Shor's and other quantum algorithms. Our full adder has the following features. (i) The near-resonant transitions with small detunings are completely suppressed, which allows us to decrease errors by several orders of magnitude and to model a 1000-qubit full adder. (We add a 1000-bit number using 2001 spins.) (ii) We construct the full adder gates directly as sequences of radio-frequency pulses, rather than breaking them down into generalized logical gates, such as Control-Not and one qubit gates. This substantially reduces the number of pulses needed to implement the full adder. (The maximum number of pulses required to add one bit (F-gate) is 15.) (iii) Full adder is realized in a homogeneous spin chain. (iv) The phase error is minimized: the F-gates generate approximately the same phase for different states of the superposition. (v) Modeling of the full adder is performed using quantum maps instead of differential equations. This allows us to reduce the calculation time to a reasonable value.
In this paper, an n-bit Quantum Binary Adder-Subtractor (QBAS) is designed using quantum logic gates using IBM Qiskit. A comprehensive understanding of the principles of quantum computing and quantum logic gates is also provided. As the fundamental module of a binary adder-subtractor circuit is a full adder, various designs of quantum full adders (QFAs) from the literature are investigated on various aspects to deliberately choose the best quantum full adder suitable for QBAS application. A QBAS circuit is thus designed using the selected QFA, analyzed and tested for its ability to replicate the output of its classical counterpart. The results obtained here will aid researchers in the design of Quantum Arithmetic Logic Units (QALUs), Quantum multipliers, dividers, and other scalable adder circuits. The proposed circuits and its results shown here expected to pave the way for design of compact and state of the art quantum adders with reduced number of qubits, quantum cost.