English
Related papers

Related papers: Entanglement enhanced bit rate over multiple uses …

200 papers

Bosonic channels describe quantum-mechanically many practical communication links such as optical, microwave, and radiofrequency. We investigate the maximum rates for the bosonic multiple access channel (MAC) in the presence of thermal…

Quantum Physics · Physics 2022-07-19 Evan J. D. Anderson , Boulat A. Bash

We investigate the dense coding in the case of non-symmetric Hilbert spaces of the sender and receiver's particles sharing the quantum maximally entangled state. The efficiency of classical information gain is also considered. We conclude…

Quantum Physics · Physics 2009-11-10 Fengli Yan , Meiyu Wang

Generating entanglement deterministically at a capacity-approaching rate is critical for next-generation quantum networks. We propose weak-coherent-state-assisted protocols that can generate entanglement near-deterministically between…

Quantum Physics · Physics 2025-05-06 Chaohan Cui , Prajit Dhara , Saikat Guha

We show that quantum entanglement can provide an exponential advantage in learning properties of a bosonic continuous-variable (CV) system. The task we consider is estimating a probabilistic mixture of displacement operators acting on $n$…

We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavior of entropy rate of the output hidden Markov chain and…

Information Theory · Computer Science 2010-07-28 Guangyue Han , Brian Marcus

Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…

In Shannon information theory the capacity of a memoryless communication channel cannot be increased by the use of feedback from receiver to sender. In this paper the use of classical feedback is shown to provide no increase in the…

Quantum Physics · Physics 2007-05-23 Garry Bowen , Rajagopal Nagarajan

We calculate the information capacities of a time-correlated amplitude-damping channel, provided the sender and receiver share prior entanglement. Our analytical results show that the noisy channel with zero capacity can transmit…

Quantum Physics · Physics 2013-07-23 Nigum Arshed , A. H. Toor

Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…

Quantum Physics · Physics 2009-11-07 G. Bowen

Entanglement is known to boost the efficiency of classical communication. In distributed computation, for instance, exploiting entanglement can reduce the number of communicated bits or increase the probability to obtain a correct answer.…

Quantum Physics · Physics 2022-09-15 Jef Pauwels , Stefano Pironio , Emmanuel Zambrini Cruzeiro , Armin Tavakoli

We determine conditions for the presence of stochastic resonance in a lossy bosonic channel with a nonlinear, threshold decoding. The stochastic resonance effect occurs if and only if the detection threshold is outside of a "forbidden…

Quantum Physics · Physics 2013-01-14 Cosmo Lupo , Stefano Mancini , Mark M. Wilde

We present a formal quantum mechanical analysis of the communication protocol of Prevedel {\it et al.}\ [Phys. Rev. Lett. \textbf{106}, 110505 (2011)], in which entanglement shared by sender and receiver is used to enhance, beyond that…

Quantum Physics · Physics 2011-09-07 H. Thomas Williams , Paul Bourdon

A memoryless state-dependent broadcast channel (BC) is considered, where the transmitter wishes to convey two private messages to two receivers while simultaneously estimating the respective states via generalized feedback. The model at…

Information Theory · Computer Science 2020-11-09 Mehrasa Ahmadipour , Michèle Wigger , Mari Kobayashi

The challenge of pattern recognition is to invoke a strategy that can accurately extract features of a dataset and classify its samples. In realistic scenarios this dataset may be a physical system from which we want to retrieve…

Most communication channels are subjected to noise. One of the goals of Information Theory is to add redundancy in the transmission of information so that the information is transmitted reliably and the amount of information transmitted…

Information Theory · Computer Science 2018-03-21 David Elkouss , David Pérez-García

Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…

Quantum Physics · Physics 2018-03-22 Ashwin Nayak , Julia Salzman

Bosonic channels are important in practice as they form a simple model for free-space or fiber-optic communication. Here we consider a single-sender two-receiver pure-loss bosonic broadcast channel and determine the unconstrained capacity…

Quantum Physics · Physics 2016-11-15 Masahiro Takeoka , Kaushik P. Seshadreesan , Mark M. Wilde

I demonstrate that, rather unexpectedly, there exist noisy quantum channels for which the optimal classical information transmission rate is achieved only by signaling alphabets consisting of nonorthogonal quantum states.

Quantum Physics · Physics 2009-01-23 Chistopher A. Fuchs

We consider the amplification of bosonic interactions through parametric control that implements squeezing along orthogonal quadratures. We show that bosonic interactions described by certain classes of quadratic and quartic Hamiltonians…

Quantum Physics · Physics 2026-02-19 Ankit Tiwari , Cecilia Cormick , Christian Arenz

The achievable rate of information transfer in optical communications is determined by the physical properties of the communication channel, such as the intrinsic channel noise. Bosonic phase-noise channels, a class of non-Gaussian…

Quantum Physics · Physics 2019-08-08 M. T. DiMario , L. Kunz , K Banaszek , F. E. Becerra