Search NASA⌕ Search

SEARCH · Search NASA

Results for “bit”

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.

At least 361 records · Page 20
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Inferring the Dynamics of the State Evolution During Quantum Annealing

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Furthermore, using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer, such as the state evolution during annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce a technique to estimate the freeze-out point of both the system as well as of individual qubits.

42 ENGINEERING↗
DOE OSTI2022

Quantum Distributed Unit Commitment: An Application in Microgrids

The dawn of quantum computing brings on a revolution in the way combinatorially complex power system problems such as Unit Commitment are solved. The Unit Commitment problem complexity is expected to increase in the future because of the trend toward the increase of penetration of intermittent renewables. Even though quantum computing has proven effective for solving a host of problems, its applications for power systems’ problems have been rather limited. Here, in this paper, a quantum unit commitment is innovatively formulated and the quantum version of the decomposition and coordination alternate direction method of multipliers (ADMM) is established. The above is achieved by devising quantum algorithms and by exploiting the superposition and entanglement of quantum bits (qubits) for solving subproblems, which are then coordinated through ADMM to obtain feasible solutions. The main contributions of this paper include: 1) the innovative development of a quantum model for Unit Commitment; 2) development of decomposition and coordination-supported framework which paves the way for the utilization of limited quantum resources to potentially solve the large-scale discrete optimization problems; 3) devising the novel quantum distributed unit commitment (QDUC) to solve the problem in a larger scale than currently available quantum computers are capable of solving. The QDUC results are compared with those from its classical counterpart, which validate the efficacy of quantum computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Distributed Inference with Sparse and Quantized Communication

Here, we consider the problem of distributed inference where agents in a network observe a stream of private signals generated by an unknown state, and aim to uniquely identify this state from a finite set of hypotheses. We focus on scenarios where communication between agents is costly, and takes place over channels with finite bandwidth. To reduce the frequency of communication, we develop a novel event-triggered distributed learning rule that is based on the principle of diffusing low beliefs on each false hypothesis. Building on this principle, we design a trigger condition under which an agent broadcasts only those components of its belief vector that have adequate innovation, to only those neighbors that require such information. We prove that our rule guarantees convergence to the true state exponentially fast almost surely despite sparse communication, and that it has the potential to significantly reduce information flow from uninformative agents to informative agents. Next, to deal with finite-precision communication channels, we propose a distributed learning rule that leverages the idea of adaptive quantization. We show that by sequentially refining the range of the quantizers, every agent can learn the truth exponentially fast almost surely, while using just 1 bit to encode its belief on each hypothesis. For both our proposed algorithms, we rigorously characterize the trade-offs between communication-efficiency and the learning rate.

42 ENGINEERING↗
DOE OSTI2022

A Visual Comparison of Silent Error Propagation

High-performance computing (HPC) systems play a critical role in facilitating scientific discoveries. Their scale and complexity (e.g., the number of computational units and software stack) continue to grow as new systems are expected to process increasingly more data and reduce computing time. However, with more processing elements, the probability that these systems will experience a random bit-flip error that corrupts a program's output also increases, which is often recognized as silent data corruption. Analyzing the resiliency of HPC applications in extreme-scale computing to silent data corruption is crucial but difficult. An HPC application often contains a large number of computation units that need to be tested, and error propagation caused by error corruption is complex and difficult to interpret. Here, to accommodate this challenge, we propose an interactive visualization system that helps HPC researchers understand the resiliency of HPC applications and compare their error propagation. Our system models an application's error propagation to study a program's resiliency by constructing and visualizing its fault tolerance boundary. Coordinating with multiple interactive designs, our system enables domain experts to efficiently explore the complicated spatial and temporal correlation between error propagations. At the end, the system integrated a nonmonotonic error propagation analysis with an adjustable graph propagation visualization to help domain experts examine the details of error propagation and answer such questions as why an error is mitigated or amplified by program execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Analysis and Compensation of Tx and Rx IQ Imbalances in Uplink IM-OFDMA Systems

Index modulation-based orthogonal division multiple access (IM-OFDMA) has recently been proposed as a potential technique for future wireless communication systems due to its superior spectral efficiency and error performance over conventional multiple access schemes. However, its performance is still under investigation by researchers in light of a variety of scenarios and assumptions. Following this direction, in this Article, the individual and joint effects of the transmitter (Tx) and receiver (Rx) in-phase and quadrature imbalances (IQI) on the bit-error-rate (BER) performance of the uplink IM-OFDMA scheme are investigated by considering whether each user's RF front-end is identical or not. Moreover, to reduce the detrimental effect of IQI, a preamble-based estimation and compensation method is proposed for IM-OFDMA. Closed-form expressions for the average BER of IM-OFDMA are obtained by considering the physical effect of the Tx and Rx IQI. Also, using Monte Carlo simulations, the derived expressions are verified under different system configurations. Furthermore, analytical and simulation results reveal that Tx and Rx IQI cause an error floor in the BER performance of IM-OFDMA schemes. However, the proposed estimation and compensation method not only reduces the impact of IQI but also leads to a better BER performance compared to the case of no IQI, which mainly refers to the frequency diversity caused by the IQI.

42 ENGINEERING↗
DOE OSTI2025

A Study on the Impact of Temperature-Dependent Ferroelectric Switching Behavior in 3D Memory Architecture

The flourishing development of neural networks that require exponentially growing amounts of data has presented an elevated demand for memory footprint. To address this, researchers have been exploring hardware accelerators with innovative memory architectures like 3D memory. These 3D memory architectures offer enhanced storage capacity and processing capabilities, at a cost of rising on-chip temperature during operation. Hafnium Zirconium Oxide (HZO) based Ferroelectric Random Access Memory (FeRAM) is a promising nonvolatile memory candidate in neural network hardware accelerators for its outstanding write performance and reliability. However, its implementation in the architecture regarding the temperature-dependent ferroelectric switching behavior has not been well studied. In this work, we study the thermal impacts on polarization switching through experimental devices and simulation results. We conduct the circuit and architecture-level simulations to showcase that one can exploit this temperature rise to reduce FeRAM's write voltage and write energy due to its unique temperature-activated polarization switching mechanisms. As the on-chip temperature increases to 351K (ambient temperature at 300K) due to neural network workloads, the access energy per bit can be reduced by 27.6% when a dynamic write voltage is applied.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Reliable edge machine learning hardware for scientific applications

Extreme data rate scientific experiments create massive amounts of data that require efficient ML edge processing. This leads to unique validation challenges for VLSI implementations of ML algorithms: enabling bit-accurate functional simulations for performance validation in experimental software frameworks, verifying those ML models are robust under extreme quantization and pruning, and enabling ultra-fine-grained model inspection for efficient fault tolerance. We discuss approaches to developing and validating reliable algorithms at the scientific edge under such strict latency, resource, power, and area requirements in extreme experimental environments. We study metrics for developing robust algorithms, present preliminary results and mitigation strategies, and conclude with an outlook of these and future directions of research towards the longer-term goal of developing autonomous scientific experimentation methods for accelerated scientific discovery.

Baldi, Tommaso↗
DOE OSTI2022

Deterministic Linear Time for Maximal Poisson‐Disk Sampling using Chocks without Rejection or Approximation

Abstract We show how to sample uniformly within the three‐sided region bounded by a circle, a radial ray, and a tangent, called a “chock.” By dividing a 2D planar rectangle into a background grid, and subtracting Poisson disks from grid squares, we are able to represent the available region for samples exactly using triangles and chocks. Uniform random samples are generated from chock areas precisely without rejection sampling. This provides the first implemented algorithm for precise maximal Poisson‐disk sampling in deterministic linear time. We prove O(n · M(b) log b), where n is the number of samples, b is the bits of numerical precision and M is the cost of multiplication. Prior methods have higher time complexity, take expected time, are non‐maximal, and/or are not Poisson‐disk distributions in the most precise mathematical sense. We fill this theoretical lacuna.

Mitchell, Scott A.↗
DOE OSTI2021

Comparison of Rotary and Linear Cutting Methodology in Determining Specific Cutting Energy of Granite

Abstract Single polycrystalline diamond compact (PDC) cutting is a practical technique to understand the rock–tool interactions in drag-bit-type geothermal drilling operations. This paper introduces a rotary cutting method to determine specific cutting energy (SCE) and compares it with the conventional linear cutting method. In this work, granite is selected to represent hard rock formations in geothermal drilling. Cutting tests are conducted on a Computer Numerical Control (CNC) machine with a realistic cutting speed of 12.7 m/min and several chip loads ranging from 0.08 to 0.25 mm. The cutting force is measured using a dynamometer and then converted to specific cutting energy (SCE). The results show that the rotary method produces an inverse relationship between SCE and chip load, whereas the linear method shows the opposite. As a result, the produced SCE by the rotary method tends to be lower than that of the linear method at a higher chip load at and over 0.16 mm. The difference may be attributed to the cutting configuration and associated force components.

Engineering↗
DOE OSTI2023

The Effects of Plasma Pre-Cracking on Drilling of Hard Rocks: A Single Insert Cutting Experiment

Abstract This paper studies the effects of plasma-induced cracks on rock cutting to support the concept of a plasma-integrated drag bit for accelerated geothermal drilling through hard rocks. For this, a single polycrystalline diamond compact (PDC) drilling technique is used in cutting granite to compare thrust and cutting forces between plasma-treated and untreated rock samples. The cracks are produced using underwater plasma at 80 J per pulse. This energy level does not produce visible damage to the rock. The cutting tests are conducted at a cutting speed of 12.7 m/min and four feed rates of 0.127, 0.201, 0.267, and 0.414 mm/s to represent actual drilling scenarios. The results show a general trend of reduction in both thrust and cutting forces for these feed rates, but the magnitude of reduction highly depends on the feed rate. The maximum force reduction of around 50% is found at the 0.267 mm/s feed rate with statistical significance. Cases with a higher force reduction are also found to have rougher surface topography, which indicates more excessive fracturing and, thus, a cracks-accelerated material removal process. This study provides initial evidence of using underwater plasma to increase the downhole drilling rate of hard rocks.

Engineering↗
DOE OSTI2024

Quantum sensing using a qubit for the detection of ionizing radiation

Quantum sensing utilizes the inherent sensitivity of a quantum system to external stimuli. Our goal is to leverage this sensitivity to develop a quantum sensor designed for the detection of ionizing radiation. Here we report on the design, fabrication, and measurement of a new quantum device for hard x-ray and gamma-ray detection. Our quantum device is based on a superconducting quantum bit (qubit) with superconducting tunnel junctions as the core device elements. We describe our experimental investigation directed toward the detection metrics of energy resolution, dynamic range, and active area. In contrast to existing superconducting detectors, the active area per qubit may be much larger than the physical area of the tunnel junctions or the physical area of the qubit device, due to the sensitivity of quantum coherence to ionizing radiation deposition within a radius on the millimeter or centimeter scale. Furthermore, our experimental design enables an ionizing radiation source at room temperature to be detected by our quantum sensor at low temperature.

qubit↗
DOE OSTI2025

Attention to quantum complexity

The imminent era of error-corrected quantum computing demands robust methods to characterize quantum state complexity from limited, noisy measurements. We introduce the Quantum Attention Network (QuAN), a classical artificial intelligence (AI) framework leveraging attention mechanisms tailored for learning quantum complexity. Inspired by large language models, QuAN treats measurement snapshots as tokens while respecting permutation invariance. Combined with our parameter-efficient miniset self-attention block, this enables QuAN to access high-order moments of bit-string distributions and preferentially attend to less noisy snapshots. We test QuAN across three quantum simulation settings: driven hard-core Bose-Hubbard model, random quantum circuits, and toric code under coherent and incoherent noise. QuAN directly learns entanglement and state complexity growth from experimental computational basis measurements, including complexity growth in random circuits from noisy data. In regimes inaccessible to existing theory, QuAN unveils the complete phase diagram for noisy toric code data as a function of both noise types, highlighting AI’s transformative potential for assisting quantum hardware.

Kim, Hyejin [Cornell Univ., Ithaca, NY (United Sta↗
DOE OSTI2023

Hunting for Majoranas

Over the past decade, there have been considerable efforts to observe non-abelian quasiparticles in novel quantum materials and devices. These efforts are motivated by the goals of demonstrating quantum statistics of quasiparticles beyond those of fermions and bosons and of establishing the underlying science for the creation of topologically protected quantum bits. In this Review, we focus on efforts to create topological superconducting phases that host Majorana zero modes. We consider the lessons learned from existing experimental efforts, which are motivating both improvements to present platforms and the exploration of new approaches. Although the experimental detection of non-abelian quasiparticles remains challenging, the knowledge gained thus far and the opportunities ahead offer high potential for discovery and advances in this exciting area of quantum physics.

Science & Technology - Other Topics↗
DOE OSTI2023

Emergence of quantum-field theory in causal diamonds

The experimental successes of quantum-field theory do not justify using it to describe even a finite fraction of the entanglement entropy of a causal diamond with its exterior, in the limit of large diamonds. Susskind and Uglum and Jacobson conjectured that this divergent entropy could be thought of as a renormalization of Newton’s constant in the Bekenstein–Hawking formula, if we applied that formula to arbitrary causal diamonds. Jacobson showed that this leads to a derivation of the null projection of Einstein’s equations as the hydrodynamic equations of the area law for arbitrary diamonds, a derivation which has the added virtue of demonstrating that the cosmological constant is not an energy density. Using a gauge choice adapted to causal diamond boundaries, we revisit arguments of Carlip and Solodukhin that the proper theory of near horizon states is a (cut-off) (1 + 1)-dimensional conformal field theory, with central charge proportional to the transverse area. This leads to a universal formula for fluctuations of the modular Hamiltonian of a diamond, which we argue is compatible with the explanation of the temperature of de Sitter space in terms of an identification between localized energy and the number of constrained q-bits of the holographic degrees of freedom.

Astronomy & Astrophysics↗
DOE OSTI2020

Time-sliced quantum circuit partitioning for modular architectures

Current quantum computer designs will not scale. To scale beyond small prototypes, quantum architectures will likely adopt a modular approach with clusters of tightly connected quantum bits and sparser connections between clusters. We exploit this clustering and the statically-known control flow of quantum programs to create tractable partitioning heuristics which map quantum circuits to modular physical machines one time slice at a time. Specifically, we create optimized mappings for each time slice, accounting for the cost to move data from the previous time slice and using a tunable lookahead scheme to reduce the cost to move to future time slices. We compare our approach to a traditional statically-mapped, owner-computes model. Our results show strict improvement over the static mapping baseline. Here, we reduce the non-local communication overhead by 89.8% in the best case and by 60.9% on average. Our techniques, unlike many exact solver methods, are computationally tractable.

Baker, Jonathan M.↗
DOE OSTI2020

FPDetect: Efficient Reasoning About Stencil Programs Using Selective Direct Evaluation

We present FPDetect, a low-overhead approach for detecting logical errors and soft errors affecting stencil computations without generating false positives. We develop an offline analysis that tightly estimates the number of floating-point bits preserved across stencil applications. This estimate rigorously bounds the values expected in the data space of the computation. Violations of this bound can be attributed with certainty to errors. FPDetect helps synthesize error detectors customized for user-specified levels of accuracy and coverage. FPDetect also enables overhead reduction techniques based on deploying these detectors coarsely in space and time. Experimental evaluations demonstrate the practicality of our approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Test Points for Online Monitoring of Quantum Circuits

Noisy Intermediate-Scale Quantum (NISQ) computers consisting of tens of inherently noisy quantum bits (qubits) suffer from reliability problems. Qubits and their gates are susceptible to various types of errors. Due to limited numbers of qubits and high error rates, quantum error correction cannot be applied. Physical constraints of quantum hardware including the error rates are used to guide the design and the layout of quantum circuits. The error rates determine the selection of qubits and their operations. The resulting circuit is executed on the quantum computer. This study explores the risk of unexpected changes in the error rates of NISQ computers post-calibration. We show that unexpected changes in error rates can alter the output state of a quantum circuit. To detect these changes, we propose the insertion of test points into the quantum circuit to enable online monitoring of the physical qubit behavior. We utilize classical, superposition, and uncompute test points. Furthermore, we use a gate error coverage metric to assess the quality of the tests. We verify the effectiveness of the proposed scheme on different IBM quantum computers (IBM Q), in addition to a noisy simulation that shows the scalability of the proposed approach.

97 MATHEMATICS AND COMPUTING↗