Random Exclusion Codes: Quantum Advantages of Single-Shot Communication

• URL: http://arxiv.org/abs/2506.07701v1
• Date: Mon, 09 Jun 2025 12:40:10 GMT
• Title: Random Exclusion Codes: Quantum Advantages of Single-Shot Communication
• Authors: Joonwoo Bae, Kieran Flatt, Teiko Heinosaari, Oskari Kerppo, Karthik Mohan, Andrés Muñoz-Moller, Ashutosh Rai,
• Abstract summary: Two-party communication primitive, Random Exclusion Code (REC), is a single-shot prepare-and-measure protocol.<n>We show that RECs with quantum resources achieve higher success probabilities than classical strategies.<n>We also show that a guessing counterpart, random access codes (RACs), may not have a dimension advantage over classical resources.
• Score: 0.6596280437011043
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Identifying information tasks that offer advantages over their classical counterparts by exploiting quantum resources finds the usefulness of quantum information technologies. In this work, we introduce a two-party communication primitive, Random Exclusion Code (REC), which is a single-shot prepare-and-measure protocol where a sender encodes a random message into a shorter sequence and a receiver attempts to exclude a randomly chosen letter in the original message. We present quantum advantages in RECs in two ways: probability and dimension. We show that RECs with quantum resources achieve higher success probabilities than classical strategies. We verify that the quantum resources required to describe detection events of RECs have a smaller dimension than classical ones. We also show that a guessing counterpart, random access codes (RACs), may not have a dimension advantage over classical resources. Our results elucidate various possibilities of achieving quantum advantages in two-party communication.

Related papers

• Gottesman-Knill Limit on One-way Communication Complexity: Tracing the Quantum Advantage down to Magic [0.0]
  We show that any one-way communication complexity protocol implemented using a prime-dimensional quantum system can always be simulated exactly by communicating a classical system of the same dimension.<n>In direct analogy with the Gottesman-Knill theorem in quantum computation, our result identifies the same resources as essential for realizing quantum advantage in one-way communication complexity.
  arXiv  Detail & Related papers  (2025-06-24T06:57:52Z)
• Limits of Classical correlations and Quantum advantages under (Anti-)Distinguishability constraints in Multipartite Communication [0.0]
  We show that quantum strategies without any shared entanglement can outperform the classical ones.<n>Explicit quantum protocols are studied that violate these inequalities.<n>We prove that when each sender has a binary input, the quantum advantage grows with the number of senders.
  arXiv  Detail & Related papers  (2025-06-09T12:38:58Z)
• Quantum Advantage: A Single Qubit's Experimental Edge in Classical Data Storage [5.669806907215807]
  We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. Our work paves the way for immediate applications in near-term quantum technologies.
  arXiv  Detail & Related papers  (2024-03-05T05:09:32Z)
• Overcoming Traditional No-Go Theorems: Quantum Advantage in Multiple Access Channels [0.0]
  We establish a novel advantage of quantum communication in a commonly encountered network configuration known as the Multiple Access Channel (MAC) Unlike the quantum superdense coding protocol, the advantage reported here is realized without invoking entanglement between the senders and the receiver. The presented quantum advantage hints at a profound connection with the concept of quantum nonlocality without inputs' and holds the potential for semi-device-independent certification of entangled measurements.
  arXiv  Detail & Related papers  (2023-09-29T14:15:35Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Prior Entanglement Exponentially Improves One-Server Quantum Private Information Retrieval for Quantum Messages [60.889483085250355]
  We find an exponential gap in the communication complexities between the presence and absence of prior entanglement. We propose an efficient one-server one-round QPIR protocol with prior entanglement.
  arXiv  Detail & Related papers  (2023-04-11T10:34:53Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Two instances of random access code in the quantum regime [0.09545101073027092]
  We consider two classes of quantum generalisations of Random Access Code (RAC) First class is based on a random access code with quantum inputs and output known as No-Signalling Quantum RAC (NS-QRAC) Second class is based on a random access code with a quantum channel and shared entanglement.
  arXiv  Detail & Related papers  (2022-08-30T17:43:37Z)
• Quantum Semantic Communications for Resource-Efficient Quantum Networking [52.3355619190963]
  This letter proposes a novel quantum semantic communications (QSC) framework exploiting advancements in quantum machine learning and quantum semantic representations. The proposed framework achieves approximately 50-75% reduction in quantum communication resources needed, while achieving a higher quantum semantic fidelity.
  arXiv  Detail & Related papers  (2022-05-05T03:49:19Z)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Secure Two-Party Quantum Computation Over Classical Channels [63.97763079214294]
  We consider the setting where the two parties (a classical Alice and a quantum Bob) can communicate only via a classical channel. We show that it is in general impossible to realize a two-party quantum functionality with black-box simulation in the case of malicious quantum adversaries. We provide a compiler that takes as input a classical proof of quantum knowledge (PoQK) protocol for a QMA relation R and outputs a zero-knowledge PoQK for R that can be verified by classical parties.
  arXiv  Detail & Related papers  (2020-10-15T17:55:31Z)
• Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication [56.678354403278206]
  We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack.
  arXiv  Detail & Related papers  (2020-03-30T09:25:13Z)
• Quantum Advantage for Shared Randomness Generation [0.0]
  We show that quantum systems provide an advantage over their classical counterpart. In a resource theoretic set-up, this feature of quantum systems can be interpreted as an advantage in winning a two players co-operative game. Protocols presented here are noise-robust and hence should be realizable with state-of-the-art quantum devices.
  arXiv  Detail & Related papers  (2020-01-07T05:02:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.