Despite of the great experimental and theoretical efforts, quantum computer realization for 1000 qubits remains being the goal of computer science and physical science. The two main problems faced on this goal are technological limitations (for example, the number of controlled ions trapped, or the maximum number of signal that can be registered by the NMR system), and the decoherence due to interaction of any quantum system with the environment    . Several quantum systems have been proposed for quantum computation like ions trapped, atoms trapped, QED cavities, NMR on liquids, chain of nuclear spins one half, superconducting jointions, Diamond VN system, etc.  - . One of the most attractive systems (due to their high decoherence time ) is nuclear spin systems. One resent proposal of this type  is the C12 - C13 diamond structure for a possible quantum computer, where a chain of C13 stable isotopes of spin one half is embedded periodically along a given line of the diamond lattice. A transverse static field with some gradient along this line, and transversally to it, and rf-magnetic field are applied. The universal CNOT and CCNOT quantum gates are obtained with a single π-pulses (evolution time is , being the Rabi’s frequency), and Hadamar’s gate is obtained with a π/2-pulse (evolution time of the quantum system is ). In this paper, we show that even with an rf-magnetic field having a component along the direction of the static magnetic field, it is possible to obtain the CNOT, CCNOT universal quantum gates with a 2π-pulse, the Hadamar’s gate with a π-pulse. In addition, the implementation of teleportation algorithm using three qubits is presented with its value of goodness (different of Fidelity ) of the reproduction of the algorithm and its associated Boltzmann-Shannon’s entropy  .
2. Analytical Approach
The diamond structure C12 (spin zero) with the line of isotopes C13 (spin one half) along the x-axis is shown in Figure 1. The spin-spin interaction is due to their dipole magnetic moments interaction 
where is the distance separation between the magnetic moments and which are related with the nuclear spin as
being the gyromagnetic ratio ( ). Assuming Ising interaction, this energy can be written as
where is the Planck’s constant divided by 2π ( ) and is the C13 - C13 nuclear separation in the diamond crystal. The propose magnetic field is
Figure 1. Diamond C12 - C13.
where , and b are the frequency, the phase and the amplitude of the rf-magnetic field, is the static magnetic field transverse to the line of C13’s. The interaction of the C13’s with the magnetic field is given by 
where is the position of the ith-atoms C13. The Hamiltonian of the system considering Ising interaction at first and second neighbor is
After rearranging terms, this Hamiltonian can be written as
where the operators and are defined as
being the Larmore’s frequency associated to the ith-atoms C13, is the so called Rabi’s frequency, and and are the ascend and descend operators, . The n-qubits registers ( for digital notation, and for decimal notation) form the basis for the Hilbert space of dimensionality , our qubit is just the spin one half of the nucleus of the atom C13. Now, having the known operations
being the Kronecker’s delta. The solution of the eigenvalue problems
is given by the eigenvalues
and the eigenfunctions are just , for . Therefore, proposing a solution of the Schrödinger’s equation
of the form
we get the equation for the coefficients as
where the frequency has been defined as
We can make all system without units by defining the new time evolution as
Then the constant , and become without units, but the Equation (17) would be exactly of the same form. So, from now on, we will talk about the time evolution in terms of the variable (19), and all the constant must be though as its value times .
3. Quantum Universal Gates
Equations (17) are solved numerically using Runge-Kutta method at fourth order. We made the simulation of the NOT quantum gate (1-qubit), Controlled-Not gate (2-qubits) and Controlled-Controlled-Not gate (3-qubits) to show the realization of a quantum computer with this magnetic field configuration in the C12 - C13 diamond structure. The parameters used in our simulations are given by
and the initial conditions are
Figure 2 shows the probabilities for the system to be in the state as a function of . This curves show the realization of the quantum gates NOT (transition: ), CNOT (transition: ), and CCNOT (transition: ) using a 2π-pulse ( ). The probabilities of the other states (CNOT and CCNOT) remain constant within and error of the order 10-5. In addition, we must observe that a superposition of states
Figure 2. Transitions: .
(Hadamar quantum gate) is gotten for a time evolution of (π-pulse), that is the states of the form
where some phases could be as factors on each state. We want to mention that if the initial conditions for CNOT and CCNOT are and and all other coefficients are zero, the superposition of states and are obtained too.
4. Realization of Teleportation Algorithm
Quantum teleportation  is one of the most fundamental elements in quantum computation and quantum information which deserves its realization for any quantum computer proposal. Therefore, this algorithm will be studied in this section with three qubits configuration, where the first state will represent Bob, the second state will be Alice and the third state will be the teleported state. From the Alice location, we want to transport this state (in general, an unknown state even by Alice) to Bob place. If the state we want to transport is
the initial state of our 3-qubits system is then
The “ideal” (mathematical) teleportation algorithm is represented by quantum circuit shown on Figure 3 (going from left to right), or written in term of operators we have
where is the CNOT operation between the qubit “i” and the cubit “j”
Figure 3. Teleportation quantum circuit.
and H is the Hadamar operator (1-qubit). The first term, , makes the entanglement between Alice(second qubit) and Bob (first qubit), and the term represents the Alice operations to produce the teleportation. The result of the application of the operator (25) to the initial state (24) can be written as
where (NOT gate), and act in the following way
Thus, the state has been teleported to Bob’s place, and this has occurred instantly (independently how separated are Alice and Bob). Of course, Alice needs to notify (at the speed of light or less) to Bob about the operation he needs to do in order to get the state ( , the identity operator). Notice then that at the end of the algorithm, we have four states with a probability and four states with probability . However, in our non-ideal system, we need to apply the correct type of pulse with the desired frequency transition in order to get the state what we want. Let us denote by
the pulse of length done in the system with a resonant frequency . Our non-ideal teleportation operator is given by
which represents and pulses where the Rabi’s frequency has been omitted. The last square parenthesis represents the entanglement, and the other one represents the teleportation. The result of this application to the initial state (24) can be seen Figure 4, where we have gotten four states with the probability 3/32 and four states with probability 5/32.
The goodness of the reproducibility of the teleportation algorithm can be measured by comparing the probabilities of the states between the real case with the ideal case at the end of the algorithm, and this can be done through the quantity
which goes from zero (excellent reproducibility) to one (non reproducibility at all). In our case, the value obtained is , meaning that we have a very good reproduction of the teleportation algorithm.
On the other hand, it is of interest to see how the information of the system is lost during the teleportation algorithm since starting with 2 states we finish with 8 states. Therefore, there must be an increasing on Boltzmann-Shannon entropy and its average value,
Of course, the maximum value this entropy can have is went all the probabilities are the same (1/8), . Figure 5 shows the evolution of the entropy and its average value, and as we expected, there is an increasing on the entropy and its average value due to the increasing of the number of states involved in the quantum dynamics of teleportation algorithm. The oscillations shown on this figure are due to CNOT and CCNOT operations which change the states but do increas the number of states. The rapidly increasing on the entropy is due to Hadamar’s operators which increases the number of states involved in the quantum dynamics.
Figure 4. Teleportation algorithm and total probability .
Figure 5. Boltzman-Shannon entropy for the teleportation algorithm.
We have shown that a solid state quantum computer can be realized using C12 - C13 structure in a diamond with even a longitudinal rf-magnetic field (one of its components is along the static field). The universal CNOT and CCNOT quantum gates and the one qubit rotation were well established on the simulations with multiples of a π-pulse. The teleportation algorithm was also implemented using these quantum gates in a 3-qubits configuration and using 10 pulses, and its associated Boltzmann-Shannon’s entropy was determined.