Quantum walks with coins undergoing different quantum noisy channels

Quantum walks have significantly different properties compared to classical random walks, which have potential applications in quantum computation and quantum simulation. We study Hadamard quantum walks with coins undergoing different quantum noisy channels and deduce the analytical expressions of the first two moments of position in the long- time limit. Numerical simulations have been done, the results are compared with the analytical results, and they match extremely well. We show that the variance of the position distributions of the walks grows linearly with time when enough steps are taken and the linear coefficient is affected by the strength of the quantum noisy channels.

Time-bin-encoding-based remote states generation of nitrogen-vacancy centers through noisy channels

We design proposals to generate a remote Greenberger-Horne-Zeilinger（GHZ） state and a W state of nitrogenvacancy（NV） centers coupled to microtoroidal resonators（MTRs） through noisy channels by utilizing time-bin encoding processes and fast-optical-switch-based polarization rotation operations.The polarization and phase noise induced by noisy channels generally affect the time of state generation but not its success probability and fidelity.Besides,the above proposals can be generalized to n-qubit between two or among n remote nodes with success probability unity under ideal conditions.Furthennore,the proposals are robust for regular noise-changeable channels for the n-node case.This method is also useful in other remote quantum information processing tasks through noisy channels.

Serial decoding of rateless code over noisy channels

Rateless code usually generates a potentially infinite number of coded packets at the encoder and collects enough packets at the decoder to ensure reliable recovery of multiple information packets.The conventional rateless decoder usually works in a parallel manner which needs to initiate a new belief propagation (BP) decoding procedure upon each newly received collection of coded packets,thereby resulting in prohibitive decoding complexity in practice.In this paper,we present a novel serial decoding algorithm,i.e.,the serial storage belief propagation (SS BP) algorithm,for rateless codes over noisy channels.Specifically,upon receiving a new group of coded packets,the decoder initiates a new attempt to decode all the packets received so far,using the results of the previous attempt as initial input.Moreover,in each iteration of the new attempt,the decoder serially propagates the messages group by group from the most recent one to the earliest one.In this way,the newly updated messages can be propagated faster,expediting the recovery of information packets.In addition,the proposed serial decoding algorithm has significantly lower complexity than the existing parallel decoding algorithms.Simulation results validate its effectiveness in AWGN,Rayleigh,and Rician fading channels.

Properties on the distant distribution of entanglement for arbitrary two-qubit pure states via noisy quantum channels

This paper investigates the change of entanglement for transmitting an arbitrarily entangled two-qubit pure state via one of three typical kinds of noisy quantum channels： amplitude damping quantum channel, phase damping quantum channel and depolarizing quantum channel. It finds, in all these three cases, that the output distant entanglement （measured by concurrence） reduces proportionately with respect to its initial amount, and the decaying ratio is determined only by the noisy characteristics of quantum channels and independent of the form of initial input state.

Robust Quantum Secure Direct Communication and Deterministic Secure Quantum Communication over Collective Dephasing Noisy Channel

We propose two schemes for quantum secure direct communication (QSDC) and deterministic securequantum communication (DSQC) over collective dephasing noisy channel.In our schemes,four special two-qubit statesare used as the quantum channel.Since these states are unchanged through the collective dephasing noisy channel,the effect of the channel noise can be perfectly overcome.Simultaneously,the security against some usual attacks canbe ensured by utilizing the various checking procedures.Furthermore,these two schemes are feasible with present-daytechnique.

Efficient Multiparty Quantum Secret Sharing with Greenberger-Horne-Zeilinger States

An effcient multiparty quantum secret sharing scheme is proposed with Greenberger-Horne-Zeilinger （GHZ） states following some ideas in quantum dense coding. The agents take the single-photon measurements on the photons received for eavesdropping check and exploit the four local unitary operations Ⅰ, σx, σx and iσy to code their message. This scheme has the advantage of high capacity as each GHZ state can carry two bits of information. The parties do not need to announce the measuring bases for almost all the photons, which will reduce the classical information exchanged largely. The intrinsic efficiency for qubits and the total effciency both approach the maximal values.

Quantum State Transfer between Two Distant Atoms by Connecting Two Cavities via Optical Fibres

A scheme is proposed to unconditionally implement state transfer between two distant atoms by sending the atoms across two distant cavities connected via an optical fibre, respectively. The field state, which preserves the information about the first atom, is transmitted from one cavity to the other along the fibre. A Faraday rotator integrated in the fibre can be designed to completely stop the fields reflected from the second cavity, thus after the field interacts with the second atom for a defined time, the state transfer can be accomplished with unit efficiency.