English
Related papers

Related papers: Mutually Unbiased Balanced Functions & Generalized…

200 papers

Random access codes are an intriguing class of communication tasks that reveal an operational and quantitative difference between classical and quantum information processing. We formulate a natural generalization of random access codes and…

Quantum Physics · Physics 2022-06-22 Teiko Heinosaari , Leevi Leppäjärvi

Massive machine-type communications (mMTC) demand robust solutions to support extensive connectivity efficiently. Unsourced random access (URA) has emerged as a promising approach, delivering high spectral and energy efficiency. Among URA…

Information Theory · Computer Science 2025-12-25 Liandong Hu , Jian Dang , Zaichen Zhang

We consider the problem of reliable communication over multiple-access channels (MAC) where the channel is driven by an independent and identically distributed state process and the encoders and the decoder are provided with various degrees…

Information Theory · Computer Science 2012-01-20 Nevroz Şen , Fady Alajaji , Serdar Yüksel , Giacomo Como

A quantum random access code (QRAC) is a map $x\mapsto\rho_x$ that encodes $n$-bit strings $x$ into $m$-qubit quantum states $\rho_x$, in a way that allows us to recover any one bit of $x$ with success probability $\geq p$. The measurement…

Quantum Physics · Physics 2025-06-03 Han-Hsuan Lin , Ronald de Wolf

The sequential quantum random access code (QRAC) allows two or more decoders to obtain a desired message with higher success probability than the best classical bounds by appropriately modulating the measurement sharpness. Here, we propose…

Quantum Physics · Physics 2021-05-03 Ya Xiao , Xin-Hong Han , Xuan Fan , Hui-Chao Qu , Yong-Jian Gu

We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with…

Quantum Physics · Physics 2019-11-07 Uma Girish , Ran Raz , Avishay Tal

This paper studies the gap between quantum one-way communication complexity $Q(f)$ and its classical counterpart $C(f)$, under the {\em unbounded-error} setting, i.e., it is enough that the success probability is strictly greater than 1/2.…

Quantum Physics · Physics 2007-09-18 Kazuo Iwama , Harumichi Nishimura , Rudy Raymond , Shigeru Yamashita

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…

Information Theory · Computer Science 2021-02-16 Vamsi K. Amalladinne , Allen Hao , Stefano Rini , Jean-Francois Chamberland

The capacity region of a two-transmitter Gaussian multiple access channel (MAC) under average input power constraints is studied, when the receiver employs a zero-threshold one-bit analog-to-digital converter (ADC). It is proved that the…

Information Theory · Computer Science 2018-10-17 Borzoo Rassouli , Morteza Varasteh , Deniz Gunduz

In this paper we study the multiple access channel (MAC) with combined cooperation and partial cribbing and characterize its capacity region. Cooperation means that the two encoders send a message to one another via a rate-limited link…

Information Theory · Computer Science 2014-04-04 Tal Kopetz , Haim Permuter , Shlomo Shamai

Multiple access communication systems enable numerous users to share common communication resources, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication networks, supporting…

Information Theory · Computer Science 2025-11-17 Mert Ozates , Mohammad Javad Ahmadi , Mohammad Kazemi , Deniz Gündüz , Tolga M. Duman

Recent days have witnessed significant interests in applying quantum-enhanced techniques for solving a variety of machine learning tasks. Variational methods that use quantum resources of imperfect quantum devices with the help of classical…

Quantum Physics · Physics 2021-11-15 Hiroshi Yano , Yudai Suzuki , Kohei M. Itoh , Rudy Raymond , Naoki Yamamoto

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…

Quantum Physics · Physics 2025-02-04 Tushita Prasad , Markus Grassl

Communication complexity is a fundamental aspect of information science, concerned with the amount of communication required to solve a problem distributed among multiple parties. The standard quantification of one-way communication…

Quantum Physics · Physics 2024-12-25 Satyaki Manna , Anubhav Chaturvedi , Debashis Saha

We show how nonclassical correlations in local bipartite states can act as a resource for quantum information processing. Considering the task of quantum random access codes (RAC) through separable Bell-diagonal states, we demonstrate the…

Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a…

Quantum Physics · Physics 2021-11-03 Tamal Guha , Mir Alimuddin , Sumit Rout , Amit Mukherjee , Some Sankar Bhattacharya , Manik Banik

Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…

Quantum Physics · Physics 2025-03-03 Saronath Halder , Alexander Streltsov

We propose a protocol to encode classical bits in the measurement statistics of many-body Pauli observables, leveraging quantum correlations for a random access code. Measurement contexts built with these observables yield outcomes with…

Quantum Physics · Physics 2023-01-18 Giancarlo Gatti , Daniel Huerga , Enrique Solano , Mikel Sanz

A memoryless state-dependent multiple-access channel (MAC) is considered, where two transmitters wish to convey their messages to a single receiver while simultaneously sensing (estimating) the respective states via generalized feedbacks.…

Information Theory · Computer Science 2022-04-01 Mehrasa Ahmadipour , Michele Wigger , Mari Kobayashi

We consider the task of communicating a generic bivariate function of two classical sources over a Classical-Quantum Multiple Access Channel (CQ-MAC). The two sources are observed at the encoders of the CQ-MAC, and the decoder aims at…

Information Theory · Computer Science 2022-02-24 Mohammad Aamir Sohail , Touheed Anwar Atif , S. Sandeep Pradhan , Arun Padakandla