40,845 research outputs found
Quantum Stabilizer Codes and Classical Linear Codes
We show that within any quantum stabilizer code there lurks a classical
binary linear code with similar error-correcting capabilities, thereby
demonstrating new connections between quantum codes and classical codes. Using
this result -- which applies to degenerate as well as nondegenerate codes --
previously established necessary conditions for classical linear codes can be
easily translated into necessary conditions for quantum stabilizer codes.
Examples of specific consequences are: for a quantum channel subject to a
delta-fraction of errors, the best asymptotic capacity attainable by any
stabilizer code cannot exceed H(1/2 + sqrt(2*delta*(1-2*delta))); and, for the
depolarizing channel with fidelity parameter delta, the best asymptotic
capacity attainable by any stabilizer code cannot exceed 1-H(delta).Comment: 17 pages, ReVTeX, with two figure
Is There an App for That? Electronic Health Records (EHRs) and a New Environment of Conflict Prevention and Resolution
Katsh discusses the new problems that are a consequence of a new technological environment in healthcare, one that has an array of elements that makes the emergence of disputes likely. Novel uses of technology have already addressed both the problem and its source in other contexts, such as e-commerce, where large numbers of transactions have generated large numbers of disputes. If technology-supported healthcare is to improve the field of medicine, a similar effort at dispute prevention and resolution will be necessary
Quantum error-correcting codes associated with graphs
We present a construction scheme for quantum error correcting codes. The
basic ingredients are a graph and a finite abelian group, from which the code
can explicitly be obtained. We prove necessary and sufficient conditions for
the graph such that the resulting code corrects a certain number of errors.
This allows a simple verification of the 1-error correcting property of
fivefold codes in any dimension. As new examples we construct a large class of
codes saturating the singleton bound, as well as a tenfold code detecting 3
errors.Comment: 8 pages revtex, 5 figure
Codes for protection from synchronization loss and additive errors
Codes for protection from synchronization loss and additive error
AONT-LT: a Data Protection Scheme for Cloud and Cooperative Storage Systems
We propose a variant of the well-known AONT-RS scheme for dispersed storage
systems. The novelty consists in replacing the Reed-Solomon code with rateless
Luby transform codes. The resulting system, named AONT-LT, is able to improve
the performance by dispersing the data over an arbitrarily large number of
storage nodes while ensuring limited complexity. The proposed solution is
particularly suitable in the case of cooperative storage systems. It is shown
that while the AONT-RS scheme requires the adoption of fragmentation for
achieving widespread distribution, thus penalizing the performance, the new
AONT-LT scheme can exploit variable length codes which allow to achieve very
good performance and scalability.Comment: 6 pages, 8 figures, to be presented at the 2014 High Performance
Computing & Simulation Conference (HPCS 2014) - Workshop on Security, Privacy
and Performance in Cloud Computin
Integrating testing techniques through process programming
Integration of multiple testing techniques is required to demonstrate high quality of software. Technique integration has three basic goals: incremental testing capabilities, extensive error detection, and cost-effective application. We are experimenting with the use of process programming as a mechanism of integrating testing techniques. Having set out to integrate DATA FLOW testing and RELAY, we proposed synergistic use of these techniques to achieve all three goals. We developed a testing process program much as we would develop a software product from requirements through design to implementation and evaluation. We found process programming to be effective for explicitly integrating the techniques and achieving the desired synergism. Used in this way, process programming also mitigates many of the other problems that plague testing in the software development process
Low-Complexity Codes for Random and Clustered High-Order Failures in Storage Arrays
RC (Random/Clustered) codes are a new efficient array-code family for recovering from 4-erasures. RC codes correct most 4-erasures, and essentially all 4-erasures that are clustered. Clustered erasures are introduced as a new erasure model for storage arrays. This model draws its motivation from correlated device failures, that are caused by physical proximity of devices, or by age proximity of endurance-limited solid-state drives. The reliability of storage arrays that employ RC codes is analyzed and compared to known codes. The new RC code is significantly more efficient, in all practical implementation factors, than the best known 4-erasure correcting MDS code. These factors include: small-write update-complexity, full-device update-complexity, decoding complexity and number of supported devices in the array
Introduction to Quantum Error Correction
In this introduction we motivate and explain the ``decoding'' and
``subsystems'' view of quantum error correction. We explain how quantum noise
in QIP can be described and classified, and summarize the requirements that
need to be satisfied for fault tolerance. Considering the capabilities of
currently available quantum technology, the requirements appear daunting. But
the idea of ``subsystems'' shows that these requirements can be met in many
different, and often unexpected ways.Comment: 44 pages, to appear in LA Science. Hyperlinked PDF at
http://www.c3.lanl.gov/~knill/qip/ecprhtml/ecprpdf.pdf, HTML at
http://www.c3.lanl.gov/~knill/qip/ecprhtm
- …