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

arXiv:2604.08214

Quantum Integrated Communication and Computing Over Multiple-Access Bosonic Channel

Ioannis Krikidis

Published Apr 9, 2026• 0 citations
arXivHTMLPDF

Abstract

We investigate a quantum integrated communication and computation (QICC) scheme for a single-mode bosonic multiple-access channel (MAC) with coherent-state signalling. By exploiting the natural superposition property of the quantum MAC, a common receiver simultaneously performs over-the-air computation (OAC) on the analogue symbols transmitted by one set of devices and decodes multiple-access data from another. The joint design of the transmit power control and the receive coefficient leads to a non-convex optimization problem that maximizes computation accuracy under a prescribed sum-rate communication constraint. To address this challenge, we develop a low-complexity alternating-optimization framework that incorporates: (i) closed-form linear minimum-mean square error updates for the receive coefficient, (ii) monotonicity properties of the quantum sum-rate constraint, and (iii) projected-gradient refinements for the communication powers. The proposed QICC scheme achieves an effective computation-communication trade-off with fast convergence and low computational complexity.

DOI
10.48550/arxiv.2604.08214

Related papers

Quantum Integrated Communication and Computing Over Multiple-Access Bosonic Channel

Ioannis Krikidis

We investigate a quantum integrated communication and computation (QICC) scheme for a single-mode bosonic multiple-access channel (MAC) with coherent-state signalling. By exploiting the natural superposition property of the quantum MAC, a common receiver simultaneously performs over-the-air computation (OAC) on the analogue symbols transmitted by one set of devices and decodes multiple-access data from another. The joint design of the transmit power control and the receive coefficient leads to a non-convex optimization problem that maximizes computation accuracy under a prescribed sum-rate communication constraint. To address this challenge, we develop a low-complexity alternating-optimization framework that incorporates: (i) closed-form linear minimum-mean square error updates for the receive coefficient, (ii) monotonicity properties of the quantum sum-rate constraint, and (iii) projected-gradient refinements for the communication powers. The proposed QICC scheme achieves an effective computation–communication trade-off with fast convergence and low computational complexity.

IEEE Signal Processing Letters•Jan 1, 2026•0 citations

Computation-Aided Classical-Quantum Multiple Access to Boost Network Communication Speeds

Masahito Hayashi, M. A. Vázquez‐Castro

A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (CQ MAC), achievable rates are known assuming that all the messages are decoded, a common assumption in quantum network design. However, such a conventional design approach ignores the global network structure, i.e., the network topology. When a CQ MAC is given as a part of quantum network communication, this work shows that computation properties can be used to boost communication speeds with code design dependent on the network topology. We quantify achievable quantum communication rates of codes with the computation property for a two-sender CQ MAC. When the two-sender CQ MAC is a boson coherent channel with binary discrete modulation, we show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design. Further, such a rate can be achieved by different detection methods: quantum (with and without quantum memory), on-off photon counting, and homodyne (each at different photon power). Finally, we describe two practical applications, one of which cryptographic.

arXiv:2105.14505•Physical Review Applied•Nov 10, 2021•18 citations

Unified approach for computing sum of sources over CQ-MAC

Mohammad Aamir Sohail, Touheed Anwar Atif, S. Sandeep Pradhan

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 reconstructing a bivariate function from the received quantum state. Inspired by the techniques developed for the classical setting, and employing the technique of simultaneous (joint) decoding developed for the CQ setup, we propose and analyze a coding scheme based on a classical superposition of algebraic structured codes and unstructured codes, and the idea of embedding functions on a prime field. We derive a new set of sufficient conditions that strictly enlarge the largest known set of sources (capable of communicating the bivariate function) for any given CQ-MAC. We provide these conditions in terms of single-letter quantum information-theoretic quantities.

arXiv:2202.10403•IEEE International Symposium on Information Theory (ISIT)•Jun 26, 2022•9 citations

On the Capacity of Vector Linear Computation Over a Noiseless Quantum Multiple-Access Channel With Entangled Transmitters

Yuhang Yao, Syed A. Jafar

Network function computation is an active topic in network coding, with much recent progress for linear (over a finite field) computations over broadcast (LCBC) and multiple access (LCMAC) channels. Over a quantum multiple access channel (QMAC) with quantum-entanglement shared among transmitters, the linear computation problem (LC-QMAC) is non-trivial even when the channel is noiseless, because of the challenge of optimally exploiting transmit-side entanglement through distributed coding. Given an arbitrary linear function of data streams defined in a finite field$\mathbb {F}_{d}$, the LC-QMAC problem seeks the optimal communication cost (minimum number of qudits that need to be sent by the transmitters to the receiver, per computation instance) over a noise-free QMAC, when the independent input data streams originate at the corresponding transmitters, who share quantum entanglement in advance. As our main result, we fully solve this problem for$K=3$transmitters ($K\geq 4$settings remain open). Coding schemes based on the$N$-sum box protocol (along with time-sharing and batch-processing) are shown to be information theoretically optimal in all cases.

arXiv:2407.01498•IEEE Transactions on Quantum Engineering•Jan 1, 2025•2 citations

Communication Efficiency of Summation Over a Two-Layer Quantum MAC

Huaming Mai, Wenkang Cen, Jinbei Zhang +1 more

To compute a summation$(\Sigma)$of independent classical data streams from multiple servers over a quantum multiple access channel (QMAC), every server must directly send its quantum system containing multiple qudits to the user. Previous work$\Sigma$-QMAC in [1] considers that the servers are entangled. In this work, the maximum rate, defined as the maximum number of dits of the sum computed per qudit transmitted, is derived, and a quantum coding scheme is designed to achieve it. In practice, a server is not always directly connected to the user, necessitating a relay between them for connectivity. Motivated by this, we consider a two-layer quantum MAC (2QMAC) model, where a user is connected to a layer of mirrors, and one of the mirrors (acting as a relay) is connected to a layer of servers. Quantum systems within the same layer are entangled, whereas quantum systems across different layers are independent. In$\Sigma-2\text{QMAC}$, deriving the maximum rates of two layers simultaneously is challenging since the rates of the two layers affect each other. To address this, we first derive the maximum rate of the first layer by neglecting the second layer. Second, to relate the rates of the two layers, we derive the maximum rate of the second layer for a given feasible rate (less than the maximum rate) of the first layer. In addition, a joint coding scheme based on the$N$-sum box abstraction is designed to achieve the maximum rate of the second layer.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 24, 2024•1 citation

Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication

Yu-Chen Shen, Matthieu R. Bloch

We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC). We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation. Specifically, we demonstrate that in the low-photon regime the capacity region collapses into a rectangle, asymptotically matching the point-to-point capacity as multi-user interference vanishes. We also characterize an achievable covert throughput region, showing that entanglement assistance enables an aggregate throughput scaling of \(O(\sqrt{n} \log n)\) covert bits with the block length $n$ for both senders, surpassing the square-root law as in the point-to-point case. Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.

quant-pharXiv:2601.21869•IEEE International Symposium on Information Theory (ISIT)•Jan 30, 2026•0 citations
We investigate a quantum integrated communication and computation (QICC) scheme for a single-mode bosonic multiple-access channel (MAC) with coherent-state signalling. By exploiting the natural superposition property of the quantum MAC, a common receiver simultaneously performs over-the-air computation (OAC) on the analogue symbols transmitted by one set of devices and decodes multiple-access data from another. The joint design of the transmit power control and the receive coefficient leads to a non-convex optimization problem that maximizes computation accuracy under a prescribed sum-rate communication constraint. To address this challenge, we develop a low-complexity alternating-optimization framework that incorporates: (i) closed-form linear minimum-mean square error updates for the receive coefficient, (ii) monotonicity properties of the quantum sum-rate constraint, and (iii) projected-gradient refinements for the communication powers. The proposed QICC scheme achieves an effective computation-communication trade-off with fast convergence and low computational complexity.
We investigate a quantum integrated communication and computation (QICC) scheme for a single-mode bosonic multiple-access channel (MAC) with coherent-state signalling. By exploiting the natural superposition property of the quantum MAC, a common receiver simultaneously performs over-the-air computation (OAC) on the analogue symbols transmitted by one set of devices and decodes multiple-access data from another. The joint design of the transmit power control and the receive coefficient leads to a non-convex optimization problem that maximizes computation accuracy under a prescribed sum-rate communication constraint. To address this challenge, we develop a low-complexity alternating-optimization framework that incorporates: (i) closed-form linear minimum-mean square error updates for the receive coefficient, (ii) monotonicity properties of the quantum sum-rate constraint, and (iii) projected-gradient refinements for the communication powers. The proposed QICC scheme achieves an effective computation–communication trade-off with fast convergence and low computational complexity.
A multiple access channel (MAC) consists of multiple senders simultaneously transmitting their messages to a single receiver. For the classical-quantum case (CQ MAC), achievable rates are known assuming that all the messages are decoded, a common assumption in quantum network design. However, such a conventional design approach ignores the global network structure, i.e., the network topology. When a CQ MAC is given as a part of quantum network communication, this work shows that computation properties can be used to boost communication speeds with code design dependent on the network topology. We quantify achievable quantum communication rates of codes with the computation property for a two-sender CQ MAC. When the two-sender CQ MAC is a boson coherent channel with binary discrete modulation, we show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design. Further, such a rate can be achieved by different detection methods: quantum (with and without quantum memory), on-off photon counting, and homodyne (each at different photon power). Finally, we describe two practical applications, one of which cryptographic.
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 reconstructing a bivariate function from the received quantum state. Inspired by the techniques developed for the classical setting, and employing the technique of simultaneous (joint) decoding developed for the CQ setup, we propose and analyze a coding scheme based on a classical superposition of algebraic structured codes and unstructured codes, and the idea of embedding functions on a prime field. We derive a new set of sufficient conditions that strictly enlarge the largest known set of sources (capable of communicating the bivariate function) for any given CQ-MAC. We provide these conditions in terms of single-letter quantum information-theoretic quantities.
Network function computation is an active topic in network coding, with much recent progress for linear (over a finite field) computations over broadcast (LCBC) and multiple access (LCMAC) channels. Over a quantum multiple access channel (QMAC) with quantum-entanglement shared among transmitters, the linear computation problem (LC-QMAC) is non-trivial even when the channel is noiseless, because of the challenge of optimally exploiting transmit-side entanglement through distributed coding. Given an arbitrary linear function of data streams defined in a finite fieldFd\mathbb {F}_{d}Fd​, the LC-QMAC problem seeks the optimal communication cost (minimum number of qudits that need to be sent by the transmitters to the receiver, per computation instance) over a noise-free QMAC, when the independent input data streams originate at the corresponding transmitters, who share quantum entanglement in advance. As our main result, we fully solve this problem forK=3K=3K=3transmitters (K≥4K\geq 4K≥4settings remain open). Coding schemes based on theNNN-sum box protocol (along with time-sharing and batch-processing) are shown to be information theoretically optimal in all cases.
To compute a summation(Σ)(\Sigma)(Σ)of independent classical data streams from multiple servers over a quantum multiple access channel (QMAC), every server must directly send its quantum system containing multiple qudits to the user. Previous workΣ\SigmaΣ-QMAC in [1] considers that the servers are entangled. In this work, the maximum rate, defined as the maximum number of dits of the sum computed per qudit transmitted, is derived, and a quantum coding scheme is designed to achieve it. In practice, a server is not always directly connected to the user, necessitating a relay between them for connectivity. Motivated by this, we consider a two-layer quantum MAC (2QMAC) model, where a user is connected to a layer of mirrors, and one of the mirrors (acting as a relay) is connected to a layer of servers. Quantum systems within the same layer are entangled, whereas quantum systems across different layers are independent. InΣ−2QMAC\Sigma-2\text{QMAC}Σ−2QMAC, deriving the maximum rates of two layers simultaneously is challenging since the rates of the two layers affect each other. To address this, we first derive the maximum rate of the first layer by neglecting the second layer. Second, to relate the rates of the two layers, we derive the maximum rate of the second layer for a given feasible rate (less than the maximum rate) of the first layer. In addition, a joint coding scheme based on theNNN-sum box abstraction is designed to achieve the maximum rate of the second layer.
We consider the problem of covert communication over the entanglement-assisted (EA) bosonic multiple access channel (MAC). We derive a closed-form achievable rate region for the general EA bosonic MAC using high-order phase-shift keying (PSK) modulation. Specifically, we demonstrate that in the low-photon regime the capacity region collapses into a rectangle, asymptotically matching the point-to-point capacity as multi-user interference vanishes. We also characterize an achievable covert throughput region, showing that entanglement assistance enables an aggregate throughput scaling of O(nlog⁡n)O(\sqrt{n} \log n)O(n​logn) covert bits with the block length nnn for both senders, surpassing the square-root law as in the point-to-point case. Our analysis reveals that the joint covertness constraint imposes a linear trade-off between the senders throughput.