Perfect teleportation, quantum-state sharing, and superdense coding through a genuinely entangled five-qubit state

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.

One of the most striking consequences of quantum physics is quantum teleportation – the possibility to transfer quantum states over arbitrary distances. Since its theoretical introduction, teleportation has been demonstrated experimentally up to the distance of 143 km. In the original proposal two parties share a maximally entangled quantum state acting as a resource for the teleportation task. If, however, the state is influenced by decoherence, perfect teleportation can no longer be accomplished. Therefore, one of the current major challenges in accomplishing teleportation over long distances is to overcome the limitations imposed by decoherence and the subsequent mixedness of the resource state. Here we show that, in the presence of nonlocal memory effects, perfect quantum teleportation can be achieved even with mixed photon polarisation states. Our results imply that memory effects can be exploited in harnessing noisy quantum systems for quantum communication and that non-Markovianity is a resource for quantum information tasks.

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 present a simple numerical optimization procedure to search for highly entangled states of 2, 3, 4 and 5 qubits. We develop a computationally tractable entanglement measure based on the negative partial transpose criterion, which can be applied to quantum systems of an arbitrary number of qubits. The search algorithm attempts to optimize this entanglement cost function to find the maximal entanglement in a quantum system. We present highly entangled 4-qubit and 5-qubit states discovered by this search. We show that the 4-qubit state is not quite as entangled, according to two separate measures, as the conjectured maximally entangled Higuchi–Sudbery state. Using this measure, these states are more highly entangled than the 4-qubit and 5-qubit GHZ states. We also present a conjecture about the NPT measure, inspired by some of our numerical results, that the single-qubit reduced states of maximally entangled states are all totally mixed.

Super dense coding is a well known protocol to communicate two classical bits using a pre-shared pair of entangled qubits. We consider the case of quantum communication over the noisy bit flip channel with a shared Bell pair and show that the encoding scheme is perfectly secure. We extend the idea of super dense coding to a tripartite system and derive expressions for Holevo capacity and accessible information for various communication scenarios among the node links.

For the relative entropy-based measure of quantum discord the key idea is to find the closest classical state (CCS) for a given state ρ, which is in general a more complicated problem. In this work, we study three and four qubit graph-diagonal states and give the explicit expressions of CCS for these states. Using the CCS, we compute the quantum discord of graph-diagonal states of three and four qubit systems and show that there is a hierarchy for the quantum discord of graph-diagonal states of any three and four qubit systems. Then we classify the entanglement of graph-diagonal states of three and four qubit systems and draw the hierarchy of entanglement of these graph-diagonal states. Finally, we compare the hierarchy of quantum discord and quantum entanglement of the these graph-diagonal states and show that the hierarchy of quantum entanglement is at least in equivalence of quantum discord.

The emergence of information metamaterials has spurred significant advances in the field of information sciences. However, the current studies are predominantly focused on classical bits as the fundamental information units, and the classical bit can only be located at two poles of Bloch sphere, resulting in limited information capacity. To break such limit, quantum bits (qubits) offer a promising solution since they have superposition states anywhere on the Bloch sphere. Here, a Pancharatnam‐Berry (PB) phase metasurface is used to emulate the qubits. Firstly, it proposes a theoretical concept of analog quantum bit and develops its mathematical and geometrical representations. Subsequently, a meta‐atom is designed as a physical platform to implement the concept of analog qubits. By manipulating the geometric configuration of the proposed meta‐atom, it achieves arbitrary superpositions of polarization states. A PB phase metasurface is experimentally fabricated to validate that the proposed analog qubit can be used to emulate the quantum bit in terms of both mathematical and geometrical representations. This work not only provides a theoretical foundation to go beyond the information limit of classical bits but also develops a feasible physics platform to investigate quantum information metasurfaces, which would complement and revolutionize classical information science.

It is well known that environment may decohere a quantum bit (qubit) system immersed in it, making a quantum computation invalid. But the quantitative features of the decoherence seem to depend on both the constitution of the environment and the details of its coupling with the qubit system. In this paper, based on the dynamic approach for quantum measurement developed from the Hepp-Coleman model [K. Hepp, Helv. Phys. Acta 45, 237 (1972)], we generally model the environment as a collection of a large number of subsystems and then consider to what extent and in which way the environment and its coupling with the qubit system may affect a quantum computation process. In the weak-coupling limit, we find that as far as decoherence time is concerned, there is no essential difference between an environment of two-level subsystems and an environment of harmonic oscillators. This implies that there exists some universality independent of specific constitutions of environments. However, it is also shown that this is not true at finite temperature or in the case of strong coupling. So only if the coupling is weak and the temperature low does there exist the possibility of developing a universal scheme of controlling a qubit system such that the decoherence is avoided. The possible effect of environment on the efficiency of a quantum algorithm is also explicitly illustrated through the example of Shor's prime factorization algorithm.

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.

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.

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.

Remote state preparation (RSP) is the act of preparing a quantum state at a remote location without actually transmitting the state itself. Using at most two classical bits and a single shared maximally entangled state, one can in theory remotely prepare any qubit state with certainty and with perfect fidelity. However, in any experimental implementation the average fidelity between the target and output states cannot be perfect. In order for an RSP experiment to demonstrate genuine quantum advantages, it must surpass the optimal threshold of a comparable classical protocol. Here we study the fidelity achievable by RSP protocols lacking shared entanglement, and determine the optimal value for the average fidelity in several different cases. We implement an experimental scheme for deterministic remote preparation of arbitrary photon polarization qubits, preparing 178 different pure and mixed qubit states with an average fidelity of 0.995. Our experimentally-achieved average fidelities surpass our derived classical thresholds whenever the classical protocol does not trivially allow for perfect RSP.

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.

We show for any $d,m\ge 2$ with $(d,m)\neq (2,2)$, the matrix-valued generalization of the (tensor product) quantum correlation set of $d$ inputs and $m$ outputs is not closed. Our argument uses a reformulation of super-dense coding and teleportation in terms of $C^*$-algebra isomorphisms. Namely, we prove that for certain actions of cyclic group ${{\mathbb{Z}}}_d$, $$\begin{equation*}M_d(C^*({{\mathbb{F}}}_{d^2}))\cong{{\mathcal{B}}}_d\rtimes{{\mathbb{Z}}}_d\rtimes{{\mathbb{Z}}}_d , M_d({{\mathcal{B}}}_d)\cong C^*({{\mathbb{F}}}_{d^2})\rtimes{{\mathbb{Z}}}_d\rtimes{{\mathbb{Z}}}_d,\end{equation*}$$where ${{\mathcal{B}}}_d$ is the universal unital $C^*$-algebra generated by the elements $u_{jk}, \, 0 \le i, j \le d-1$, satisfying the relations that $[u_{j,k}]$ is a unitary operator, and $C^*({{\mathbb{F}}}_{d^2})$ is the universal $C^*$-algebra of $d^2$ unitaries. These isomorphisms provide a nice connection between the embezzlement of entanglement and the non-closedness of quantum correlation sets.

A quantum computer based on the manipulation and detection of coherent states of electrons localized above a helium film is described. Each quantum logic element (qubit) is made of a combination of the ground and first excited states of an electron trapped in the image potential well at the surface. Potentials applied to micro-electrodes located beneath each electron confine the lateral motion of the electron and are used to operate gates. Mechanisms for one- and two-qubit logic operations and a readout of the final state are discussed. The principle decay channel for the excited state is via the emission of one phonon into the bulk liquid. Dechoherence times are calculated to be of order of 100 μs and allow greater than 10⁴ serial operations.