Searcharxiv⌕ Search

arXiv subjects

Xiaowei Deng

Publications and source records attributed to Xiaowei Deng.

22 records · Page 2Linked to original sources

Quantum random number generator based on twin beams

We produce two strings of quantum random numbers simultaneously from the intensity fluctuations of the twin beams generated by a nondegenerate optical parametric oscillator. Two strings of quantum random numbers with bit rates up to 60 Mb/s are extracted simultaneously with a suitable post-processing algorithm. By post-selecting the identical data from two raw sequences and using a suitable hash function, we also extract two strings of identical quantum random numbers. The obtained random numbers pass all NIST randomness tests. The presented scheme shows the feasibility of generating quantum random numbers from the intensity of a macroscopic optical field.

quant-ph↗

Quantum entanglement swapping between two multipartite entangled states

Quantum entanglement swapping is one of the most promising ways to realize the quantum connection among local quantum nodes. In this Letter, we present an experimental demonstration of the entanglement swapping between two independent multipartite entangled states, each of which involves a tripartite Greenberger-Horne-Zeilinger (GHZ) entangled state of an optical field. The entanglement swapping is implemented deterministically by means of a joint measurement on two optical modes coming from the two multipartite entangled states respectively and the classical feedforward of the measurement results. After entanglement swapping the two independent multipartite entangled states are merged into a large entangled state in which all unmeasured quantum modes are entangled. The entanglement swapping between a tripartite GHZ state and an Einstein-Podolsky-Rosen entangled state is also demonstrated and the dependence of the resultant entanglement on transmission loss is investigated. The presented experiment provides a feasible technical reference for constructing more complicated quantum networks.

quant-ph↗

Gates for one-way quantum computation based on Einstein-Podolsky-Rosen entanglement

Single-mode squeezing and Fourier transformation operations are two essential logical gates in continuous-variable quantum computation, which have been experimentally implemented by means of an optical four-mode cluster state. In this paper, we present a simpler and more efficient protocol based on the use of Einstein-Podolsky-Rosen two-mode entangled states to realize the same operations. The theoretical calculations and the experimental results demonstrate that the presented scheme not only decreases the requirement to the resource quantum states at the largest extent but also enhances significantly the squeezing degree and the fidelity of the resultant modes under an identical resource condition. That is because in our system the influence of the excess noises deriving from the imperfect squeezing of the resource states is degraded. The gate operations applying two-mode entanglement can be utilized as a basic element in a future quantum computer involving a large-scale cluster state.

quant-ph↗

Gate sequence for continuous variable one-way quantum computation

Measurement-based one-way quantum computation (QC) using cluster states as resources provides an efficient model to perform computation and information processing of quantum codes. Arbitrary Gaussian QC can be implemented by sufficiently long single-mode and two-mode gate sequences. However, continuous variable (CV) gate sequences have not been realized so far due to an absence of cluster states larger than four submodes. Here we present the first CV gate sequence consisting of a single-mode squeezing gate and a two-mode controlled-phase gate based on a six-mode cluster state. The quantum property of this gate sequence is confirmed by the fidelities and the quantum entanglement of two output modes, which depend on both the squeezing and controlled-phase gates. The experiment demonstrates the feasibility of implementing Gaussian QC by means of accessible gate sequences.

quant-ph↗