One-shot inner bounds for sending private classical information over a quantum MAC

• URL: http://arxiv.org/abs/2105.06100v1
• Date: Thu, 13 May 2021 06:31:27 GMT
• Title: One-shot inner bounds for sending private classical information over a quantum MAC
• Authors: Sayantan Chakraborty and Aditya Nema and Pranab Sen
• Abstract summary: We provide the first inner bounds for sending private classical information over a quantum multiple access channel. We do so by using three powerful information theoretic techniques: rate splitting, quantum simultaneous decoding for multiple access channels, and a novel smoothed distributed covering lemma for classical quantum channels.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: We provide the first inner bounds for sending private classical information over a quantum multiple access channel. We do so by using three powerful information theoretic techniques: rate splitting, quantum simultaneous decoding for multiple access channels, and a novel smoothed distributed covering lemma for classical quantum channels. Our inner bounds are given in the one shot setting and accordingly the three techniques used are all very recent ones specifically designed to work in this setting. The last technique is new to this work and is our main technical advancement. For the asymptotic iid setting, our one shot inner bounds lead to the natural quantum analogue of the best classical inner bounds for this problem.

Related papers

• Extendibility limits quantum-secured communication and key distillation [4.079147243688764]
  We study the task of secret-key distillation from bipartite states and point-to-point quantum channels. We extend our formalism to private communication over a quantum channel assisted by forward classical communication.
  arXiv  Detail & Related papers  (2024-10-28T18:00:11Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• Information Carried by a Single Particle in Quantum Multiple-Access Channels [13.821363169821046]
  Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. We compare how well multi-party information can be transmitted to a single receiver using just one classical or quantum particle.
  arXiv  Detail & Related papers  (2023-01-06T14:01:56Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Quantum-Classical Hybrid Information Processing via a Single Quantum System [1.1602089225841632]
  Current technologies in quantum-based communications bring a new integration of quantum data with classical data for hybrid processing. We propose a quantum reservoir processor to harness quantum dynamics in computational tasks requiring both classical and quantum inputs.
  arXiv  Detail & Related papers  (2022-09-01T14:33:40Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Differential Privacy Amplification in Quantum and Quantum-inspired Algorithms [0.6827423171182154]
  We provide privacy bounds amplification for quantum and quantum-inspired algorithms. We show for the first time, that algorithms running on quantum encoding of a classical dataset amplify differential privacy.
  arXiv  Detail & Related papers  (2022-03-07T18:55:20Z)
• Commitment capacity of classical-quantum channels [70.51146080031752]
  We define various notions of commitment capacity for classical-quantum channels. We prove matching upper and lower bound on it in terms of the conditional entropy.
  arXiv  Detail & Related papers  (2022-01-17T10:41:50Z)
• Novel one-shot inner bounds for unassisted fully quantum channels via rate splitting [4.642647756403863]
  We prove the first non-trivial one-shot inner bounds for sending quantum information over an entanglement over an unassisted two-sender quantum multiple access channel (QMAC) and an unassisted two-sender two-receiver quantum interference channel (QIC) Previous works only studied the unassisted QMAC in the limit of many independent and identical uses of the channel also known as the iid limit, and did not study the unassisted QIC at all.
  arXiv  Detail & Related papers  (2021-02-02T21:36:09Z)
• 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)

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.