Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Performance benchmark”

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 721 records · Page 40

AI Model Benchmarking for Nonproliferation Applications: Steel Thread Benchmarking Task Force Technical Report (Rev. 2)

Steel Thread is a NA-22 venture that seeks to build trustworthy, reliable AI models that can be used in a wide variety of nonproliferation tasks. A key aspect of building these models is developing appropriate benchmarks and evaluation methods, which will enable the venture to identify and adapt models to provide the most value in the nonproliferation domain. Benchmarks must be relevant to key tasks in this domain, such as question answering, information retrieval, document summarization and classification, consensus analysis, and image and data analysis. This report 1) provides an overview of benchmark design, evaluation, and challenges; 2) reviews a variety of open benchmarks, with a focus on language models and tasks; and 3) identifies benchmarks that are most relevant to Steel Thread. This report is intended to serve as a basis for further efforts to classify and evaluate benchmarks and their correlation with success on nonproliferation-specific tasks. The Steel Thread venture has defined benchmarks to be a particular combination of a dataset (or datasets) and a metric (or metrics) conceptualized as representing one or more specific tasks or sets of abilities for a specific modality. It is adopted by a research community as a shared framework for comparing methods.1 It includes 1) Data: Labeled (a designated subset not used for training, which could be all the data), 2) Metric: A way to quantify performance, 3) Task/Ability: What the benchmark is testing, 4) Protocol: A structured and repeatable evaluation process, 5) Baseline/Reference Model: For comparison; could be statistical, rule-based, SME-derived, or another model, and 6) Maintenance Plan: to update with new information over time; important for long-term utility. For further clarity, the definition includes what a benchmark, in this context, is not. It is not a corpus of training data, specific to a model (it is intended to apply to a range of models), a universal evaluation of performance, a guarantee that the ‘top’ model on the leaderboard will be the best fit for every specific use case, an all-encompassing proof of a model’s universal quality, nor is it a one-size-fits-all measure of success. It does not cover every real-world constraint (like operational, ethical, or cost considerations), a systems integration test, or a unit test. This definition was inspired by and resulted from discussions within the Steel Thread Benchmarking Task Force. This group was formed to define what we would mean as a benchmark within Steel Thread but persisted as the need to develop a thorough understanding of the large and expanding existing benchmarking space. This technical report is a result of the group’s divide and conquer approach to exploring this space. The release of benchmarks might not be progressing as quickly as model development, but it is moving very fast, as many benchmarks quickly become saturated, when state-of-the-art models score so close to the benchmark’s ceiling that their results are virtually indistinguishable. At that point, the test no longer differentiates between new systems, so researchers usually stop reporting scores as the benchmark no longer informs about improvements from the next generation of models. In the OpenAI announcement of GPT-5, they reported results on six flagship public benchmarks (AIME 2025, SWE-bench Verified, Aider Polyglot, MMMU, HealthBench Hard, GPQA) but the full system-card covers roughly thirty-five separate evaluations, comprising hundreds of test task items in total. There have been some efforts to summarize benchmarks in specific fields, like for text-to-image generation, but these surveys have had a narrow methodology scope. Therefore, a comprehensive survey of all benchmarks or even all benchmarks that could be relevant to Steel Thread is outside of the scope of this report. We chose some specific benchmarks to investigate in detail.

97 MATHEMATICS AND COMPUTING↗

An HPC benchmark survey and taxonomy for characterization

The field of High-Performance Computing (HPC) is defined by providing computing devices with highest performance for a variety of demanding scientific users. The tight co-design relationship between HPC providers and users propels the field forward, paired with technological improvements, achieving continuously higher performance and resource utilization. A key device for system architects, architecture researchers, and scientific users are benchmarks, allowing for well-defined assessment of hardware, software, and algorithms. Many benchmarks exist in the community, from individual niche benchmarks testing specific features, to large-scale benchmark suites for whole procurements. We survey the available HPC benchmarks, summarizing them in table form with key details and concise categorization, also through an interactive website. For categorization, we present a benchmark taxonomy for well-defined characterization of benchmarks.

Benchmarking↗

OptiBench: An Optimization Benchmark Tool for Renewable Energy Problems

We propose a benchmark framework and visualization tool, OptiBench, for analyzing the performance of state-of-the-art optimization solvers across a variety of optimization problems in renewable energy research. Our framework is designed from the ground up in the Julia programming language and enables analysis at scale on high performance computing (HPC) systems. Our visualization tool allows effortless evaluation of optimization solver performance, robustness, and accuracy through intuitive plots, e.g., performance profiles, heat maps, and distribution plots. We have tested three benchmark suites relevant to the modeling of renewable energy systems, viz., CUTEst, PGLib-OPF, and WaterTAP water treatment optimization problems. We illustrate benchmarking of CUTEst using OptiBench on the National Renewable Energy Laboratory's (NREL) HPC Kestrel. Our findings indicate that MA57 HSL linear solver demonstrated the best overall performance for an experimental IPOPT implementation. Our work is ongoing and we intend to add support for more optimization solvers and benchmark test suites in the future.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Implementing and Benchmarking the Locally Competitive Algorithm on the Loihi 2 Neuromorphic Processor

Neuromorphic processors have garnered considerable interest in recent years for their potential in enabling energy-efficient and high-speed computing. The Locally Competative Algorithm (LCA) has been utilized for power efficient sparse coding on neuromophic processors, including the first Loihi processor \cite{appletospikes, loihi1}. With the Loihi 2 processor enabling custom neuron models and graded spike communication, more complex implementations of LCA are possible \cite{loihi2}. We present a new implementation of LCA designed for the Loihi 2 processor and perform an initial set of benchmarks comparing it to LCA on CPU and GPU devices. In these experiments LCA on Loihi 2 is faster and orders of magnitude more efficient, while maintaining similar reconstruction quality. We find this performance improvement increases as the LCA parameters are tuned towards greater representation sparsity. Our study highlights the potential of neuromorphic processors, particularly Loihi 2, in enabling intelligent,autonomous, real-time processing on small robots, satellite where there are strict SWaP (small, lightweighr, and low-power) requirement. By demonstrating the superior performance of LCA on Loihi 2 compared to conventional computing device, our study suggests that Loihi 2 could be a valuable tool in advancing these types of applications. Overall, our study highlights the potential of neuromorphic processors for efficient and accurate data processing on resource-constrained devices.

Parpart, Gavin G.↗

OptiBench: An Optimization Benchmark Tool for Renewable Energy Problems

We propose a benchmark framework and visualization tool, OptiBench, for analyzing the performance of state-of-the-art optimization solvers across a variety of optimization problems in renewable energy research. Our framework is designed from the ground up in the Julia programming language and enables analysis at scale on high performance computing (HPC) systems. Our visualization tool allows effortless evaluation of optimization solver performance, robustness, and accuracy through intuitive plots, e.g., performance profiles, heat maps, and distribution plots. We have tested three benchmark suites relevant to the modeling of renewable energy systems, viz., CUTEst, PGLib-OPF, and WaterTAP water treatment optimization problems. We illustrate benchmarking of CUTEst using OptiBench on the National Laboratory of the Rockies's (NLR) HPC Kestrel. Our findings indicate that MA57 HSL linear solver demonstrated the best overall performance for an experimental IPOPT implementation. Our work is ongoing and we intend to add support for more optimization solvers and benchmark test suites in the future.

97 MATHEMATICS AND COMPUTING↗

Ada issues in implementing ART-Ada

Due to the Ada mandate of a number of government agencies, interest in deploying expert systems such as Ada has increased. Recently, several Ada-based expert system tools have been developed. According to a recent benchmark report, these tools do not perform as well as similar tools written in C. While poorly implemented Ada compilers contribute to the poor benchmark result, some fundamental problems of the Ada language itself have been uncovered. Here, the authors describe Ada language issues encountered during the deployment of ART-Ada, an expert system tool for Ada deployment. ART-Ada is being used to implement several prototype expert systems for the Space Station Freedom and the U.S. Air Force.

Lee, S. Daniel↗

Understanding the Cray X1 System

This paper helps the reader understand the characteristics of the Cray X1 vector supercomputer system, and provides hints and information to enable the reader to port codes to the system. It provides a comparison between the basic performance of the X1 platform and other platforms that are available at NASA Ames Research Center. A set of codes, solving the Laplacian equation with different parallel paradigms, is used to understand some features of the X1 compiler. An example code from the NAS Parallel Benchmarks is used to demonstrate performance optimization on the X1 platform.

Cheung, Samson↗

So you think you can track?

This work introduces a multi-camera tracking dataset consisting of 234 hours of video data recorded concurrently from 234 overlapping HD cameras covering a 4.2 mile stretch of 8-10 lane interstate highway near Nashville, TN. Video is recorded in cooperation with Tennessee State Department of Transportation and its policies. The video is recorded during a period of high traffic density with 500+ objects typically visible within the scene and typical object longevities of 3-15 minutes. GPS trajectories from 270 vehicle passes through the scene are manually corrected in the video data to provide a set of ground-truth trajectories for recall-oriented tracking metrics, and object detections are provided for each camera in the scene (159 million total before cross-camera fusion). Initial benchmarking of tracking-by-detection algorithms is performed against the GPS trajectories, and a best HOTA of only 9.5% is obtained (best recall 75.9% at IOU 0.1, 47.9 average IDs per ground truth object), indicating the benchmarked trackers do not perform sufficiently well at the long temporal and spatial durations required for traffic scene understanding. Video data, scene information, and vehicle trajectories are made publicly available at i24motion.org.

42 ENGINEERING↗

Toward Scalable Benchmarks for Mass Storage Systems

This paper presents guidelines for the design of a mass storage system benchmark suite, along with preliminary suggestions for programs to be included. The benchmarks will measure both peak and sustained performance of the system as well as predicting both short- and long-term behavior. These benchmarks should be both portable and scalable so they may be used on storage systems from tens of gigabytes to petabytes or more. By developing a standard set of benchmarks that reflect real user workload, we hope to encourage system designers and users to publish performance figures that can be compared with those of other systems. This will allow users to choose the system that best meets their needs and give designers a tool with which they can measure the performance effects of improvements to their systems.

Miller, Ethan L.↗

Bragg Spot Finder (BSF): a new machine-learning-aided approach to deal with spot finding for rapidly filtering diffraction pattern images

Macromolecular crystallography contributes significantly to understanding diseases and, more importantly, how to treat them by providing atomic resolution 3D structures of proteins. This is achieved by collecting X-ray diffraction images of protein crystals from important biological pathways. Spotfinders are used to detect the presence of crystals with usable data, and the spots from such crystals are the primary data used to solve the relevant structures. Having fast and accurate spot finding is essential, but recent advances in synchrotron beamlines used to generate X-ray diffraction images have brought us to the limits of what the best existing spotfinders can do. This bottleneck must be removed so spotfinder software can keep pace with the X-ray beamline hardware improvements and be able to see the weak or diffuse spots required to solve the most challenging problems encountered when working with diffraction images. In this paper, we first present Bragg Spot Detection (BSD), a large benchmark Bragg spot image dataset that contains 304 images with more than 66 000 spots. We then discuss the open source extensible U-Net-based spotfinder Bragg Spot Finder (BSF), with image pre-processing, a U-Net segmentation backbone, and post-processing that includes artifact removal and watershed segmentation. Finally, we perform experiments on the BSD benchmark and obtain results that are (in terms of accuracy) comparable to or better than those obtained with two popular spotfinder software packages ( Dozor and DIALS ), demonstrating that this is an appropriate framework to support future extensions and improvements.

36 MATERIALS SCIENCE↗

A comparative analysis of YOLOv8 and U-Net image segmentation approaches for transmission electron micrographs of polycrystalline thin films

Metallic thin films offer a platform to experimentally study the dynamics of microstructural evolution, but the required transmission electron microscopy (TEM)-based imaging generates complex images that are challenging to segment and quantify. This work provides a comparative analysis of a new YOLOv8 model and an established U-Net model for bright-field TEM images of polycrystals, employing a framework leveraging physical observables to evaluate performance against two hand-traced benchmark datasets. This methodology obviates the comparison of large, diversely structured, and manually labeled datasets that are required to assess performance on a per-image/per-pixel basis. It is found that the YOLOv8 model, adapted for real-time instance segmentation, has up to 43× faster inferencing (NVIDIA GeForce RTX 4090) compared to U-Net and reconstructs hand-traced grain size distributions (GSDs) with excellent fidelity, finding mean diameter within 3% for grains near an optimal magnification; for grains that deviate from the optimal pixel-diameter, the size of small- (large)-diameter grains is systematically over- (under)-estimated. This is partially mitigated by including scale-aware augmentations during training. Moreover, when the bias is corrected post-inference by a rigid shift in distribution, the YOLOv8 model reproduces ground truth GSDs with exceptional fidelity, with statistical tests indicating <5% probability that the distributions are distinct. Based on ground truth data, calibration curves pertaining to this shift can be constructed for a given model. This issue is not present in the U-Net model’s results, indicating that for quantitative measurements where the true size of objects is of interest, special procedures must be implemented for YOLO-based models.

36 MATERIALS SCIENCE↗

Hover and Forward Flight Performance Modeling of the Ingenuity Mars Helicopter

In 2015, NASA’s Jet Propulsion Laboratory partnered with Ames Research Center, Langley Research Center, and AeroVironment to develop Ingenuity, a small coaxial helicopter capable of flying within Mars’ unique atmospheric conditions. Ingenuity was successfully deployed from its protective shroud on the underside of the Mars 2020 Perseverance Rover and has flown 17 flights on Mars as of December 2021. A number of rotorcraft analysis tools were utilized, and a series of experimental tests were performed to ready Ingenuity for its launch with the Perseverance Rover in July 2020. In this paper, RotCFD, a Reynolds-averaged Navier-Stokes flow solver, is used to model Ingenuity in hover and forward flight for the purposes of validating tools to aid in the development of a future generation of Mars rotorcraft. The results from the RotCFD modeling are benchmarked against results from hover performance tests of the Ingenuity prototype in the 25-Foot Space Simulator at the Jet Propulsion Laboratory and are also compared to hover and forward flight predictions made by CAMRAD II, a well-known comprehensive rotorcraft analysis code. Surrogate performance models are trained to obtain a set of trimmed rotor settings for Ingenuity at different forward flight speeds, which are then used as inputs for the RotCFD forward flight simulations. Additionally, a study of the airframe-rotor interaction and a study of the aerodynamics of the individual airframe components of Ingenuity in forward flight are performed. Finally, to better understand performance predictions by RotCFD and CAMRAD II, a study is conducted on how sectional angles of attack in each code vary with radial station and azimuth.

Hover↗

Experiences using OpenMP based on Computer Directed Software DSM on a PC Cluster

In this work we report on our experiences running OpenMP programs on a commodity cluster of PCs running a software distributed shared memory (DSM) system. We describe our test environment and report on the performance of a subset of the NAS Parallel Benchmarks that have been automaticaly parallelized for OpenMP. We compare the performance of the OpenMP implementations with that of their message passing counterparts and discuss performance differences.

Hess, Matthias↗

Improved Benchmarking of Cohesive Elements in Abaqus Standard for Predicting Disbond and Delamination in Composite Structures

Traditional approaches for aircraft certification require the assumption of an initial flaw condition, either represented as barely visible impact damage (BVID) or through inclusion of a Teflon insert to serve as surrogate damage. Based on the initial composite damage state, the structure must be shown to demonstrate structural durability and damage tolerance (DaDT) according to the following criteria: a. Damage displays no detrimental growth under cyclic loading b. The structure is able to sustain design limit load (DLL) Currently, the only available manner for validating structural performance is through test. Since damage can occur over a wide variety of areas within a structure, this approach has proven to be increasingly expensive and time consuming for composite airframes and acreage structure within the design-test-certification building block. A further complicating factor is the requirement to accurately capture the most critical damage morphologies as a starting condition. To understand the severity of the damage, it is either required to experimentally determine the most critical areas at tremendous expense or rely on legacy data of similar structural testing, which limits design space expansion. A preferred solution is to use advanced analysis to provide improved understanding of load margins for critical locations based on a wide variety of potential starting damage conditions. The standard industry approach for DaDT certification adheres to the use of the traditional virtual crack closure technique (VCCT) method. VCCT is generally a preferred method because it conforms to the current certification principles of damage from a known flaw, and when used correctly, can be effective at predicting delamination propagation under static and cyclic loading. The VCCT method requires the inclusion of an initial flaw in the finite element (FE) model requiring a-priori knowledge of the flaw location. This in turn requires a plethora of analysis cases to be examined to cover a reasonable span of potential damage states. Additionally, the VCCT approach requires node-to-node connectivity rendering it incompatible with the best practices and approaches for using continuum damage mechanics (CDM) based progressive damage and failure analysis (PDFA) tools within a typical FE solver. Alternatives to VCCT have emerged in the form of cohesive elements which utilize the cohesive zone model (CZM). Unlike VCCT which models linear elastic fracture mechanics, cohesive elements couples continuum and fracture based responses through the use of bilinear traction separation laws. These laws are defined based on a penalty stiffness, a cohesive strength, and a strain energy release rate. The approach can be mesh regularized with native cohesive elements within many FE solvers such as Abaqus and LS-DYNA. In Phase I of the NASA Advanced Composites Consortium (ACC) post-buckled stiffened panel with BVID, Strength and Life [1], the performance of cohesive elements were benchmarked in comparison to VCCT and LEFM solutions and showed good agreement using Abaqus explicit [2]. To realize savings on current and future programs, it is still necessary to close technical gaps related to the use of cohesive elements with Abaqus Standard. Within a program environment, standard finite element analysis is the preferred analytical capability for quasi-static loading as it eliminates uncertainty due to oscillatory behavior commonly seen with explicit analysis. This oscillatory behavior creates difficulties in writing margins of safety based on the analysis. The use of negative tangent stiffness material models complicates convergence which typically requires the use of numerical controls such as viscous damping to overcome. To date, there has not been a comprehensive study on how to establish best practices for cohesive element convergence for predictive capability within the Abaqus implicit solver. In pursuit of these goals, under the NASA ACC program, several numerical benchmark problems were proposed including pure mode I (double cantilevered beam – DCB), pure mode II (end notch flexure – ENF), and symmetric/unsymmetric evolving mixed mode (single leg bend – SLB). This paper focuses on the use of cohesive elements to model the delamination through the use of CZM. Specifically, finite element models for the DCB, ENF, symmetric SLB, and unsymmetric SLB, are developed and various solution controls for convergence are studied to develop a best practice. Once the best practice has been developed, the predictive capability of the objective CZM model is used to analyze the hat pull-off strength of a standard hat stiffened configuration under various loading conditions.

Abaqus↗

Qubit Assignment Using Time Reversal

As quantum computers with large numbers of qubits become increasingly available, experiments executed on a given device may not utilize all available qubits. In this case, the outcome of executing a quantum program will depend on the ability to efficiently select a subset of high-performing physical qubits. For any given quantum program and device there are many ways to assign physical qubits for execution of the program, and assignments will differ in performance due to the variability in quality across qubits and entangling operations on a single device. Evaluating the performance of each assignment using fidelity estimation introduces significant experimental overhead and will be infeasible for many applications, while relying on standard device benchmarks provides incomplete information about the performance of any specific program. Furthermore, the number of possible assignments grows combinatorially in the number of qubits on the device and in the program, motivating the use of heuristic optimization techniques. We demonstrate a practical solution to the problem of qubit assignment by using simulated annealing with a cost function based on the Loschmidt echo, a diagnostic that measures the reversibility of a quantum process. We provide theoretical justification for this choice of cost function by demonstrating that the optimal qubit assignment coincides with the optimal qubit assignment based on state fidelity in the weak error limit, and we provide experimental justification using diagnostics performed on Google’s superconducting qubit devices. We then establish the performance of simulated annealing for qubit assignment using classical simulations of noisy devices as well as optimization experiments performed on a quantum processor. Our results demonstrate that the use of Loschmidt echoes and simulated annealing provides a scalable and flexible approach to optimizing qubit assignment on near-term hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reconstruction of Thermal Protection System Aeroheating using a Green’s Function Approach

Inverse heat transfer (IHT) techniques are often used to reconstruct the surface heating conditions on spacecraft thermal protection systems (TPS) during atmospheric entry. Current IHT techniques for entry spacecraft applications, however, demand substantial computational resources, and are impractical for analyses such as uncertainty quantification and real-time health monitoring. In this paper, a Green’s function sensor fusion approach is used to reconstruct the TPS surface aeroheating conditions on experimental spaceflight and ground test systems from collocated temperature and heat flux sensors embedded in the TPS. The algorithm leverages Green’s functions to model the heat conduction within the spacecraft TPS and stabilizes the recovery of the surface heating condition using the direct heat flux sensor measurement. The algorithm is validated using arc-jet ground test data and applied to the reconstruction of the Mars 2020 backshell heating during Martian atmospheric entry. The performance of the algorithm is benchmarked against a current state-of-the-art IHT framework, FIAT_Opt. The Green’s function-based reconstruction algorithm recovers the net hot-wall heat flux absorbed by the TPS and the incident heat flux from the atmospheric entry environment in close agreement with FIAT_Opt. Notably, computation of the surface heating condition is completed in three orders of magnitude less time with the Green’s function sensor fusion approach using a consumer-grade PC, versus with FIAT_Opt running on a high performance computer cluster. The efficiency of the algorithm is leveraged to compute the uncertainty contributions of input parameters to the total uncertainty in reconstructed Mars 2020 backshell heating for the full atmospheric entry heat pulse. The sensitivity analysis uncovers that, at different times throughout the entry heat pulse, uncertainties in the TPS specific heat, thermal conductivity, and emissivity are all dominant drivers of the reconstruction uncertainty. These results demonstrate Green’s functions and sensor-fusion techniques as promising IHT approaches to reconstruct atmospheric entry environments from TPS-embedded measurements, and highlight how these techniques may give access to post-flight analyses previously hindered by the prohibitive cost of current methods.

Kenneth McAfee↗

Reconstruction of Thermal Protection System Aeroheating using a Green’s Function Approach

Inverse heat transfer (IHT) techniques are often used to reconstruct the surface heating conditions on spacecraft thermal protection systems (TPS) during atmospheric entry. Current IHT techniques for entry spacecraft applications, however, demand substantial computational resources, and are impractical for analyses such as uncertainty quantification and real-time health monitoring. In this paper, a Green’s function sensor fusion approach is used to reconstruct the TPS surface aeroheating conditions on experimental spaceflight and ground test systems from collocated temperature and heat flux sensors embedded in the TPS. The algorithm leverages Green’s functions to model the heat conduction within the spacecraft TPS and stabilizes the recovery of the surface heating condition using the direct heat flux sensor measurement. The algorithm is validated using arc-jet ground test data and applied to the reconstruction of the Mars 2020 backshell heating during Martian atmospheric entry. The performance of the algorithm is benchmarked against a current state-of-the-art IHT framework, FIAT_Opt. The Green’s function-based reconstruction algorithm recovers the net hot-wall heat flux absorbed by the TPS and the incident heat flux from the atmospheric entry environment in close agreement with FIAT_Opt. Notably, computation of the surface heating condition is completed in three orders of magnitude less time with the Green’s function sensor fusion approach using a consumer-grade PC, versus with FIAT_Opt running on a high performance computer cluster. The efficiency of the algorithm is leveraged to compute the uncertainty contributions of input parameters to the total uncertainty in reconstructed Mars 2020 backshell heating for the full atmospheric entry heat pulse. The sensitivity analysis uncovers that, at different times throughout the entry heat pulse, uncertainties in the TPS specific heat, thermal conductivity, and emissivity are all dominant drivers of the reconstruction uncertainty. These results demonstrate Green’s functions and sensor-fusion techniques as promising IHT approaches to reconstruct atmospheric entry environments from TPS-embedded measurements, and highlight how these techniques may give access to post-flight analyses previously hindered by the prohibitive cost of current methods.

Kenneth McAfee↗

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗