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/0212070 · International Journal of Quantum Information

METHOD FOR IMPLEMENTATION OF UNIVERSAL QUANTUM LOGIC GATES IN A SCALABLE ISING SPIN QUANTUM COMPUTER

G. P. Berman, D. I. Kamenev, Richard B. Kassman, Carlos Pineda, V. I. Tsifrinovich

Published Mar 1, 2003• 24 citations
arXivHTMLPDF

Abstract

We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. Since the wavelength of the radio-frequency pulses is much larger than the distance between the spins, each pulse affects all spins in the chain and introduces the phase and probability errors, which occur even without the influence of the environment. These errors caused by the unwanted transitions are minimized and computed numerically.

DOI
10.1142/s0219749903000085

Related papers

MINIMIZATION OF NONRESONANT EFFECTS IN A SCALABLE ISING SPIN QUANTUM COMPUTER

G. P. Berman, D. I. Kamenev, V. I. Tsifrinovich

The errors caused by the transitions with large frequency offsets (nonresonant transitions) are calculated analytically for a scalable solid-state quantum computer based on a one-dimensional spin chain with Ising interactions between neighboring spins. Selective excitations of the spins are enabled by a uniform gradient of the external magnetic field. We calculate the probabilities of all unwanted nonresonant transitions associated with the flip of each spin with nonresonant frequency and with flips of two spins: one with resonant and one with nonresonant frequencies. It is shown that these errors oscillate with changing gradient of the external magnetic field. Choosing the optimal values of this gradient allows us to decrease these errors by 50%.

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

Creation of entanglement in a scalable spin quantum computer with long-range dipole-dipole interaction between qubits

D. I. Kamenev, G. P. Berman, V. I. Tsifrinovich

Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment, (ii) nonselective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically and calculated numerically. For the perfectly entangled state the $z$ component $M$ of the magnetization of the whole system is equal to zero. The errors lead to a finite value of $M$. If the number of qubits in the system is large, $M$ can be detected experimentally. Using the fact that $M$ depends differently on the parameters of the system for each kind of error, varying these parameters would allow one to experimentally determine the most significant source of errors and to optimize correspondingly the quantum computer design in order to decrease the errors and $\ensuremath{\mid}M\ensuremath{\mid}$. Using our approach one can benchmark the quantum computer, decrease the errors, and prepare the quantum computer for implementation of more complex quantum algorithms.

arXiv:quant-ph/0603227•Physical Review A•Jun 29, 2006•5 citations

IMPLEMENTATION OF QUANTUM LOGIC OPERATIONS AND CREATION OF ENTANGLEMENT BETWEEN TWO NUCLEAR SPIN QUBITS WITH CONSTANT INTERACTION

G. P. Berman, Geoffrey W. Brown, M. E. Hawley +2 more

We describe how to implement quantum logic operations in a silicon-based quantum computer with phosphorus atoms serving as qubits. The information is stored in the states of nuclear spins and the conditional logic operations are implemented through the electron spins using nuclear–electron hyperfine and electron–electron exchange interactions. The electrons in our computer should stay coherent only during implementation of one Controlled-NOT gate. The exchange interaction is constant, and selective excitations are provided by a magnetic field gradient. The quantum logic operations are implemented by rectangular radio-frequency pulses. This architecture is scalable and does not require manufacturing nanoscale electronic gates. As shown in this paper, parameters of a quantum protocol can be derived analytically even for a computer with a large number of qubits using our perturbation approach. We present the protocol for initialization of the nuclear spins and the protocol for creation of entanglement. All analytical results are tested numerically using a two-qubit system.

arXiv:quant-ph/0512174•International Journal of Quantum Information•Dec 1, 2006•1 citation

Scalable architecture for spin-based quantum computers with a single type of gate

Dieter Suter, Kyungwon Lim

We propose a scalable design for a solid-state spin-based quantum computer. It uses endohedral fullerenes like $\mathrm{N}@{\mathrm{C}}_{60}$ or $\mathrm{P}@{\mathrm{C}}_{60},$ which can be positioned on Si surfaces with a scanning tunneling microscope. Each logical qubit is stored in two physical qubits, corresponding to the nuclear and electronic spins. We discuss the addressing of individual qubits by a magnetic field gradient, and the implementation of one- and two-qubit quantum gates by sequences of radio-frequency and microwave pulses.

Physical Review A•Apr 24, 2002•97 citations

Simulations of quantum-logic operations in a quantum computer with a large number of qubits

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

We report the simulations of the dynamics of quantum-logic operations with large number of qubits (up to 1000). A nuclear-spin chain in which selective excitations of spins are provided by the gradient of the external magnetic field is considered. The spins interact with their nearest neighbors. We simulate the quantum controlled-NOT (CN) gate implementation for remote qubits, which provides the long-distance entanglement. Our approach can be applied to any implementation of quantum-logic gates involving a large number of qubits.

arXiv:quant-ph/9909032•Physical Review A•May 15, 2000•25 citations

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
We present protocols for implementation of universal quantum gates on an arbitrary superposition of quantum states in a scalable solid-state Ising spin quantum computer. The spin chain is composed of identical spins 1/2 with the Ising interaction between the neighboring spins. The selective excitations of the spins are provided by the gradient of the external magnetic field. The protocols are built of rectangular radio-frequency pulses. Since the wavelength of the radio-frequency pulses is much larger than the distance between the spins, each pulse affects all spins in the chain and introduces the phase and probability errors, which occur even without the influence of the environment. These errors caused by the unwanted transitions are minimized and computed numerically.
The errors caused by the transitions with large frequency offsets (nonresonant transitions) are calculated analytically for a scalable solid-state quantum computer based on a one-dimensional spin chain with Ising interactions between neighboring spins. Selective excitations of the spins are enabled by a uniform gradient of the external magnetic field. We calculate the probabilities of all unwanted nonresonant transitions associated with the flip of each spin with nonresonant frequency and with flips of two spins: one with resonant and one with nonresonant frequencies. It is shown that these errors oscillate with changing gradient of the external magnetic field. Choosing the optimal values of this gradient allows us to decrease these errors by 50%.
Creation of entanglement is considered theoretically and numerically in an ensemble of spin chains with dipole-dipole interaction between the spins. The unwanted effect of the long-range dipole interaction is compensated by the optimal choice of the parameters of radio-frequency pulses implementing the protocol. The errors caused by (i) the influence of the environment, (ii) nonselective excitations, (iii) influence of different spin chains on each other, (iv) displacements of qubits from their perfect locations, and (v) fluctuations of the external magnetic field are estimated analytically and calculated numerically. For the perfectly entangled state the zzz component MMM of the magnetization of the whole system is equal to zero. The errors lead to a finite value of MMM. If the number of qubits in the system is large, MMM can be detected experimentally. Using the fact that MMM depends differently on the parameters of the system for each kind of error, varying these parameters would allow one to experimentally determine the most significant source of errors and to optimize correspondingly the quantum computer design in order to decrease the errors and $\ensuremath{\mid}M\ensuremath{\mid}$. Using our approach one can benchmark the quantum computer, decrease the errors, and prepare the quantum computer for implementation of more complex quantum algorithms.
We describe how to implement quantum logic operations in a silicon-based quantum computer with phosphorus atoms serving as qubits. The information is stored in the states of nuclear spins and the conditional logic operations are implemented through the electron spins using nuclear–electron hyperfine and electron–electron exchange interactions. The electrons in our computer should stay coherent only during implementation of one Controlled-NOT gate. The exchange interaction is constant, and selective excitations are provided by a magnetic field gradient. The quantum logic operations are implemented by rectangular radio-frequency pulses. This architecture is scalable and does not require manufacturing nanoscale electronic gates. As shown in this paper, parameters of a quantum protocol can be derived analytically even for a computer with a large number of qubits using our perturbation approach. We present the protocol for initialization of the nuclear spins and the protocol for creation of entanglement. All analytical results are tested numerically using a two-qubit system.
We propose a scalable design for a solid-state spin-based quantum computer. It uses endohedral fullerenes like N@C60\mathrm{N}@{\mathrm{C}}_{60}N@C60​ or P@C60,\mathrm{P}@{\mathrm{C}}_{60},P@C60​, which can be positioned on Si surfaces with a scanning tunneling microscope. Each logical qubit is stored in two physical qubits, corresponding to the nuclear and electronic spins. We discuss the addressing of individual qubits by a magnetic field gradient, and the implementation of one- and two-qubit quantum gates by sequences of radio-frequency and microwave pulses.
We report the simulations of the dynamics of quantum-logic operations with large number of qubits (up to 1000). A nuclear-spin chain in which selective excitations of spins are provided by the gradient of the external magnetic field is considered. The spins interact with their nearest neighbors. We simulate the quantum controlled-NOT (CN) gate implementation for remote qubits, which provides the long-distance entanglement. Our approach can be applied to any implementation of quantum-logic gates involving a large number of qubits.
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.