English
Related papers

Related papers: Increased Capacity per Unit-Cost by Oversampling

200 papers

A longstanding open problem in quantum information theory is to find the classical capacity of an optical communication link, modeled as a Gaussian bosonic channel. It has been conjectured that this capacity is achieved by a random coding…

The present paper is devoted to investigation of the classical capacity of infinite-dimensional quantum measurement channels. A number of usable conditions are introduced that enable us to apply previously obtained general results to…

Quantum Physics · Physics 2020-08-31 A. S. Holevo , A. A. Kuznetsova

We present an algorithm for calculation of the Gaussian classical capacity of a quantum bosonic memory channel with additive Gaussian noise. The algorithm, restricted to Gaussian input states, is applicable to all channels with noise…

Quantum Physics · Physics 2015-03-17 Joachim Schäfer , Evgueni Karpov , Nicolas J. Cerf

This letter is focused on quantized Compressed Sensing, assuming that Lasso is used for signal estimation. Leveraging recent work, we provide a framework to optimize the quantization function and show that the recovered signal converges to…

Information Theory · Computer Science 2016-06-10 Xiaoyi Gu , Shenyinying Tu , Hao-Jun Michael Shi , Mindy Case , Deanna Needell , Yaniv Plan

Quantum superdense coding protocols enhance channel capacity by using shared quantum entanglement between two users. The channel capacity can be as high as 2 when one uses entangled qubits. However, this limit can be surpassed by using…

Quantum Physics · Physics 2019-05-09 Xiao-Min Hu , Yu Guo , Bi-Heng Liu , Yun-Feng Huang , Chuan-Feng Li , Guang-Can Guo

Classical communication capacity of a channel can be enhanced either through a device called a 'quantum switch' or by putting the channel in a quantum superposition. The gains in the two cases, although different, have their origin in the…

Quantum Physics · Physics 2020-01-27 Nicolas Loizeau , Alexei Grinbaum

Abstract-One-bit compressive sensing (CS) is known to be particularly suited for resource-constrained wireless sensor networks (WSNs). In this paper, we consider 1-bit CS over noisy WSNs subject to channel-induced bit flipping errors, and…

Information Theory · Computer Science 2015-06-05 Ching-Hsien Chen , Jwo-Yuh Wu

The energy-optimal scheme is found for communicating one bit over a memoryless Gaussian channel with an ideal feedback channel. It is assumed that the channel is allowed to be used at most N times before decoding. The optimal…

Information Theory · Computer Science 2016-05-17 Bo Bernhardsson , Ather Gattami

A class of diamond networks are studied where the broadcast component is modelled by two independent bit-pipes. New upper and low bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min…

Information Theory · Computer Science 2014-01-24 Shirin Saeedi Bidokhti , Gerhard Kramer

Quasiprobabilistic cutting techniques allow us to partition large quantum circuits into smaller subcircuits by replacing non-local gates with probabilistic mixtures of local gates. The cost of this method is a sampling overhead that scales…

Quantum Physics · Physics 2025-02-19 Lukas Schmitt , Christophe Piveteau , David Sutter

We propose to send a Gaussian source over an average-power limited additive white Gaussian noise channel by transmitting a linear combination of the source sequence and the result of its quantization using a high dimensional Gaussian vector…

Information Theory · Computer Science 2007-07-16 Shraga Bross , Amos Lapidoth , Stephan Tinguely

The cognitive interference channel models cognitive overlay radio systems, where cognitive radios overhear the transmission of neighboring nodes. Capacity for this channel is not known in general. For the Gaussian case capacity is known in…

Information Theory · Computer Science 2012-04-11 Stefano Rini , Ernest Kurniawan , Andrea Goldsmith

We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly sub-sampled circulant matrix) and is robust to analog pre-quantization noise…

Information Theory · Computer Science 2018-12-18 Sjoerd Dirksen , Shahar Mendelson

Compressed sensing (CS) is on recovery of high dimensional signals from their low dimensional linear measurements under a sparsity prior and digital quantization of the measurement data is inevitable in practical implementation of CS…

Information Theory · Computer Science 2016-08-24 Zai Yang , Lihua Xie , Cishen Zhang

Classical capacity of unital qubit channels is well known, whereas that of nonunital qubit channels is not. We find lower and upper bounds on classical capacity of nonunital qubit channels by using a recently developed decomposition…

Quantum Physics · Physics 2019-03-22 Sergey N. Filippov

We study communication systems over band-limited Additive White Gaussian Noise (AWGN) channels in which the transmitter output is constrained to be symmetric binary (bi-polar). In this work we improve the original Ozarov-Wyner-Ziv (OWZ)…

Information Theory · Computer Science 2021-10-07 Michael Peleg , Tomer Michaeli , Shlomo Shamai

Upper bounds on the capacity of vector Gaussian channels affected by fading are derived under peak amplitude constraints at the input. The focus is on constraint regions that can be decomposed in a Cartesian product of sub-regions. This…

Information Theory · Computer Science 2022-07-05 Antonino Favano , Marco Ferrari , Maurizio Magarini , Luca Barletta

A formula is derived for the capacity of the Gaussian channel with a benevolent message-cognizant rate-limited helper that provides a noncausal description of the noise to the encoder and decoder. This capacity is strictly larger than when…

Information Theory · Computer Science 2023-10-25 Amos Lapidoth , Ligong Wang , Yiming Yan

In this work, we show that reconstructing a sparse signal from quantized compressive measurement can be achieved in an unified formalism whatever the (scalar) quantization resolution, i.e., from 1-bit to high resolution assumption. This is…

Information Theory · Computer Science 2013-05-09 Laurent Jacques , Kévin Degraux , Christophe De Vleeschouwer

A channel with continuous phase modulation and 1-bit ADC with oversampling is considered. Due to oversampling, higher-order modulations yield a higher achievable rate and this work presents a method to approach this with sophisticated…

Information Theory · Computer Science 2019-12-06 Rodrigo R. M. de Alencar , Lukas T. N. Landau , Rodrigo C. de Lamare