Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “computational framework”

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 901 records · Page 50
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Power capture and power take-off load of a self-balanced dual-flap oscillating surge wave energy converter

Wave energy converters are an important part of future renewable energy infrastructure. Predicting their power matrix, capture width ratio, and power take-off loads at a targeted site is required for performance assessment before deployment. Because their testing is very expensive, numerical modeling and simulations play a significant role in those assessments. Linear potential flow theory has limited accuracy under large amplitude wave forcing. More accurate predictions can be obtained by using higher-fidelity models, which are computationally expensive. We present a framework for multi-fidelity numerical simulations to determine the hydrodynamic response, wave capture capability, and power take-off load of a full-scale dual-flap oscillating surge wave energy converter. This design exploits out-of-phase motion by setting the distance between the flaps to half the wavelength of the most occurring wave. The simulations are validated using a 1:10 model experiments in a wave tank. Based on these validations, it was determined that Euler simulations provide an acceptable prediction with 90% reduction in computational time with only 11% error. Utilizing Euler simulations at full-scale, the results demonstrate that the annual electrical energy output is 1.79 GWh under regular wave conditions. Here, one significant improvement over single-flap designs is the capture width ratio which exceeds unity.

16 TIDAL AND WAVE POWER↗
DOE OSTI2021

Online Voltage Event Detection Using Synchrophasor Data with Structured Sparsity-Inducing Norms

This paper develops an accurate and computationally efficient data-driven framework to detect voltage events from PMU data streams. It develops an innovative Proximal Bilateral Random Projection (PBRP) algorithm to quickly decompose the PMU data matrix into a low-rank matrix, a row-sparse event-pattern matrix and a noise matrix. Here, the row-sparse pattern matrix significantly distinguishes events from normal behavior. These matrices are then fed into a clustering algorithm to separate voltage events from normal operating conditions. Large-scale numerical study results on real-world PMU data show that the proposed algorithm is computationally more efficient and achieves higher F scores than state-of-the-art benchmarks.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Assessment of Cloud-Based Applications Enabling a Scalable Risk-Informed Predictive Maintenance Strategy Across the Nuclear Fleet

The current light water reactor fleet uses time-based or failure-based maintenance strategies to achieve high-capacity factors. But to make nuclear more competitive in the energy market, these reactors could utilize emerging technologies in terms of artificial intelligence (AI) and cloud computing to enable a cost-effective, predictive maintenance strategy. This report examines the feasibility of cloud computing for the nuclear industry’s needs in terms of the cloud’s computing capabilities, feasibility, and regulatory concerns. The technical viability of cloud computing was analyzed using one year worth of data from a boiling water reactor’s safety relief valve. Models were hosted on a local desktop, Idaho National Laboratory’s high-performance computer, and Microsoft Azure. Data was loaded, processed, and two types of models were trained in an A/B fashion. Based on the speed at which these actions were completed, it was used to determined that cloud computing has adequate computing resources. Additionally, the computing power can scale with the demanded load. To enable cloud computing in the existing fleet, additional sensors, networks, and other requirements must be implemented to ensure a smooth transition from current maintenance strategies. However, there is a benefit as the plant no longer needs manage their own servers, software, cybersecurity, and IT support staff. Many of these features can be offloaded on to the cloud provider. A comprehensive analysis was completed that showed the current annual cost of operating is more expensive than using cloud computing resources. Lastly, the regulatory framework does not explicitly address AI or autonomous control. Currently, the NRC and other regulatory bodies are evaluating providing guidance to address gaps rather than new regulations to address the use of AI and ML. But since many of the AI applications are focused on non-safety related applications, such as balance-of-plant components, they will likely have little or no regulatory restrictions or necessary approvals. Demonstrating how AI can improve maintenance and operation of these non-safety related systems seems like the likely path forward for implementing AI and cloud computing resources inside nuclear power plants (NPPs).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Accelerating Thermochemical Equilibrium Calculations for Nuclear Reactor Applications

Thermochemical properties play a key role in modeling and simulation of several key phenomena in nuclear reactors. There has been an increasing interest in incorporating CALPHAD-based formulations in multiphysics simulations including for Molten Salt Reactors where knowledge of phase evolution of the salt and the chemical potentials of various elements are of utmost importance in source term analyses and redox control. However, the size of such simulations is often limited by the high computational cost of full thermodynamic equilibrium calculations. This work discusses the current efforts aimed at accelerating thermochemical equilibrium calculations for multiphysics simulations performed using the open-source finite element / finite volume code Multiphysics Object Oriented Simulation Environment (MOOSE) [1]. While several methods have been proposed for accelerating phase equilibrium calculations [2], most focus on relatively small systems and often rely on a- priori knowledge of the state-space of the system. Nuclear materials, however, are often multi-component systems owing to the evolution of composition under irradiation and an approach based on a-priori mapping of phase diagram is often not enough. This work is aimed at demonstrating an on-the-fly surrogate modeling framework that uses active learning to reduce the number of full equilibrium calculations that must be performed. By combining with efficient coupling approaches, the surrogate framework helps in reducing the computational cost of thermodynamic equilibrium informed multiphysics simulations of nuclear materials. The performance is benchmarked against full coupling with the thermochemistry library Thermochimica [3]. This work uses a machine learning based approach for constructing surrogate models to predict the stable phases in a multicomponent system. The surrogates were constructed using neural networks and Gaussian process classification. In this work, we compare the relative performance of the two methods. We also demonstrate the use of caching previous calculations by interpolating the values from nearest neighbors. References [1] Lindsay, A.D., et al. "2.0 – MOOSE: Enabling massively parallel multiphysics simulation", SoftwareX, 20 (2022): 101202. [2] Roos, W.A. and Zietsman J.H. "Accelerating complex chemical equilibrium calculations – A Review", Calphad, 77 (2022): 102380. [3] Piro, M.H.A., et al. "The thermochemistry library Thermochimica", Computational Materials Science, 67 (2013): 266-272.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Efficient near-field ptychography reconstruction using the Hessian operator

X-ray ptychography is a powerful and robust coherent imaging method providing access to the complex object and probe (illumination). Ptychography reconstruction is typically performed using first-order methods due to their computational efficiency. Higher-order methods, while potentially more accurate, are often prohibitively expensive in terms of computation. In this study, we present a mathematical framework for reconstruction using second-order information derived from an efficient computation of the bilinear Hessian and Hessian operator. The formulation is provided for Gaussian-based models, enabling the simultaneous reconstruction of the object, probe, and object positions. Synthetic data tests, along with experimental near-field ptychography data processing, demonstrate a ten-fold reduction in computation time compared to first-order methods. The derived formulas for computing the Hessians, along with the strategies for incorporating them into optimization schemes, are well-structured and easily adaptable to various ptychography problem formulations.

Carlsson, Marcus [Lund Univ. (Sweden)] (ORCID:0000↗
DOE OSTI2024

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗
NASA NTRS2000

Information Power Grid: Distributed High-Performance Computing and Large-Scale Data Management for Science and Engineering

The term "Grid" refers to distributed, high performance computing and data handling infrastructure that incorporates geographically and organizationally dispersed, heterogeneous resources that are persistent and supported. The vision for NASN's Information Power Grid - a computing and data Grid - is that it will provide significant new capabilities to scientists and engineers by facilitating routine construction of information based problem solving environments / frameworks that will knit together widely distributed computing, data, instrument, and human resources into just-in-time systems that can address complex and large-scale computing and data analysis problems. IPG development and deployment is addressing requirements obtained by analyzing a number of different application areas, in particular from the NASA Aero-Space Technology Enterprise. This analysis has focussed primarily on two types of users: The scientist / design engineer whose primary interest is problem solving (e.g., determining wing aerodynamic characteristics in many different operating environments), and whose primary interface to IPG will be through various sorts of problem solving frameworks. The second type of user if the tool designer: The computational scientists who convert physics and mathematics into code that can simulate the physical world. These are the two primary users of IPG, and they have rather different requirements. This paper describes the current state of IPG (the operational testbed), the set of capabilities being put into place for the operational prototype IPG, as well as some of the longer term R&D tasks.

Johnston, William E.↗
DOE OSTI2026

Ion-Electron Coupling-Driven Redox Behavior in Metal–Organic Frameworks

Redox-active metal–organic frameworks (MOFs) have long been proposed as electronic transport platforms, yet the microscopic origin of their conductivity remains debated. A theoretical demonstration reveals charge transport in a Zn(pyrazole–naphthalene diimide (NDI)) MOF arising not from delocalized band-like states but from redox hopping between discrete linker sites. Using ab initio molecular dynamics simulations combined with electronic structure analysis, we established a direct link among electron injection, structural reorganization, and transport. Electron accumulation proceeds sequentially and site-selectively from imide and carbonyl groups of the NDI core progressively involving pyrazole N atoms at higher reduction states, through a hierarchy of redox-active sites. In contrast, Zn nodes remain essentially redox-inactive, which confirms their structural role. Density-of-states analysis corroborates a transport regime dominated by linker-centered states with evolving p-character upon reduction, resulting in dynamically reconfigured conduction networks. Real-time trajectories reveal anisotropic linker-to-linker electron transfer modulated by counterion coordination. This cooperative ion–electron regime emerges from potential energy surface collapse into a single low-barrier transition (ΔG ‡ ≈ 45 meV), where ionic and electronic motions evolve adiabatically on the same free-energy landscape. Elucidating redox conductivity in Zn(pyrazole–NDI) MOFs provides a theoretical framework for use in neuromorphic computing and related technologies.

Charge transfer↗
NASA NTRS2015

A High Performance Computing Approach to Tree Cover Delineation in 1-m NAIP Imagery Using a Probabilistic Learning Framework

Tree cover delineation is a useful instrument in deriving Above Ground Biomass (AGB) density estimates from Very High Resolution (VHR) airborne imagery data. Numerous algorithms have been designed to address this problem, but most of them do not scale to these datasets, which are of the order of terabytes. In this paper, we present a semi-automated probabilistic framework for the segmentation and classification of 1-m National Agriculture Imagery Program (NAIP) for tree-cover delineation for the whole of Continental United States, using a High Performance Computing Architecture. Classification is performed using a multi-layer Feedforward Backpropagation Neural Network and segmentation is performed using a Statistical Region Merging algorithm. The results from the classification and segmentation algorithms are then consolidated into a structured prediction framework using a discriminative undirected probabilistic graphical model based on Conditional Random Field, which helps in capturing the higher order contextual dependencies between neighboring pixels. Once the final probability maps are generated, the framework is updated and re-trained by relabeling misclassified image patches. This leads to a significant improvement in the true positive rates and reduction in false positive rates. The tree cover maps were generated for the whole state of California, spanning a total of 11,095 NAIP tiles covering a total geographical area of 163,696 sq. miles. The framework produced true positive rates of around 88% for fragmented forests and 74% for urban tree cover areas, with false positive rates lower than 2% for both landscapes. Comparative studies with the National Land Cover Data (NLCD) algorithm and the LiDAR canopy height model (CHM) showed the effectiveness of our framework for generating accurate high-resolution tree-cover maps.

Segments↗
DOE OSTI2022

Assessing Two Approaches for Enhancing the Range of Simulated Scales in the E3SMv1 and the Impact on the Character of Hourly US Precipitation

Abstract Improving the representation of precipitation in Earth system models is essential for understanding and projecting water cycle changes across scales. Progress has been hampered by persistent deficiencies in representing precipitation frequency, intensity, and timing in current models. Here, we analyze simulated US precipitation in the low‐resolution (LR) configuration of the Energy Exascale Earth System Model (E3SMv1) and assess the effect of two approaches to enhance the range of explicitly resolved scales: high‐resolution (HR) and multiscale modeling framework (MMF), which incur similar computational expense. Both E3SMv1‐MMF and E3SMv1‐HR capture more intense and less frequent precipitation on hourly and daily timescales relative to E3SMv1‐LR. E3SMv1‐HR improves the intensity over the Eastern and Northwestern US during winter, while E3SMv1‐MMF improves the intensity over the Eastern US and summer diurnal timing over the Central US. These results indicate that both methods may be needed to improve simulations of different storm types, seasons, and regions.

58 GEOSCIENCES↗
DOE OSTI2026

Leveraging Qubit Loss Detection in Fault-Tolerant Quantum Algorithms

Qubit loss errors constitute a dominant source of noise in many quantum hardware systems, particularly in neutral-atom quantum computers. We develop a theoretical framework to effectively detect and correct loss errors in logical algorithms and leverage such loss information in decoding. Considering general quantum error correction codes and logical circuits, we introduce a delayed-erasure decoder for experimentally motivated error models which leverages information from delayed loss detection to accurately correct loss errors, even when the precise moment of the error is unknown. Using this decoder, we identify strategies for detecting and correcting loss errors based on the logical circuit structure. For deep circuits prior to logical measurement, we explore methods to integrate loss detection into syndrome extraction with minimal overhead, identifying optimal strategies depending on the qubit loss fraction in the noise and hardware capabilities. In contrast, we find that many key algorithmic subroutines involve frequent gate teleportation, shortening the circuit depth before logical measurement and naturally replacing qubits with no additional experimental overhead. We simulate this setting using a toy model algorithm for small-angle synthesis and find a significant performance improvement as the loss fraction increases. These results provide a path forward for advancing large-scale fault-tolerant quantum computation in systems with loss error detection.

atoms↗
DOE OSTI2023

ZeoNet: 3D convolutional neural networks for predicting adsorption in nanoporous zeolites

Zeolites are one of the most widely used materials in the chemical industry due to their nanometer-sized pores that can adsorb and react upon molecules selectively. With hundreds of known framework topologies and hundreds of thousands of computationally predicted structures, the ability to rapidly predict zeolite performance allows researchers to prioritize their efforts on the most promising structures for a given application. Although the accuracy of forcefield-based atomistic simulations has advanced significantly in the past two decades, these simulations can be computationally expensive, especially for long-chain, complex molecules. Here, we present ZeoNet, a representation learning framework using convolutional neural networks (ConvNets) and 3D volumetric representations for predicting adsorption in zeolites. ZeoNet was trained on the task of predicting Henry's constants for adsorption, k H , of n-octadecane in more than 330 000 known and predicted zeolite materials. Employing a 3D grid based on the distances to solvent-accessible surfaces, a volumetric representation that can be generated efficiently, the best-performing ZeoNet achieved a correlation coefficient r 2 = 0.977 and a mean-squared error MSE = 3.8 in ln k H , which corresponds to an error of 9.3 kJ mol -1 in adsorption free energy. In comparison, a model based on hand-designed geometric features has values of r 2 = 0.783 and MSE = 35.7. ZeoNet is also relatively efficient and can process ≈8 structures per second on an Nvidia RTX 2080TI GPU, orders of magnitude faster than forcefield-based simulations. A systematic analysis was conducted to investigate how the choice of ConvNet architectures, the linear dimension (L) and spatial resolution (Δd) of the distance grids, batch size, optimizer, and learning rate impact the model performance. We found that ConvNets based on the ResNet architecture offer the best tradeoff between expressiveness and efficiency. The performance for all models reaches a plateau at L = 30–45 Å and depends less sensitively on grid resolution, with a small benefit around Δd = 0.30–0.45 Å. Finally, saliency maps were visualized to identify which regions of the materials contributed the most to model predictions. It was found, interestingly, that the predictions are driven primarily by the accessible pore volume rather than the region occupied by the framework atoms.

36 MATERIALS SCIENCE↗
DOE OSTI2020

GentenMPI: Distributed Memory Sparse Tensor Decomposition

GentenMPl is a toolkit of sparse canonical polyadic (CP) tensor decomposition algorithms that is designed to run effectively on distributed-memory high-performance computers. Its use of distributed-memory parallelism enables it to efficiently decompose tensors that are too large for a single compute node's memory. GentenMPl leverages Sandia's decades-long investment in the Trilinos solver framework for much of its parallel-computation capability. Trilinos contains numerical algorithms and linear algebra classes that have been optimized for parallel simulation of complex physical phenomena. This work applies these tools to the data science problem of sparse tensor decomposition. In this report, we describe the use of Trilinos in GentenMPl, extensions needed for sparse tensor decomposition, and implementations of the CP-ALS (CP via alternating least squares) and GCP-SGD (generalized CP via stochastic gradient descent) sparse tensor decomposition algorithms. We show that GentenMPl can decompose sparse tensors of extreme size, e.g., a 12.6-terabyte tensor on 8192 computer cores. We demonstrate that the Trilinos backbone provides good strong and weak scaling of the tensor decomposition algorithms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Framework for optimization of long-term, multi-period investment planning of integrated urban energy systems

In order to achieve stringent greenhouse gas emission reductions, a transition of our entire energy system from fossil to renewable resources needs to be designed. Such an energy transition brings two main challenges: most renewables generate variable electric energy, yet most demand is currently not electric (carrier mismatch) and does not always manifest at the same time as supply (temporal mismatch). Integrating multiple energy infrastructures can address both challenges by using the synergy between different energy carriers; building on existing infrastructure, while allowing a robust and flexible integration of the new. This paper proposes an optimization framework for long-term, multi-period investment planning of urban energy systems in an integrated manner. We formulate it as a mixed-integer linear program, combining a capacitated facility location with a multi-dimensional, capacitated network design problem. It includes generation and network expansion planning as well as interconnections between networks and storage infrastructure for each energy system. It can incorporate pathway effects like techno-economic developments, policy measures, and weather variations. The intended use is to support urban decision makers with long-term investment planning, though it can be tailored to fit other geographical or temporal scales. We demonstrate the model using two cases based on an average city in The Netherlands, which wants to reduce its CO 2 -emissions with 95% by 2050. In the first case, we include explicit carbon-emission constraints to study the effects of the carrier mismatch. In the second case, we implement interannual weather variations to analyze the temporal mismatch. The results give valuable insights into the energy transition design strategy for urban decision makers. They also show the future potential, as well as the computational challenges of the optimization framework.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

LuGo: An enhanced quantum phase estimation implementation

Quantum Phase Estimation (QPE) is a cardinal algorithm in quantum computing that plays a crucial role in various applications, including cryptography, molecular simulation, and solving systems of linear equations. However, the standard implementation of QPE faces challenges related to time complexity and circuit depth, which limit its practicality for large-scale computations. We introduce LuGo, a novel framework designed to enhance the performance of QPE by reducing circuit duplication, as well as using parallelization techniques to achieve faster generation of the QPE circuit and gate reduction. We validate the effectiveness of our framework by generating quantum linear solver circuits, which require both QPE and inverse QPE, to solve linear systems of equations. LuGo achieves significant improvements in both computational efficiency and hardware requirements without compromising on accuracy. Compared to a standard QPE implementation, LuGo reduces time consumption to generate a circuit that solves a 2 6 × 2 6 system matrix by a factor of 50.68 and over 31× reduction of quantum gates and circuit depth, with no fidelity loss on an ideal quantum simulator. Furthermore, we demonstrated the versatility and scalability of LuGo enabled HHL algorithm by simulating a canonical Hele-Shaw fluid problem using a quantum simulator. With these advantages, LuGo paves the way for more efficient implementations of QPE, enabling broader applications across several quantum computing domains.

Quantum algorithm↗
DOE OSTI2026

A multi‐variable framework for selecting WRF physics configurations at convection‐permitting scales: An Amazon wet‐season case study

Tropical convection over rainforests modulates atmospheric circulation and the energy and hydrological cycles across multiple scales. However, the scarcity of observations still limits our understanding of these processes. Although numerical models are utilized to investigate atmospheric physical processes, their performance depends on the choice of parameterizations and grid resolution. Here, in this work, we introduce and apply a multi‐variable, multi‐physics framework to evaluate and rank the Advanced Research Weather Research and Forecasting (WRF–ARW) configurations at 1‐km resolution over the central Amazon during the wet season. A 48‐member ensemble combines three land‐surface models (LSMs), four planetary boundary layer (PBL), and four microphysics (MP) schemes. Model performance for seven convection‐related near‐surface and boundary‐layer variables is assessed using Taylor diagrams and the Taylor skill score (TSS), analysis of variance (ANOVA)‐based sensitivity metrics, and non‐parametric rank tests. We then construct a combined, weighted TSS to identify configurations that are comparatively robust across variables. Results showed that most configurations reproduce near‐surface temperature, sensible and latent heat fluxes, and boundary‐layer height reasonably well, whereas humidity and rainfall remain challenging. LSM choice has the strongest impact on the surface fluxes and a secondary influence on near‐surface temperature and humidity, PBL schemes dominate boundary‐layer height, and MP schemes exert the largest control on rainfall. No single configuration is optimal for all variables, but the combination of Noah (LSM), Yonsei University (PBL), and Morrison (MP) emerges as the most robust configuration for this case, with the WRF single‐moment six‐class scheme (WSM6) providing a competitive, computationally cheaper MP alternative. The framework is general and can be applied to other regions, seasons, and convective regimes.

Amazon rainforest↗
DOE OSTI2020

In-Depth Optimization with the OpenACC-to-FPGA Framework on an Arria 10 FPGA

The reconfigurable computing paradigm that uses field programmable gate arrays (FPGAs) has received renewed interest in the high-performance computing field due to FPGAs' unique combination of performance and energy efficiency. However, difficulties in programming and optimizing FPGAs have prevented them from being widely accepted as general-purpose computing devices. In accelerator-based heterogeneous computing, portability across diverse heterogeneous devices is also an important issue, but the unique architectural features in FPGAs make this difficult to achieve. To address these issues, a directive-based, high-level FPGA programming and optimization framework was previously developed. In this work, developed optimizations were combined holistically using the directive-based approach to show that each individual benchmark requires a unique set of optimizations to maximize performance. The relationships between FPGA resource usages and runtime performance were also explored.

Lambert, Jacob↗
DOE OSTI2022

Let Each Quantum Bit Choose Its Basis Gates

Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX-or XY-type gate). This strict hardware uniformity requirement for 2Q gates in a large quantum computer has made scaling up a time and resource-intensive endeavor in the lab. We propose a radical idea – allow the 2Q basis gate(s) to differ between every pair of qubits, selecting the best entangling gates that can be calibrated between given pairs of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform. Scientists will also be able to use a much broader variety of novel 2Q gates for quantum computing. We develop a theoretical framework for identifying good 2Q basis gates on “nonstandard” Cartan trajectories that deviate from “standard” trajectories like XX. We then introduce practical methods for calibration and compilation with nonstandard 2Q gates, and discuss possible ways to improve the compilation. To demonstrate our methods in a case study, we simulated both standard XY-type trajectories and faster, nonstandard trajectories using an entangling gate architecture with far-detuned transmon qubits. We identify efficient 2Q basis gates on these nonstandard trajectories and use them to compile a number of standard benchmark circuits such as QFT and QAOA. Furthermore, our results demonstrate an 8x improvement over the baseline 2Q gates with respect to speed and coherence-limited gate fidelity.

quantum computing↗