The Capacity of Classical Summation over a Quantum MAC with Arbitrarily Distributed Inputs and Entanglements

Abstract

The $\Sigma$-QMAC problem is introduced, involving $S$ servers, $K$ classical (${\mathbb{F}}_d$) data streams, and $T$ independent quantum systems. Data stream ${\mathsf{W}}_k,k\in [K]$ is replicated at a subset of servers $\mathcal{W}(k)\subset [S]$, and quantum system ${\mathcal{Q}}_t,t\in [T]$ is distributed among a subset of servers $\mathcal{E}(t)\subset [S]$ such that Server $s\in \mathcal{E}(t)$ receives subsystem ${\mathcal{Q}}_{t,s}$ of ${\mathcal{Q}}_t=({\mathcal{Q}}_{t,s}{)}_{s\in \mathcal{E}(t)}$. Servers manipulate their quantum subsystems according to their data and send the subsystems to a receiver. The total download cost is ${\sum }_{t\in [T]}{\sum }_{s\in \mathcal{E}(t)}{\log }_d|{\mathcal{Q}}_{t,s}|$ qudits, where $|\mathcal{Q}|$ is the dimension of $\mathcal{Q}$. The states and measurements of $({\mathcal{Q}}_t{)}_{t\in [T]}$ are required to be separable across $t\in [T]$ throughout, but for each $t\in [T]$, the subsystems of ${\mathcal{Q}}_t$ can be prepared initially in an arbitrary (independent of data) entangled state, manipulated arbitrarily by the respective servers, and measured jointly by the receiver. From the measurements, the receiver must recover the sum of all data streams. Rate is defined as the number of dits (${\mathbb{F}}_d$ symbols) of the desired sum computed per qudit of download. The capacity of $\Sigma$-QMAC, i.e., the supremum of achievable rates is characterized for arbitrary data replication and entanglement distribution maps $\mathcal{W},\mathcal{E}$. Coding based on the $N$-sum box abstraction is optimal in every case. Notably, for every $S\ne 3$ there exists an instance of the $\Sigma$-QMAC where $S$-party entanglement is necessary to achieve the fully entangled capacity.

References in corpus (40)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Mixed State Entanglement and Quantum Error Correction
• Quantum-enhanced measurements: beating the standard quantum limit
• Distributed Entanglement
• Good Quantum Error-Correcting Codes Exist
• Persistent entanglement in arrays of interacting particles
• Multiple Particle Interference and Quantum Error Correction
• Quantum fingerprinting
• Conditions for a class of entanglement transformations
• Information Causality as a Physical Principle
• Stabilizer Codes and Quantum Error Correction
• A Multiparticle Generalization of Entanglement Swapping
• Geometric measure of entanglement and applications to bipartite and multipartite quantum states
• Entanglement monotones
• Quantum Internet: Networking Challenges in Distributed Quantum Computing
• General Scheme for Super Dense Coding between Multi-Parties
• Multi-parameter estimation in networked quantum sensors
• When Entanglement meets Classical Communications: Quantum Teleportation for the Quantum Internet (Invited Paper)
• The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement
• The cost of exactly simulating quantum entanglement with classical communication
• Absolute Maximal Entanglement and Quantum Secret Sharing
• Monotones and invariants for multi-particle quantum states
• The structure of multidimensional entanglement in multipartite systems
• Quantum information and precision measurement
• Distributed quantum dense coding
• Demonstration of a Reconfigurable Entangled Radiofrequency-Photonic Sensor Network
• Network Coding for Computing: Cut-Set Bounds
• Metrological Detection of Multipartite Entanglement from Young Diagrams
• On network coding for sum-networks
• Distributed super dense coding over noisy channels
• Graph States Under the Action of Local Clifford Group in Non-Binary Case
• Quantum Advantage in Communication Networks
• Capacity of Quantum Private Information Retrieval with Collusion of All But One of Servers
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Hyperdense coding and superadditivity of classical capacities in hypersphere theories
• Entanglement-assisted zero-error source-channel coding
• On the Capacity of Secure $K$-user Product Computation over a Quantum MAC
• Private Product Computation using Quantum Entanglement
• On the Generic Capacity of $K$-User Symmetric Linear Computation Broadcast
• Communication Complexity of Private Simultaneous Quantum Messages Protocols

Cited by in corpus (3)

• On the Capacity of Secure $K$-user Product Computation over a Quantum MAC
• Quantum $X$-Secure $T$-Private Information Retrieval From MDS Coded Storage With Unresponsive and Byzantine Servers
• Capacity of Summation over a Symmetric Quantum Erasure MAC with Partially Replicated Inputs