Searcharxiv⌕ Search

arXiv subjects

Rongdian Han

Publications and source records attributed to Rongdian Han.

13 recordsLinked to original sources
arXiv2003

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.

quant-ph↗
arXiv2003

Experimentally obtaining the Likeness of Two Unknown Quantum States on an NMR Quantum Information Processor

Recently quantum states discrimination has been frequently studied. In this paper we study them from the other way round, the likeness of two quantum states. The fidelity is used to describe the likeness of two quantum states. Then we presented a scheme to obtain the fidelity of two unknown qubits directly from the integral area of the spectra of the assistant qubit(spin) on an NMR Quantum Information Processor. Finally we demonstrated the scheme on a three-qubit quantum information processor. The experimental data are consistent with the theoretical expectation with an average error of 0.05, which confirms the scheme.

quant-ph↗
arXiv2003

Phase-transition-like Behavior of Quantum Games

The discontinuous dependence of the properties of a quantum game on its entanglement has been shown up to be very much like phase transitions viewed in the entanglement-payoff diagram [J. Du et al., Phys. Rev. Lett, 88, 137902 (2002)]. In this paper we investigate such phase-transition-like behavior of quantum games, by suggesting a method which would help to illuminate the origin of such kind of behavior. 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 behavior.

quant-ph↗
arXiv2003

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.

quant-ph↗
arXiv2003

Playing Prisoner's Dilemma with Quantum Rules

Quantum game theory is a recently developing field of physical research. In this paper, we investigate quantum games in a systematic way. With the famous instance of the Prisoner's Dilemma, we present the fascinating properties of quantum games in different conditions, i.e. different number of the players, different strategic space of the players and different amount of the entanglement involved.

quant-ph↗
arXiv2003

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.

quant-ph↗
arXiv2002

Multi-Player and Multi-Choice Quantum Game

We investigate a multi-player and multi-choice quantum game. We start from two-player and two-choice game and the result is better than its classical version. Then we extend it to N-player and N-choice cases. In the quantum domain, we provide a strategy with which players can always avoid the worst outcome. Also, by changing the value of the parameter of the initial state, the probabilities for players to obtain the best payoff will be much higher that in its classical version.

quant-ph↗
arXiv2002

Implementations of Nonadiabatic Geometric Quantum Computation using NMR

Recently, geometric phases, which is fault tolerate to certain errors intrinsically due to its geometric property, are getting considerable attention in quantum computing theoretically. So far, only one experiment about adiabatic geometric gate with NMR through Berry phase has been reported. However, there are two drawbacks in it. First, the adiabatic condition of Berry phase makes such gate very slowly. Second, the extra operation to eliminate the dynamic phase. As we know, geometric phase can exist both adiabatic(Berry phase) and nonadiabatic(Aharonov-Anandan phase). In this letter, we reports the first experimental realization of nonadiabatic geometric gate with NMR through conditional-AA phase. In our experiment the gates can be made faster and more easily, and the two drawbacks mentioned above are removed.

quant-ph↗
arXiv2002

Experimental realization of quantum games on a quantum computer

We generalize the quantum Prisoner's Dilemma to the case where the players share a non maximally entangled states. We show that the game exhibits an intriguing structure as a function of the amount of entanglement with two thresholds which separate a classical region, an intermediate region and a fully quantum region. Furthermore this quantum game is experimentally realized on our nuclear magnetic resonance quantum computer.

quant-ph↗
arXiv2001

Nash Equilibrium in the Quantum Battle of Sexes Game

We investigate Nash Equilibrium in the quantum Battle of Sexes Game. We find the game has infinite Nash Equilibria and all of them leads to the asymmetry result. We also show that there is no unique but infinite Nash Equilibrium in it if we use the quantizing scheme proposed by Eisert et al and the two players are allowed to adopt any unitary operator as his/her strategies.

quant-ph↗
arXiv2001

Remark On Quantum Battle of The Sexes Game

Recently Quantum Battle of The Sexes Game has been studied by Luca Marinatto and Tullio Weber. Yet some important problems exist in their scheme. Here we propose a new scheme to quantize Battle of The Sexes Game, and this scheme will truly remove the dilemma that exists in the classical form of the game.

quant-ph↗
arXiv2000

Quantum Strategy Without Entanglement

In this paper we quantize the Card Game. In the classical version of this game, one player (Alice) can always win with propability 2/3. But when the other player (Bob) is allowed to apply quantum strategy, the original unfair game turns into a fair and zero-sum game. Further more, the procedure in which Bob perform his quantum strategy does not include any ingredient of entanglement.

quant-ph↗