Search

Traditionally, quantum state correlation can be obtained with calculations on a state density matrix already known. Here, we propose a model with which correlations of unknown quantum states can be obtained. There are no needs of classical communication in the course of coupling, optimization and complicated calculations. All we need are weak coupling and ancillary systems. We detail the model on the state in which particles belong to the different owners. A concisely example is elaborated in the last part of this paper.

Two bounds on the minimal time of dynamic rotating an initial state by arbitrary angle have been obtained. These bounds have been applied to study the evolutions in the Hadamard-Walsch gate, the Control-NOT quantum gate, and the Grover algorithm., Comment: 4 pages and 1 figure

The exotic structures in the 2s_{1/2} states of five pairs of mirror nuclei ^{17}O-^{17}F, ^{26}Na-^{26}P, ^{27}Mg-^{27}P, ^{28}Al-^{28}P and ^{29}Si-^{29}P are investigated with the relativistic mean-field (RMF) theory and the single-particle model (SPM) to explore the role of the Coulomb effects on the proton halo formation. The present RMF calculations show that the exotic structure of the valence proton is more obvious than that of the valence neutron of its mirror nucleus, the difference of exotic size between each mirror nuclei becomes smaller with the increase of mass number A of the mirror nuclei and the ratios of the valence proton and valence neutron root-mean-square (RMS) radius to the matter radius in each pair of mirror nuclei all decrease linearly with the increase of A. In order to interpret these results, we analyze two opposite effects of Coulomb interaction on the exotic structure formation with SPM and find that the contribution of the energy level shift is more important than that of the Coulomb barrier for light nuclei. However, the hindrance of the Coulomb barrier becomes more obvious with the increase of A. When A is larger than 34, Coulomb effects on the exotic structure formation will almost become zero because its two effects counteract with each other., Comment: 9 pages, 6 figures. One column

We present a way for symmetric multiparty-controlled teleportation of an arbitrary two-particle entangled state based on Bell-basis measurements by using two Greenberger-Horne-Zeilinger states, i.e., a sender transmits an arbitrary two-particle entangled state to a distant receiver, an arbitrary one of the $n+1$ agents via the control of the others in a network. It will be shown that the outcomes in the cases that $n$ is odd or it is even are different in principle as the receiver has to perform a controlled-not operation on his particles for reconstructing the original arbitrary entangled state in addition to some local unitary operations in the former. Also we discuss the applications of this controlled teleporation for quantum secret sharing of classical and quantum information. As all the instances can be used to carry useful information, its efficiency for qubits approaches the maximal value., Comment: 9 pages, 3 figures; the revised version published in Physical Review A 72, 022338 (2005). The detail for setting up a GHZ-state quantum channel is added

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., Comment: 4 pages

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., Comment: 5 pages

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., Comment: 6 pages, 2 eps figures

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 \delta^2})$, where $\delta$ is the uncertainty., Comment: 6 pages, 3 figures

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 \theta and the inversion for the prepared state |\gamma> is replaced by rotation through \phi, we found that these phase rotations must satisfy a matching condition \theta=\phi. 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., Comment: 13 pages, 7 figures

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 $\pi$ 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., Comment: 5 pages, 5 figures