491 research outputs found
Memory effects in attenuation and amplification quantum processes
With increasing communication rates via quantum channels, memory effects
become unavoidable whenever the use rate of the channel is comparable to the
typical relaxation time of the channel environment. We introduce a model of a
bosonic memory channel, describing correlated noise effects in quantum-optical
processes via attenuating or amplifying media. To study such a channel model,
we make use of a proper set of collective field variables, which allows us to
unravel the memory effects, mapping the n-fold concatenation of the memory
channel to a unitarily equivalent, direct product of n single-mode bosonic
channels. We hence estimate the channel capacities by relying on known results
for the memoryless setting. Our findings show that the model is characterized
by two different regimes, in which the cross correlations induced by the noise
among different channel uses are either exponentially enhanced or exponentially
reduced.Comment: 10 pages, 7 figures, close to the published versio
Interior Point Decoding for Linear Vector Channels
In this paper, a novel decoding algorithm for low-density parity-check (LDPC)
codes based on convex optimization is presented. The decoding algorithm, called
interior point decoding, is designed for linear vector channels. The linear
vector channels include many practically important channels such as inter
symbol interference channels and partial response channels. It is shown that
the maximum likelihood decoding (MLD) rule for a linear vector channel can be
relaxed to a convex optimization problem, which is called a relaxed MLD
problem. The proposed decoding algorithm is based on a numerical optimization
technique so called interior point method with barrier function. Approximate
variations of the gradient descent and the Newton methods are used to solve the
convex optimization problem. In a decoding process of the proposed algorithm, a
search point always lies in the fundamental polytope defined based on a
low-density parity-check matrix. Compared with a convectional joint message
passing decoder, the proposed decoding algorithm achieves better BER
performance with less complexity in the case of partial response channels in
many cases.Comment: 18 pages, 17 figures, The paper has been submitted to IEEE
Transaction on Information Theor
Simplifying Random Satisfiability Problem by Removing Frustrating Interactions
How can we remove some interactions in a constraint satisfaction problem
(CSP) such that it still remains satisfiable? In this paper we study a modified
survey propagation algorithm that enables us to address this question for a
prototypical CSP, i.e. random K-satisfiability problem. The average number of
removed interactions is controlled by a tuning parameter in the algorithm. If
the original problem is satisfiable then we are able to construct satisfiable
subproblems ranging from the original one to a minimal one with minimum
possible number of interactions. The minimal satisfiable subproblems will
provide directly the solutions of the original problem.Comment: 21 pages, 16 figure
Finite-Connectivity Spin-Glass Phase Diagrams and Low Density Parity Check Codes
We obtain phase diagrams of regular and irregular finite connectivity
spin-glasses. Contact is firstly established between properties of the phase
diagram and the performances of low density parity check codes (LDPC) within
the Replica Symmetric (RS) ansatz. We then study the location of the dynamical
and critical transition of these systems within the one step Replica Symmetry
Breaking theory (RSB), extending similar calculations that have been performed
in the past for the Bethe spin-glass problem. We observe that, away from the
Nishimori line, in the low temperature region, the location of the dynamical
transition line does change within the RSB theory, in comparison with the (RS)
case. For LDPC decoding over the binary erasure channel we find, at zero
temperature and rate R=1/4 an RS critical transition point located at p_c =
0.67 while the critical RSB transition point is located at p_c = 0.7450, to be
compared with the corresponding Shannon bound 1-R. For the binary symmetric
channel (BSC) we show that the low temperature reentrant behavior of the
dynamical transition line, observed within the RS ansatz, changes within the
RSB theory; the location of the dynamical transition point occurring at higher
values of the channel noise. Possible practical implications to improve the
performances of the state-of-the-art error correcting codes are discussed.Comment: 21 pages, 15 figure
Belief propagation algorithm for computing correlation functions in finite-temperature quantum many-body systems on loopy graphs
Belief propagation -- a powerful heuristic method to solve inference problems
involving a large number of random variables -- was recently generalized to
quantum theory. Like its classical counterpart, this algorithm is exact on
trees when the appropriate independence conditions are met and is expected to
provide reliable approximations when operated on loopy graphs. In this paper,
we benchmark the performances of loopy quantum belief propagation (QBP) in the
context of finite-tempereture quantum many-body physics. Our results indicate
that QBP provides reliable estimates of the high-temperature correlation
function when the typical loop size in the graph is large. As such, it is
suitable e.g. for the study of quantum spin glasses on Bethe lattices and the
decoding of sparse quantum error correction codes.Comment: 5 pages, 4 figure
Effective Capacity in Broadcast Channels with Arbitrary Inputs
We consider a broadcast scenario where one transmitter communicates with two
receivers under quality-of-service constraints. The transmitter initially
employs superposition coding strategies with arbitrarily distributed signals
and sends data to both receivers. Regarding the channel state conditions, the
receivers perform successive interference cancellation to decode their own
data. We express the effective capacity region that provides the maximum
allowable sustainable data arrival rate region at the transmitter buffer or
buffers. Given an average transmission power limit, we provide a two-step
approach to obtain the optimal power allocation policies that maximize the
effective capacity region. Then, we characterize the optimal decoding regions
at the receivers in the space spanned by the channel fading power values. We
finally substantiate our results with numerical presentations.Comment: This paper will appear in 14th International Conference on
Wired&Wireless Internet Communications (WWIC
Asymmetric quantum error correcting codes
The noise in physical qubits is fundamentally asymmetric: in most devices,
phase errors are much more probable than bit flips. We propose a quantum error
correcting code which takes advantage of this asymmetry and shows good
performance at a relatively small cost in redundancy, requiring less than a
doubling of the number of physical qubits for error correction
Information transmission through lossy bosonic memory channels
We study the information transmission through a quantum channel, defined over
a continuous alphabet and losing its energy en route, in presence of correlated
noise among different channel uses. We then show that entangled inputs improve
the rate of transmission of such a channel.Comment: 6 pages revtex, 2 eps figure
Degree Complexity of a Family of Birational Maps
We compute the degree complexity of a family of birational mappings of the
plane with high order singularities
Information capacity in the weak-signal approximation
We derive an approximate expression for mutual information in a broad class
of discrete-time stationary channels with continuous input, under the
constraint of vanishing input amplitude or power. The approximation describes
the input by its covariance matrix, while the channel properties are described
by the Fisher information matrix. This separation of input and channel
properties allows us to analyze the optimality conditions in a convenient way.
We show that input correlations in memoryless channels do not affect channel
capacity since their effect decreases fast with vanishing input amplitude or
power. On the other hand, for channels with memory, properly matching the input
covariances to the dependence structure of the noise may lead to almost
noiseless information transfer, even for intermediate values of the noise
correlations. Since many model systems described in mathematical neuroscience
and biophysics operate in the high noise regime and weak-signal conditions, we
believe, that the described results are of potential interest also to
researchers in these areas.Comment: 11 pages, 4 figures; accepted for publication in Physical Review
- …