Related papers: Quantum computation in a Ising spin chain taking i…
For a one-dimensional chain of four nuclear spins (1/2) and taking into account first and second neighbor interactions among the spin system, we make the numerical simulation of Shor prime factorization algorithm of the integer number N=4…
We implement Grover's 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…
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…
In this paper, we discuss the dynamical issues of quantum computation. We demonstrate that fast wave function oscillations can affect the performance of Shor's quantum algorithm by destroying required quantum interference. We also show that…
We simulate Shor's algorithm on an Ising spin quantum computer. The influence of non-resonant effects is analyzed in detail. It is shown that our ``$2\pi k$''-method successfully suppresses non-resonant effects even for relatively large…
We have taken significant steps towards the realization of a practical quantum computer: using nuclear spins and magnetic resonance techniques at room temperature, we provided proof of principle of quantum computing in a series of…
An architecture for a quantum computer is presented in which spins associated with donors in silicon function as qubits. Quantum operations on the spins are performed using a combination of voltages applied to gates adjacent to the spins…
The proposal for quantum computing with rare-earth-ion qubits in inorganic crystals makes use of the inhomogeneous broadening of optical transitions in the ions to associate individual qubits with ions responding to radiation in selected…
We describe a quantum information processor (quantum computer) based on the hyperfine interactions between the conduction electrons and nuclear spins embedded in a two-dimensional electron system in the quantum-Hall regime. Nuclear spins…
We propose that neuromorphic computing can perform quantum operations. Spiking neurons in the active or silent states are connected to the two states of Ising spins. A quantum density matrix is constructed from the expectation values and…
A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is…
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We first give an overview of quantum information…
A quantum computer promises efficient processing of certain computational tasks that are intractable with classical computer technology. While basic principles of a quantum computer have been demonstrated in the laboratory, scalability of…
The enormous theoretical potential of Quantum Information Processing (QIP) is driving the pursuit for its practical realization by various physical techniques. Currently Nuclear Magnetic Resonance (NMR) has been the forerunner by…
We show how to divide a coupled multi-spin system into a small subset of ``active'' spins that evolve under chemical shift or scalar coupling operators, and a larger subset of ``spectator'' spins which are returned to their initial states,…
The superpositional wave function oscillations for finite-time implementation of quantum algorithms modifies the desired interference required for quantum computing. We propose a scheme with trapped ultracold ion-pairs being qubits to…
A theoretical spin-based scheme for performing a variety of quantum computations is presented. It makes use of an array of multiple identical computer vectors of phosphorus-doped silicon where the nuclei serve as logical qubits and the…
Quantum annealing aims at solving optimization problems efficiently by preparing the ground state of an Ising spin-Hamiltonian quantum mechanically. A prerequisite of building a quantum annealer is the implementation of programmable…
Four decades after Richard Feynman's famous remark, we have reached a stage at which nature can be simulated quantum mechanically. Quantum simulation is among the most promising applications of quantum computing. However, like many quantum…
The notion of compressed quantum computation is employed to simulate the Ising interaction of a 1D--chain consisting out of $n$ qubits using the universal IBM cloud quantum computer running on $\log(n)$ qubits. The external field parameter…