2007
DOI: 10.1007/s10773-007-9607-8
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Computation in a Ising Spin Chain Taking into Account Second Neighbor Couplings

Abstract: We consider the realization of a quantum computer in a chain of nuclear spins coupled by an Ising interaction. Quantum algorithms can be performed with the help of appropriate radio-frequency pulses. In addition to the standard nearest-neighbor Ising coupling, we also allow for a second neighbor coupling. It is shown, how to apply the 2πk method in this more general setting, where the additional coupling eventually allows to save a few pulses. We illustrate our results with two numerical simulations: the Shor … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
3
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 22 publications
0
3
0
Order By: Relevance
“…Furthermore, the approach relies in the universal character of Quantum Mechanics. In this model, the Ising interaction is considered among first and second neighbor spins which allows to implement ideally this type of computer up to 1000-qubits or more [13], [14]. Among other gates and algorithms [15], one qubit rotation and CNOT gates were study with this quantum computer model [16].…”
Section: Introductionmentioning
confidence: 99%
“…Furthermore, the approach relies in the universal character of Quantum Mechanics. In this model, the Ising interaction is considered among first and second neighbor spins which allows to implement ideally this type of computer up to 1000-qubits or more [13], [14]. Among other gates and algorithms [15], one qubit rotation and CNOT gates were study with this quantum computer model [16].…”
Section: Introductionmentioning
confidence: 99%
“…At the moment, there has not been a physical realization of this quantum computer. However, since the full Hamiltonian can be explicitly written for this system, several useful analytical and numerical studies have been made [16,17] where the results can be extrapolated to other solid state spins quantum computers. On the other hand, one important aspect of the simulation or implementation of a quantum algorithm is the effect that the noise can cause to the performance of this algorithm which may arise from error in the quantum parameters or from the interaction with the environment, or both.…”
Section: Introductionmentioning
confidence: 99%
“…The model of the system can be found in reference [15], and the explicit Hamiltonian for simulation of the Grover' search algorithm is given by [17] …”
mentioning
confidence: 99%