An Architecture of Deterministic Quantum Central Processing Unit

We present an architecture of QCPU(Quantum Central Processing Unit), based on the discrete quantum gate set, that can be programmed to approximate any n-qubit computation in a deterministic fashion. It can be built efficiently to implement computations with any required accuracy. QCPU makes it possible to implement universal quantum computation with a fixed, general purpose hardware. Thus the complexity of the quantum computation can be put into the software rather than the hardware.Comment: 4 pages, 4 figures, 1 tabl

Entanglement Enhanced Multiplayer Quantum Games

We investigate the 3-player quantum Prisoner's Dilemma with a certain strategic space, a particular Nash equilibrium that can remove the original dilemma is found. Based on this equilibrium, we show that the game is enhanced by the entanglement of its initial state.Comment: 9 pages, 3 figure

Phase-transition-like behaviour of quantum games

The discontinuous dependence of the properties of a quantum game on its entanglement has been shown to be very much like phase transitions viewed in the entanglement-payoff diagram (J Du et al 2002 Phys. Rev. Lett. 88 137902). In this paper we investigate such phase-transition-like behaviour of quantum games, by suggesting a method which would help to illuminate the origin of such a kind of behaviour. For the particular case of the generalized Prisoners' Dilemma, we find that, for different settings of the numerical values in the payoff table, even though the classical game behaves the same, the quantum game exhibits different and interesting phase-transition-like behaviour.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/48840/2/a32318.pd

Experimental Implementation of the Quantum Random-Walk Algorithm

The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed. In this paper we present the experimental implementation of the quantum random walk algorithm on a nuclear magnetic resonance quantum computer. We observe that the quantum walk is in sharp contrast to its classical counterpart. In particular, the properties of the quantum walk strongly depends on the quantum entanglement.Comment: 5 pages, 4 figures, published versio

Implementing universal multi-qubit quantum logic gates in three and four-spin systems at room temperature

In this paper, we present the experimental realization of multi-qubit gates $$ in macroscopic ensemble of three-qubit and four-qubit molecules. Instead of depending heavily on the two-bit universal gate, which served as the basic quantum operation in quantum computing, we use pulses of well-defined frequency and length that simultaneously apply to all qubits in a quantum register. It appears that this method is experimentally convenient when this procedure is extended to more qubits on some quantum computation, and it can also be used in other physical systems.Comment: 5 Pages, 2 Figure