On communication over an entanglement-assisted quantum channel. (arXiv:quant-ph/0206122v1 CROSS LISTED)

Ashwin Nayak, Julia Salzman

Published Mar 21, 2018• 0 citations

Abstract

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or significantly reduce the classical complexity of computing functions (as compared to private-coin protocols), shared entanglement leads to startling phenomena such as ``quantum teleportation'' and ``superdense coding.'' The problem of characterising the power of prior entanglement has puzzled many researchers. In this paper, we revisit the problem of transmitting classical bits over an entanglement-assisted quantum channel. We derive a new, optimal bound on the number of quantum bits required for this task, for any given probability of error. All known lower bounds in the setting of bounded error entanglement-assisted communication are based on sophisticated information theoretic arguments. In contrast, our result is derived from first principles, using a simple linear algebraic technique.

Related papers

Codes for entanglement-assisted classical communication

Tushita Prasad, Markus Grassl

Abstract Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which presents a challenge for real-world implementation. In response, we introduce a new EACC scheme capable of correcting a fixed number of erasures/errors. It can be adjusted to the available amount of entanglement and sends classical information over a quantum channel. We establish a general framework to accomplish such a task by reducing it to a classical problem. Comparing with specific bounds, we identify optimal parameter ranges. The scheme requires only the implementation of super-dense coding which has been demonstrated successfully in experiments. Furthermore, our results show that an adaptable entanglement use confers a communication advantage. Overall, our work sheds light on how entanglement can elevate various finite-length communication protocols, opening new avenues for exploration in the field.

arXiv:2310.19774npj Quantum InformationJan 27, 20253 citations

8 Optimal Direct Sum and Privacy Trade-off Results for Quantum and Classical Communication Complexity [Full version]⋆

Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen

We show optimal Direct Sum result for the one-way entanglement-assisted quantum com- munication complexity for any relation fX × Y × Z. We show: Q 1,pub (f ⊕m ) = (m · Q 1,pub (f)), where Q 1,pub (f), represents the one-way entanglement-assisted quantum communication complexity of f with error at most 1/3 and f ⊕m represents m-copies of f. Similarly for the one-way public-coin classical communication complexity we show: R 1,pub (f ⊕m ) = (m · R 1,pub (f)), where R 1,pub (f), represents the one-way public-coin classical communication complexity of f with error at most 1/3. We show similar optimal Direct Sum results for the Simultaneous Message Passing (SMP) quantum and classical models. For two-party two-way protocols we present optimal Privacy Trade-off results leading to a Weak Direct Sum result for such protocols. We show our Direct Sum and Privacy Trade-off results via message compression arguments. These arguments also imply a new round elimination lemma in quantum communication, which allows us to extend classical lower bounds on the cell probe complexity of some data structure problems, e.g. Approximate Nearest Neighbor Searching (ANN) on the Hamming cube {0,1} n and Predecessor Search to the quantum setting. In a separate result we show that Newman's (New91) technique of reducing the number of public-coins in a classical protocol cannot be lifted to the quantum setting. We do this by defining a general notion of black-box reduction of prior entanglement that subsumes Newman's technique. We prove that such a black-box reduction is impossible for quantum protocols by exhibiting a particular one-round quantum protocol for the Equality function where the black-box technique fails to reduce the amount of prior entanglement by more than a constant factor.

Aug 17, 20162 citations

Entanglement assisted communication complexity measured by distinguishability

Satyaki Manna, Ankush Pandit, Anubhav Chaturvedi +1 more

We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the distinguishability of the sender's inputs, we demonstrate that entanglement-assisted communication with both classical and quantum message can outperform classical communication supplemented with shared randomness. We begin by developing a general framework for communication tasks with pre-shared correlations. Within this framework, we establish an equivalence among entanglement-assisted classical communication, entanglement-assisted quantum communication, and quantum communication, showing that no hierarchy exists between these three paradigms. We then investigate the scenario where the receiver has no input and prove that no advantage can arise in this case. However, an advantage in the entanglement-assisted setting emerges once additional constraints are imposed on the dimension of the communicated message. This further highlights the superiority of entanglement-assisted classical communication over standard quantum communication. Then we demonstrate several tasks where the entanglement-assisted protocol using one-bit communication proves to be advantageous over classical communication. Finally, by constructing an explicit class of communication tasks, we show that a non-maximally entangled states outperform the maximally entangled state as a pre-shared resource between the communicating parties.

quant-pharXiv:2603.19105Mar 20, 20260 citations

Adaptive Advantage in Entanglement-Assisted Communications

Jef Pauwels, Stefano Pironio, Emmanuel Zambrini Cruzeiro +1 more

Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer. Entanglement-assisted classical communication protocols usually consist of two successive rounds: first, a Bell test round, in which the parties measure their local shares of the entangled state, and then a communication round, where they exchange classical messages. Here, we go beyond this standard approach and investigate adaptive uses of entanglement: we allow the receiver to wait for the arrival of the sender's message before measuring their share of the entangled state. We first show that such adaptive protocols improve the success probability in random access codes. Second, we show that once adaptive measurements are used, an entanglement-assisted bit becomes a strictly stronger resource than a qubit in prepare-and-measure scenarios. We briefly discuss the extension of these ideas to scenarios involving quantum communication and we identify resource inequalities.

arXiv:2203.05372Physical Review LettersSep 14, 202215 citations

Optimal entanglement-assisted one-shot classical communication

Brett Hemenway, Carl A. Miller, Yaoyun Shi +1 more

The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be successfully sent via a single use of the channel. Prevedel et al. [Phys. Rev. Lett. 106, 110505 (2011)] recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. In this paper, we characterize the optimal entanglement-assisted protocols in terms of the radius of a set of operators associated with the channel. This characterization can be used to construct optimal entanglement-assisted protocols for a given classical channel and to prove the limits of such protocols. As an example, we show that the Prevedel et al. protocol is optimal for two-qubit entanglement. We also prove some tight upper bounds on the improvement that can be obtained from quantum and nonsignaling correlations.

arXiv:1201.1521Physical Review AJun 3, 20135 citations

Classical Error-correcting Codes in Quantum Communications

Christopher Boyd

This thesis investigates the feasibility of utilising classical error-correcting codes in quantum communications, specifically in the entanglement-assisted communication of classical information over quantum depolarising channels. A classical-quantum communication system is presented, which relies on error-correction in the classical domain to achieve a classical information rate that approaches the entanglement-assisted capacity of a depolarising channel. Classical information is transmitted over the quantum channel by means of the superdense coding protocol. Different scenarios for the system are considered, including the noiseless and noisy distribution of initial entanglement resources and the use of higher-order entangled states. The overall transmission model corresponding to each scenario is shown to reduce to a classical, discrete and memoryless channel. The capacities of these equivalent classical channels are derived, and an inherent capacity loss when binary classical error correcting codes are employed is identified, motivating the use of non-binary codes. It is ultimately demonstrated that duo-binary turbo codes outperform binary turbo codes in all investigated scenarios, a result of the former's ability to exploit correlations between the pairs of classical bits communicated via the superdense coding protocol.

Oct 20, 20143 citations