arXiv subjects

Yan Song Li

Publications and source records attributed to Yan Song Li.

6 recordsLinked to original sources

arXiv2001

General Schemes for multi-particle d-dimensional Cat-like State Teleportation

Two kinds of $M$-particle d-dimensional cat-like state teleportation protocols are present. In the first protocol, the teleportation is achieved by d-dimensional Bell-basis measurements, while in the second protocol it is realized by d-dimensional GHZ-basis measurement. It is also shown that the second protocol has a simple mathematical formulation that is identical to Bennett et al's original teleportation protocol for an unknown state of a single particle.

quant-ph↗

arXiv2001

Entanglement in a two-identical-particle system

The definition of entanglement in identical-particle system is introduced. The separability criterion in two-identical particle system is given. The physical meaning of the definition is analysed. Applications to two-boson and two-fermion systems are made. It is found new entanglement and correlation phenomena in identical-boson systems exist, and they may have applications in the field of quantum information.

quant-ph↗

arXiv1999

A novel SO(3) picture for quantum searching

An SO(3) picture of the generalized Grover's quantum searching algorithm,with arbitrary unitary transformation and with arbitrary phase rotations, is constructed. In this picture, any quantum search operation is a rotation in a 3 dimensional space. Exact formulas for the rotation angle and rotational axis are given. The probability of finding the marked state is just $(z+1)/2$, where z is the z-component of the state vector. Exact formulas for this probability is easily obtained. The phase matching requirement and the failure of algorithm when phase mismatches are clearly explained.

quant-ph↗

arXiv1999

An intrinsic limitation on the size of quantum database

It is found that Grover's quantum search algorithm is not robust against phase inversion and Hadmard transformation inaccuracies. Imperfect phase inversions and Hadmard-Walsh transformations in Grover's quantum search algorithm lead to reductions in the maximum probability of the marked state and affect the efficiency of the algorithm. even in the absence of decoherence. Given the degrees of inaccuracies, we find that to guarantee half rate of success, the size of the database should be in the order of $O({1 \over δ^2})$, where $δ$ is the uncertainty.

quant-ph↗

arXiv1999

Phase matching in quantum searching

Each iteration in Grover's original quantum search algorithm contains 4 steps: two Hadamard-Walsh transformations and two amplitudes inversions. When the inversion of the marked state is replaced by arbitrary phase rotation θand the inversion for the prepared state |γ> is replaced by rotation through ϕ, we found that these phase rotations must satisfy a matching condition θ=ϕ. Approximate formula for the amplitude of the marked state after an arbitrary number of iterations are also derived. We give also a simple explanation of the phase matching requirement.

quant-ph↗

arXiv1999

Arbitrary phase rotation of the marked state can not be used for Grover's quantum search algorithm

A misunderstanding that an arbitrary phase rotation of the marked state together with the inversion about average operation in Grover's search algorithm can be used to construct a (less efficient) quantum search algorithm is cleared. The $π$ rotation of the phase of the marked state is not only the choice for efficiency, but also vital in Grover's quantum search algorithm. The results also show that Grover's quantum search algorithm is robust.

quant-ph↗