Xianyi Zhou
University of Science and Technology of China
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Xianyi Zhou.
Physical Review Letters | 2002
Jiangfeng Du; Hui Li; Xiaodong Xu; Mingjun Shi; Jihui Wu; Xianyi Zhou; Rongdian Han
We generalize the quantum prisoners dilemma to the case where the players share a nonmaximally 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.
Physical Review A | 2003
Jiangfeng Du; Hui Li; Xiaodong Xu; Mingjun Shi; Jihui Wu; Xianyi Zhou; Rongdian Han
The quantum random walk is a possible approach to construct 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.
Physics Letters A | 2002
Jiangfeng Du; Hui Li; Xiaodong Xu; Xianyi Zhou; Rongdian Han
We investigate the 3-player quantum Prisoners 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.
Physical Review Letters | 2008
Xinhua Peng; Zeyang Liao; Nanyang Xu; Gan Qin; Xianyi Zhou; Dieter Suter; Jiangfeng Du
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shors algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales polynomially with the problem size.
Physical Review A | 2007
Hongwei Chen; Xianyi Zhou; Dieter Suter; Jiangfeng Du
While exact cloning of an unknown quantum state is prohibited by the linearity of quantum mechanics, approximate cloning is possible and has been used, e.g., to derive limits on the security of quantum communication protocols. In the case of asymmetric cloning, the information from the input state is distributed asymmetrically between the different output states. Here, we consider asymmetric phase-covariant cloning, where the goal is to optimally transfer the phase information from a single input qubit to different output qubits. We construct an optimal quantum cloning machine for two qubits that does not require ancilla qubits and implement it on an NMR quantum information processor.
Physical Review A | 2001
Jiangfeng Du; Mingjun Shi; Xianyi Zhou; Yangmei Fan; Bangjiao Ye; Rongdian Han; Jihui Wu
Bernstein and Varizani have given the first quantum algorithm to solve parity problem in which a strong violation of the classical imformation theoritic bound comes about. In this paper, we refine this algorithm with fewer resource and implement a two qubits algorithm in a single query on an ensemble quantum computer for the first time.
Physical Review Letters | 2011
Hongwei Chen; Dawei Lu; Bo Chong; Gan Qin; Xianyi Zhou; Xinhua Peng; Jiangfeng Du
The method of quantum cloning is divided into two main categories: approximate and probabilistic quantum cloning. The former method is used to approximate an unknown quantum state deterministically, and the latter can be used to faithfully copy the state probabilistically. Thus far, many approximate cloning machines have been experimentally demonstrated, but probabilistic cloning remains an experimental challenge, as it requires more complicated networks and a higher level of precision control. In this work, we design an efficient quantum network with a limited amount of resources and perform the first experimental demonstration of probabilistic quantum cloning in a NMR quantum computer. In our experiment, the optimal cloning efficiency proposed by Duan and Guo [Phys. Rev. Lett. 80, 4999 (1998)] is achieved.
Fluctuation and Noise Letters | 2002
Jiangfeng Du; Xiaodong Xu; Hui Li; Xianyi Zhou; Rongdian Han
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 Prisoners 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.
Physical Review A | 2001
Jiangfeng Du; Mingjun Shi; Jihui Wu; Xianyi Zhou; Rongdian Han
In this paper, we present the experimental realization of multiqubit gates
Journal of Physics D | 2007
Shaowei Jin; Guanyin Gao; Wenbin Wu; Xianyi Zhou
{\ensuremath{\Lambda}}_{n}(