SEARCH · Search NASA
Results for “Erasure”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
MLEC-Sim: A Simulator for Evaluating Multi-Level Erasure Coding
We present MLEC-Sim, a sophisticated simulator for Multi-Level Erasure Coding (MLEC), developed in approximately 13 KLOC. The simulator is engineered to analyze the impact of various system configurations and erasure coding policies on system durability and network overhead. It supports a comprehensive range of parameters including disk capacity, disk I/O bandwidth, failure rates, network bandwidth, and system scale, accommodating various erasure coding approaches such as Single-Level Erasure Coding (SLEC), Multi-Level Erasure Coding (MLEC), and Local Reconstruction Codes (LRC). MLEC-Sim provides support for multiple chunk placement policies, including clustered parity and declustered parity, and encompasses a variety of repair methods like Repair-ALL, Repair-FCO, Repair-HYB, and Repair-MIN. It is capable of simulating disk failures through a variety of means, including distribution-based or trace-based mechanisms, and can handle complex multi-level (de)clustered placements and repair processes. A key feature of MLEC-Sim is its adoption of the splitting simulation method for evaluating system durabilities at extremely high levels, which are challenging to assess with traditional simulation approaches. This feature allows for a detailed evaluation of system resilience under a range of conditions, aiding in the selection of appropriate erasure coding solutions for enhancing system durability. MLEC-Sim contributes to the field of data storage and reliability by providing a tool for the detailed evaluation of the durability and efficiency of erasure coding configurations, intended for use by researchers and practitioners in the design and optimization of storage systems.
Erasure conversion in a high-fidelity Rydberg quantum simulator
Minimizing and understanding errors is critical for quantum science, both in noisy intermediate scale quantum (NISQ) devices and for the quest towards fault-tolerant quantum computation. Rydberg arrays have emerged as a prominent platform in this context with impressive system sizes and proposals suggesting how error-correction thresholds could be significantly improved by detecting leakage errors with single-atom resolution, a form of erasure error conversion. However, two-qubit entanglement fidelities in Rydberg atom arrays have lagged behind competitors and this type of erasure conversion is yet to be realized for matter-based qubits in general. Here we demonstrate both erasure conversion and high-fidelity Bell state generation using a Rydberg quantum simulator. When excising data with erasure errors observed via fast imaging of alkaline-earth atoms, we achieve a Bell state fidelity of $\ge 0.997{1}_{-13}^{+10}$ , which improves to $\ge 0.998{5}_{-12}^{+7}$ when correcting for remaining state-preparation errors. We further apply erasure conversion in a quantum simulation experiment for quasi-adiabatic preparation of long-range order across a quantum phase transition, and reveal the otherwise hidden impact of these errors on the simulation outcome. Our work demonstrates the capability for Rydberg-based entanglement to reach fidelities in the 0.999 regime, with higher fidelities a question of technical improvements, and shows how erasure conversion can be utilized in NISQ devices. These techniques could be translated directly to quantum-error-correction codes with the addition of long-lived qubits.
Nonequilibrium formulation of varying-temperature bit erasure
Landauer's principle states that erasing a bit of information at fixed temperature T costs at least $k$ B $T$ ln 2 units of work. Here we investigate erasure at varying temperature, to which Landauer's result does not apply. Here we formulate bit erasure as a stochastic nonequilibrium process involving a compression of configuration space, with physical and logical states associated in a symmetric way. Erasure starts and ends at temperature T, but temperature can otherwise vary with time in an arbitrary way. Defined in this way, erasure is governed by a set of nonequilibrium fluctuation relations that show that varying-temperature erasure can done with less work than $k$ B $T$ ln 2. As a result, erasure and the complementary process of bit randomization can be combined to form a work-producing engine cycle.
Chiral charge erasure via thermal fluctuations of magnetic helicity
We consider a relativistic plasma of fermions coupled to an Abelian gauge field and carrying a chiral charge asymmetry, which might arise in the early Universe through baryogenesis. It is known that on large length scales, λ≳1/(αμ{sub 5}), the chiral anomaly opens an instability toward the erasure of chiral charge and growth of magnetic helicity. Here the chemical potential μ{sub 5} parametrizes the chiral asymmetry and α is the fine-structure constant. We study the process of chiral charge erasure through the thermal fluctuations of magnetic helicity and contrast with the well-studied phenomenon of Chern-Simons number diffusion. Through the fluctuation-dissipation theorem we estimate the amplitude and time scale of helicity fluctuations on the length scale λ, finding δ H∼λT and τ∼αλ{sup 3}T{sup 2} for a relativistic plasma at temperature T. We argue that the presence of a chiral asymmetry allows the helicity to grow diffusively for a time t∼T{sup 3}/(α{sup 5}μ{sub 5}{sup 4}) until it reaches an equilibrium value H∼μ{sub 5}T{sup 2}/α, and the chiral asymmetry is partially erased. If the chiral asymmetry is small, μ{sub 5}<T/α, this avenue for chiral charge erasure is found to be slower than the chiral magnetic effect for which t∼T/(α{sup 3}μ{sub 5}{sup 2}). This mechanism for chiral charge erasure can be important for the hypercharge sector of the Standard Model as well as extensions including U(1) gauge interactions, such as asymmetric dark matter models.
Information transmission with continuous variable quantum erasure channels
Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different types of channels, evaluating the corresponding quantum capacity, and finding the capacity-approaching coding scheme are the major tasks in quantum communication theory. Quantum channel in discrete variables has been discussed enormously based on various error models, while error model in the continuous variable channel has been less studied due to the infinite dimensional problem. In this paper, we investigate a general continuous variable quantum erasure channel. By defining an effective subspace of the continuous variable system, we find a continuous variable random coding model. We then derive the quantum capacity of the continuous variable erasure channel in the framework of decoupling theory. The discussion in this paper fills the gap of a quantum erasure channel in continuous variable setting and sheds light on the understanding of other types of continuous variable quantum channels.
Learning efficient erasure protocols for an underdamped memory
Here we apply evolutionary reinforcement learning to a simulation model to identify efficient time-dependent erasure protocols for a physical realization of a 1-bit memory using an underdamped mechanical cantilever. We show that these protocols, when applied to the cantilever in the laboratory, are considerably more efficient than our best hand-designed protocols. The learned protocols allow reliable high-speed erasure by minimizing the heating of the memory during its operation. More generally, the combination of methods used here opens the door to the rational design of efficient protocols for various physics applications.
Circuit-Based Leakage-to-Erasure Conversion in a Neutral-Atom Quantum Processor
Atom-loss errors are a major limitation of current state-of-the-art neutral-atom quantum computers and pose a significant challenge for scalable systems. In a quantum processor with cesium atoms, we demonstrate proof-of-principle circuit-based conversion of this form of leakage error to erasure errors via leakage-detection units (LDUs), which nondestructively map information about the presence or absence of the qubit onto the state of an ancilla. We benchmark the performance of the LDU using a three-outcome low-loss state-detection method and find that the LDU detects atom-loss errors with approximately 93.4% accuracy, limited by technical imperfections of our apparatus. We further compile and execute a SWAP LDU, wherein the roles of the original data atom and ancilla atom are exchanged under the action of the LDU, providing “free refilling” of atoms in the case of atom loss. This circuit-based leakage-to-erasure error conversion is a critical component of a neutral-atom quantum processor where the quantum information may significantly outlive the lifetime of any individual atom in the quantum register. Finally, we demonstrate that LDUs may also be used to handle other forms of leakage errors where population moves to states outside of the computational subspace.
Quantum erasure and the locality problem
The problem of locality arising in connection with the quantum-erasure experiments is considered using the algebraic approach. We demonstrate that, contrary to a widespread opinion, the results of these experiments can be reconciled with the existence of a local physical reality determining the results of local measurements. A clear physical interpretation of the quantum-erasure experiments, that is consistent with the classical concepts, is given.
Computing erasure metadata and data layout prior to storage using a processing platform
Techniques are provided for computing data and metadata layout prior to storage in a storage system using a processing platform. An exemplary processing platform comprises one or more of a compute node and a burst buffer appliance. The processing platform communicates with a plurality of the compute nodes over a network, wherein a plurality of applications executing on the plurality of compute nodes generate a plurality of data objects; computes erasure metadata for one or more of the data objects on at least one of the compute nodes; and provides the erasure metadata with the corresponding one or more data objects to a storage system. The processing platform optionally determines a full set of the data objects to be stored and queries the storage system to determine an anticipated layout of the full set of the data objects to be stored. The anticipated layout allows special handling, for example, for small files and large files that are identified based on predefined criteria.
Current possibilities and future opportunities for erasure coded computations
The key capability established through the research funded by this award are erasure coded computations for linear systems, in serial and in parallel. This capability enables powerful efficient and scalable alternatives to existing linear system solvers in fault-prone computational systems.
Nonequilibrium thermodynamics of erasure with superconducting flux logic
We implement a thermal-fluctuation-driven logical bit reset on a superconducting flux logic cell. We show that the logical state of the system can be continuously monitored with only a small perturbation to the thermally activated dynamics at 500 mK. We use the trajectory information to derive a single-shot estimate of the work performed on the system per logical cycle. We acquire a sample of 10 5 erasure trajectories per protocol and show that the work histograms agree with both microscopic theory and global fluctuation theorems. The results demonstrate how to design and diagnose complex, high-speed, and thermodynamically efficient computing using superconducting technology.
Design Considerations and Analysis of Multi-Level Erasure Coding in Large-Scale Data Centers
Multi-level erasure coding (MLEC) has seen large deployments in the field, but there is no in-depth study of design considerations for MLEC at scale. In this paper, we provide comprehensive design considerations and analysis of MLEC at scale. We introduce the design space of MLEC in multiple dimensions, including various code parameter selections, chunk placement schemes, and various repair methods. We quantify their performance and durability, and show which MLEC schemes and repair methods can provide the best tolerance against independent/correlated failures and reduce repair network traffic by orders of magnitude. To achieve this, we use various evaluation strategies including simulation, splitting, dynamic programming, and mathematical modeling. We also compare the performance and durability of MLEC with other EC schemes such as SLEC and LRC and show that MLEC can provide high durability with higher encoding throughput and less repair network traffic over both SLEC and LRC.
To image, or not to image: class-specific diffractive cameras with all-optical erasure of undesired objects
Abstract Privacy protection is a growing concern in the digital era, with machine vision techniques widely used throughout public and private settings. Existing methods address this growing problem by, e.g., encrypting camera images or obscuring/blurring the imaged information through digital algorithms. Here, we demonstrate a camera design that performs class-specific imaging of target objects with instantaneous all-optical erasure of other classes of objects. This diffractive camera consists of transmissive surfaces structured using deep learning to perform selective imaging of target classes of objects positioned at its input field-of-view. After their fabrication, the thin diffractive layers collectively perform optical mode filtering to accurately form images of the objects that belong to a target data class or group of classes, while instantaneously erasing objects of the other data classes at the output field-of-view. Using the same framework, we also demonstrate the design of class-specific permutation and class-specific linear transformation cameras, where the objects of a target data class are pixel-wise permuted or linearly transformed following an arbitrarily selected transformation matrix for all-optical class-specific encryption, while the other classes of objects are irreversibly erased from the output image. The success of class-specific diffractive cameras was experimentally demonstrated using terahertz (THz) waves and 3D-printed diffractive layers that selectively imaged only one class of the MNIST handwritten digit dataset, all-optically erasing the other handwritten digits. This diffractive camera design can be scaled to different parts of the electromagnetic spectrum, including, e.g., the visible and infrared wavelengths, to provide transformative opportunities for privacy-preserving digital cameras and task-specific data-efficient imaging.
Performance Studies of Parallel Erasure Coding on Clustered Micro Storage Servers
The objective of this presentation for the HPC mini showcase was to find effectiveness of erasure encoding done in parallel and then discover a possible solution to more cost effective storage.
Selective Amnesia using Contrastive Subnet Erasure for Class Level Unlearning in Vision Models
We study concept-level forgetting in pretrained vision models: removing an entire semantic category so the system no longer recognizes that object in unseen images and contexts, rather than merely forgetting specific training examples. Prior work either applies blunt global projections or fine-tunes parameters, which can introduce collateral damage to unrelated features, add compute, and become unstable as forgetting strength increases. We introduce Contrastive Subnet Erasure (CSE), a training-free, encoder-centric edit that targets a compact set of channels most responsible for the class and attenuates them in a calibrated manner. The modification is algebraically folded into the subsequent layer, yielding no inference-time overhead and leaving task heads unchanged. To evaluate whether forgetting generalizes beyond the data used to specify the class, we introduce a cross dataset protocol in which the class is defined on a source dataset and performance is measured on a disjoint target dataset drawn from a different distribution with no shared images. This setup tests whether the model still fails to recognize the object when it looks different or appears in new scenes, and it helps avoid overfitting to patterns in the source dataset. Across CIFAR 10, CIFAR 100, and ImageNet under this protocol, CSE achieves stronger forgetting of the target class while better preserving non target utility than existing baselines in both single class and multi class settings. Overall, CSE provides a simple, stable, and deployment-ready mechanism for class-level unlearning in vision.
Multimodal Characterization of Crystal Structure and Formation in Rubrene Thin Films Reveals Erasure of Orientational Discontinuities
Abstract Multimodal multiscale characterization provide opportunities to study organic semiconducting thin films with multiple length scales, across multiple platforms, to elucidate crystallization mechanisms of the various microstructures that impact functionality. With polarized scanning transmission X‐ray and 4D‐scanning transmission electron microscopy, hybrid crystalline structures in rubrene thin films in which large crystalline domains surround a common nucleus and transition to a spherulite morphology at larger radii is observed. These high‐resolution techniques reveal how azimuthal orientational discontinuities at smaller radii are erased as spherulite morphology takes hold. In situ crystallization in the films with optical microscopy is also captured, discovering the importance of considering the initial temperature increase of a film during thermal annealing over the crystallization timescale. This kinetic information of the radial crystallization rate and of corresponding film heating kinetics is used to estimate the temperature at which the larger crystalline regions transition into a spherulite. By combining the results obtained from the different characterization modes, it is learned that thermal conditions can sensitively affect the crystallization of rubrene and other organic thin films. The observations suggest opportunities for more complex temperature‐dependent processing to maximize hybrid structures’ functionality in organic thin films and demonstrate that multimodal studies deepen the understanding of structure‐function dynamics.
A mid-circuit erasure check on a dual-rail cavity qubit using the joint-photon number-splitting regime of circuit QED
Not Available