Building Multiple Access Channels with a Single Particle

• URL: http://arxiv.org/abs/2006.12475v4
• Date: Wed, 9 Feb 2022 04:24:18 GMT
• Title: Building Multiple Access Channels with a Single Particle
• Authors: Yujie Zhang, Xinan Chen and Eric Chitambar
• Abstract summary: A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. We consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies.
• Score: 16.9695901606804
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A multiple access channel describes a situation in which multiple senders are trying to forward messages to a single receiver using some physical medium. In this paper we consider scenarios in which this medium consists of just a single classical or quantum particle. In the quantum case, the particle can be prepared in a superposition state thereby allowing for a richer family of encoding strategies. To make the comparison between quantum and classical channels precise, we introduce an operational framework in which all possible encoding strategies consume no more than a single particle. We apply this framework to an N-port interferometer experiment in which each party controls a path the particle can traverse. When used for the purpose of communication, this setup embodies a multiple access channel (MAC) built with a single particle. We provide a full characterization of the N-party classical MACs that can be built from a single particle, and we show that every non-classical particle can generate a MAC outside the classical set. To further distinguish the capabilities of a single classical and quantum particle, we relax the locality constraint and allow for joint encodings by subsets of 1<K<= N parties. This generates a richer family of classical MACs whose polytope dimension we compute. We identify a "generalized fingerprinting inequality" as a valid facet for this polytope, and we verify that a quantum particle distributed among N separated parties can violate this inequality even when K=N-1. Connections are drawn between the single-particle framework and multi-level coherence theory. We show that every pure state with K-level coherence can be detected in a semi-device independent manner, with the only assumption being conservation of particle number.

Related papers

• Flavor Patterns of Fundamental Particles from Quantum Entanglement? [0.0]
  We find a surprising connection between quantum entanglement and the degree of quark mixing. We speculate that minimization of quantum entanglement might be a fundamental principle that determines particle physics input parameters.
  arXiv  Detail & Related papers  (2024-10-30T18:00:01Z)
• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Optimal quantum violations of n-locality inequalities with conditional dependence on inputs [0.0]
  Bell experiment in the network gives rise to a form of quantum nonlocality which is conceptually different from traditional multipartite Bell nonlocality. We introduce an elegant sum-of-squares approach that enables the optimization in quantum theory without specifying the dimension of the quantum system.
  arXiv  Detail & Related papers  (2023-11-08T11:51:04Z)
• 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)
• Non-Abelian braiding of graph vertices in a superconducting processor [144.97755321680464]
  Indistinguishability of particles is a fundamental principle of quantum mechanics. braiding of non-Abelian anyons causes rotations in a space of degenerate wavefunctions. We experimentally verify the fusion rules of the anyons and braid them to realize their statistics.
  arXiv  Detail & Related papers  (2022-10-19T02:28:44Z)
• Semiclassical roots of universality in many-body quantum chaos [0.0]
  In quantum systems with a classical limit, advanced semiclassical methods provide the crucial link between classically chaotic dynamics and corresponding universal features at the quantum level. This paper provides a unified framework for understanding random-matrix correlations of both single-particle and many-body quantum chaotic systems. Case studies presented include a many-body version of Gutzwiller's trace formula for the spectral density and out-of-time-order correlators along with brief remarks on where further progress may be forthcoming.
  arXiv  Detail & Related papers  (2022-05-05T18:07:57Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Probing quantum effects with classical stochastic analogs [0.0]
  We propose a method to construct a classical analog of an open quantum system. The classical analog is made out of a collection of identical wells where classical particles of mass $m$ are trapped.
  arXiv  Detail & Related papers  (2020-12-13T18:02:27Z)
• 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)
• From a quantum theory to a classical one [117.44028458220427]
  We present and discuss a formal approach for describing the quantum to classical crossover. The method was originally introduced by L. Yaffe in 1982 for tackling large-$N$ quantum field theories.
  arXiv  Detail & Related papers  (2020-04-01T09:16:38Z)
• Genuine Network Multipartite Entanglement [62.997667081978825]
  We argue that a source capable of distributing bipartite entanglement can, by itself, generate genuine $k$-partite entangled states for any $k$. We provide analytic and numerical witnesses of genuine network entanglement, and we reinterpret many past quantum experiments as demonstrations of this feature.
  arXiv  Detail & Related papers  (2020-02-07T13:26:00Z)

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.