ﻻ يوجد ملخص باللغة العربية
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 2pi 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 prime factorization of the number 4 and the teleportation of a qubit along a chain of 3 qubits. In both cases, the optimal Rabi frequency (to suppress non-resonant effects) depends primarily on the strength of the second neighbor interaction.
We implement Grovers quantum search algorithm on a nuclear spin chain quantum computer, taking into Ising type interactions between nearest and second nearest neighbours into account. The performance of the realisation of the algorithm is studied by
Causal inference with observational data can be performed under an assumption of no unobserved confounders (unconfoundedness assumption). There is, however, seldom clear subject-matter or empirical evidence for such an assumption. We therefore develo
We have calculated the energy per site for the ground state of antiferromagnetic quantum spin chain with variable range exchange $h(j-k)propto sinh^2 a sinh^{-2}a(j-k)$ in the framework of the asymptotic Bethe ansatz. By expanding it in powers of $e^
Electron spins in semiconductor quantum dots are promising candidates for the experimental realization of solid-state qubits. We analyze the dynamics of a system of three qubits arranged in a linear geometry and a system of four qubits arranged in a
The evolution of entanglement in a 3-spin chain with nearest-neighbor Heisenberg-XY interactions for different initial states is investigated here. In an NMR experimental implementation, we generate multipartite entangled states starting from initial