arXiv subjects
Publications and source records attributed to Chuan-Wei Zhang.
We derive a lower bound for the optimal fidelity for deterministic cloning a set of n pure states. In connection with states estimation, we obtain a lower bound about average maximum correct states estimation probability.
We propose a probabilistic quantum cloning scheme using Greenberger-Horne-Zeilinger states, Bell basis measurements, single-qubit unitary operations and generalized measurements, all of which are within the reach of current technology. Compared to another possible scheme via Tele-CNOT gate [D. Gottesman and I. L. Chuang, Nature 402, 390 (1999)], the present scheme may be used in experiment to clone the states of one particle to those of two different particles with higher probability and less GHZ resources.
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a $k$-partite system, such as quantum computer, and may be generalized to general state-dependent cloning and identification.
We derive a sufficient condition for a set of pure states, each entangled in two remote $N$-dimensional systems, to be transformable to $k$-dimensional-subspace equivalent entangled states ($k\leq N$) by same local operations and classical communication. If $k=N$, the condition is also necessary. This condition reveals the function of the relative marginal density operators of the entangled states in the entanglement manipulation without sufficient information of the initial states.
Suppose two distant observers Alice and Bob share a pure biparticle entangled state secretly chosen from a set, it is shown that Alice (Bob) can probabilistic concentrate the state to a maximally entangled state by applying local operations and classical communication (LQCC) if and only if the states in the set share the same marginal density operator for her (his) subsystem. Applying this result, we present probabilistic superdense coding and show that perfect purification of mixed state is impossible using only LQCC on individual particles.
We construct a Universal Quantum Entanglement Concentration Gate (QEC-Gate). Special times operations of QEC-Gate can transform a pure 2-level bipartite entangled state to nearly maximum entanglement. The transformation can attain any required fidelity with optimal probability by adjusting concentration step. We also generate QEC-Gate to the Schmidt decomposable multi-partite system.
We realize the probabilistic cloning and identifying linear independent quantum states of multi-particles system, given prior probability, with universal quantum logic gates using the method of unitary representation. Our result is universal for separate state and entanglement. We also provide the realization in the condition given $M$ initial copies for each state.
We derive general discrimination of quantum states chosen from a certain set, given initial $M$ copies of each state, and obtain the matrix inequality, which describe the bound between the maximum probability of correctly determining and that of error. The former works are special cases of our results.