Searcharxiv⌕ Search

arXiv subjects

Fengli Yan

Publications and source records attributed to Fengli Yan.

72 records · Page 4Linked to original sources
arXiv2013

Bell-type inequality and quantum nonlocality in four-qubit systems

We present a Bell-type inequality for four-qubit systems. Using the inequality we investigate quantum nonlocality of a generic family of states $\left|G_{abcd}\right >$ [Phys. Rev. A 65, 052112 (2002)] and several canonical four-qubit entangled states. It has been demonstrated that the inequality is maximally violated by so called "four-qubit maximal entangled state $\left|G_{m}\right >$" and it is also violated by the four-qubit W state and a special family of states $\left|G_{ab00}\right >$. Moreover, a useful entanglement-nonlocality relationship for the family of states $\left|G_{ab00}\right >$ is obtained.

quant-ph↗
arXiv2013

Efficient $k$-separability criteria for mixed multipartite quantum states

We investigate classification and detection of entanglement of multipartite quantum states in a very general setting, and obtain efficient $k$-separability criteria for mixed multipartite states in arbitrary dimensional quantum systems. These criteria can be used to distinguish $n-1$ different classes of multipartite inseparable states and can detect many important multipartite entangled states such as GHZ states, W states, anti W states, and mixtures thereof. They detect $k$-nonseparable $n$-partite quantum states which have previously not been identified. Here $k=2,3,\cdots,n$. No optimization or eigenvalue evaluation is needed, and our criteria can be evaluated by simple computations involving components of the density matrix. Most importantly, they can be implemented in today's experiments by using at most $\mathcal{O}(n^2)$ local measurements.

quant-ph↗
arXiv2013

Generation of four-photon polarization entangled state based on EPR entanglers

We show how to prepare four-photon polarization entangled states based on some Einstein-Podolsky-Rosen (EPR) entanglers. An EPR entangler consists of two single photons, linear optics elements, quantum non-demolition measurement using a weak cross-Kerr nonlinearity, and classical feed forward. This entangler which acts as the most primary part in the construction of our scheme allows us to make two separable polarization qubits entangled near deterministically. Therefore, the efficiency of the present device completely depends on that of EPR entanglers, and it has a high success probability.

quant-ph↗
arXiv2013

Preparation of $km$-photon concatenated GHZ states for observing distinct quantum effects at macroscopic scale

As a class of multipartite entangled states, the multipartite concatenated GHZ (C-GHZ) states remain superior stability under the influence of decoherence. We propose two scalable experimental realization of the multiphoton C-GHZ states based on the entanglers of multiphoton GHZ state. Given a $km$-photon GHZ state as an input state, if $m$ is odd, one can create a $km$-photon C-GHZ state. Also, generally, we design a scheme to prepare $km$-photon C-GHZ states from $km$ single-photon states by using $k$ entanglers of $m$-photon GHZ state and $k$ $m$-control Toffoli gates.

quant-ph↗
arXiv2013

Measure of multipartite entanglement with computable lower bounds

In this paper, we present a measure of multipartite entanglement ($k$-nonseparable), $k$-ME concurrence $C_{k-\mathrm{ME}}(ρ)$ that unambiguously detects all $k$-nonseparable states in arbitrary dimensions, where the special case, 2-ME concurrence $C_{2-\mathrm{ME}}(ρ)$, is a measure of genuine multipartite entanglement. The new measure $k$-ME concurrence satisfies important characteristics of an entanglement measure including entanglement monotone, vanishing on $k$-separable states, convexity, subadditivity and strictly greater than zero for all $k$-nonseparable states. Two powerful lower bounds on this measure are given. These lower bounds are experimentally implementable without quantum state tomography and are easily computable as no optimization or eigenvalue evaluation is needed. We illustrate detailed examples in which the given bounds perform better than other known detection criteria.

quant-ph↗
arXiv2012

Entangler and analyzer for multiphoton maximally entangled states using weak nonlinearities

In the regime of weak nonlinearity we present two general feasible schemes. One is an entangler for generating any one of the $n$-photon Greenberger-Horne-Zeilinge (GHZ) states and Bell states. After the interactions with cross-Kerr nonlinear media, a phase gate followed by a measurement on the probe beam, and appropriate local operations via classical feed-forward, one can obtain the desired states in a nearly deterministic way. Another scheme is an analyzer for multiphoton maximally entangled states, which is taken as a further application of the above entangler. In this scheme, all of the $2^n$ $n$-photon GHZ states can, nearly deterministically, be discriminated. Furthermore, an efficient two-step nondestructive Bell-state analyzer is designed.

quant-ph↗
arXiv2012

Efficient scheme for three-photon Greenberger-Horne-Zeilinger state generation

We propose an efficient scheme for the generation of three-photon Greenberger-Horne-Zeilinger (GHZ) state with linear optics and postselection. Several devices are designed and a two-mode quantum nondemolition (QND) detection is introduced to obtain the desired state. It is worth noting that the states which have entanglement in both polarization and spatial degrees of freedom are created in one of the designed setups. The method described in the present scheme can create a large number of three-photon GHZ states in principle. We also discuss an approach to generate the desired GHZ state in the presence of channel noise.

quant-ph↗
arXiv2012

Perfect NOT transformation and conjugate transformation

The perfect NOT transformation, probabilistic perfect NOT transformation and conjugate transformation are studied. Perfect NOT transformation criteria on a quantum state set $S$ of a qubit are obtained. Two necessary and sufficient conditions for realizing a perfect NOT transformation on $S$ are derived. When these conditions are not satisfied we discuss a probabilistic perfect NOT transformation (gate). We construct a probabilistic perfect NOT machine (gate) by a general unitary-reduction operation. With a postselection of the measurement outcomes, the probabilistic NOT gate yields perfectly complements of the input states. We prove that one can realize probabilistically the NOT gate of the input states secretly chosen from a certain set $S=\{|Ψ_1>, |Ψ_2>,..., |Ψ_n>\}$ if and only if $|Ψ_1>, |Ψ_2>,...,$ and $|Ψ_n>$ are linearly independent. We also generalize the probabilistic NOT transformation to the conjugate transformation in the multi-level quantum system. The lower bound of the best possible efficiencies attained by a probabilistic perfect conjugate transformation are obtained.

quant-ph↗
arXiv2010

Two Local Observables are Sufficient to Characterize Maximally Entangled States of N Qubits

Maximally entangled states (MES) represent a valuable resource in quantum information processing. In $N$-qubit systems the MES are $N$-GHZ states, i.e. the collection of $\ket{GHZ_N}=\frac{1}{\sqrt{2}}(\ket{00...0}+\ket{11...1})$ and its local unitary (LU) equivalences. While it is well-known that such states are uniquely stabilized by $N$ commuting observables, in this Letter we consider the minimum number of non-commuting observables needed to characterize an $N$-qubit MES as the unique common eigenstate. Here, we prove that in this general case, any $N$-GHZ state can be uniquely stabilized by only two observables. Thus, for the task of MES certification, only two correlated measurements are required with each party observing the spin of his/her system along one of two directions.

quant-ph↗
arXiv2010

Probabilistic chain teleportation of a qutrit-state

We investigate chain teleportation of a qutrit-state via the non-maximally two-qutrit entangled channels. For the case of four parties, the efficiencies of two chain teleportation protocols, the separate chain teleportation protocol (SCTP) and the global chain teleportation protocol (GCTP), are calculated. In SCTP the errors are corrected between every step while in GCTP the errors are corrected only at the end. Furthermore, we present a piecewise global chain teleportation protocol (PGCTP) for keeping away from the inconvenience of error-correction of GCTP. We show that PGCTP is more efficient than SCTP.

quant-ph↗
arXiv2010

Quantum Key Distribution by Utilizing Four-Level Particles

We present a quantum key distribution protocol based on four-level particles entanglement. Furthermore, a controlled quantum key distribution protocol is proposed by utilizing three four-level particles. We show that the two protocols are secure.

quant-ph↗
arXiv2009

Multiple teleportation via the partially entangled states

We investigate the multiple teleportation with some nonmaximally entangled channels. The efficiencies of two multiple teleportation protocols, the separate multiple teleportation protocol (SMTP) and the global multiple teleportation protocol (GMTP), are calculated. We show that GMTP is more efficient than SMTP.

quant-ph↗
arXiv2009

Two-step deterministic remote preparation of an arbitrary quantum state in the whole Hilbert space

We present a two-step exact remote state preparation protocol of an arbitrary qubit with the aid of a three-particle Greenberger-Horne-Zeilinger state. Generalization of this protocol for higher-dimensional Hilbert space systems among three parties is also given. We show that only single-particle von Neumann measurement, local operation and classical communication are necessary. Moreover, since the overall information of the quantum state can be divided into two different parts, which may be at different locations, this protocol may be useful in the quantum information field.

quant-ph↗
arXiv2005

Probabilistic teleportation of unknown two-particle state via POVM

We propose a scheme for probabilistic teleportation of unknown two-particle state with partly entangled four-particle state via POVM. In this scheme the teleportation of unknown two-particle state can be realized with certain probability by performing two Bell state measurements, a proper POVM and a unitary transformation.

quant-ph↗
arXiv2003

Achievable efficiencies for probabilistically cloning the states

We present an example of quantum computational tasks whose performance is enhanced if we distribute quantum information using quantum cloning. Furthermore we give achievable efficiencies for probabilistic cloning the quantum states used in implemented tasks for which cloning provides some enhancement in performance.

quant-ph↗
arXiv2003

A scheme for dense coding in the non-symmetric quantum channel

We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude that when a more level particle is with the sender, she can get a non-symmetric quantum channel from a symmetric one by entanglement transfer. Thus the efficiency of information transmission is improved.

quant-ph↗
arXiv2003

Secure direct communication using Einstein-Podolsky-Rosen pairs and teleportation

A novel scheme for secure direct communication between Alice and Bob is proposed, where there is no need for establishing a shared secret key. The communication is based on Einstein-Podolsky-Rosen pairs and teleportation between Alice and Bob. After insuring the security of the quantum channel (EPR pairs), Bob encodes the secret message directly on a sequence of particle states and transmits them to Alice by teleportation. In this scheme teleportation transmits Bob's message without revealing any information to a potential eavesdropper. Alice can read out the encoded messages directly by the measurement on her qubits. Because there is not a transmission of the qubit which carry the secret message between Alice and Bob, it is completely secure for direct secret communication if perfect quantum channel is used.

quant-ph↗