Channel Discord and Distortion

• URL: http://arxiv.org/abs/2004.10864v3
• Date: Wed, 15 Sep 2021 10:33:18 GMT
• Title: Channel Discord and Distortion
• Authors: Wei-Wei Zhang, Yuval R. Sanders, Barry C. Sanders
• Abstract summary: We show that classical discord is equivalent to (doubly) channel distortion. Connecting discord with distortion establishes a signature of classical, not quantum, channel distortion.
• Score: 1.857118727520834
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Discord, originally notable as a signature of bipartite quantum correlation,in fact can be nonzero classically, i.e., arising from noisy measurements by one of the two parties. Here we redefine classical discord to quantify channel distortion,in contrast to the previous restriction of classical discord to a state,and we then show a monotonic relationship between classical (channel) discord and channel distortion. We show that classical discord is equivalent to (doubly stochastic) channel distortion by numerically discovering a monotonic relation between discord and total-variation distance for a bipartite protocol with one party having a noiseless channel and the other party having a noisy channel. Our numerical method includes randomly generating doubly stochastic matrices for noisy channels and averaging over a uniform measure of input messages. Connecting discord with distortion establishes discord as a signature of classical, not quantum, channel distortion.

Related papers

• Quantum discord of mixed states under noisy channels in the curved spacetime [1.6624384368855523]
  We investigate quantum discord properties in the background of a Schwarzschild black hole under phase damping.<n>For the three channel noises, the behaviors of discords are similar.<n>In the case of the bit flip channel and phase flip channel, the discords perform symmetrically with the decay probability rising.
  arXiv  Detail & Related papers  (2026-02-24T11:56:03Z)
• On (Im)possibility of Network Oblivious Transfer via Noisy Channels and Non-Signaling Correlations [45.59862974645558]
  This work investigates the fundamental limits of implementing network oblivious transfer via noisy multiple access channels and broadcast channels between honest-but-curious parties.<n>By modeling the shared resource as an arbitrary tripartite non-signaling box, we obtain a unified perspective on both the channel behavior and the resulting correlations.
  arXiv  Detail & Related papers  (2026-02-03T11:45:43Z)
• Joint Source-Channel-Generation Coding: From Distortion-oriented Reconstruction to Semantic-consistent Generation [58.67925548779465]
  We propose Joint Source-Channel-Generation Coding (JSCGC), a novel paradigm that shifts the focus from perceptual reconstruction to probabilistic generation.<n>JSCGC improves substantially semantic quality and semantic fidelity, significantly outperforming conventional distortion-oriented J SCC methods.
  arXiv  Detail & Related papers  (2026-01-19T08:12:47Z)
• Superadditivity of Zero-Error Capacity in Noisy Classical and Perfect Quantum Channel Pairs [0.6524460254566904]
  We demonstrate superadditivity of one-shot zero-error classical capacity in an asymmetric communication setting.<n>We show that replacing the perfect quantum channel with a perfect classical channel eliminates the effect.
  arXiv  Detail & Related papers  (2026-01-13T19:00:08Z)
• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer. Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• String commitment from unstructured noisy channels [53.04878543623513]
  Noisy channels are valuable resources for cryptography, enabling primitives like bit commitment and oblivious transfer. We present a protocol for string commitment over such channels that is complete, hiding, and binding, and derive its achievable commitment rate. The commitment rate coincides with previous results when the adversarial channels are the same binary symmetric channel as in the honest case.
  arXiv  Detail & Related papers  (2024-12-31T05:28:05Z)
• Resolvability of classical-quantum channels [54.825573549226924]
  We study the resolvability of classical-quantum channels in two settings, for the channel output generated from the worst input, and form the fixed independent and identically distributed (i.i.d.) input. For the fixed-input setting, while the direct part follows from the known quantum soft covering result, we exploit the recent alternative quantum Sanov theorem to solve the strong converse.
  arXiv  Detail & Related papers  (2024-10-22T05:18:43Z)
• Overcoming the Zero-Rate Hashing Bound with Holographic Quantum Error Correction [40.671162828621426]
  We study zero-rate holographic quantum error correction codes, discovering very high threshold values under diverse and finitely-biased noise channels. This work is also the first instance of such remarkable threshold behavior in stabilizer quantum codes for the pure 2-Pauli noise regime.
  arXiv  Detail & Related papers  (2024-08-12T15:35:03Z)
• Entanglement sharing across a damping-dephasing channel [2.249916681499244]
  Entment distillation is a fundamental information processing task. Noise experienced by quantum communication and computing platforms occurs not only in the form of Pauli noise but also non-Pauli noise. We propose a distillation scheme that completely isolates away the damping noise.
  arXiv  Detail & Related papers  (2024-05-10T03:51:40Z)
• A Generalized Bandsplit Neural Network for Cinematic Audio Source Separation [39.45425155123186]
  We develop a model generalizing the Bandsplit RNN for any complete or overcomplete partitions of the frequency axis. A loss function motivated by the signal-to-noise ratio and the sparsity-promoting property of the 1-norm was proposed. Our best model sets the state of the art on the Divide and Remaster dataset with performance above the ideal ratio mask for the dialogue stem.
  arXiv  Detail & Related papers  (2023-09-05T19:19:22Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Quantum error correction with dissipatively stabilized squeezed cat qubits [68.8204255655161]
  We propose and analyze the error correction performance of a dissipatively stabilized squeezed cat qubit. We find that for moderate squeezing the bit-flip error rate gets significantly reduced in comparison with the ordinary cat qubit while leaving the phase flip rate unchanged.
  arXiv  Detail & Related papers  (2022-10-24T16:02:20Z)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Classical Optical Analogue of Quantum Discord [0.0]
  We present a proof-of-concept demonstration for creating a classical analogue of quantum discord using classical light. Such a classical analogue of quantum discord may provide further insight in understanding and development of quantum information technologies.
  arXiv  Detail & Related papers  (2022-04-29T21:54:26Z)
• Self-Supervised Learning from Automatically Separated Sound Scenes [38.71803524843168]
  This paper explores the use of unsupervised automatic sound separation to decompose unlabeled sound scenes into semantically-linked views. We find that learning to associate input mixtures with their automatically separated outputs yields stronger representations than past approaches.
  arXiv  Detail & Related papers  (2021-05-05T15:37:17Z)
• Geometric Discord for Multi-qubit Systems [7.582845136495998]
  We evaluate the geometric measure of multipartite quantum discord and obtain results for a large family of multi-qubit states. Sudden change of multipartite geometric discord can appear when phase noise act only on one part of the two-, three- and four-qubit states.
  arXiv  Detail & Related papers  (2021-04-26T04:38:05Z)
• Looking into Your Speech: Learning Cross-modal Affinity for Audio-visual Speech Separation [73.1652905564163]
  We address the problem of separating individual speech signals from videos using audio-visual neural processing. Most conventional approaches utilize frame-wise matching criteria to extract shared information between co-occurring audio and video. We propose a cross-modal affinity network (CaffNet) that learns global correspondence as well as locally-varying affinities between audio and visual streams.
  arXiv  Detail & Related papers  (2021-03-25T15:39:12Z)
• Remote Creation of Quantum Coherence via Indefinite Causal Order [0.5549359079450177]
  We present a method for the creation of quantum coherence at a remote location via the use of entangled state and indefinite causal order. We find that when the indefinite causal order of channels act on one-half of the entangled pair, then the shared state looses entanglement, but can retain non-zero quantum discord.
  arXiv  Detail & Related papers  (2021-03-08T16:56:17Z)
• 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)

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.