Probabilistic Dense Coding Using Non-Maximally Entangled Three-Particle States

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.

How to concentrate non-maximally entangled states for quantum communication is a fundamental problem in quantum information. In this paper, we will apply generalized measurements to entanglement concentration of known non-maximally entangled pure states in arbitrary dimensional system. How to design the generalized measurements for the unambiguous discrimination of linearly independent non-orthogonal states is crucial for the concentration of the known non-maximally entangled states. The result shows that, any known non-maximally entangled pure state (for arbitrary dimensional system) can be transformed to the maximally entangled state only by introducing a qubit as ancilla and a joint unitary transformation operation on one of the entangled particles and the ancilla. In addition, because the less entangled state of each fail round will be re-concentrated too, the entanglement waste during the concentration process will be greatly reduced.

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.

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.

To establish an entangled state of optimal fidelity between two distant observers when the available quantum channel is noisy, is a central problem in quantum information theory. We consider an instance of this problem for two-qubit systems when only a single use of the channel and local post-processing by trace preserving operations are allowed. We show that the optimal fidelity is obtained only when part of an appropriate non-maximally entangled state is transmitted through the channel. The entanglement of this state can be vanishingly small when the channel becomes very noisy. Moreover, in the optimal case no further local processing is required to enhance the fidelity. We further show that local post-processing can enhance fidelity if and only if the amount of noise is larger than a critical value and entanglement of the transmitted state is bounded from below. A notable consequence of these results is that the ordering of states under an entanglement monotone can be reversed even when the states undergo the same local interaction via a trace-preserving completely positive map.

Dynamics of coded information over Bloch channels is investigated. We show that the coded information is sent with high accuracy over the Bloch channel by increasing the absolute equilibrium value of the information carrier or decreasing the ratio of relaxation time. The robustness of coded information in maximum and partial entangled states is discussed. It is shown that, the maximum entangled states are more robust than the partial entangled state over these types of channels. The dynamics of the local and the non-local information is investigated for different values of the channel's parameters and the initial state setting. It is found that by increasing the absolute equilibrium values for both qubits, the local information of both qubits decreases faster and consequently the information gained by the eavesdropper increases.

Graph construction using adaptive Local Hybrid Coding scheme

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.

In this chapter we review the employment of quantum entanglement as a resource for information processing and transmission. In particular we introduce and discuss the notion of completely positive maps operating on observable algebras of physical systems in order to have a model to construct communication channels based on quantum processes. Then we discuss advantages and limitations of entanglement-assisted quantum communication schemes like quantum teleportation and dense coding.

Richard Feynman's observation that certain quantum mechanical effects cannot be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used these quantum effects. This speculation proved justified when Peter Shor described a polynomial time quantum algorithm for factoring intergers. In quantum systems, the computational space increases exponentially with the size of the system, which enables exponential parallelism. This parallelism could lead to exponentially faster quantum algorithms than possible classically. The catch is that accessing the results, which requires measurement, proves tricky and requires new nontraditional programming techniques. The aim of this paper is to guide computer scientists through the barriers that separate quantum computing from conventional computing. We introduce basic principles of quantum mechanics to explain where the power of quantum computers comes from and why it is difficult to harness. We describe quantum cryptography, teleportation, and dense coding. Various approaches to exploiting the power of quantum parallelism are explained. We conclude with a discussion of quantum error correction.

A scheme for probabilistic teleportation of an unknown three-atom entangled state via a five-atom non-maximally entangled cluster state as quantum channel is proposed. In this scheme, the sender performs two Bell state and a single-atom measurements on the atoms, the receiver can reconstruct the original state with a certain probability by introducing an auxiliary atom and operating appropriate unitary transformations and controlled-not (C-not) operations according to the sender Alice's measurement results. As a result, the probability of successful teleportation is determined by the smallest two of the coefficients' absolute values of the cluster state. The considerable advantage of our scheme is that we employ a non-maximally entangled cluster state as quantum channel in the scheme, which can greatly reduce the amount of entanglement resources and need less classical bits. If we employ a maximally entangled cluster state as quantum channel, the probabilistic teleportation scheme becomes usual teleportation, the successful probability being 100%.

Application quantum renormalization group to optimal dense coding in transverse Ising model

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.

In this paper, we propose a scheme for quantum information splitting based on the non-maximally entangled four-qubit state in order to realize the splitting of the specific two-qubit state |ψ〉AB=x|00〉+y|11〉. The information splitter will safely share an state to the receiver with help of the controller. Through introducing an auxiliary system and applying several appropriate unitary transformations the information receiver can reconstruct the original state sent by the information splitter. Due to the non-maximally entangled four-qubit state, the total probability that the receiver obtains the original information is P. Furthermore, we discuss the relationship between the successful splitting probability and the concurrence of the entangled state and get a specific expression. In addition, the scheme is tested against external and internal attacks, and we define a function to characterise the security with the concurrence of the entanglement.

Superdense coding promises increased classical capacity and communication security but this advantage may be undermined by noise in the quantum channel. We present a numerical study of how forward error correction (FEC) applied to the encoded classical message can be used to mitigate against quantum channel noise. By studying the bit error rate under different FEC codes, we identify the unique role that burst errors play in superdense coding, and we show how these can be mitigated against by interleaving the FEC codewords prior to transmission. We conclude that classical FEC with interleaving is a useful method to improve the performance in near-term demonstrations of superdense coding.