Probabilistically implementing nonlocal operations between two distant qutrits

We propose a method to probabilistically implement a nonlocal operation, exp[iζUAUB], between two distant qutrits A and B, where ζ∈ C [0,2π] and UA, UB are local unitary and Hermitian operations for qutrits A and B respectively. The consumptions of resource for one performance of the method are a single non-maximally entangled qutrit state and 1-trit classical communication. For a given ζ, the successful probability of the method depends on the forms of both entanglement resource and Bob＇s partial-measurement basis. We systematically discuss the optimal successful probabilities and their corresponding conditions for three cases： adjustable entanglement resource, adjustable partial-measurement basis, adjustable entanglement resource and partial-measurement basis. It is straightforward to generalize the method for producing nonlocal unitary operations between any two N-level systems.

Probabilistic resumable quantum teleportation in high dimensions

Teleportation is a quantum information process without classical counterparts, in which the sender can disembodiedly transfer unknown quantum states to the receiver. In probabilistic teleportation through a partial entangled quantum channel,the transmission is exact(with fidelity 1), but may fail in a probability and the initial state is destroyed simultaneously.We propose a scheme for nondestructive probabilistic teleportation of high-dimensional quantum states. With the aid of an ancilla in the hands of the sender, the initial quantum information can be recovered when teleportation fails. The ancilla acts as a quantum apparatus to measure the sender’s subsystem. Erasing the information recorded in it can resume the initial state.

Controllable all-optical stochastic logic gates and their delay storages based on the cascaded VCSELs with optical-injection

Using the dynamical properties of the polarization bistability that depends on the detuning of the injected light,we propose a novel approach to implement reliable all-optical stochastic logic gates in the cascaded vertical cavity surface emitting lasers（VCSELs） with optical-injection.Here,two logic inputs are encoded in the detuning of the injected light from a tunable CW laser.The logic outputs are decoded from the two orthogonal polarization lights emitted from the optically injected VCSELs.For the same logic inputs,under electro-optic modulation,we perform various digital signal processing（NOT,AND,NAND,XOR,XNOR,OR,NOR） in the all-optical domain by controlling the logic operation of the applied electric field.Also we explore their delay storages by using the mechanism of the generalized chaotic synchronization.To quantify the reliabilities of these logic gates,we further demonstrate their success probabilities.

Effects of initial states on the quantum correlations in the generalized Grover search algorithm

We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation.Using a set of suitable bases,we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations.For different initial states,we obtain the concurrence and quantum discord compared with the success probability in the algorithm.The results show that the initial states affect the correlations and the limit point of the correlations in the searching process.However,the initial states do not influence the whole cyclical trend.

On the System Performance of Mobile Edge Computing in an Uplink NOMA WSN With a Multiantenna Access Point Over Nakagami-m Fading

In this paper,we study the system performance of mobile edge computing(MEC)wireless sensor networks(WSNs)using a multiantenna access point(AP)and two sensor clusters based on uplink nonorthogonal multiple access(NOMA).Due to limited computation and energy resources,the cluster heads(CHs)offload their tasks to a multiantenna AP over Nakagami-m fading.We proposed a combination protocol for NOMA-MEC-WSNs in which the AP selects either selection combining(SC)or maximal ratio combining(MRC)and each cluster selects a CH to participate in the communication process by employing the sensor node(SN)selection.We derive the closed-form exact expressions of the successful computation probability(SCP)to evaluate the system performance with the latency and energy consumption constraints of the considered WSN.Numerical results are provided to gain insight into the system performance in terms of the SCP based on system parameters such as the number of AP antennas,number of SNs in each cluster,task length,working frequency,offloading ratio,and transmit power allocation.Furthermore,to determine the optimal resource parameters,i.e.,the offloading ratio,power allocation of the two CHs,and MEC AP resources,we proposed two algorithms to achieve the best system performance.Our approach reveals that the optimal parameters with different schemes significantly improve SCP compared to other similar studies.We use Monte Carlo simulations to confirm the validity of our analysis.

Exact Decoding Probability of Random Linear Network Coding for Combinatorial Networks

Combinatorial networks are widely applied in many practical scenarios. In this paper, we compute the closed-form probability expressions of successful decoding at a sink and at all sinks in the multicast scenario, in which one source sends messages to k destinations through m relays using random linear network coding over a Galois field. The formulation at a （all） sink（s） represents the impact of major parameters, i.e., the size of field, the number of relays （and sinks） and provides theoretical groundings to numerical results in the literature. Such condition maps to the receivers＇ capability to decode the original information and its mathematical characterization is helpful to design the coding. In addition, numerical results show that, under a fixed exact decoding probability, the required field size can be minimized.

Teleportation of unknown states of a qubit and a single-mode field in strong coupling regime without Bell-state measurement

In this paper,we develop the teleportation scheme in[Zheng in Phys Rev A 69,064302,2004],in the sense that,we work in the strong atom-field coupling regime wherein the rotating wave approximation(RWA)is no longer valid.To achieve the purpose,a scheme consisting of a qubit interacting with a single-mode quantized field is described via the Rabi model(counter rotation terms are taken into account).Our first aim is to teleport an unknown atomic state of a qubit(which interacts with the quantized field in a cavity)to a second qubit(exists in another distant cavity field),beyond the RWA and without the Bell-state measurement method.In the continuation,in a similar way,we teleport an unknown state of a single-mode field too.In fact,it is shown that,in this regime,after applying some particular conditions,containing the interaction time of atom-field in the cavities,adjusting the involved frequencies,as well as the atom-field coupling in the model,if a proper measurement is performed on the state of the first qubit(the related field in the cavity),the unknown states of the qubit(field)can be teleported from the first qubit(cavity field)to the second qubit(cavity field),appropriately.We show that in both considered cases,the teleportation protocol is successfully performed with the maximum possible fidelity,1,and the acceptable success probability,0.25.

Probabilistic Teleportation of an Arbitrary Two-Qubit State via Positive Operator-Valued Measurement with Multi Parties

We propose a novel scheme to probabilistically transmit an arbitrary unknown two-qubit quantum state via Positive Operator-Valued Measurement with the help of two partially entangled states. In this scheme, the teleportation with two senders and two receives can be realized when the information of non-maximally entangled states is only available for the senders. Furthermore, the concrete implementation processes of this proposal are presented, meanwhile the classical communication cost and the successful probability of our scheme are calculated.

Optimizing scheme for probabilistic remote preparation of a two-qubit state

Remote state preparation is increasingly becoming attractive in recent years, people have already started theoretical and experimental research, and have made valuable research results. Recently, a scheme for probabilistic remote preparation of a general two-qubit state was proposed （Wang Z Y in Quantum Inf Process. 11：1585, 2012））. In this paper, we present a modified scheme for probabilistic remote preparation of a general two-qubit state. To complete the scheme, the new and feasible complete orthogonal basis vectors have been introduced. Compared with the previous schemes, the advantage of our schemes is that the total success probability of remote state preparation will be greatly improved. The probability of success regarding this scheme is calculated in both general and particular cases. The results show that the success probability of remote state preparation can be improved a little. However, in certain special cases, the success probability of preparation can be greatly improved. In special cases, the success probability of preparation can be improved to 1. The security analysis of the scheme is provided in details.

The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials

Orthogonal matching pursuit(OMP for short)algorithm is a popular method of sparse signal recovery in compressed sensing.This paper applies OMP to the sparse polynomial reconstruction problem.Distinguishing from classical research methods using mutual coherence or restricted isometry property of the measurement matrix,the recovery guarantee and the success probability of OMP are obtained directly by the greedy selection ratio and the probability theory.The results show that the failure probability of OMP given in this paper is exponential small with respect to the number of sampling points.In addition,the recovery guarantee of OMP obtained through classical methods is lager than that of ℓ_(1)-minimization whatever the sparsity of sparse polynomials is,while the recovery guarantee given in this paper is roughly the same as that of ℓ_(1)-minimization when the sparsity is less than 93.Finally,the numerical experiments verify the availability of the theoretical results.