Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Ising”

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 1,657 records · Page 92
All sourcesNASA NTRSDOE OSTI
NASA NTRS2009

ARTEMIS: The First Mission to the Lunar Libration Orbits

The ARTEMIS mission will be the first to navigate to and perform stationkeeping operations around the Earth-Moon L1 and L2 Lagrangian points. The NASA Goddard Space Flight Center (GSFC) has previous mission experience flying in the Sun-Earth L1 (SOHO, ACE, WIND, ISEE-3) and L2 regimes (WMAP) and have maintained these spacecraft in libration point orbits by performing regular orbit stationkeeping maneuvers. The ARTEMIS mission will build on these experiences, but stationkeeping in Earth-Moon libration orbits presents new challenges since the libration point orbit period is on the order of two weeks rather than six months. As a result, stationkeeping maneuvers to maintain the Lissajous orbit will need to be performed frequently, and the orbit determination solutions between maneuvers will need to be quite accurate. The ARTEMIS mission is a collaborative effort between NASA GSFC, the University of California at Berkeley (UCB), and the Jet Propulsion Laboratory (JPL). The ARTEMIS mission is part of the THEMIS extended mission. ARTEMIS comprises two of the five THEMIS spacecraft that will be maneuvered from near-Earth orbits into lunar libration orbits using a sequence of designed orbital maneuvers and Moon & Earth gravity assists. In July 2009, a series of orbit-raising maneuvers began the proper orbit phasing of the two spacecraft for the first lunar flybys. Over subsequent months, additional propulsive maneuvers and gravity assists will be performed to move each spacecraft though the Sun-Earth weak stability regions and eventually into Earth-Moon libration point orbits. We will present the overall orbit designs for the two ARTEMIS spacecraft and provide analysis results of the 3/4-body dynamics, and the sensitivities of the trajectory design to both · maneuver errors and orbit determination errors. We will present results from the. initial orbit-raising maneuvers.

Woodward, Mark↗
NASA NTRS2018

Learning Model Structural Uncertainty with Gaussian Processes

The advent of commercially available quantum computers has marked the beginning of quantum computing as a reality. Both quantum gate and annealing computers have been released by major computer hardware companies. In this work, the D-Wave 2XTM quantum annealing computer housed at the NASA Advanced Systems computational facility is investigated to accelerate Machine Learning (ML) for image registration. NASA collects large amounts of images over the globe remotely using space-based monitoring. Images of a fixed areas of the land surface are taken over time. Due to the orbit of the sensors, the viewing angles deviate slightly, and it is necessary to align or register the images precisely to create image time series over the land surface. Unaligned images can lead to substantial analysis errors. These time-series are then used in modeling Earth Systems models such as hydrological, weather, and carbon monitoring models. In this work, we consider the Moderate Resolution Image Spectrometer (MODIS) data collected by the NASA's terra satellite. Artificial Neural Networks (ANNs) is a natural fit for ML modelling of images. Several successes have been reported using machine learning related to image processing. We investigate the use of ML to register MODIS images. ANNs are investigated in combination with a Restricted Boltzmann Machines (RBM) as an auto-encoder. We will present results showing the accuracy and efficiency of this approach.The D-Wave 2XTM quantum annealer samples the ground-state wave-function of a spin-Ising systems with quadratic interactions between qubits and a Chimera connectivity. The system sits in a ~15 mK thermal bath. One can think of the system as being placed in the ground state initially and subject to thermal excitations governed by Boltzmann statistics. If this is assumed true, one can use the statistics from the D-Wave 2XTM to train RBMs. Generating statistics for training Boltzmann machines is an NP-hard problem and constitutes the largest compute cost. We investigate the use of the D-Wave 2XTM to accelerate the training of the RBMs in our ANNs and report on the results.

Kouatchou, Jules↗
NASA NTRS2018

A Small Spacecraft Swarm Deployment and Stationkeeping Strategy for Sun-Earth L1 Halo Orbits

Spacecraft orbits about the Sun-Earth librarian point L1 have been of interest since the 1950s. An L1 halo orbit was first achieved with the International Sun-Earth Explorer-3 (ISEE-3) mission, and similar orbits around Sun-Earth L1 were achieved in the Solar and Heliospheric Observatory (SOHO), Advanced Composition Explorer (ACE), Genesis, and Deep Space Climate Observatory (DSCOVR) missions. With recent advancements in CubeSat technology, we envision that it will soon be feasible to deploy CubeSats at L1. As opposed to these prior missions where one large satellite orbited alone, a swarm of CubeSats at L1 would enable novel science data return, providing a topology for intersatellite measurements of heliophysics phenomena both spatially and temporally, at varying spatial scales.The purpose of this iPoster is to present a flight dynamics strategy for a swarm of numerous CubeSats orbiting Sun-Earth L1. The presented method is a coupled, two-part solution. First, we present a deployment strategy for theCubeSats that is optimized to produce prescribed, time-varying intersatellite baselines for the purposes of collectingmagnetometer data as well as radiometric measurements from cross-links. Second, we employ a loose controlstrategy that was successfully applied to SOHO and ACE for minimized stationkeeping propellant expenditure. Weemphasize that the presented solution is practical within the current state-of-the-art and heritage CubeSat technology,citing capabilities of CubeSat designs that will launch on the upcoming Exploration Mission 1 (EM-1) to lunar orbitsand beyond. Within this iPoster, we present animations of the simulated deployment strategy and resulting spacecrafttrajectories. Mission design parameters such as total v required for long-term station keeping andminimum/maximum/mean spacecraft separation distances are also presented.

Optimal control↗
NASA NTRSDate not supplied

Broad Compatibility Study of Polymeric Materials with Ionic Silver Biocide, Part I

NASA is considering ionic silver as a residual biocide for use in potable water systems being planned for future exploration spacecraft. Compatibility of the biocide with the system’s wetted-materials of construction remains a challenge. Due to the relatively inert nature of plastics, their use in varied water system applications may offer unique opportunities to address many biocide compatibility issues. A 2020 ICES paper described a “Stage 1” assessment of several polymeric materials, in which coupons having a 2 cm 1 surface to volume ratio were exposed to solutions of 400 parts per billion (ppb) aqueous silver fluoride (AgF) for one week. In this current paper, additional Stage 1 test results are presented for select epoxies and lubricants applied on silver-inert substrates. The coupon exposure studies were also expanded to a duration of 5 weeks for the “well-behaved” Stage 1 plastics previously reported: those exhibiting silver losses above 10% and less than 50%. For this type of Stage 2 testing, silver biocide solution samples are taken from three separate (and not previously-sampled) coupon containers after 3 days, and 2, 3, 4, and 5 weeks of exposure. "Very well-behaved" Stage 1 plastics will be tested in the same manner over one year, with longer sample intervals; early-period results are included here. In addition, for select materials, the coupons were “aged” by refilling test containers with fresh AgF and observing the respective silver uptake over similar Stage 2 test durations. For all test series, Inductively Coupled Plasma Mass Spectrometry (ICP-MS) and ion-selective electrode (ISE) analyses were used to determine total and ionic silver (Ag+) concentrations, respectively. Additional sample analyses for Stage 2 tests includes total organic carbon (TOC), pH, conductivity, and oxidation-reduction potential (ORP). Ultimately, these early compatibility studies will be used to guide future material selections for developing silver biocide-compatible spacecraft water systems.

Silver Biocide↗
NASA NTRS2022

Evolution and folding of repeat proteins

Repeat proteins are made with tandem copies of similar amino acid stretches that fold into elongated architectures. These proteins constitute excellent model systems to investigate how evolution relates to structure, folding, and function. Here, we propose a scheme to map evolutionary information at the sequence level to a coarse-grained model for repeat-protein folding and use it to investigate the folding of thousands of repeat proteins. We model the energetics by a combination of an inverse Potts-model scheme with an explicit mechanistic model of duplications and deletions of repeats to calculate the evolutionary parameters of the system at the single-residue level. These parameters are used to inform an Ising-like model that allows for the generation of folding curves, apparent domain emergence, and occupation of intermediate states that are highly compatible with experimental data in specific case studies. We analyzed the folding of thousands of natural Ankyrin repeat proteins and found that a multiplicity of folding mechanisms are possible. Fully cooperative all-or-none transitions are obtained for arrays with enough sequence-similar elements and strong interactions between them, while noncooperative element-by-element intermittent folding arose if the elements are dissimilar and the interactions between them are energetically weak. Additionally, we characterized nucleation-propagation and multidomain folding mechanisms. We show that the global stability and cooperativity of the repeating arrays can be predicted from simple sequence scores.

Ezequiel A. Galpern↗
NASA NTRSDate not supplied

Hardware-Efficient Quantum Optimization Layered Algorithms and Experiments

Quantum optimization algorithms, such as QAOA, that implement parametrized stochastic optimization solvers attempt to identify low-energy solutions of Ising systems by exploiting available quantum effects in noisy-intermediate scale machines. Engineering a well-performing parametrized quantum optimization circuit is indeed an exercise in balancing the trade-off between expressivity and implementation complexity. We show that, for MaxCut QAOA circuits defined on native hardware topology (Rigetti’s Aspen Quantum Processors), error-mitigation techniques recover simulated features of the noiseless theory. Moreover, we explore a design space for QAOA-like ansatze that perform well in theory as well as in hardware for fully-connected problems. We also discuss how efficient coherence and entanglement detection methods that could be coupled with quantum optimization experiments require only linear overhead in benchmarking time.

quantum computing↗
NASA NTRSDate not supplied

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗
DOE OSTI2021

Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware

In this work we present a detailed analysis of variational quantum phase estimation (VQPE), a method based on real-time evolution for ground and excited state estimation on near-term hardware. We derive the theoretical ground on which the approach stands, and demonstrate that it provides one of the most compact variational expansions to date for solving strongly correlated Hamiltonians. At the center of VQPE lies a set of equations, with a simple geometrical interpretation, which provides conditions for the time evolution grid in order to decouple eigenstates out of the set of time evolved expansion states, and connects the method to the classical filter diagonalization algorithm. Further, we introduce what we call the unitary formulation of VQPE, in which the number of matrix elements that need to be measured scales linearly with the number of expansion states, and we provide an analysis of the effects of noise which substantially improves previous considerations. The unitary formulation allows for a direct comparison to iterative phase estimation. Our results mark VQPE as both a natural and highly efficient quantum algorithm for ground and excited state calculations of general many-body systems. We demonstrate a hardware implementation of VQPE for the transverse field Ising model. Further, we illustrate its power on a paradigmatic example of strong correlation (Cr2 in the SVP basis set), and show that it is possible to reach chemical accuracy with as few as ~50 timesteps.

Klymko, Katherine↗
DOE OSTI2021

Computing Free Energies with Fluctuation Relations on Quantum Computers

One of the most promising applications for quantum computers is the dynamic simulation of quantum materials. Current hardware, however, sets stringent limitations on how long such simulations can run before decoherence begins to corrupt results. The Jarzynski equality, a fluctuation theorem that allows for the computation of equilibrium free energy differences from an ensemble of short, non-equilibrium dynamics simulations, can make use of such short-time simulations on quantum computers. Here, we present a quantum algorithm based on the Jarzynski equality for computing free energies of quantum materials. We demonstrate our algorithm using the transverse field Ising model on both a quantum simulator and real quantum hardware. As the free energy is a central thermodynamic property that allows one to compute virtually any equilibrium property of a physical system, the ability to perform this algorithm for larger quantum systems in the future has implications for a wide range of applications including the construction of phase diagrams, prediction of transport properties and reaction constants, and computer-aided drug design.

Bassman, Lindsay↗
DOE OSTI2021

Leveraging Randomized Compiling for the QITE Algorithm

The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error correction. One outstanding issue is that of coherent errors arising from the increased complexity of these devices. These errors can accumulate through a circuit, making their impact on algorithms hard to predict and mitigate. Iterative algorithms like Quantum Imaginary Time Evolution are susceptible to these errors. This article presents the combination of both noise tailoring using Randomized Compiling and error mitigation with a purification. We also show that Cycle Benchmarking gives an estimate of the reliability of the purification. We apply this method to the Quantum Imaginary Time Evolution of a Transverse Field Ising Model and report an energy estimation and a ground state infidelity both below 1\%. Our methodology is general and can be used for other algorithms and platforms. We show how combining noise tailoring and error mitigation will push forward the performance of NISQ devices.

Ville, Jean-Loup↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2025

Time correlations from steady-state expectation values

Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis requires solving the system evolution. Here, we use recent results of quantum metrology with continuous measurements to derive general lower bounds on the relaxation and second-order correlation times that are both easy to calculate and measure. These bounds are based solely on steady-state expectation values and their derivatives with respect to a control parameter, and can be readily extended to the autocorrelation of arbitrary observables. We validate our method on two examples of critical quantum systems: a critical driven-dissipative resonator, where the bound matches analytical results for the dynamics, and the infinite-range Ising model, where only the steady state is solvable and thus the bound provides information beyond the reach of existing analytical approaches. Our results can be applied to experimentally characterize ultrafast systems, and to theoretically analyze many-body models with dynamics that are analytically or numerically hard.

Górecki, Wojciech [INFN, Pavia]↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2025

Time correlations from steady-state expectation values

Recovering properties of correlation functions is typically challenging. On one hand, experimentally, it requires measurements with a temporal resolution finer than the system's dynamics. On the other hand, analytical or numerical analysis requires solving the system evolution. Here, we use recent results of quantum metrology with continuous measurements to derive general lower bounds on the relaxation and second-order correlation times that are both easy to calculate and measure. These bounds are based solely on steady-state expectation values and their derivatives with respect to a control parameter, and can be readily extended to the autocorrelation of arbitrary observables. We validate our method on two examples of critical quantum systems: a critical driven-dissipative resonator, where the bound matches analytical results for the dynamics, and the infinite-range Ising model, where only the steady state is solvable and thus the bound provides information beyond the reach of existing analytical approaches. Our results can be applied to experimentally characterize ultrafast systems, and to theoretically analyze many-body models with dynamics that are analytically or numerically hard.

Górecki, Wojciech [INFN, Pavia]↗
DOE OSTI2026

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗
DOE OSTI2026

QCalEval: Benchmarking Vision-Language Models for Quantum Calibration Plot Understanding

Quantum computing calibration depends on interpreting experimental data, and calibration plots provide the most universal human-readable representation for this task, yet no systematic evaluation exists of how well vision-language models (VLMs) interpret them. We introduce QCalEval, the first VLM benchmark for quantum calibration plots: 243 samples across 87 scenario types from 22 experiment families, spanning superconducting qubits and neutral atoms, evaluated on six question types in both zero-shot and in-context learning settings. The best general-purpose zero-shot model reaches a mean score of 72.3, and many open-weight models degrade under multi-image in-context learning, whereas frontier closed models improve substantially. A supervised fine-tuning ablation at the 9-billion-parameter scale shows that SFT improves zero-shot performance but cannot close the multimodal in-context learning gap. As a reference case study, we release NVIDIA Ising Calibration 1, an open-weight model based on Qwen3.5-35B-A3B that reaches 74.7 zero-shot average score.

Cao, Shuxiang↗
DOE OSTI2025

Floating photovoltaic power plants: A review of energy yield, reliability, and operation and maintenance

Photovoltaic (PV) systems are essential for the transition to sustainable energy, reducing fossil fuel dependence and mitigating climate change. Although PV requires minimal land area — PV can meet the European Union's energy needs using only 0.26% of its land — space for deployment is often scarce in densely populated regions. Floating photovoltaics (FPV) offer an effective solution to land-use challenges by installing PV systems on floating structures in water bodies. FPV is a growing niche within PV with a cumulative installed capacity reaching 7.7 GW globally by 2023. Almost 90% of the installed FPV capacity is in Asia, with close to 50% of in China alone, while the Netherlands and France are the largest markets outside Asia. FPV shows strong potential to support climate targets, but still faces challenges like regulatory barriers, cost competitiveness compared to ground-based PV (GPV), and uncertainties about environmental impacts and system reliability. FPV systems are currently installed mainly on sheltered inland waters, such as quarry lakes, irrigation ponds and reservoirs. FPV technical standards are still being developed. Guidelines have been published by the World Bank, DNV, and Solar Power Europe, and emerging national standards from South Korea, China, and Singapore address design, components, and safety. The International Electrotechnical Commission (IEC) is working on formal standards for floats, mooring systems, and electrical connectors. However, the published best practices lack quantitative guidance for yield modelling and reliability, which this report aims to address. It provides data-driven insights, models, and parameters essential for accurate energy yield, reliability, and maintenance predictions over FPV systems' lifetimes.

14 SOLAR ENERGY↗