12,964 research outputs found
Effects of noise on quantum error correction algorithms
It has recently been shown that there are efficient algorithms for quantum
computers to solve certain problems, such as prime factorization, which are
intractable to date on classical computers. The chances for practical
implementation, however, are limited by decoherence, in which the effect of an
external environment causes random errors in the quantum calculation. To combat
this problem, quantum error correction schemes have been proposed, in which a
single quantum bit (qubit) is ``encoded'' as a state of some larger number of
qubits, chosen to resist particular types of errors. Most such schemes are
vulnerable, however, to errors in the encoding and decoding itself. We examine
two such schemes, in which a single qubit is encoded in a state of qubits
while subject to dephasing or to arbitrary isotropic noise. Using both
analytical and numerical calculations, we argue that error correction remains
beneficial in the presence of weak noise, and that there is an optimal time
between error correction steps, determined by the strength of the interaction
with the environment and the parameters set by the encoding.Comment: 26 pages, LaTeX, 4 PS figures embedded. Reprints available from the
authors or http://eve.physics.ox.ac.uk/QChome.htm
`The frozen accident' as an evolutionary adaptation: A rate distortion theory perspective on the dynamics and symmetries of genetic coding mechanisms
We survey some interpretations and related issues concerning the frozen hypothesis due to F. Crick and how it can be explained in terms of several natural mechanisms involving error correction codes, spin glasses, symmetry breaking and the characteristic robustness of genetic networks. The approach to most of these questions involves using elements of Shannon's rate distortion theory incorporating a semantic system which is meaningful for the relevant alphabets and vocabulary implemented in transmission of the genetic code. We apply the fundamental homology between information source uncertainty with the free energy density of a thermodynamical system with respect to transcriptional regulators and the communication channels of sequence/structure in proteins. This leads to the suggestion that the frozen accident may have been a type of evolutionary adaptation
Continuous quantum error correction via quantum feedback control
We describe a protocol for continuously protecting unknown quantum states
from decoherence that incorporates design principles from both quantum error
correction and quantum feedback control. Our protocol uses continuous
measurements and Hamiltonian operations, which are weaker control tools than
are typically assumed for quantum error correction. We develop a cost function
appropriate for unknown quantum states and use it to optimize our
state-estimate feedback. Using Monte Carlo simulations, we study our protocol
for the three-qubit bit-flip code in detail and demonstrate that it can improve
the fidelity of quantum states beyond what is achievable using quantum error
correction when the time between quantum error correction cycles is limited.Comment: 12 pages, 6 figures, REVTeX; references fixe
A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees
Low-density parity-check codes, a class of capacity-approaching linear codes,
are particularly recognized for their efficient decoding scheme. The decoding
scheme, known as the sum-product, is an iterative algorithm consisting of
passing messages between variable and check nodes of the factor graph. The
sum-product algorithm is fully parallelizable, owing to the fact that all
messages can be update concurrently. However, since it requires extensive
number of highly interconnected wires, the fully-parallel implementation of the
sum-product on chips is exceedingly challenging. Stochastic decoding
algorithms, which exchange binary messages, are of great interest for
mitigating this challenge and have been the focus of extensive research over
the past decade. They significantly reduce the required wiring and
computational complexity of the message-passing algorithm. Even though
stochastic decoders have been shown extremely effective in practice, the
theoretical aspect and understanding of such algorithms remains limited at
large. Our main objective in this paper is to address this issue. We first
propose a novel algorithm referred to as the Markov based stochastic decoding.
Then, we provide concrete quantitative guarantees on its performance for
tree-structured as well as general factor graphs. More specifically, we provide
upper-bounds on the first and second moments of the error, illustrating that
the proposed algorithm is an asymptotically consistent estimate of the
sum-product algorithm. We also validate our theoretical predictions with
experimental results, showing we achieve comparable performance to other
practical stochastic decoders.Comment: This paper has been submitted to IEEE Transactions on Information
Theory on May 24th 201
Information-theoretic Physical Layer Security for Satellite Channels
Shannon introduced the classic model of a cryptosystem in 1949, where Eve has
access to an identical copy of the cyphertext that Alice sends to Bob. Shannon
defined perfect secrecy to be the case when the mutual information between the
plaintext and the cyphertext is zero. Perfect secrecy is motivated by
error-free transmission and requires that Bob and Alice share a secret key.
Wyner in 1975 and later I.~Csisz\'ar and J.~K\"orner in 1978 modified the
Shannon model assuming that the channels are noisy and proved that secrecy can
be achieved without sharing a secret key. This model is called wiretap channel
model and secrecy capacity is known when Eve's channel is noisier than Bob's
channel.
In this paper we review the concept of wiretap coding from the satellite
channel viewpoint. We also review subsequently introduced stronger secrecy
levels which can be numerically quantified and are keyless unconditionally
secure under certain assumptions. We introduce the general construction of
wiretap coding and analyse its applicability for a typical satellite channel.
From our analysis we discuss the potential of keyless information theoretic
physical layer security for satellite channels based on wiretap coding. We also
identify system design implications for enabling simultaneous operation with
additional information theoretic security protocols
A practical scheme for error control using feedback
We describe a scheme for quantum error correction that employs feedback and
weak measurement rather than the standard tools of projective measurement and
fast controlled unitary gates. The advantage of this scheme over previous
protocols (for example Ahn et. al, PRA, 65, 042301 (2001)), is that it requires
little side processing while remaining robust to measurement inefficiency, and
is therefore considerably more practical. We evaluate the performance of our
scheme by simulating the correction of bit-flips. We also consider
implementation in a solid-state quantum computation architecture and estimate
the maximal error rate which could be corrected with current technology.Comment: 12 pages, 3 figures. Minor typographic change
- âŚ