SEARCH · Engineering Papers

Results for “protocol (computers)”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 253 records · Page 14

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Modeling neutral defects in III-V ternary alloys with a special quasirandom structure: Analysis of As- and III-site point defects in InGaAs

While first-principles density functional theory modeling has become a vital tool to investigate defect properties in semiconductors, the lack of crystalline periodicity in pseudobinary random composition alloys, such as In 1−𝑥 ⁢Ga 𝑥 ⁢As, complicates such analyses. We present a simulation strategy to systematically take into account the variability in the local defect environment in order to predict statistical properties of neutral intrinsic defects in In 1−𝑥⁢ Ga 𝑥 ⁢As. We use a comprehensive sampling from a modest-sized 64-atom special quasirandom structure (SQS) to define a statistically representative set of defects, and use a 512-atom hypercell, a 2 × 2 × 2 supercell of SQS supercells, to achieve cell-size convergence. We articulate an equivalent site principle and describe how it constrains atomic chemical reference energies in computation of defect formation energies in pseudobinary alloys. A simple protocol for estimating reference energies for the Ga and In atoms sharing the III site succeeds in obtaining the equivalence of defects at Ga-sites and In sites in the SQS supercell, (<30 meV differences in average formation energies). For III-site defects, such as the As antisite As III , the statistical variability in formation energies is modest, ≈ 0.1–0.2 eV. The variability in formation energy at As-site defects, such as the As vacancy 𝑣 As , can be much larger, >1 eV. The As antisite is shown to be a low-energy defect and the most likely to be present in as-grown materials, just as in GaAs. All other defects are higher-energy defects unlikely to be important in native material, but potentially important in radiation-damaged material. With a strong variability in defect energies, especially on the As-site, explicit consideration of statistical variability due to compositional randomness will be imperative for meaningful and quantitative comparisons to experiment.

Density functional theory↗

DOE OSTI2022

Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution

We study the properties of output distributions of noisy random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the “useless” uniform distribution. These bounds are tight with respect to the dependence on circuit depth. Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits. We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation. Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques. We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2026

Symposium MT02: Statistical Mechanics-Based Computational Tools for the Study of Phase Transformation in Complex Materials (Final Report)

Symposium MT02 brought together a diverse and interdisciplinary community of scientists specializing in Statistical Mechanics-based computational modeling to investigate phase transformations in materials exhibiting complex disordered structures. As the demand for materials with extreme performance metrics grows—from aerospace components to next-generation optical fibers—the ability to predict microstructural evolution under non-equilibrium conditions has become paramount. The primary goal of this symposium was to identify, evaluate, and discuss advanced computational tools capable of designing precise manufacturing conditions to tailor material properties efficiently. By fostering a dialogue between computational theorists and experimentalists, the symposium sought to establish new protocols for predicting how processing history—such as cooling rates or strain paths—dictates the final microstructure.

36 MATERIALS SCIENCE↗

DOE OSTI2022

Radio frequency sensing and its innovative applications in diverse sectors: A comprehensive study

Recent advancements in radio frequency (RF) sensing technology can be attributed to the development of the Internet of Things (IoT), healthcare, RF-identification, and communication applications. RF sensing is a multidisciplinary research field that requires expertise in computing, electronics, and electromagnetics to cover all system features, including protocol development, antenna design, sensor integration, algorithm formulation, interconnection, data, and analytics. The overarching aim of this work is to present detailed information about RF technologies and their innovations and application diversity from the novel work carried out at CSI Lab1, together in one platform with an extensive survey. This study presents state-of-the art applications and RF sensing that include W-Fi, radar, and SDR and RFID-based sensing. A comprehensive survey and study of the advantages and limitations of each non-contact technology is discussed. Additionally, open research gaps have been identified as well. Decades of knowledge and experience have been put to use to meet new challenges and demands. The development and study of RF systems, IoT, RFID sensing, and research and deployment activities, are briefly discussed. The emerging research projects with industry, institutional research centers, and academic studies are also addressed. Finally, an outline of identified potential future research areas is provided, emphasizing opportunities and challenges.

47 OTHER INSTRUMENTATION↗

NASA NTRS1985

A 250-Mbit/s ring local computer network using 1.3-microns single-mode optical fibers

A 250-Mbit/s three-station fiber-optic ring local computer network was built and successfully demonstrated. A conventional token protocol was employed for bus arbitration to maximize the bus efficiency under high loading conditions, and a non-return-to-zero (NRS) data encoding format was selected for simplicity and maximum utilization of the ECL-circuit bandwidth.

Eng, S. T.↗

DOE OSTI2022

A Thermogravimetric Temperature-Programmed Thermal Redox Protocol for Rapid Screening of Metal Oxides for Solar Thermochemical Hydrogen Production

As combinatorial and computational methods accelerate the identification of potentially suitable thermochemically-active oxides for use in solar thermochemical hydrogen production (STCH), the onus shifts to quickly evaluating predicted performance. Traditionally, this has required an experimental setup capable of directly carrying out a two-stage thermochemical water-splitting process. But this can be a difficult endeavor, as most off-the-shelf equipment cannot adequately deal simultaneously with the high temperatures, varying oxygen partial pressures, and high H 2 O partial pressures required; achieving sufficient temporal sensitivity to accurately quantify the kinetics is also a major challenge. However, as proposed here, a less complicated experiment can be used as a first screening for thermochemical water splitting potential. Temperature-Programmed Thermal Redox (TPTR) using thermogravimetry evaluates the thermal reduction behavior of materials. This technique does not require water splitting or CO 2 -splitting analogs but can nonetheless predict water-splitting performance. Three figures of merit are obtained from the TPTR experiment: reduction onset temperature, extent of reduction, and extent of recovery upon reoxidation. These metrics can collectively be used to determine if a material is capable of thermochemical water-splitting, and, to good approximation, predict whether the thermodynamics are favorable for use under more challenging high-conversion conditions. This paper discusses the pros and cons of using TPTR and proposes a protocol for use within the STCH community.

08 HYDROGEN↗

DOE OSTI2022

Dynamical Anyon Generation in Kitaev Honeycomb Non-Abelian Spin Liquids

Relativistic Mott insulators known as “Kitaev materials” potentially realize spin liquids hosting non-Abelian anyons. Motivated by fault-tolerant quantum-computing applications in this setting, we introduce a dynamical anyon-generation protocol that exploits universal edge physics. The setup features holes in the spin liquid, which define energetically cheap locations for non-Abelian anyons, connected by a narrow bridge that can be tuned between spin liquid and topologically trivial phases. We show that modulating the bridge from trivial to spin liquid over intermediate time scales—quantified by analytics and extensive simulations—deposits non-Abelian anyons into the holes with O(1) probability. The required bridge manipulations can be implemented by integrating the Kitaev material into magnetic tunnel junction arrays that engender locally tunable exchange fields. Combined with existing readout strategies, our protocol reveals a path to topological qubit experiments in Kitaev materials at zero applied magnetic field.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS2001

Simple LDAP Schemas for Grid Monitoring

The purpose of this document is to provide an initial definition of the data we need in a directory service or database so that we can implement a performance monitoring testbed. To begin with, this document describes how to represent producers of events and event schemes. The representation of producers is simple and does not contain information such as who has access to the events and what protocols can be used to access the events. In the future, we will define how to describe consumers of events and add details to our representations. A popular choice for a directory service or database for grid computing is a distributed directory service that is accessed using the Lightweight Directory Access Protocol (LDAP). This document uses LDAP terminology, schemes, and formats to represent the directory service schemes.

Smith, Warren↗

DOE OSTI2025

Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

open quantum systems & decoherence↗

DOE OSTI2023

Interactive cryptographic proofs of quantumness using mid-circuit measurements

The ability to perform measurements in the middle of a quantum circuit is a powerful resource. It underlies a wide range of applications, from remote state preparation to quantum error correction. Here we apply mid-circuit measurements for a particular task: demonstrating quantum computational advantage. The goal of such a demonstration is for a quantum device to perform a computational task that is infeasible for a classical device with comparable resources. In contrast to existing demonstrations, the distinguishing feature of our approach is that the classical verification process is efficient, both in asymptotic complexity and in practice. Furthermore, the classical hardness of performing the task is based upon well-established cryptographic assumptions. Protocols with these features are known as cryptographic proofs of quantumness. Using a trapped-ion quantum computer, we perform mid-circuit measurements by spatially isolating portions of the ion chain via shuttling. This enables us to implement two interactive cryptographic proofs of quantumness, which when suitably scaled to larger systems, promise the efficient verification of quantum computational advantage. In conclusion, our methods can be applied to a range of interactive quantum protocols.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2004

Tools for Administration of a UNIX-Based Network

Several computer programs have been developed to enable efficient administration of a large, heterogeneous, UNIX-based computing and communication network that includes a variety of computers connected to a variety of subnetworks. One program provides secure software tools for administrators to create, modify, lock, and delete accounts of specific users. This program also provides tools for users to change their UNIX passwords and log-in shells. These tools check for errors. Another program comprises a client and a server component that, together, provide a secure mechanism to create, modify, and query quota levels on a network file system (NFS) mounted by use of the VERITAS File SystemJ software. The client software resides on an internal secure computer with a secure Web interface; one can gain access to the client software from any authorized computer capable of running web-browser software. The server software resides on a UNIX computer configured with the VERITAS software system. Directories where VERITAS quotas are applied are NFS-mounted. Another program is a Web-based, client/server Internet Protocol (IP) address tool that facilitates maintenance lookup of information about IP addresses for a network of computers.

LeClaire, Stephen↗

NASA NTRS1987

Computer simulation of fibrillation threshold measurements and electrophysiologic testing procedures

A finite element model of cardiac conduction was used to simulate two experimental protocols: 1) fibrillation threshold measurements and 2) clinical electrophysiologic (EP) testing procedures. The model consisted of a cylindrical lattice whose properties were determined by four parameters: element length, conduction velocity, mean refractory period, and standard deviation of refractory periods. Different stimulation patterns were applied to the lattice under a given set of lattice parameter values and the response of the model was observed through a simulated electrocardiogram. The studies confirm that the model can account for observations made in experimental fibrillation threshold measurements and in clinical EP testing protocols.

NASA Discipline Cardiopulmonary↗

DOE OSTI2024

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS1995

An empirical evaluation of graphical interfaces to support flight planning

Whether optimization techniques or expert systems technologies are used, the underlying inference processes and the model or knowledge base for a computerized problem-solving system are likely to be incomplete for any given complex, real-world task. To deal with the resultant brittleness, it has been suggested that 'cooperative' rather than 'automated' problem-solving systems be designed. Such cooperative systems are proposed to explicitly enhance the collaboration of people and the computer system when working in partnership to solve problems. This study evaluates the impact of alternative design concepts on the performance of airline pilots interacting with such a cooperative system designed to support enroute flight planning. Thirty pilots were studied using three different versions of the system. The results clearly demonstrate that different system design concepts can strongly influence the cognitive processes of users. Indeed, one of the designs studied caused four times as many pilots to accept a poor flight amendment. Based on think-aloud protocols, cognitive models are proposed to account for how features of the computer system interacted with specific types of scenarios to influence exploration and decision-making by the pilots. The results are then used to develop recommendations for guiding the design of cooperative systems.

Smith, Philip J.↗

DOE OSTI2024

Shape-shifting Elephants: Multi-modal Transport for Integrated Research Infrastructure

Data Acquisition (DAQ) workloads form an important class of scientific network traffic that by its nature (1) flows across different research infrastructure, including remote instruments and supercomputer clusters, (2) has ever-increasing throughput demands, and (3) has ever-increasing integration demands---for example, observations at one instrument could trigger a reconfiguration of another instrument. Today's DAQ transfers rely on UDP and (heavily tuned) TCP, but this is driven by convenience rather than suitability. The mismatch between Internet transport protocols and scientific workloads becomes more stark with the steady increase in link capacities, data generation, and integration across research infrastructure.This position paper argues the importance of developing specialized transport protocols for DAQ workloads. It proposes a new transport feature for this kind of elephant flow: multi-modality involves the network actively configuring the transport protocol to change how DAQ flows are processed across different underlying networks that connect scientific research infrastructure. Multi-modality is a layering violation that is proposed as a pragmatic technique for DAQ transport protocol design. It takes advantage of programmable network hardware that is increasingly being deployed in scientific research infrastructure. The paper presents an initial evaluation through a pilot study that includes a Tofino2 switch and Alveo FPGA cards, and using data from a particle detector.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Simulating topological quantum gates in two-dimensional magnet-superconductor hybrid structures

The creation of topological quantum gates using Majorana zero modes—an outstanding problem in the field of topological quantum computing—relies on our ability to control the braiding process in time and space. Here, we propose two-dimensional magnet-superconductor hybrid structures as a new platformfor the successful implementation of topologically protected √σ z -, σ z - and σ x -quantum gates using Majorana zero modes. Employing a novel theoretical formalism to compute the full timedependent many-body wave-function and utilizing a braiding protocol motivated by recent advances in electron-spin-resonance techniques we simulate quantum gates in 2D systems up to 600 sites, on timescales from a few femto- to nanoseconds. We demonstrate that the braiding process can be visualized in time and space by computing the non-equilibrium local density of states, which is proportional to the time-dependent differential conductance measured in scanning tunneling spectroscopy experiments, allowing us to directly image Majorana world lines.

Superconducting properties and materials↗

DOE OSTI2023

Quantum Communication Networks for Energy Applications: Review and Perspective

Abstract The energy sector is expected to undergo significant changes in the coming decades with the advent of new technologies, including smart grid development, microgrid expansion, increasing electric vehicle and renewable energy usage, and enhanced measures to minimize greenhouse gas emission, among others. In tandem, these changes are expected to create new opportunities for the deployment of quantum technologies within the energy sector. Building on the authors' previous reviews on the current state of and future opportunities for quantum sensing, quantum computing and quantum simulations for energy sector applications, this work provides an overview of recent progress in quantum networking and communications for the energy industry, with a focus on platforms, devices, and protocols, including quantum teleportation and quantum key distribution. Specific areas of relevance to the energy sector are then analyzed, including the role of quantum networks for greenhouse gas monitoring, secure data collection and transmission in smart grids, nuclear power plants’ safety, facilitating oil and gas exploration, and other energy‐relevant applications. This review concludes with a brief overview of areas for future innovation, including the need for platforms for simulating quantum networks, quantum material and platform design, and computational approaches to accelerate quantum protocol discovery and development.

Paudel, Hari P.↗