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

Optical Fiber Communication Conference

Perturbation Approach for Quantum Computation

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

Published Jan 1, 2001• 0 citations
Publisher

Abstract

We discuss how to simulate errors in the implementation of simple quantum logic operations in a nuclear spin quantum computer with many qubits, using radio-frequency pulses. We verify our perturbation approach using the exact solutions for relatively small (L = 10) number of qubits.
DOI
10.1364/icqi.2001.pb20

Related papers

Perturbation approach for nuclear magnetic resonance solid‐state quantum computation

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

A dynamics of a nuclear‐spin quantum computer with a large number (L = 1000) of qubits is considered using a perturbation approach. Small parameters are introduced and used to compute the error in an implementation of an entanglement between remote qubits, using a sequence of radio‐frequency pulses. The error is computed up to the different orders of the perturbation theory and tested using exact numerical solution.

Journal of Applied Mathematics•Jan 1, 2003•2 citations

Perturbation Approach for a Solid-State Quantum Computation

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

The dynamics of the nuclear-spin quantum computer with large number (L=1000) of qubits is considered using a perturbation approach, based on approximate diagonalization of exponentially large sparse matrices. Small parameters are introduced and used to compute the error in implementation of entanglement between remote qubits, by applying a sequence of resonant radio-frequency pulses. The results of the perturbation theory are tested using exact numerical solutions for small number of qubits.

arXiv:quant-ph/0110069•Oct 10, 2001•0 citations

Perturbation theory for quantum computation with a large number of qubits

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

We develop a dynamical perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by nonresonant transitions are estimated. We verify our perturbation approach using exact numerical solution for relatively small $(N=10)$ number of qubits. A preferred range of parameters is found in which the errors in processing quantum information are reasonably small. Our results can be useful for understanding the mechanisms of errors and for experimental testing of scalable solid-state quantum computers.

arXiv:quant-ph/0104025•Physical Review A•Dec 14, 2001•14 citations

Perturbation Theory and Numerical Modeling of Quantum Logic Operations with a Large Number of Qubits

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

The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain is considered in which selective excitations of spins are provided by having a uniform gradient of the external magnetic field. Quantum logic operations are utilized by applying resonant electromagnetic pulses. The spins interact with their nearest neighbors. We simulate the creation of the long-distance entanglement between remote qubits in the spin chain. Our method enables us to minimize unwanted non-resonant effects in a controlled way. The method we use cannot simulate complicated quantum logic (a quantum computer is required to do this), but it can be useful to test the experimental performance of simple quantum logic operations. We show that: (a) the probability distribution of unwanted states has a ``band'' structure, (b) the directions of spins in typical unwanted states are highly correlated, and (c) many of the unwanted states are high-energy states of a quantum computer (a spin chain). Our approach can be applied to simple quantum logic gates and fragments of quantum algorithms involving a large number of qubits.

arXiv:quant-ph/0107038•Jul 6, 2001•0 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

Scalable NMR Quantum Computation

Leonard J. Schulman, Umesh V. Vazirani

Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio frequency pulses. Existing proposals, however, suffer from a signal-to-noise ratio that decays exponentially in the number of qubits in the quantum computer. This places a severe limit on the size of the computations that can be performed by such a computer; estimates of that limit are well within the range in which a conventional computer taking exponentially more steps would still be practical. We give an NMR implementation in which the signal-to-noise ratio depends only on features of NMR technology, not the size of the computer. This provides a means for NMR computation techniques to scale to sizes at which the exponential speedup enables quantum computation to solve problems beyond the capabilities of classical computers.

arXiv:quant-ph/9804060•Apr 24, 1998•40 citations
We develop a dynamical perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by nonresonant transitions are estimated. We verify our perturbation approach using exact numerical solution for relatively small (N=10)(N=10)(N=10) number of qubits. A preferred range of parameters is found in which the errors in processing quantum information are reasonably small. Our results can be useful for understanding the mechanisms of errors and for experimental testing of scalable solid-state quantum computers.
The perturbation theory is developed based on small parameters which naturally appear in solid state quantum computation. We report the simulations of the dynamics of quantum logic operations with a large number of qubits (up to 1000). A nuclear spin chain is considered in which selective excitations of spins are provided by having a uniform gradient of the external magnetic field. Quantum logic operations are utilized by applying resonant electromagnetic pulses. The spins interact with their nearest neighbors. We simulate the creation of the long-distance entanglement between remote qubits in the spin chain. Our method enables us to minimize unwanted non-resonant effects in a controlled way. The method we use cannot simulate complicated quantum logic (a quantum computer is required to do this), but it can be useful to test the experimental performance of simple quantum logic operations. We show that: (a) the probability distribution of unwanted states has a ``band'' structure, (b) the directions of spins in typical unwanted states are highly correlated, and (c) many of the unwanted states are high-energy states of a quantum computer (a spin chain). Our approach can be applied to simple quantum logic gates and fragments of quantum algorithms involving a large number of qubits.
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.
Nuclear magnetic resonance offers an appealing prospect for implementation of quantum computers, because of the long coherence times associated with nuclear spins, and extensive laboratory experience in manipulating the spins with radio frequency pulses. Existing proposals, however, suffer from a signal-to-noise ratio that decays exponentially in the number of qubits in the quantum computer. This places a severe limit on the size of the computations that can be performed by such a computer; estimates of that limit are well within the range in which a conventional computer taking exponentially more steps would still be practical. We give an NMR implementation in which the signal-to-noise ratio depends only on features of NMR technology, not the size of the computer. This provides a means for NMR computation techniques to scale to sizes at which the exponential speedup enables quantum computation to solve problems beyond the capabilities of classical computers.