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

A Quantum Full Adder for a Scalable Nuclear Spin Quantum Computer

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

Published May 25, 2001• 6 citations
OpenAlex

Abstract

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.

Related papers

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 quantum full adder for a scalable nuclear spin quantum computer

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

arXiv:quant-ph/0105133•Computer Physics Communications•Jul 1, 2002•5 citations

Control of Non-Resonant Effects in a Nuclear Spin Quantum Computer with a Large Number of Qubits

G. P. Berman, G. D. Doolen, D. I. Kamenev +1 more

We discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a spin chain. Analytical estimates are presented for possible correlated errors caused by non-resonant transitions. A range of parameters is given in which non-resonant effects can be minimized.

arXiv:quant-ph/0103007•Mar 3, 2001•0 citations

Adder on ternary base elements for a quantum computer

V. E. Zobov, D. I. Pekhterev

A circuit consisting of elementary quantum logic operators has been proposed for an adder in the ternary number system. A sequence of RF magnetic field pulses has been found for its implementation by the nuclear magnetic resonance method on a chain of quadrupole nuclei with spin I = 1. The numerical simulation of the adder operation has been performed.

Journal of Experimental and Theoretical Physics Letters•May 1, 2009•13 citations

Teleportation in a nuclear spin quantum computer

G. P. Berman, Gustavo V. López, V. I. Tsifrinovich

We present a procedure for quantum teleportation in a nuclear spin quantum computer in which quantum logic gates are implemented by using selective electromagnetic pulses. A sequence of pulses is combined with single-spin measurements in the ${\ensuremath{\sigma}}^{z}$ basis for fast transfer of information in a spin quantum computer. We simulated this procedure for quantum teleportation in a nuclear spin chain with a large number (201) of spins. The systematic errors generated in the process of teleportation due to the non-resonant effects are analyzed in detail. We demonstrate that a $``2\ensuremath{\pi}k''$ method provides a significant reduction of errors.

Physical Review A•Oct 17, 2002•6 citations

CONTROL OF NON-RESONANT EFFECTS IN A NUCLERA SPIN QUANTUM COMPUTER WITH A LARGE NUMBER OF QUBITS

G. P. Berman

The authors discuss how to simulate simple quantum logic operations with a large number of qubits. These simulations are needed for experimental testing of scalable solid-state quantum computers. Quantum logic for remote qubits is simulated in a spin chain. Analytical estimates are presented for possible correlated errors caused by non-resonant transitions. A range of parameters is given in which non-resonant effects can be minimized.

•Feb 1, 2001•0 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.
We present a procedure for quantum teleportation in a nuclear spin quantum computer in which quantum logic gates are implemented by using selective electromagnetic pulses. A sequence of pulses is combined with single-spin measurements in the ${\ensuremath{\sigma}}^{z}$ basis for fast transfer of information in a spin quantum computer. We simulated this procedure for quantum teleportation in a nuclear spin chain with a large number (201) of spins. The systematic errors generated in the process of teleportation due to the non-resonant effects are analyzed in detail. We demonstrate that a $``2\ensuremath{\pi}k''$ method provides a significant reduction of errors.