SEARCH · Engineering Papers

Results for “quantum annealing”

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 55 records · Page 3

All sources NASA NTRS DOE OSTI

DOE OSTI2025

Programmable exploration of magnetic states in Lieb-kagome interpolated lattices

We investigate a hybrid modeling framework in which a quantum annealer is used to simulate magnetic interactions in molecular qubit lattices inspired by experimentally realizable systems. Using phthalocyanine assemblies as a structurally constrained prototype, we model a continuous deformation from a Lieb to a kagome lattice, revealing frustration-driven disorder and magnetic field-induced reordering in the spin structure. Here, the goal is to show how a quantum annealer can operate as a physically instantiated, programmable platform to emulate experimentally relevant lattice deformations and produce observables in a manner analogous to an experimental measurement, enabling the characterization of magnetic arrangements beyond the reach of current molecular architectures. This surrogate modeling approach offers a pathway to explore and iteratively design tunable magnetic states in synthetic materials. The synthetic design, structural characterization, and quantum simulation framework established here defines a modular and scalable paradigm for probing the limits of engineered matter across chemistry, condensed matter, and quantum information science.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

NASA NTRS2019

Quantum Technologies for UAS (QTech)

Recent advances in small Unmanned Aerial System (sUAS) technologies lower the barriers for use by both private and commercial entities. However, these advances are also likely to lead to greater vehicle densities, a more heterogenous mix of vehicles and equipment and greater levels of vehicle autonomy, which can increase the chance for communications disruptions. For the safe and secure operation of these vehicles, it is essential to have a robust communications network. This work is focused on harnessing the power of quantum technologies to enable this robust communications network by: (1) utilizing quantum optimization algorithms to design robust network with routing redundancy that can respond adaptively to dynamically changing real-time environment and disruptions, (2) utilize quantum optimization algorithms resource allocation for detection, localization, and tracking of mobile communication disruption agents and (3) utilize quantum key distribution (QKD) to execute secure key sharing in anti-jamming protocols for secure radio frequency (RF) communication. Efforts to map these quantum optimization algorithms to commercially available quantum annealers and soon to be available general-purpose gate-model quantum hardware architectures will be reviewed, and plans for testing the solutions to these algorithms through indoor sUAS flight tests will be discussed. Lastly, efforts to miniaturize and practically deploy Quantum Key Distribution (QKD) hardware, which could ultimately be used to securely exchange encryption keys, in sUAS networks will be reviewed.

Quantum Computing↗

NASA NTRS2017

QSPIN: A High Level Java API for Quantum Computing Experimentation

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

Quantu↗

NASA NTRS2017

Quantum Approximate Optimization with Hard and Soft Constraints

Challenging computational problems arising in the practical world are frequently tackled by heuristic algorithms. Small universal quantum computers will emerge in the next year or two, enabling a substantial broadening of the types of quantum heuristics that can be investigated beyond quantum annealing. The immediate question is What experiments should we prioritize that will give us insight into quantum heuristics? One leading candidate is the quantum approximate optimization algorithm (QAOA) metaheuristic. Here, we provide a framework for designing QAOA circuits for a variety of combinatorial optimization problems with both hard constraints that must be met and soft constraints whose violation we wish to minimize. We work through a number of examples, and discuss design principles and implementation considerations.

Hadfield, Stuart↗

NASA NTRS2018

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗

NASA NTRSDate not supplied

Introduction to Quantum Computing

Quantum computing offers the potential to revolutionize high-performance computing by providing a means to solve certain computational problems asymptotically faster than any classical computer. Quantum computing has advanced recently from merely a theoretical possibility to engineered reality, including commercial entities offering early prototype quantum processors, both special-purpose quantum annealers and general-purpose gate-model processors. The media have been showcasing each new development and implicitly conveying the message that quantum-computing ubiquity is nigh. Here, we will respond to this hype and provide an overview of the exciting but still early state of the field. In this tutorial, we introduce participants to the computational models that give quantum computing its immense computational power. We examine the thought processes that programmers need to map problems to quantum computers. And we discuss hardware and algorithmic challenges that must be overcome before quantum computing becomes a component of every software developer's repertoire.

Quantum computing↗

NASA NTRSDate not supplied

Introduction to Quantum Computing

Quantum computing↗

NASA NTRS2008

In Situ Irradiation and Measurement of Triple Junction Solar Cells at Low Intensity, Low Temperature (LILT) Conditions

The performance of triple junction InGaP/(In)GaAs/Ge space solar cells was studied following high energy electron irradiation at low temperature. Cell characterization was carried out in situ at the irradiation temperature while using low intensity illumination, and, as such, these conditions reflect those found for deep space, solar powered missions that are far from the sun. Cell characterization consisted of I-V measurements and quantum efficiency measurements. The low temperature irradiations caused substantial degradation that differs in some ways from that seen after room temperature irradiations. The short circuit current degrades more at low temperature while the open circuit voltage degrades more at room temperature. A room temperature anneal after the low temperature irradiation produced a substantial recovery in the degradation. Following irradiation at both temperatures and an extended room temperature anneal, quantum efficiency measurement suggests that the bulk of the remaining damage is in the (In)GaAs sub-cell

Quantum Efficiency↗

NASA NTRSDate not supplied

Simulating a Low-Weight Encoding of the Fermi-Hubbard Model Feedback and Support with QAOA

Recent work [1] has proposed a compact fermion-to-qubit mapping for the Fermi-Hubbard model (FHM), potentially lowering the overhead needed to simulate such a system on quantum hardware. In prior work [2], we numerically investigated how well a quantum annealer could prepare ground states of the FHM encoded using the resource-efficient mapping. In order to compare these results to gate-model systems, we turn to a QAOA-style approach and replace the annealing schedule with both Trotterizations thereof and also more general Hamiltonian-variational ansatze based on the terms of the mapped FH Hamiltonian. We investigate the achievable ground state fidelities of these gate sequences, consider various optimizations of the ansatze structure, and offer resource estimations of the optimized QAOA protocols for near-term hardware.

quantum computing↗

DOE OSTI2025

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Magnetic devil's staircaselike behavior in quasiperiodic qubit lattices

The devil's staircase (DS) phenomenon is a fractal response of magnetization to external fields, traditionally observed in periodic ferromagnetic systems, where the commensurability between spin arrangements, lattice parameters, and external magnetic fields governs abrupt changes in magnetization. Its occurrence in aperiodic, fractal-type systems has remained largely unexplored, despite their natural compatibility with such phenomena. Using a quantum annealing device, we uncover a wealth of abrupt magnetic transitions between spin manifolds driven by increasing external magnetic fields within a simple yet effective Ising-model framework. In contrast to periodic systems, where DS arises from long-range competing interactions, our findings reveal that short-range, purely antiferromagnetic couplings in aperiodic geometries produce equally rich ground-state magnetization patterns. Here, we demonstrate that while magnetic textures are determined by the lattice size, their formation remains remarkably robust and independent of scale, with commensurability emerging locally. Our results challenge the prevailing view that DS behavior is limited to periodic systems and establish quasiperiodic geometries as a natural host for this phenomenon.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2026

A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design

We present a benchmarking study of active learning (AL) schemes for designing planar multilayer nanophotonic metamaterials, where the design tasks are formulated as binary optimization problems. Different surrogate models, including factorization machine (FM), Gaussian process regression (GPR), and convolutional neural network (CNN), combined with different optimization methods, including exhaustive enumeration, discrete particle swarm optimization (DPSO), quantum annealing (QA), hybrid QA, and simulated annealing are studied. The benchmark cases investigated range from small problems with short binary lengths (N = 25) to large problems with N up to 100, focusing on the design of two classes of photonic structures, including antireflective coatings for the long-wavelength infrared region and transparent radiative coolers. For small problems, CNN coupled with DPSO in AL achieves the best performance. As N increases, FM with QA outperforms GPR and CNN. For FM-based AL, hybrid QA yields the best optimization results, particularly in high-dimensional cases (N = 100). These results demonstrate that the optimization method can significantly affect in AL performance as N increases, and that QA-based optimization can provide practical routes for mitigating the optimization bottleneck in high-dimensional problems.

Jung, Serang [Kyung Hee University, Korea]↗

DOE OSTI2024

Quantum/AI Topology-Aware Latency-Adaptive HPC Workflow Scheduling Optimization

The growing demand for more powerful high-performance computing (HPC) systems has led to a steady rise in energy consumption by supercomputing worldwide. This study is focused on comparing our Application-Topology Mapper (ATMapper) to the popular Simple Linux Utility for Resource Management (SLURM) for the purpose of exploring methods that can further optimize job-scheduling within HPC systems. ATMapper is an Artificial-Intelligence based approach to job-scheduling that is currently being enhanced with quantum annealing (QA) to generate optimal schedules faster. We are applying QA to speedup our ATMapper process to achieve higher computing efficiency, thereby reducing HPC energy consumption. Here, we examine how four job-scheduling approaches perform in processor node assignment when using an example network architecture of 4 interconnected nodes. Using a specialized script, we are assessing the schedule of a computation flow with 11 interdependent tasks. The data movements among nodes were tracked to count for the number of interactions (network hops) between nodes needed to complete the tasks. The total number of hops and the job completion time were then used to quantify the efficiency of the different mapping approaches. In addition to SLURM, we also compare our ATMapper to the QA-enabled LBNL TIGER and the D-Wave Distributed Computing processor assignment approaches. The preliminary results showed that our topology-aware, latency-adaptive ATMapper is significantly more efficient when compared to the other scheduling approaches due to its load-imbalance network allocation. The scheduler displayed a computing efficiency of 53% by performing significantly fewer network hops than its alternatives. By reducing the number of hops, ATMapper was able to perform all 11 tasks by using only 3 nodes out of given 4. This research indicates the potential to use QA/AI for HPC job-scheduling. Later, we will test a SLURM simulator program to draw further comparisons on the effectiveness of ATMapper's scheduling approach. The results of this comparison will serve as a baseline for later improving SLURM's performance using a QA-enhanced ATMapper approach.

Caraveo, Braulio [University of Huston - Clear Lak↗

DOE OSTI2025

Non-Equilibrium Effects in Quantum Magnets

While most often the state of a material will tend toward an equilibrium determined by its environment, there are many cases of scientific and technological interest where materials are manipulated to be or are found in non-equilibrium configurations. For example, data can be stored in hard drives by deliberately altering the magnetic orientation in a material to store information in non-equilibrium pattern. In this project, the main goals were studies of non-equilibrium properties of quantum magnets using neutron scattering as the primary experimental method. Neutron scattering allows characterization of magnetic correlation lengths sensitive to the presence of defects. It can also be used to distinguish equilibrium from non-equilibrium states via energy transfer rates. Typical bulk state magnetization relaxation times are too short to perform many neutron scattering measurements of interest. To enable the study of non-equilibrium conditions, materials with longer magnetic relaxation times were targeted. CoNb 2 O 6 was used in two experiments related to non-equilibrium physics. In the first, evidence for defects created via the Kibble-Zurek mechanism (KZM) was sought by quenching across a magnetic field-dependent phase transition. Somewhat unexpectedly, clear evidence for KZM-induced defects was absent. Additional measurements of CoNb 2 O 6 were made to better characterize its crystal field and other properties to provide a better theoretical understanding to enable more effective non-equilibrium physics measurements. In another project, LiHo 0.45 Y 0.55 F 4 was used to compare a quantum annealing protocol to a thermal annealing one since magnetic fields can be used to control the thermal fluctuations in LiHo 0.45 Y 0.55 F 4 . In addition, a new pulsed magnet power supply and new techniques were developed suitable for neutron scattering experimental environments to enable faster magnetic field changes for producing non-equilibrium conditions. The power supply developed for this project has wider technological applications in addition to faster magnetic field ramps.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

NASA NTRS2019

Overview of NASA QuAIL Team Research

NASA is constantly confronting massively challenging computational problems. These problems have the potential to limit mission scope and aim. NASA's Quantum Artificial Intelligence Laboratory (QuAIL) Group was formed to determine the potential for quantum computation to enable more ambitious NASA missions in the future. This presentation highlights recent work by the QuAIL team that is focused on physics insights and applications associated with the D-Wave 2000Q quantum annealing hardware that is located at NASA Ames Research Center.

Shon Grabbe↗

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 NTRS2016

Applying Simulated Annealing to Problems in Model-Based Diagnosis

Generating all diagnoses is computationally intractable. Therefore, many of the state-of-the-art approaches are incomplete. Quantum computers may however offer a solution. The first commercially available quantum computer is being used to minimize polynomials that are difficult for classical simulated annealing but easy for quantum annealing. All problems in Model-based Diagnosis (MBD) can be transformed into a polynomial minimization problem, allowing one to apply a quantum algorithm called quantum annealing to solve MBD problems. To better understand the need for this quantum approach, we designed two simulated annealingdiagnostic algorithms tailored to run on a polynomial representation of MBD. These algorithms differ on their policy for random neighborhood variable selection. In addition, enhanced metrics were devised to provide more diagnostic coverage. Finally, these two simulated annealing algorithms were analyzed and empirically evaluated and compared against state-of-the-art probabilistic methods for MBD such as SAFARI using ISCAS-85.

Simulated annealing↗

DOE OSTI2025

Ancilla-entangling Floquet kicks for accelerating quantum algorithms

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, in this study, we accelerate quantum simulation using digital multiqubit gates that entangle primary system qubits with ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system registry. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.

97 MATHEMATICS AND COMPUTING↗