Quantum communication over bit flip channels using entangled bipartite and tripartite states

We investigate the usefulness of a recently introduced five-qubit state by Brown et al. [I. D. K. Brown, S. Stepney, A. Sudbery, and S. L. Braunstein, J. Phys. A 38, 1119 (2005)] for quantum teleportation, quantum-state sharing, and superdense coding. It is shown that this state can be utilized for perfect teleportation of arbitrary single and two-qubit systems. We devise various schemes for quantum-state sharing of an arbitrary single- and two-particle state via cooperative teleportation. We later show that this state can be used for superdense coding as well. It is found that five classical bits can be sent by sending only three quantum bits.

We introduce the concept of the locally unextendible non-maximally entangled basis (LUNMEB) in H^d \bigotimes H^d. It is shown that such a basis consists of d orthogonal vectors for a non-maximally entangled state. However, there can be a maximum of (d-1)^2 orthogonal vectors for non-maximally entangled state if it is maximally entangled in (d-1) dimensional subspace. Such a basis plays an important role in determining the number of classical bits that one can send in a superdense coding protocol using a non-maximally entangled state as a resource. By constructing appropriate POVM operators, we find that the number of classical bits one can transmit using a non-maximally entangled state as a resource is (1+p_0\frac{d}{d-1})\log d, where p_0 is the smallest Schmidt coefficient. However, when the state is maximally entangled in its subspace then one can send up to 2\log (d-1) bits. We also find that for d= 3, former may be more suitable for the superdense coding.

The utility of a five-qubit entangled state for quantum teleportation, quantum state sharing and superdense coding is investigated. The state can be utilized for perfect teleportation and quantum state sharing of an arbitrary single- and two-qubit state. The capacity of superdense coding of the state reaches the "Holevo bound", which means that five classical bits can be transmitted by sending three qubits. The preparation of the five-qubit state and detection of the multipartite states in cavity QED are discussed. The distinct advantage of the feasible cavity QED technology that we use is insensitive to the thermal field and the cavity decay.

This chapter introduces the notions of classical and quantum information and discusses simple protocols for their exchange. It defines the entropy as a quantitative measure of information, and investigates its mathematical properties and operational meaning. It discusses the extent to which classical information can be carried by a quantum system and derives a pertinent upper bound, the Holevo bound. One important application of quantum communication is the secure distribution of cryptographic keys; a pertinent protocol, the BB84 protocol, is discussed in detail. Moreover, the chapter explains two protocols where previously shared entanglement plays a key role, superdense coding and teleportation. These are employed to effectively double the classical information carrying capacity of a qubit, or to transmit a quantum state with classical bits, respectively. It is shown that both protocols are optimal.

Quantum coherence of mixed states under noisy channels in noninertial frames

We investigate quantum entanglement and coherence of tripartite W state for Dirac fields under phase damping, phase flip and bit flip channels, respectively, in non-inertial frames. Via π-tangle, we numerically compute tripartite entanglement of W state under three channels when two observers are accelerated. We also analytically derive l 1-norm quantum coherence of W state under the simultaneous influence of Unruh effect and noisy environments. For phase-damping and phase-flip channels, both the acceleration and noisy channels modulate the behaviour of the tripartitle entanglement and quantum coherence. They do not vanish even for infinite acceleration when only A's qubit is under noisy environment, in contrast with the case when two or more observers’ qubits are under noisy environment. In the case of the bit flip channel, the behavior of the tripartite entanglement is similar to the one of the phase flip channel, but quantum coherence remains unaffected by the environment.

This chapter unifies all of the channel coding theorems that we have studied in this book. One of the most general information-processing tasks that a sender and receiver can accomplish is to transmit classical and quantum information and generate entanglement with many independent uses of a quantum channel and with the assistance of classical communication, quantum communication, and shared entanglement.1 The resulting rates for communication are net rates that give the generation rate of a resource less its consumption rate. Since we have three resources, all achievable rates are rate triples ( C,Q,E ) that lie in a three-dimensional capacity region, where C is the net rate of classical communication, Q is the net rate of quantum communication, and E is the net rate of entanglement consumption/generation. The capacity theorem for this general scenario is known as the quantum dynamic capacity theorem, and it is the main theorem that we prove in this chapter. All of the rates given in the channel coding theorems of previous chapters are special points in this three-dimensional capacity region. The proof of the quantum dynamic capacity theorem comes in two parts: the direct coding theorem and the converse theorem. The direct coding theorem demonstrates that the strategy for achieving any point in the three-dimensional capacity region is remarkably simple: we just combine the protocol from Corollary 22.5.2 for entanglement-assisted classical and quantum communication with the three unit protocols of teleportation, super-dense coding, and entanglement distribution. The interpretation of the achievable rate region is that it is the unit resource capacity region from Chapter 8 translated along the points achievable with the protocol from Corollary 22.5.2. In the proof of the converse theorem, we analyze the most general protocol that can consume and generate classical communication, quantum communication, and entanglement along with the consumption of many independent uses of a quantum channel, and we show that the net rates for such a protocol are bounded by the regularization of the achievable rate region.

The Bell basis is a distinctive set of maximally entangled two-particle quantum states that forms the foundation for many quantum protocols such as teleportation, dense coding and entanglement swapping. While the generation, manipulation, and measurement of two-level quantum states is well understood, the same is not true in higher dimensions. Here we present the experimental generation of a complete set of Bell states in a four-dimensional Hilbert space, comprising of 16 orthogonal entangled Bell-like states encoded in the orbital angular momentum of photons. The states are created by the application of generalized high-dimensional Pauli gates on an initial entangled state. Our results pave the way for the application of high-dimensional quantum states in complex quantum protocols such as quantum dense coding.

The famous superdense coding protocol of Bennett and Wiesner demonstrates that it is possible to communicate two bits of classical information by sending only one qubit and using a shared EPR pair. Our first result is that an arbitrary protocol for achieving this task (where there are no assumptions on the sender’s encoding operations or the dimension of the shared entangled state) is locally equivalent to the canonical Bennett-Wiesner protocol. In other words, the superdense coding task is rigid . In particular, we show that the sender and receiver only use additional entanglement (beyond the EPR pair) as a source of classical randomness. We also investigate several questions about higher-dimensional superdense coding, where the goal is to communicate one of d 2 possible messages by sending a d -dimensional quantum state, for general dimensions d . Unlike the d =2 case (i.e., sending a single qubit), there can be inequivalent superdense coding protocols for higher d . We present concrete constructions of inequivalent protocols, based on constructions of inequivalent orthogonal unitary bases for all d > 2. Finally, we analyze the performance of superdense coding protocols where the encoding operators are independently sampled from the Haar measure on the unitary group. Our analysis involves bounding the distinguishability of random maximally entangled states, which may be of independent interest.

Pulse-based Electron–Nuclear and ELectron–electron DOuble Resonance (ENDOR/ELDOR) techniques have been applied to molecular spins in order to implement ensemble electron spin-qubit based quantum computers/computing (QC) and quantum information processing (QIP) in the solid state. Pulsed ENDOR-based QC/QIP experiments for super dense coding (SDC) have for the first time been carried out by the use of molecular electron- and nuclear-spin entities such as the stable malonyl radical as matter spin-qubits. The spin-qubit manipulation technology for quantum gate operations in this work is based on the time-proportional-phase-increment (TPPI) technique, enabling us to distinguish between the phases of spin-qubit based entangled states. The TPPI technique, as firstly applied by Mehring et al. (M. Mehring, J. Mende and W. Scherer, Phys. Rev. Lett., 2003, 90, 153001), has illustrated the establishment of quantum entanglement between electron- and nuclear-spin states and mutual interconversion between the electron–nuclear Bell states. The electron-spin 4π-periodicity in phase shows up in the QC/QIP experiments, explicitly and experimentally illustrating the electron-spin spinor nature for the first time. Tripartite QC experiments have been made, showing the occurrence of separable states. Also, the development of novel electron-spin technology to manipulate multi-electron spin-qubits is described. In this work, the pulsed coherent-dual ELDOR for QC/QIP has for the first time been implemented by invoking a novel microwave dual phase-rotation technique. Thus, applications of the coherent-dual ELDOR to molecular electron spin-qubit systems are also discussed, emphasising designing the molecular two electron-qubit systems appropriate for QC/QIP. g- and/or hyperfine A-tensor engineering approaches give us the two- and multi-electron-qubit systems, which have been a materials challenge to implement matter spin-qubit based QC/QIP. The targeted matter spin-qubits can be used to facilitate selective resonant microwave excitations achieved by the pulsed ELDOR technique. In addition to DiVincenzo's five criteria, general requisites for scalable electron spin-qubit systems as 1D periodic robust spin structures are described. According to the requisites, double- or triple-stranded helicates embedding open-shell metal cations are proposed instead of organic molecular spin-qubits.

Einstein–Podolsky–Rosen steering is a peculiar quantum nonlocal correlation and has unique physical characteristics and a wide application prospect. Even more importantly, multipartite steerable states have more vital applications in the future quantum information field. Thus, in this work, we explored the dynamics characteristics of both genuine multipartite steering (GMS) and genuine multipartite entanglement (GME) and the relations of both under an open tripartite system. Specifically, the tripartite decoherence system may be modeled by the three parties of a tripartite state that undergo the noisy channels. The conditions for genuine entangled and steerable states can be acquired for the initial tripartite state. The results showed that decoherence noises can degrade the genuine multipartite entanglement and genuine multipartite steering and even induce its death. Explicitly, GME and GMS disappear with the increase in the decoherence strength under the phase damping channel. However, GME and GMS rapidly decay to death with the increase in the channel-noise factor and then come back to life soon after in the bit flip channel. Additionally, the results indicate that GMS is born of GME, but GME does not imply GMS, which means that the set of genuine multipartite steerable states is a strict subset of the set of genuine multipartite entangled states. These conclusions may be useful for discussing the relationship of quantum nonlocal correlations (GME and GMS) in the decoherence systems.

This paper proposes an experimentally feasible scheme for implementing quantum dense coding of trapped-ion system in decoherence-free states. As the phase changes due to time evolution of components with different eigenenergies of quantum superposition are completely frozen, quantum dense coding based on this model would be perfect. The scheme is insensitive to heating of vibrational mode and Bell states can be exactly distinguished via detecting the ionic state.

We introduce the notion of distributed quantum dense coding, i.e., the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders do not increase the information transfer capacity, in the case of a single receiver. For the case of two receivers, using local operations and classical communication, a nontrivial upper bound for the capacity is derived. We propose a general classification scheme of quantum states according to their usefulness for dense coding. In the bipartite case (for any dimensions), bound entanglement is not useful for this task.

We present a scheme for probabilistic dense coding via quantum channels of non-maximally entangled three-particle states. Quantum dense coding will succeed with a certain probability if the sender introduces an auxiliary particle and performs a collective unitary transformation. The average information transmitted in this scheme is calculated.

Consensus and Broadcast are two fundamental problems in distributed computing, whose solutions have several applications. Intuitively, Consensus should be no harder than Broadcast , and this can be rigorously established in several models. Can Consensus be easier than Broadcast? In models that allow noiseless communication, we prove a reduction of (a suitable variant of) Broadcast to binary Consensus, that preserves the communication model and all complexity parameters such as randomness, number of rounds, communication per round, etc., while there is a loss in the success probability of the protocol. Using this reduction, we get, among other applications, the first logarithmic lower bound on the number of rounds needed to achieve Consensus in the uniform GOSSIP model on the complete graph. The lower bound is tight and, in this model, Consensus and Broadcast are equivalent. We then turn to distributed models with noisy communication channels that have been studied in the context of some bio-inspired systems. In such models, only one noisy bit is exchanged when a communication channel is established between two nodes, and so one cannot easily simulate a noiseless protocol by using error-correcting codes. An Ω(e −2 n) lower bound on the number of rounds needed for Broadcast is proved by Boczkowski et al. [PLOS Comp. Bio. 2018] in one such model (noisy uniform PULL, where e is a parameter that measures the amount of noise). We prove an O(e −2 log n) upper bound for binary Consensus in such model, thus establishing an exponential gap between the number of rounds necessary for Consensus versus Broadcast. We also prove a new O(e −2 n log n) upper bound for Broadcast in this model.