625 research outputs found
Density Evolution for Asymmetric Memoryless Channels
Density evolution is one of the most powerful analytical tools for
low-density parity-check (LDPC) codes and graph codes with message passing
decoding algorithms. With channel symmetry as one of its fundamental
assumptions, density evolution (DE) has been widely and successfully applied to
different channels, including binary erasure channels, binary symmetric
channels, binary additive white Gaussian noise channels, etc. This paper
generalizes density evolution for non-symmetric memoryless channels, which in
turn broadens the applications to general memoryless channels, e.g. z-channels,
composite white Gaussian noise channels, etc. The central theorem underpinning
this generalization is the convergence to perfect projection for any fixed size
supporting tree. A new iterative formula of the same complexity is then
presented and the necessary theorems for the performance concentration theorems
are developed. Several properties of the new density evolution method are
explored, including stability results for general asymmetric memoryless
channels. Simulations, code optimizations, and possible new applications
suggested by this new density evolution method are also provided. This result
is also used to prove the typicality of linear LDPC codes among the coset code
ensemble when the minimum check node degree is sufficiently large. It is shown
that the convergence to perfect projection is essential to the belief
propagation algorithm even when only symmetric channels are considered. Hence
the proof of the convergence to perfect projection serves also as a completion
of the theory of classical density evolution for symmetric memoryless channels.Comment: To appear in the IEEE Transactions on Information Theor
On Secure Distributed Data Storage Under Repair Dynamics
We address the problem of securing distributed storage systems against
passive eavesdroppers that can observe a limited number of storage nodes. An
important aspect of these systems is node failures over time, which demand a
repair mechanism aimed at maintaining a targeted high level of system
reliability. If an eavesdropper observes a node that is added to the system to
replace a failed node, it will have access to all the data downloaded during
repair, which can potentially compromise the entire information in the system.
We are interested in determining the secrecy capacity of distributed storage
systems under repair dynamics, i.e., the maximum amount of data that can be
securely stored and made available to a legitimate user without revealing any
information to any eavesdropper. We derive a general upper bound on the secrecy
capacity and show that this bound is tight for the bandwidth-limited regime
which is of importance in scenarios such as peer-to-peer distributed storage
systems. We also provide a simple explicit code construction that achieves the
capacity for this regime.Comment: 5 pages, 4 figures, to appear in Proceedings of IEEE ISIT 201
Direct Characterization of Quantum Dynamics: General Theory
The characterization of the dynamics of quantum systems is a task of both
fundamental and practical importance. A general class of methods which have
been developed in quantum information theory to accomplish this task is known
as quantum process tomography (QPT). In an earlier paper [M. Mohseni and D. A.
Lidar, Phys. Rev. Lett. 97, 170501 (2006)] we presented a new algorithm for
Direct Characterization of Quantum Dynamics (DCQD) of two-level quantum
systems. Here we provide a generalization by developing a theory for direct and
complete characterization of the dynamics of arbitrary quantum systems. In
contrast to other QPT schemes, DCQD relies on quantum error-detection
techniques and does not require any quantum state tomography. We demonstrate
that for the full characterization of the dynamics of n d-level quantum systems
(with d a power of a prime), the minimal number of required experimental
configurations is reduced quadratically from d^{4n} in separable QPT schemes to
d^{2n} in DCQD.Comment: 17 pages, 6 figures, minor modifications are mad
Specular sets
We introduce the notion of specular sets which are subsets of groups called
here specular and which form a natural generalization of free groups. These
sets are an abstract generalization of the natural codings of linear
involutions. We prove several results concerning the subgroups generated by
return words and by maximal bifix codes in these sets.Comment: arXiv admin note: substantial text overlap with arXiv:1405.352
Universal fault-tolerant gates on concatenated stabilizer codes
It is an oft-cited fact that no quantum code can support a set of
fault-tolerant logical gates that is both universal and transversal. This no-go
theorem is generally responsible for the interest in alternative universality
constructions including magic state distillation. Widely overlooked, however,
is the possibility of non-transversal, yet still fault-tolerant, gates that
work directly on small quantum codes. Here we demonstrate precisely the
existence of such gates. In particular, we show how the limits of
non-transversality can be overcome by performing rounds of intermediate
error-correction to create logical gates on stabilizer codes that use no
ancillas other than those required for syndrome measurement. Moreover, the
logical gates we construct, the most prominent examples being Toffoli and
controlled-controlled-Z, often complete universal gate sets on their codes. We
detail such universal constructions for the smallest quantum codes, the 5-qubit
and 7-qubit codes, and then proceed to generalize the approach. One remarkable
result of this generalization is that any nondegenerate stabilizer code with a
complete set of fault-tolerant single-qubit Clifford gates has a universal set
of fault-tolerant gates. Another is the interaction of logical qubits across
different stabilizer codes, which, for instance, implies a broadly applicable
method of code switching.Comment: 18 pages + 5 pages appendix, 12 figure
- …