Locally unextendible non-maximally entangled basis

We show that a qubit can be used to substitute for a classical analog system requiring an arbitrarily large number of classical bits to represent digitally. Let a physical system S interact locally with a classical field varphi(x) as S travels directly from point A to point B. Our task is to use S to answer a simple yes/no question about varphi(x). If S is a qubit, the task can be done perfectly. We show that any classical system S must encode an arbitrarily large number of classical bits to solve the same task. This result implies a large quantum advantage in the memory size necessary for some computations. We also show that no finite amount of one-way classical communication can perfectly simulate the effect of quantum entanglement.

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.

In this paper, we first propose a remote state preparation (RSP) scheme in the traditional sense, which accomplishes the remote preparation of a single-qubit controlled by multiple agents in the network. This triggers a new RSP scheme, by which we can remotely prepare tensor product-type quantum states controlled by one agent. After that, we generalize the above approach to the RSP scheme of multi-qubit information controlled by multiple agents in the network. In the extended scheme, as long as all agents operate faithfully, the receiver can recover all qubits of information in the original state; otherwise, the scheme fails. Such a scheme entangles quantum information in the preparation process, thus slashing the cost of such quantum resources as auxiliary qubits and local unitary operations, and, meanwhile, reducing the number of classical bits transferred among participants. Finally, we further investigate the remote preparation scheme for multiple qubit-string information under the control of multiple agents in the network.

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%.

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 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.

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.

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.

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.

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.

We present a scheme for the preparation of arbitrary non-maximally entangled states of two two-level atoms. The distinct feature of the effective Hamiltonian is that it is independent of the photon-number of the cavity field. Thus the scheme is insensitive to the cavity decay and the atom radiation.

Entangled states are an important resource for quantum information processing and for the fundamental understanding of quantum physics. An intriguing open question would be whether entanglement can improve the performance of quantum heat engines in particular. One of the promising platforms to address this question is to use entangled atoms as a non-thermal bath for cavity photons, where the cavity mirror serves as a piston of the engine. Here we theoretically investigate a photonic quantum engine operating under an effective reservoir consisting of quantum-correlated pairs of atoms. We find that maximally entangled Bell states alone do not help extract useful work from the reservoir unless some extra populations in the excited states or ground states are taken into account. Furthermore, high efficiency and work output are shown for the non-maximally entangled superradiant state, while negligible for the subradiant state due to lack of emitted photons inside the cavity. Our results provide insights in the role of quantum-correlated atoms in a photonic engine and present new opportunities in designing a better quantum heat engine.

We consider a scenario where a party, say, Alice prepares a pure two-qubit (either maximally entangled or non-maximally entangled) state and sends one half of this state to another distant party, say, Bob through a qubit (either unital or non-unital) channel. Finally, the shared state is used as a teleportation channel. In this scenario, we focus on characterizing the set of qubit channels with respect to the final state's efficacy as a resource of quantum teleportation (QT) in terms of maximal average fidelity and fidelity deviation (fluctuation in fidelity values over the input states). Importantly, we point out the existence of a subset of qubit channels for which the final state becomes useful for universal QT (having maximal average fidelity strictly greater than the classical bound and having zero fidelity deviation) when the initially prepared state is either useful for universal QT (i.e., for a maximally entangled state) or not useful for universal QT (i.e., for a subset of non-maximally entangled pure states). Interestingly, in the latter case, we show that non-unital channels (dissipative interactions) are more effective than unital channels (non-dissipative interactions) in producing useful states for universal QT from non-maximally entangled pure states.

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.