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

Physical Review A

Teleportation in a nuclear spin quantum computer

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

Published Oct 17, 2002• 6 citations
Publisher

Abstract

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.

DOI
10.1103/physreva.66.042312

Related papers

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

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

Iterative quantum-state transfer along a chain of nuclear spin qubits

Jingfu Zhang, Nageswaran Rajendran, Xinhua Peng +1 more

Transferring quantum information between two qubits is a basic requirement for many applications in quantum communication and quantum-information processing. In the iterative quantum-state transfer proposed by Burgarth et al. [Phys. Rev. A 75, 062327 (2007)], this is achieved by a static spin chain and a sequence of gate operations applied only to the receiving end of the chain. The only requirement on the spin chain is that it transfers a finite part of the input amplitude to the end of the chain, where the gate operations accumulate the information. For an appropriate sequence of evolutions and gate operations, the fidelity of the transfer can asymptotically approach unity. We demonstrate the principle of operation of this transfer scheme by implementing it in a nuclear magnetic resonance quantum-information processor.

arXiv:0706.0352•Physical Review A•Jul 17, 2007•30 citations

Perturbation Approach for Quantum Computation

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

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.

Optical Fiber Communication Conference•Jan 1, 2001•0 citations

Numerical simulation of Quantum Teleportation in a chain of three nuclear spins system taking into account second neighbor interaction

Gustavo V. López, Lorena Lara

For a one-dimensional chain of three nuclear spins (one half), we make the numerical simulation of quantum teleportation of a given state from one end of the chain to the other end, taking into account first and second neighbor interactions among the spins. It is shown that a well defined teleportation protocol is achieved for a ratio of the first to second neighbor interaction coupling constant of $J'/J\ge 0.04$. We also show that the optimum Rabi's frequency to control the non-resonant effects is dominated by the second neighbor interaction coupling parameter ($J'$).

arXiv:quant-ph/0608194•Aug 24, 2006•0 citations

Composite pulses in NMR quantum computation

Jonathan A. Jones

I describe the use of techniques based on composite rotations to combat systematic errors in quantum logic gates. Although developed and described within the context of Nuclear Magnetic Resonance (NMR) quantum computing these sequences should be applicable to other implementations of quantum computation.

arXiv:0906.4719•Journal of the Indian Institute of Science•Jun 25, 2009•6 citations
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σz{\ensuremath{\sigma}}^{z}\ensuremathσ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πk′′``2\ensuremath{\pi}k''‘‘2\ensuremathπk′′ method provides a significant reduction of errors.
Transferring quantum information between two qubits is a basic requirement for many applications in quantum communication and quantum-information processing. In the iterative quantum-state transfer proposed by Burgarth et al. [Phys. Rev. A 75, 062327 (2007)], this is achieved by a static spin chain and a sequence of gate operations applied only to the receiving end of the chain. The only requirement on the spin chain is that it transfers a finite part of the input amplitude to the end of the chain, where the gate operations accumulate the information. For an appropriate sequence of evolutions and gate operations, the fidelity of the transfer can asymptotically approach unity. We demonstrate the principle of operation of this transfer scheme by implementing it in a nuclear magnetic resonance quantum-information processor.
For a one-dimensional chain of three nuclear spins (one half), we make the numerical simulation of quantum teleportation of a given state from one end of the chain to the other end, taking into account first and second neighbor interactions among the spins. It is shown that a well defined teleportation protocol is achieved for a ratio of the first to second neighbor interaction coupling constant of J′/J≥0.04J'/J\ge 0.04J′/J≥0.04. We also show that the optimum Rabi's frequency to control the non-resonant effects is dominated by the second neighbor interaction coupling parameter (J′J'J′).