SEARCH · Search NASA

Results for “Algorithm”

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 505 records · Page 28

All sources NASA NTRS DOE OSTI

DOE OSTI2026

EASY-SHIFT v Alpha

The software is a generic, price- and load-responsive control algorithm integrating heat pumps with thermal energy storage. The algorithm leverages simple models of the system and easily accessible data to schedule operation of heat pumps and thermal energy storage in ways that minimize the cost of operating the heating/cooling system. This tool is specifically designed to be easy to interact with, and something that industry partners are able to adopt. There are two current state of the art approaches. Industry tends to develop very simple algorithms, with predetermined schedules that are not capable of changing operation in response to changes in operating environment. For example, a control designed to avoid high-price electricity from 5-8 PM will not be able to adapt if the high-price period changes to 4-9 PM. Academia commonly develops algorithms called Model predictive control (MPC). MPC requires extensive data and highly trained staff to develop a specific type of simulation model of the building, connect the building to optimization algorithms, and leverage powerful computers. Industry, with limited time/finance budgets for any project, is resistant to adopting MPC due to the associated high complexity and cost.

Grant, Peter [Lawrence Berkeley National Laborator↗

DOE OSTI2025

solposx: A Python package for determining solar position and atmospheric refraction

solposx is a Python package of reference algorithms for calculating the sun’s position and atmospheric refraction. The package includes 11 solar position algorithms and 6 refraction models from the past 50 years. All functions follow a standardized design pattern, making it easy to compare different algorithms. The provided algorithm implementations have been thoroughly vetted, making the package a valuable research tool and a reliable reference for implementing solar position algorithms in other programming languages or applications.

Jensen, Adam R. [Technical University of Denmark, ↗

DOE OSTI2024

Machine-Learning-Based Mapping and Modeling of Solar Energy with Ultra-High Spatiotemporal Granularity

Despite the rapid growth of solar energy, we still lack a dynamic, high-fidelity database that tracks the spatiotemporal variations of solar PVs and their associated infrastructures across different places at a spatially resolved scale. The absence of such data presents a barrier to various applications such as solar PV growth projection, solar energy integration, solar incentive design, and climate risk assessment. In this project, we aim to bridge this gap by developing AI-based algorithms to extract granular information about solar PV installations and their associated infrastructures (i.e., distribution grids) from widely available unstructured data like remote sensing images and street views. As a result, we have built the Solar Energy Atlas, a fine-grained, large-scale geospatial overlay of distributed solar PVs and distribution grids. On top of it, we have advanced the understanding of solar adoption and distribution grid vulnerability to climate-induced extremes. Our major contributions can be summarized as follow: (1) By developing new AI algorithms, we have built the most comprehensive solar PV spatiotemporal database covering the entire US. This is the first time we obtained the exact GPS locations, size, subtype, and installation year information for rooftop solar PVs across the US. This database can be used for solar PV growth projection, solar energy integration, solar energy policy analysis and design, and spatially-resolved climate risk assessment. (2) Leveraging this database, we have uncovered the socioeconomic driving factors that are correlated with earlier onset of solar adoption and higher saturated adoption levels. We have identified the heterogeneity in the effects of different types of financial incentives on solar adoption and provided implications for tailoring incentive design based on local income levels to promote equitable solar adoption. (3) We have developed a distribution grid GIS mapping algorithm which can obtain granular geospatial and topology information about distribution grids using multi-modal open data, reducing the dependency on hard-to-obtain smart meter data of conventional approaches. It shows effectiveness in both the U.S. and Sub-Saharan Africa. Using this algorithm, we have uncovered the non-uniform vulnerability of distribution grids to wildfires in California in the aspects of undergrounding protection and Distributed Energy Resources (DER) preparedness. This has provided important implications for improving the affordability and equity of grid adaptation approaches. (3) We have made our produced database publicly available and provided user-friendly interface to enable various stakeholders and the general public to interact with the data. We have also integrated the produced data into the Data Commons platform to enable the public to access the data and correlate it with other location-specific characteristics simply using natural language as queries. The impact of our project is three-fold: (1) New algorithms for mapping solar PVs and distribution grids across space and time, which are open source to facilitate researchers and industry; (2) New databases of solar PVs and distribution grids that have been made publicly available for engineering, social, and policy applications; (3) New understandings and actionable insights on the potential approaches to promoting solar adoption and reducing energy infrastructure vulnerabilities. In this report, we start by discussing the project background and motivation (section 5), followed by the overview of project objectives (section 6). Results and discussion for each task are presented in section 7. Significant accomplishments are summarized in section 8. This report will be concluded by discussing the paths forwards (section 9), products (section 10), and team roles (section 11).

14 SOLAR ENERGY↗

DOE OSTI2024

Addressing Issues with Working Memory in Video Object Segmentation

Contemporary state-of-the-art video object segmentation (VOS) models compare incoming unannotated images to a history of image-mask relations via affinity or cross-attention to predict object masks. We refer to the internal memory state of the initial image-mask pair and past image-masks as a working memory buffer. While the current state of the art models perform very well on clean video data, their reliance on a working memory of previous frames leaves room for error. Affinity-based algorithms include the inductive bias that there is temporal continuity between consecutive frames. To account for inconsistent camera views of the desired object, working memory models need an algorithmic modification that regulates the memory updates and avoid writing irrelevant frames into working memory. A simple algorithmic change is proposed that can be applied to any existing working memory-based VOS model to improve performance on inconsistent views, such as sudden camera cuts, frame interjections, and extreme context changes. The resulting model performances show significant improvement on video data with these frame interjections over the same model without the algorithmic addition. Our contribution is a simple decision function that determines whether working memory should be updated based on the detection of sudden, extreme changes and the assumption that the object is no longer in frame. By implementing algorithmic changes, such as this, we can increase the real-world applicability of current VOS models.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Developing ML/AI Methods for High-Throughput Characterization of Multiple-Sensor Streams of Tokamak Dynamics for High-Speed Control (Final Report)

This project evaluated and developed new mathematical and algorithmic techniques capable of handling (in real-time) the growing amounts of data generated by modern fusion research. While existing numerical linear algebra (NLA) methods provide the backbone to classical data analysis and algorithms, these methods fundamentally do not port to distributed architectures nor do they allow low-latency data reduction for control. Motivated by the needs for modern fusion reactors, this project explored and implemented new numerical methods to characterize plasma dynamics, respond in real-time to discharge evolution, and to process massive-scale data accurately and rapidly more fully. This project links expertise in multiple-sensor diagnostics of tokamak plasma dynamics from Columbia University’s Plasma Physics Laboratory with expertise in massive-scale data reduction and extreme data control algorithms at Columbia University’s Data Science Institute. This interdisciplinary project (i) applied machine learning methods, (ii) implemented a properly-trained neural-network for very fast processing of high-speed plasma videography, and (ii) developed the applied mathematical methods, based on randomized-NLA (rNLA) routines, for data analysis, reduction, and real-time control. The Columbia University High Beta Tokamak-Extended Pulse (HBT-EP) facility provided data to test new algorithms and partnership with Columbia University's Data Sciences Institute evaluated the broader use of new algorithms for many challenging control applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2025

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2025

A Model Predictive Control to Improve Grid Resilience

The following article details a model predictive control (MPC) to improve grid resilience when faced with variable generation resources. This topic is of significant interest to utility power systems where distributed intermittent energy sources will increase significantly and be relied on for electric grid ancillary services. Previous work on MPCs has focused on narrowly targeted control applications such as improving electric vehicle (EV) charging infrastructure or reducing the cost of integrating Energy Storage Systems (ESSs) into the grid. In contrast, this article develops a comprehensive treatment of the construction of an MPC tailored to electric grids and then applies it integration of intermittent energy resources. To accomplish this, the following article includes a description of a reduced order model (ROM) of an electric power grid based on a circuit model, an optimization formulation that describes the MPC, a collocation method for solving linear time-dependent differential algebraic equations (DAEs) that result from the ROM, and an overall strategy for iteratively refining the behavior of the MPC. Next, the algorithm is validated using two separate numerical experiments. First, the algorithm is compared to an existing MPC code and the results are verified by a numerically precise simulation. It is shown that this algorithm produces a control comparable to existing algorithms and the behavior of the control carefully respects the bounds specified. Second, the MPC is applied to a small nine bus system that contains a mix of turbine-spinning-machine-based and intermittent generation in order to demonstrate the algorithm’s utility for resource planning and control of intermittent resources. This study demonstrates how the MPC can be tuned to change the behavior of the control, which can then assist with the integration of intermittent resources into the grid. The emphasis throughout the paper is to provide systematic treatment of the topic and produce a novel nonlinear control compatible design framework applicable to electric grids and the control of variable resources. This differs from the more targeted application-based focus in most presentations.

microgrid↗

DOE OSTI2026

Cold Climate Field Study of the Effect of Defrost Controls on the Integrated Performance of a Ductless Air-Source Heat Pump

Residential heat pumps have advanced over the past decade to allow for operation at colder temperatures. However, the challenges of frost accumulation and defrosting the outdoor coil remain. The goal of this study was to evaluate the impact of the control algorithms that determine when a heat pump needs to defrost and when the base pan heater runs on the overall heating efficiency of the heat pump. In this study, which occurred during the 2023–2024 heating season, we measured the performance of a ductless air-source heat pump installed in Fairbanks, Alaska, USA. The heat pump was instrumented to measure the electrical input and the thermal output, as well as selected internal variables and indoor and outdoor environmental conditions. The heat pump was first operated with factory default control algorithms associated with the initiation of defrost and control of the base pan heater. These factory default algorithms focused on aggressively defrosting the outdoor coil and keeping the base pan ice-free. In the middle of the winter, these algorithms were changed to focus on reducing defrost cycles and increasing efficiency, while the heat pump continued to be operated and monitored. The results showed that significant increases in efficiency are possible by improving the defrost and base pan heater control algorithms.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2025

An Integral-based Technique to Accelerate the Monte Carlo Radiative Transfer Computation for Supernovae

We present an integral-based technique (IBT) algorithm to accelerate supernova (SN) radiative transfer calculations. The algorithm utilizes “integral packets,” which are calculated by the path integral of the Monte Carlo (MC) energy packets, to synthesize the observed spectropolarimetric signal at a given viewing direction in a 3D time-dependent radiative transfer program. Compared to the event-based technique (EBT) proposed by M. Bulla et al., our algorithm significantly reduces the computation time and increases the MC signal-to-noise ratio (S/N). Using a 1D spherical symmetric Type Ia SN ejecta model DDC10 and its derived 3D model, the IBT algorithm has successfully passed the verification of spherical symmetry and cross comparison on a 3D SN model with the direct-counting technique and EBT. Notably, with our algorithm implemented in the 3D MC radiative transfer code SEDONA, the computation time is faster than EBT by a factor of 10−30, and the S/N is better by a factor of 1.5−3, with the same number of MC quanta.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Toward Higher-order Accuracy in Self-gravitating Hydrodynamics

High-order algorithms have emerged in numerical astrophysics as a promising avenue to reduce truncation error (proportional to a power of the linear resolution Δ x ) with only a moderate increase to computational expense. Significant effort has been placed in the development of finite-volume algorithms for (magneto)hydrodynamics; however, state-of-the-art astrophysical simulations tightly couple a plenitude of physics, additionally including gravity, photon transport, cosmic-ray transport, chemistry, and/or diffusion, to name a few. Algorithms frequently operator-split this additional physics (often a first-order error in time) and/or adopt a model wherein their evaluation is limited to second-order accuracy in space. In this work, we present a fourth-order-accurate finite-volume scheme for self-gravitating hydrodynamics on a uniform Cartesian grid. The method supplies source terms for the gravitational acceleration ( ρ g ) and gravitational energy release ( ρ v · g ) associated with fourth-order-accurate solutions to the Poisson equation. Our scheme (1) guarantees the conservation of total linear momentum while (2) decreasing (in proportion to Δ x 4 ) the effects of spurious heating and/or cooling associated with truncation error in the gravity. We demonstrate expected convergence rates for the algorithm by measuring errors in test problems evolving self-gravity modified linear waves and 3D polytropic equilibria. We test robustness of the algorithm by integrating an induced “inside-out” adiabatic collapse. We also discuss a method to smoothly downgrade the solution to second-order spatial accuracy to avoid spurious overshoots near steep density and/or pressure gradients.

79 ASTRONOMY AND ASTROPHYSICS↗

DOE OSTI2025

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗

DOE OSTI2025

Virtual Refrigerant Charge Sensing Method for Next-Generation Refrigerant in Residential Heat Pumps

The charge level of refrigerant in heat pump systems significantly affects their operational performance. Virtual refrigerant charge (VRC) sensing technology has been well-established for traditional refrigerants (HFCs and HCFCs) for its low cost compared to physical sensors. However, other than traditional refrigerants, HFOs are increasingly used in next-generation heat pumps; whether these conventional VRC sensing methods remain applicable for heat pump systems utilizing next-generation refrigerants requires further investigation. To address these issues, this study develops a low-cost VRC sensing method for next-generation refrigerant heat pumps used in residential buildings. The developed algorithm is evaluated by using simulation models to evaluate the accuracy, considering an R454B heat pump with a nominal heating capacity of 51K Btu/hr (14.95 kW) as an example, and compared with those of the two reference VRC sensing algorithms. Though the developed VRC sensing algorithm and the two reference methods can accurately predict the charge level for the R454B heat pump system (with mean absolute percentage error for various cooling and heating conditions less than 7%), the developed VRC sensing algorithm uses fewer sensors and improves the overall accuracy for heating conditions by 7.1%, and the accuracy for undercharge cooling conditions 14.2%, compared with a mainstream algorithm. This technology will complement physical leakage detectors, and promote the adoption of next-generation heat pump systems, along with reducing wasted energy and maintenance costs.

Liang, Chenjiyu↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

The simulation of fluid flows is an essential part of the design and analysis of nuclear systems. Algorithms able to simulate flows at different fidelity levels are available in the Multiphysics Object-Oriented Simulation Environment (MOOSE) and MOOSE-based applications such as Pronghorn \cite{novak2018pronghorn}, Pronghorn-Subchannel, RELAP-7, and SAM. Currently, significant effort is being invested in the development of coarse-mesh Computational Fluid Dynamics (CFD) capabilities within MOOSE and Pronghorn for the simulation of Generation IV nuclear reactors. Traditionally, the solution algorithms in MOOSE have relied on Newton or quasi-Newton methods (such as the preconditioned Jacobian-free Newton-Krylov method) where residuals and Jacobians (or approximations thereof) are constructed. Both Newton and quasi-Newton methods require the solution of a linear system at each nonlinear Newton iteration with the Jacobian as the system matrix. The Jacobian contains blocks originating from all variables in the problem (i.e., for thermal-hydraulics at least pressure, velocities, and temperature). Due to the formulation of the problem in a general multiphysics setting on unstructured mesh, creating a good preconditioner for the linear system can be challenging, thus many fluid applications have utilized direct solver-based methods such as LU factorization. However, with increasing system size and complexity in multi-dimensional problems, the direct solution of linear systems becomes computationally expensive both in execution time and and memory. For this reason, recent effort has focused on adapting segregated solution algorithms for CFD problems in MOOSE. These algorithms use fixed-point iteration between segregated systems whose assembly and preconditioning are easier those of the monolithic system. Initial results show that the segregated solution algorithm outperforms the monolithic approach in terms of memory usage and for large 3D problems in terms of CPU time as well.

42 ENGINEERING↗

DOE OSTI2024

NUMERICAL MODELING OF A SOLID OXIDE FUEL CELL FOR USE IN REAL-TIME SIMULATION AND CYBER-PHYSICAL SYSTEMS

Cyber-physical systems provide a mechanism with which to investigate the physical phenomena and behavior of traditionally cost-prohibitive or otherwise fragile equipment. For the National Energy Technology Laboratory (NETL), this approach resulted in the Hybrid Performance (Hyper) facility which features a gas turbine-SOFC hybrid cycle utilizing real turbomachinery and a simulated SOFC stack. This allows for the investigation of combined cycle performance and control strategies, in an exhaustive manner, both without fear of destroying delicate state-of-the-art fuel cells, and with the full accuracy of real-world turbomachinery. Issues arose between the transient response of the SOFC model being limited to a sample time of 80 milliseconds, due to the calculation time of the SOFC model taking on average 40 milliseconds to calculate for a given timestep with spikes in calculation time reaching the 80 millisecond threshold. In order to be able to match the speed of transients from the turbomachinery and likewise better discern transient behavior, it was determined that the SOFC model must be optimized to operate at a sample time of 5 milliseconds. Therefore, it is necessary to optimize the SOFC model in order to decrease the calculation time from around 40 milliseconds, down to at the most 5 milliseconds. To do this, both the electrochemical algorithm and the thermal algorithm used to simulate the physical behavior of the SOFC are investigated to determine where improvements can be made. To this end the rootfinding numerical recipes of the electrochemical algorithm are investigated as the complex electrochemistry requires a highly iterative nested dual convergence loop to resolve the voltage-current relationship, and likewise the temporal discretization of the thermal algorithm is modified for the sake of higher accuracy and stability. Ultimately the new electrochemical algorithm featuring higher order rootfinding schemes proves to be efficient enough to reach the sub 5 millisecond target, signifying an order of magnitude reduction in calculation time, and when coupled with the new temporal discretization similar calculation time characteristics show that a fully implicit, higher order temporal discretization can also successfully be used if desired. Ultimately this result means that the cyber-physical simulation system can operate at higher sample rates, and resolve transient events at significantly higher resolution and fidelity.

Arias, Jesus↗

DOE OSTI2024

Development of Segregated Thermal-Hydraulics Solvers in MOOSE

42 ENGINEERING↗

DOE OSTI2025

Distributed Coordination of Demand-side Flexible Resources in Microgrid with All-Time Feasibility

The prevalence of distributed renewable generators motivates microgrid operators to exploit demand-side flexible resources (DFRs). Due to their dispersed nature, distributed DFR coordination has been a vibrant research area, while there are several issues awaiting to be addressed. On one hand, DFR power is internally coupled through power flow, while DFR usually cannot access grid information. On the other hand, in time-restricted scenarios, solution feasibility cannot be guaranteed by conventional dual-based algorithms. To fill these gaps, we propose a distributed DFR coordination framework with all-time feasibility. The proposed framework accounts for the distinct access of microgrid entities to grid information. A distributed and all-time feasible algorithm is proposed for optimal DFR coordination, which allows DFRs to make local decisions without violating constraints throughout iterations. The effectiveness of the proposed algorithm is demonstrated through case studies. The impact of peer-to-peer communication links on algorithm convergence is also investigated, which emphasizes the balance between communication investment and algorithm performance.

Li, Hongyi [Iowa State Univ., Ames, IA (United Sta↗

DOE OSTI2025

Muon momentum reconstruction in ICARUS-T600 LArTPC via Multiple Scattering

The SBN program at Fermilab investigates the possible existence of eV-scale sterile neutrinos. This work focuses on reconstructing muon momentum in $\nu$-Ar interactions within the ICARUS-T600 LArTPC detector using Multiple Coulomb Scattering (MCS), the only viable method for non-contained muons. Two algorithms are evaluated: the Gran Sasso algorithm (2D, Collection view) and the MicroBooNE algorithm (3D angles), applied to 2391 simulated and 2255 real stopping muon tracks (0.4-1 GeV/c). Performance is assessed via bias and resolution, using range-based momentum as a reference. Two enhanced versions of the Gran Sasso algorithm are also developed: one combining all three wire plane views, and one using 3D angles. Results show that the MicroBooNE algorithm performs slightly better, with resolution down to 14\% in simulation and 16\% in real data. These improvements significantly boost $\nu_\mu$ CC statistics, enhancing sensitivity to $\nu_\mu$ disappearance and 3+1 oscillation signals.

Chiello, Giovanni [Pisa U.] (ORCID:000900064571071↗

DOE OSTI2025

Application-level benchmarking of quantum computers using nonlocal game strategies

In a nonlocal game, two noncommunicating players cooperate to convince a referee that they possess a strategy that does not violate the rules of the game. Quantum strategies allow players to optimally win some games by performing joint measurements on a shared entangled state, but computing these strategies can be challenging. We present a variational quantum algorithm to compute quantum strategies for nonlocal games by encoding the rules of a nonlocal game into a Hamiltonian. We show how this algorithm can generate a short-depth optimal quantum strategy for a graph coloring game with a quantum advantage. This quantum strategy is then evaluated on fourteen different quantum hardware platforms to demonstrate its utility as a benchmark. Finally, we discuss potential sources of errors that can explain the observed decreased performance of the executed task and derive an expression for the number of samples required to accurately estimate the win rate in the presence of noise.

nonlocal games↗