21,676 research outputs found
Simulating Noisy Channel Interaction
We show that rounds of interaction over the binary symmetric channel
with feedback can be simulated with
rounds of interaction over a noiseless channel. We also introduce a more
general "energy cost" model of interaction over a noisy channel. We show energy
cost to be equivalent to external information complexity, which implies that
our simulation results are unlikely to carry over to energy complexity. Our
main technical innovation is a self-reduction from simulating a noisy channel
to simulating a slightly-less-noisy channel, which may have other applications
in the area of interactive compression
Communication on noisy channels: a coding theorem for computation
Communication is critical to distributed computing, parallel computing, or any situation in which automata interact-hence its significance as a resource in computation. In view of the likelihood of errors occurring in a lengthy interaction, it is desirable to incorporate this possibility in the model of communication. The author relates the noisy channel and the standard (noise less channel) complexities of a communication problem by establishing a `two-way' or interactive analogue of Shanon's coding theorem: every noiseless channel protocol can be simulated by a private-coin noisy channel protocol whose time bound is proportional to the original (noiseless) time bound and inversely proportional to the capacity of the channel, while the protocol errs with vanishing probability. The method involves simulating the original protocol while implementing a hierarchical system of progress checks which ensure that errors of any magnitude in the simulation are, with high probability, rapidly eliminated
Capacity estimation of two-dimensional channels using Sequential Monte Carlo
We derive a new Sequential-Monte-Carlo-based algorithm to estimate the
capacity of two-dimensional channel models. The focus is on computing the
noiseless capacity of the 2-D one-infinity run-length limited constrained
channel, but the underlying idea is generally applicable. The proposed
algorithm is profiled against a state-of-the-art method, yielding more than an
order of magnitude improvement in estimation accuracy for a given computation
time
Simulating noisy quantum protocols with quantum trajectories
The theory of quantum trajectories is applied to simulate the effects of
quantum noise sources induced by the environment on quantum information
protocols. We study two models that generalize single qubit noise channels like
amplitude damping and phase flip to the many-qubit situation. We calculate the
fidelity of quantum information transmission through a chaotic channel using
the teleportation scheme with different environments. In this example, we
analyze the role played by the kind of collective noise suffered by the quantum
processor during its operation. We also investigate the stability of a quantum
algorithm simulating the quantum dynamics of a paradigmatic model of chaos, the
baker's map. Our results demonstrate that, using the quantum trajectories
approach, we are able to simulate quantum protocols in the presence of noise
and with large system sizes of more than 20 qubits.Comment: 11 pages, 7 fig
- …