Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

On Quantum Noncompression

Samuel Epstein

Published Nov 16, 2015• 0 citations
OpenAlex

Abstract

This article presents a quantum transmission problem, in which Alice is trying to send a number of qbits to Bob. Alice has access to two channels, one that sends classical bits and another that sends quantum bits. We show that under certain error terms, Alice can optimize transmission, up to logarithmic precision, by sending only a classical description of the qbits.

Related papers

Countering quantum noise with supplementary classical information

Jonathan Barrett

We consider situations in which (i) Alice wishes to send quantum information to Bob via a noisy quantum channel, (ii) Alice has a classical description of the states she wishes to send, and (iii) Alice can make use of a finite amount of noiseless classical information. After setting up the problem in general, we focus attention on one specific scenario in which Alice sends a known qubit down a depolarizing channel along with a noiseless classical bit. We describe a protocol that we conjecture is optimal and calculate the average fidelity obtained. A surprising amount of structure is revealed even for this simple case, which suggests that relationships between quantum and classical information could in general be very intricate.

arXiv:quant-ph/0201073•Physical Review A•Jul 2, 2003•3 citations

Error correction, authentication, and false acceptance, probabilities for communication over noisy quantum channels: converse upper bounds on the bit transmission rate

Pete Rigas

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for the bit transmission rate without the presence of significant noise over the channel shared by Alice and Bob for the purposes of encoding, decoding, transmission and authentication, the author suggests that upper bounding the bit transmission rate could be of use towards classifying paradoxical aspects of communication protocols, as well as constructing error correcting codes which are resilient to noise. The upper bound that is obtained in this work for the bit transmission rate, as a converse result, is dependent upon the natural logarithm of the size of each player's alphabet, as well as smaller alphabets, which can be leveraged for simultaneously realizing Quantum advantage for maximizing error correction and minimizing false acceptance. Crucially, the upper bound to the bit transmission rate is dependent upon a pruning procedure, which seeks to determine whether letters from player's alphabets can be removed so that prospective Quantum advantage, in order for Alice and Bob to implement error correction protocols with high probability, despite the fact that there is more noise over the channel between Alice and Bob in comparison to that between Bob and Eve.

arXiv:2507.03035•Jul 3, 2025•5 citations

Zero-error source-channel coding with entanglement

Jop Briët, Harry Buhrman, Monique Laurent +2 more

We study a problem from zero-error information theory—a topic well-known for its rich connections to combinatorics [1,8,10–12,14]—in a setting where a sender and receiver may use quantum entanglement, one of the most striking features of quantum mechanics. The problem that we consider is the classical source-channel coding problem , where Alice and Bob are each given an input from a random source and get access to a noisy channel through which Alice can send messages to Bob. Their goal is to minimize the average number of channel uses per source input while allowing Bob to learn Alice’s inputs. Here we show that entanglement can allow for an unbounded decrease in the asymptotic rate of classical source-channel codes. We also consider the source problem , the case where Alice can send messages to Bob without noise. We prove a lower bound on the rate of source codes with entanglement in terms of a variant of the Lovász theta number [10,13], a graph parameter given by a semidefinite program.

Scuola Normale Superiore eBooks•Jan 1, 2013•9 citations

On Achieving Superluminal Communication

Dhananjay P. Mehendale

What is proposed here is a simple modication in the quantum protocol [1] for achieving instantaneous teleportation of arbitrary quantum state from Alice to Bob even when Bob is several light years away. This modied quantum protocol is constructed by adding a step the in the celebrated quantum teleportation protocol [1]. It consists of the action of a unitary operator to be performed by Alice on the qubits in her possession before she does the Bell basis measurement. It is important to note that the existing quantum teleportation protocol [1] requires certain classical communication between the participants, Alice and Bob, and we are going to eliminate this classical communication through our modification. In the existing protocol [1] Alice requires sending the classical bits generated during her Bell basis measurement over a classical channel to Bob for Bob to use these classical bits to determine the exact recovery operation to be performed on the qubit(s) in his possession for creating the exactly identical copy of unknown quantum state that was with Alice and got destroyed during her Bell basis measurement. Alice cannot send the classical bits she obtained to Bob with the speed faster than that of light since it is the well known experimentally veried universal upper limit on the speed. We show that by incorporating suitable unitary operation to be performed by Alice on her qubits before the Bell basis measurement the requirement of the transmission of classical bits by Alice to Bob for the creation of the unknown quantum state by Bob at his place can be completely eliminated. Our modification in the teleportation protocols [1], [2] thus clearly demonstrates the enormous advantage of remaining in the quantum regime and avoiding the requirement of any classical communication for the teleportation of the quantum states.

•Oct 1, 2017•0 citations

Data Transmission in the Fourth Dimension

Serge Burckel

Alice wants to send an arbitrary binary word to Bob. We show here that there is no problem for her to do that with only two bits. Of course, we consider here information like a signal in 4D.

arXiv:0711.0356•Nov 2, 2007•2 citations

Classical Communication

Mark M. Wilde

This chapter begins our exploration of “dynamic” information-processing tasks in quantum Shannon theory, where the term “dynamic” indicates that a quantum channel connects a sender to a receiver and their goal is to exploit this resource for communication. We specifically consider the scenario where a sender Alice would like to communicate classical information to a receiver Bob, and the capacity theorem that we prove here is one particular generalization of Shannon's noisy channel coding theorem from classical information theory (overviewed in Section 2.2). In later chapters, we will see other generalizations of Shannon's theorem, depending on what resources are available to assist their communication or depending on whether they are trying to communicate classical or quantum information. For this reason and others, quantum Shannon theory is quite a bit richer than classical information theory. The naive approach to communicate classical information over a quantum channel is for Alice and Bob simply to mimic the approach used in Shannon's noisy channel coding theorem. That is, they select a random classical code according to some distribution pX(x) , and Bob performs individual measurements of the outputs of a noisy quantum channel according to some POVM. The POVM at the output induces some conditional probability distribution pY∣X(y∣x) , which we can in turn think of as an induced noisy classical channel. The classical mutual information I(X; Y) of this channel is an achievable rate for communication, and the best strategy for Alice and Bob is to optimize the mutual information over all of Alice's inputs to the channel and over all measurements that Bob could perform at the output.

Cambridge University Press eBooks•Apr 18, 2013•0 citations
This article presents a quantum transmission problem, in which Alice is trying to send a number of qbits to Bob. Alice has access to two channels, one that sends classical bits and another that sends quantum bits. We show that under certain error terms, Alice can optimize transmission, up to logarithmic precision, by sending only a classical description of the qbits.
We consider situations in which (i) Alice wishes to send quantum information to Bob via a noisy quantum channel, (ii) Alice has a classical description of the states she wishes to send, and (iii) Alice can make use of a finite amount of noiseless classical information. After setting up the problem in general, we focus attention on one specific scenario in which Alice sends a known qubit down a depolarizing channel along with a noiseless classical bit. We describe a protocol that we conjecture is optimal and calculate the average fidelity obtained. A surprising amount of structure is revealed even for this simple case, which suggests that relationships between quantum and classical information could in general be very intricate.
We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for the bit transmission rate without the presence of significant noise over the channel shared by Alice and Bob for the purposes of encoding, decoding, transmission and authentication, the author suggests that upper bounding the bit transmission rate could be of use towards classifying paradoxical aspects of communication protocols, as well as constructing error correcting codes which are resilient to noise. The upper bound that is obtained in this work for the bit transmission rate, as a converse result, is dependent upon the natural logarithm of the size of each player's alphabet, as well as smaller alphabets, which can be leveraged for simultaneously realizing Quantum advantage for maximizing error correction and minimizing false acceptance. Crucially, the upper bound to the bit transmission rate is dependent upon a pruning procedure, which seeks to determine whether letters from player's alphabets can be removed so that prospective Quantum advantage, in order for Alice and Bob to implement error correction protocols with high probability, despite the fact that there is more noise over the channel between Alice and Bob in comparison to that between Bob and Eve.
We study a problem from zero-error information theory—a topic well-known for its rich connections to combinatorics [1,8,10–12,14]—in a setting where a sender and receiver may use quantum entanglement, one of the most striking features of quantum mechanics. The problem that we consider is the classical source-channel coding problem , where Alice and Bob are each given an input from a random source and get access to a noisy channel through which Alice can send messages to Bob. Their goal is to minimize the average number of channel uses per source input while allowing Bob to learn Alice’s inputs. Here we show that entanglement can allow for an unbounded decrease in the asymptotic rate of classical source-channel codes. We also consider the source problem , the case where Alice can send messages to Bob without noise. We prove a lower bound on the rate of source codes with entanglement in terms of a variant of the Lovász theta number [10,13], a graph parameter given by a semidefinite program.
What is proposed here is a simple modication in the quantum protocol [1] for achieving instantaneous teleportation of arbitrary quantum state from Alice to Bob even when Bob is several light years away. This modied quantum protocol is constructed by adding a step the in the celebrated quantum teleportation protocol [1]. It consists of the action of a unitary operator to be performed by Alice on the qubits in her possession before she does the Bell basis measurement. It is important to note that the existing quantum teleportation protocol [1] requires certain classical communication between the participants, Alice and Bob, and we are going to eliminate this classical communication through our modification. In the existing protocol [1] Alice requires sending the classical bits generated during her Bell basis measurement over a classical channel to Bob for Bob to use these classical bits to determine the exact recovery operation to be performed on the qubit(s) in his possession for creating the exactly identical copy of unknown quantum state that was with Alice and got destroyed during her Bell basis measurement. Alice cannot send the classical bits she obtained to Bob with the speed faster than that of light since it is the well known experimentally veried universal upper limit on the speed. We show that by incorporating suitable unitary operation to be performed by Alice on her qubits before the Bell basis measurement the requirement of the transmission of classical bits by Alice to Bob for the creation of the unknown quantum state by Bob at his place can be completely eliminated. Our modification in the teleportation protocols [1], [2] thus clearly demonstrates the enormous advantage of remaining in the quantum regime and avoiding the requirement of any classical communication for the teleportation of the quantum states.
This chapter begins our exploration of “dynamic” information-processing tasks in quantum Shannon theory, where the term “dynamic” indicates that a quantum channel connects a sender to a receiver and their goal is to exploit this resource for communication. We specifically consider the scenario where a sender Alice would like to communicate classical information to a receiver Bob, and the capacity theorem that we prove here is one particular generalization of Shannon's noisy channel coding theorem from classical information theory (overviewed in Section 2.2). In later chapters, we will see other generalizations of Shannon's theorem, depending on what resources are available to assist their communication or depending on whether they are trying to communicate classical or quantum information. For this reason and others, quantum Shannon theory is quite a bit richer than classical information theory. The naive approach to communicate classical information over a quantum channel is for Alice and Bob simply to mimic the approach used in Shannon's noisy channel coding theorem. That is, they select a random classical code according to some distribution pX(x) , and Bob performs individual measurements of the outputs of a noisy quantum channel according to some POVM. The POVM at the output induces some conditional probability distribution pY∣X(y∣x) , which we can in turn think of as an induced noisy classical channel. The classical mutual information I(X; Y) of this channel is an achievable rate for communication, and the best strategy for Alice and Bob is to optimize the mutual information over all of Alice's inputs to the channel and over all measurements that Bob could perform at the output.