Search NASA⌕ Search

SEARCH · Search NASA

Results for “anneal schedule”

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.

8 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Trajectory-independent speed limits for controlled open quantum systems

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting [L. P. García-Pintos et al ., SciPost Phys. 18 , 159 (2025)]. In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high-temperature limit.

open quantum systems & decoherence↗
DOE OSTI2023

Lower Bounds on Quantum Annealing Times

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Herein, our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Tunable and Robust Optical and Structural Properties of a Cooperative Squaraine-Dye Aggregate-DNA DX-DAE Tile System

Molecular excitons, which are excitations delocalized over multiple dyes in a wavelike manner, are of interest for a wide range of applications, including quantum information science. Numerous studies have templated a variety of synthetic dyes via a DNA scaffold to induce dye aggregation to create molecular excitons upon photoexcitation. Dye aggregate optical properties are critically dependent on relative dye geometry and local environment; therefore, an understanding of dye-dye and DNA-dye interactions is critical for advancing toward more complex DNA-dye systems. The extensively studied DNA Holliday junction (HJ) and less-studied double-crossover (DX) tile motif are fundamental test beds for designing complex and ultimately modular DNA-dye architectures. Here, we report the first study of single-linked squaraine dye aggregation and exciton delocalization on a larger and more stable (compared with the HJ) DX tile motif. We first highlight a few DNA-dye constructs that support single dyes and aggregates with distinct optical properties that are both tunable—through sample design, buffer conditions, and heat treatment—and robust to environment changes, including transfer to solid phase. Next, we assess several experimental and design considerations that demonstrate directed dye-driven assembly of a novel double-tile DNA configuration. Our results demonstrate that single-linked squaraine dyes templated to DX tiles provide a viable research path to design and evaluate dye aggregate networks that support exciton delocalization. We include herein the first report of exciton delocalization in the solid phase in a DNA-dye construct. Additionally, our findings indicate that dye aggregation impacts the assembly of the DNA-dye construct, and, in some cases, thereby cooperates with the DNA to determine a final robust system configuration. Finally, we show that a controlled annealing schedule can be employed to promote the homogeneous assembly of DNA-dye constructs. The findings in this study contribute to the understanding of DNA-dye systems and the relevant factors involved in their directed assembly to achieve specific constructs with desirable properties.

36 MATERIALS SCIENCE↗
DOE OSTI2023

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2026

CHARACTERIZING AND CONTROLLING RECOVERY AND RECRYSTALLIZATION IN NIOBIUM FOR IMPROVED SRF CAVITY PERFORMANCE

Crystal defects, such as dislocations and low-angle boundaries, provide sources of magnetic flux trapping in the Nb materials used for superconducting radio frequency (SRF) resonating cavities. Improving the performance of SRF cavities, as measured through the quality factor, requires reducing these defects. SRF cavity production involves deformation processing, such as rolling and forming, and strategic annealing heat treatments. The resulting microstructures can be recovered, recrystallized, or both. Because recovery leaves many defects that can trap flux, recrystallization should improve cavity performance. Thus, processing schedules that produce complete recrystallization without excessive grain growth need to be designed. Solutions to this problem require understanding physical metallurgy and differentiating between recovered and recrystallized regions of microstructure. Backscattered electron microscopy techniques are applied to this end. We demonstrate that the conditions required to produce fully recrystallized microstructures depend on Nb impurity content, suggesting that processing schedules may need to be adjusted by material heat or lot. We also demonstrate that processing can be used to control growth of recrystallized grains to maintain mechanical strength in fully recrystallized materials. Forming cavities from cold-rolled Nb sheet material may provide strategic new routes to obtain microstructures that improve SRF cavity performance.

Taleff, E. [The University of Texas at Austin]↗