Classical simulations of communication channels

• URL: http://arxiv.org/abs/2101.10985v4
• Date: Wed, 22 Jun 2022 13:02:34 GMT
• Title: Classical simulations of communication channels
• Authors: P\'eter E. Frenkel
• Abstract summary: We investigate whether certain non-classical communication channels can be simulated by a classical channel with a given number of states and a given amount' of noise. It is proved that any noisy quantum channel can be simulated by a corresponding classical channel with the same amount' of noise.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate whether certain non-classical communication channels can be simulated by a classical channel with a given number of states and a given `amount' of noise. It is proved that any noisy quantum channel can be simulated by a corresponding classical channel with `the same amount' of noise. Classical simulations of general probabilistic channels are also studied.

Related papers

• Operationally classical simulation of quantum states [41.94295877935867]
  A classical state-preparation device cannot generate superpositions and hence its emitted states must commute. We show that no such simulation exists, thereby certifying quantum coherence. Our approach is a possible avenue to understand how and to what extent quantum states defy generic models based on classical devices.
  arXiv  Detail & Related papers  (2025-02-03T15:25:03Z)
• No-Go Theorem for Generic Simulation of Qubit Channels with Finite Classical Resources [0.0]
  We show that a general simulation for the perfect qubit channel is impossible with finite classical communication. For noisy qubit channels, such as those with depolarizing noise, we demonstrate that general simulation is achievable with finite communication.
  arXiv  Detail & Related papers  (2025-01-27T06:28:33Z)
• Classical Capacity of Arbitrarily Distributed Noisy Quantum Channels [11.30845610345922]
  We study the impact of a mixture of classical and quantum noise on an arbitrary quantum channel carrying classical information. We formulate the achievable channel capacity over an arbitrary distributed quantum channel in presence of the mixed noise.
  arXiv  Detail & Related papers  (2023-06-28T11:14:12Z)
• Simulating all multipartite non-signalling channels via quasiprobabilistic mixtures of local channels in generalised probabilistic theories [0.0]
  Non-signalling quantum channels may be simulated via affine combinations of local operations in bipartite scenarios. We show that such useful quasi-stochastic characterizations of channels may be unified and applied to the broader class of multipartite non-signalling channels.
  arXiv  Detail & Related papers  (2022-04-22T11:16:18Z)
• 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)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Coherent control and distinguishability of quantum channels via PBS-diagrams [59.94347858883343]
  We introduce a graphical language for coherent control of general quantum channels inspired by practical quantum optical setups involving polarising beam splitters (PBS) We characterise the observational equivalence of purified channels in various coherent-control contexts, paving the way towards a faithful representation of quantum channels under coherent control.
  arXiv  Detail & Related papers  (2021-03-02T22:56:25Z)
• Certifying the Classical Simulation Cost of a Quantum Channel [4.974890682815778]
  A fundamental objective in quantum information science is to determine the cost in classical resources simulating a particular quantum system. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel.
  arXiv  Detail & Related papers  (2021-02-24T20:22:43Z)
• Bosonic Dirty Paper Coding [12.437226707039448]
  The single-mode bosonic channel is addressed with classical interference in the modulation and with side information at the transmitter. We show that the effect of the channel parameter can be canceled even when the decoder has no side information. Considering the special case of a pure-loss bosonic channel, we demonstrate that the optimal coefficient for dirty paper coding is not necessarily the MMSE estimator coefficient as in the classical setting.
  arXiv  Detail & Related papers  (2021-01-03T09:48:08Z)
• 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)
• Permutation Enhances Classical Communication Assisted by Entangled States [67.12391801199688]
  We show that the capacity satisfies the strong converse property and thus the formula serves as a sharp dividing line between achievable and unachievable rates of communication. As examples, we derive analytically the classical capacity of various quantum channels of interests.
  arXiv  Detail & Related papers  (2020-01-07T01:49: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.