Search NASA⌕ Search

SEARCH · Search NASA

Results for “Implementation”

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 433 records · Page 24

Leveraging the Run 3 experience for the evolution of the ATLAS software-based readout towards HL-LHC

The High-Luminosity Large Hadron Collider (HL-LHC), scheduled to start operating in 2030, aims to increase the instantaneous luminosity by a factor of 10 compared to the LHC. To match this increase, the ATLAS experiment has been implementing a major upgrade program divided into two phases. The first phase (Phase-I), completed in 2022, introduced new trigger and detector systems that have been used during the Run 3 data taking period which began in July 2022. These systems have been used in conjunction with the new Data Acquisition (DAQ) Readout system, based on a software application called Software Readout Driver (SW ROD). SW ROD receives and aggregates data from the front-end electronics via the Front-End Link eXchange (FELIX) system and passes aggregated data fragments to the High-Level Trigger (HLT) system. During Run 3, SW ROD operates in parallel with the legacy Readout System (ROS) at an input rate of 100 kHz. For the Phase-II, the legacy ROS will be completely replaced with a new system based on the next generation of FELIX and an evolution of the SW ROD application called Data Handler. Data Handler has the same functional requirements as SW ROD but must be able to operate at an input rate of 1 MHz. To facilitate this evolution the SW ROD has been implemented using plugin architecture. This contribution presents the design and implementation of the SW ROD application for Run 3, along with the strategy for its evolution to the Phase-II Readout system. It discusses the lessons learned during Run 3 and describes the challenges that have been addressed to accomplish the demanding performance requirements of HL-LHC.

Kolos, Serguei [Univ. of California, Irvine, CA (U↗

Relativistic Douglas–Kroll–Hess calculations of hyperfine interactions within first-principles multireference methods

A relativistic magnetic hyperfine interaction Hamiltonian based on the Douglas–Kroll–Hess (DKH) theory up to the second order is implemented within the ab initio multireference methods, including spin–orbit coupling in the Molcas/OpenMolcas package. This implementation is applied to calculate relativistic hyperfine coupling (HFC) parameters for atomic systems and diatomic radicals with valence s or d orbitals by systematically varying active space size in the restricted active space self-consistent field formalism with restricted active space state interaction for spin–orbit coupling. The DKH relativistic treatment of the hyperfine interaction reduces the Fermi contact contribution to the HFC due to the presence of kinetic factors that regularize the singularity of the Dirac delta function in the nonrelativistic Fermi contact operator. This effect is more prominent for heavier nuclei. As the active space size increases, the relativistic correction of the Fermi contact contribution converges well to the experimental data for light and moderately heavy nuclei. The relativistic correction, however, does not significantly affect the spin-dipole contribution to the hyperfine interaction. In addition to the atomic and molecular systems, the implementation is applied to calculate the relativistic HFC parameters for large trivalent and divalent Tb-based single-molecule magnets (SMMs), such as Tb(III)Pc2 and Tb(II)(CpiPr5)2 without ligand truncation using well-converged basis sets. In particular, for the divalent SMM, which has an unpaired valence 6s/5d hybrid orbital, the relativistic treatment of HFC is crucial for a proper description of the Fermi contact contribution. Even with the relativistic hyperfine Hamiltonian, the divalent SMM is shown to exhibit strong tunability of HFC via an external electric field (i.e., strong hyperfine Stark effect).

Chemistry↗

3-center and 4-center 2-particle Gaussian AO integrals on modern accelerated processors

We report an implementation of the McMurchie–Davidson (MD) algorithm for 3-center and 4-center 2-particle integrals over Gaussian atomic orbitals (AOs) with low and high angular momenta l and varying degrees of contraction for graphical processing units (GPUs). This work builds upon our recent implementation of a matrix form of the MD algorithm that is efficient for GPU evaluation of 4-center 2-particle integrals over Gaussian AOs of high angular momenta (l ≥ 4) [A. Asadchev and E. F. Valeev, J. Phys. Chem. A 127, 10889–10895 (2023)]. The use of unconventional data layouts and three variants of the MD algorithm allow for the evaluation of integrals with double precision and sustained performance between 25% and 70% of the theoretical hardware peak. Performance assessment includes integrals over AOs with l ≤ 6 (a higher l is supported). Preliminary implementation of the Hartree–Fock exchange operator is presented and assessed for computations with up to a quadruple-zeta basis and more than 20 000 AOs. The corresponding C++ code is part of the experimental open-source LibintX library available at https://github.com/ValeevGroup/libintx.

Chemistry↗

Verification of electromagnetic simulation capabilities in global gyrokinetic particle-in-cell code GTS

Recently, the numerical scheme presented by Mishchenko et al. enabled explicit gyrokinetic simulations of low-frequency electromagnetic instabilities in tokamaks at experimentally relevant values of plasma β⁠. This scheme resolved the long-standing cancellation problem that previously hindered gyrokinetic particle-in-cell code simulations of magnetohydrodynamic phenomena with inherently small parallel electric fields. Moreover, the scheme did not employ approximations that eliminate critical tearing-type instabilities. Here, we report on the implementation of this numerical scheme in the global gyrokinetic particle-in-cell code GTS. This implementation allows for a more complete and accurate picture of interaction between small scale turbulence and MHD modes in tokamaks. Additionally, we present a comprehensive set of verification simulations of numerous electromagnetic instabilities relevant to present-day tokamaks. These simulations encompass the kinetic ballooning mode, the internal kink mode, the tearing mode, the micro-tearing mode, and the toroidal Alfven eigenmode destabilized by energetic ions, which are all instrumental in understanding tokamak physics. We will also showcase the preliminary nonlinear simulations of kinetic ballooning instabilities and (2,1) island formation due to tearing mode instability. These simulations validate the accuracy of the scheme implementation and pave the way for studying how these instabilities affect plasma confinement and performance.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Measuring the thermal conductivity of hydrogels with a bidirectional 3w method

Hydrogels are soft, water-absorbing polymer materials with diverse applications in biomedicine and agriculture. Recently, hydrogels have been proposed to encapsulate water-soluble phase change materials which store energy in their latent heat of solidification. In these applications, the thermal conductivity of these materials affects their performance. Few methods exist for measuring the thermal conductivity of small quantities of hydrogels. Here, we describe an implementation of the bidirectional 3w technique to measure the thermal conductivity of hydrogels with particular attention to their moisture content. Our implementation of the technique can probe sample volumes as little as ~20 mL and yields the thermal conductivity without requiring fitting of additional thermal parameters. We numerically simulate 3w sensor designs with frequency-domain 3-D models to quantify and reduce errors introduced by the choice of substrate and insulation layer thickness. Frequencies in the ~1−20 Hz range yield less error for the materials considered here. We verify our setup with measurements on water and report values for polyacrylamide and poly(2-acrylamido-2-methylpropane sulfonic acid) (PAMPS) hydrogels. Our swollen hydrogels exhibited thermal conductivities nearly equivalent to water, 0.6 W m-1 K-1, and we estimate thermal conductivities of 0.43 and 0.42 W m-1 K-1 for neat polyacrylamide and PAMPS, respectively. Finally, we estimate an error of ±7%, consistent with other 3ω methods, with the largest error coming from the sensor calibration. We find our implementation of the bidirectional 3w method gives reasonable results and can be employed for prototyping soft materials relevant for thermal storage.

3-omega, thermal conductivity, hydrogel, moisture ↗

MixPI: Mixed-time slicing path integral software for quantized molecular dynamics simulations

We introduce the MixPI software to implement path integral molecular dynamics (PIMD) simulations for the study of condensed phase systems where nuclear quantum effects (NQEs) are important. In contrast to existing PIMD simulation software, MixPI enables the implementation of mixed quantum–classical path integral simulations where only a subset of system degrees of freedom (dofs) are treated quantum mechanically in an extended phase space while the remaining dofs are described classically. We expect this software to be particularly useful for simulations of electron and proton transfer in condensed phase systems, as well as for the study of biological and material systems where only a handful of dofs contribute significantly to the observed NQEs. We demonstrate the use of MixPI in two different systems. The first is a simple water model where we implement a set of mixed quantum–classical simulations to compute average energy and radial distribution functions. We use these simulations to benchmark the effectiveness of MixPI and to demonstrate how it enables systematic investigation into the origin of observed NQEs. We then compute radial distribution functions for a system where MixPI is essential: a solvated metal (M 2+ ) cation described using an explicit quantized electron localized on an M 3+ ion in water.

chemical physics↗

Integrating vehicle trajectory planning and arterial traffic management to facilitate eco-approach and departure deployment

Eco-approach and departure (EAD) enable continuous vehicle motion in urban signalized corridors. Since such a motion can extend to the EAD vehicles’ followers, it makes EAD a promising technology to benefit the traffic flow where automated vehicles and conventional vehicles coexist. Most existing EAD studies envision an ideal setting that neglects real-world operational conditions such as lane changes, multi-movement intersection configuration, partially automated fleet, and/or limited traffic state awareness. This study aims to fill the gap by designing an EAD algorithm considering real-world traffic operation constraints. The proposed algorithm uses a model predictive controller to minimize vehicle speed reduction and variation based on the real-time traffic signal control plan and measured queues at the intersection. The required inputs are readily available at many modern intersections. We observed that the proposed controller’s performance might degrade because of lane-changing maneuvers and lead-left turn traffic signals. These observations motivated our development of a lane change management strategy and a signal control implementation strategy to facilitate the EAD implementation. The lane change management strategies separate the EAD operations and lane-changing maneuvers in time and space. The signal control implementation strategy applies lag-left turn signals to enable EAD operation for both the through and left-turn vehicles. Compared to the non-EAD case, our EAD approach produces 2.5% to 7.8% energy savings while keeping similar intersection mobility. Notably, this approach brings about 2.5% to 3.6% energy savings in a 2% CAV case. This result demonstrates the feasibility of deploying EAD at low connected automated vehicle penetration rates.

Arterial corridor management↗

Sequential Kalman tuning of the t -preconditioned Crank-Nicolson algorithm: efficient, adaptive and gradient-free inference for Bayesian inverse problems

Ensemble Kalman Inversion (EKI) has been proposed as an efficient method for the approximate solution of Bayesian inverse problems with expensive forward models. However, when applied to the Bayesian inverse problem EKI is only exact in the regime of Gaussian target measures and linear forward models. Here, in this work we propose embedding EKI and Flow Annealed Kalman Inversion, its normalizing flow (NF) preconditioned variant, within a Bayesian annealing scheme as part of an adaptive implementation of the t-preconditioned Crank-Nicolson (tpCN) sampler. The tpCN sampler differs from standard pCN in that its proposal is reversible with respect to the multivariate t-distribution. The more flexible tail behaviour allows for better adaptation to sampling from non-Gaussian targets. Within our Sequential Kalman Tuning (SKT) adaptation scheme, EKI is used to initialize and precondition the tpCN sampler for each annealed target. The subsequent tpCN iterations ensure particles are correctly distributed according to each annealed target, avoiding the accumulation of errors that would otherwise impact EKI. We demonstrate the performance of SKT for tpCN on three challenging numerical benchmarks, showing significant improvements in the rate of convergence compared to adaptation within standard SMC with importance weighted resampling at each temperature level, and compared to similar adaptive implementations of standard pCN. The SKT scheme applied to tpCN offers an efficient, practical solution for solving the Bayesian inverse problem when gradients of the forward model are not available. Code implementing the SKT schemes for tpCN is available at https://github.com/RichardGrumitt/KalmanMC.

97 MATHEMATICS AND COMPUTING↗

Emergency Radiation Dose Rate Monitoring During Prolonged Armed Conflict

The 2022 Russian full-scale invasion of Ukraine has introduced unprecedented challenges for the nuclear power generation and radiological safety communities, including occupation and disturbance of highly-contaminated areas, occupation of a nuclear power plant, and strikes near and within boundaries of nuclear sites. The war has necessitated the implementation of a supplementary dose rate sensor network to provide resilient measurement data for public protection and leadership awareness. This paper discusses the implementation of such a system, the factors determining what equipment is best suited for the purpose, and practical factors regarding deployment of the system and data management. The crucial factors for operating a supplementary dose rate sensing network are backup power and communications options for dose rate sensors to make the network resilient to the effects of military operations. The most important implementation factor is to plan for extended operations beyond those typically considered for emergency response given the unpredictable nature of warfare.

resilience↗

Numerical challenges in modeling gravothermal collapse in Self-Interacting Dark Matter halos

When dark matter has a large cross section for self scattering, halos can undergo a process known as gravothermal core collapse, where the inner core rapidly increases in density and temperature. To date, several methods have been used to implement Self-Interacting Dark Matter (SIDM) in N-body codes, but there has been no systematic study of these different methods or their accuracy in the core-collapse phase. In this paper, we compare three different numerical implementations of SIDM, including the standard methods from the GIZMO and Arepo codes, by simulating idealized dwarf halos undergoing significant dark matter self interactions (σ/m = 50 cm 2 /g). When simulating these halos, we also vary the mass resolution, time-stepping criteria, and gravitational force-softening scheme. The various SIDM methods lead to distinct differences in a halo's evolution during the core-collapse phase, as each results in spurious scattering rate differences and energy gains/losses. The use of adaptive force softening for gravity can lead to numerical heating that artificially accelerates core collapse, while an insufficiently small simulation time step can cause core evolution to stall or completely reverse. Additionally, particle numbers must be large enough to ensure that the simulated halos are not sensitive to noise in the initial conditions. Even for the highest-resolution simulations tested in this study (10 6 particles per halo), we find that variations of order 10% in collapse time are still present. Here, the results of this work underscore the sensitivity of SIDM modeling on the choice of numerical implementation and motivate a careful study of how these results generalize to halos in a cosmological context.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Soil management practices can contribute to net carbon neutrality in California

Stabilizing climate requires reducing greenhouse gas (GHG) emissions and storing atmospheric carbon dioxide (CO 2 ) in land or ocean systems. Soil management practices can reduce GHG emissions or sequester atmospheric CO 2 into inorganic and organic forms. However, whether soil carbon strategies represent a viable and impactful climate mitigation pathway is uncertain. A specific question concerns the role that land-management practices and soil amendments can play in realizing California's ambition for carbon neutrality by 2045. Here we examine the carbon flux impacts of soil conservation (i.e., compost, reduced tillage, cover crop) and enhanced silicate rock weathering (EW) practices at different areal extents of implementation in cropland, grassland, and savanna in California under two climate change cases. We show that with implementation areas of 15% or 50% of private cultivated land, grassland, and savanna in California, soil conservation practices alone can contribute $1.4^{2.1}_{0.7}$% ($-1.8^{-2.7}_{ -0.9}$ Mt CO 2 eq y -1 ) and $4.6^{6.9}_{2.3}$% ($-6.0^{-8.9}_{-3.0}$ Mt CO 2 eq y -1 ) of the additional emissions reduction needed (beyond previous targets) to meet the 2045 net neutrality goal (-129.3 Mt CO 2 eq y -1 ), respectively, on an average annual basis, including climate uncertainty. Including EW in these scenarios increases the total contributions of management practices to $4.1^{5.6}_{2.5}$% ($-5.2^{-7.3}_{-3.2}$ Mt CO 2 eq y -1 ) and $13.5^{18.6}_{8.2}$% ($-17.5^{-24.2}_{-10.7}$ Mt CO 2 eq y -1 ), respectively, of this reduction. This highlights that the extent of implementation area is a major factor in determining benefits and that EW has the potential to make a real contribution to net reduction targets. Results are similar across climate cases, indicating that contemporary field data can be used to make future projections. With EW there remains mechanistic uncertainties, however, such as rock dissolution rate and environmental controls on weathering products, which require additional field research to improve understanding of the technological efficacy of this approach for California's 2045 carbon neutrality goal.

54 ENVIRONMENTAL SCIENCES↗

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗

Harnessing large language models’ zero-shot and few-shot learning capabilities for regulatory research

Abstract Large language models (LLMs) are sophisticated AI-driven models trained on vast sources of natural language data. They are adept at generating responses that closely mimic human conversational patterns. One of the most notable examples is OpenAI's ChatGPT, which has been extensively used across diverse sectors. Despite their flexibility, a significant challenge arises as most users must transmit their data to the servers of companies operating these models. Utilizing ChatGPT or similar models online may inadvertently expose sensitive information to the risk of data breaches. Therefore, implementing LLMs that are open source and smaller in scale within a secure local network becomes a crucial step for organizations where ensuring data privacy and protection has the highest priority, such as regulatory agencies. As a feasibility evaluation, we implemented a series of open-source LLMs within a regulatory agency’s local network and assessed their performance on specific tasks involving extracting relevant clinical pharmacology information from regulatory drug labels. Our research shows that some models work well in the context of few- or zero-shot learning, achieving performance comparable, or even better than, neural network models that needed thousands of training samples. One of the models was selected to address a real-world issue of finding intrinsic factors that affect drugs' clinical exposure without any training or fine-tuning. In a dataset of over 700 000 sentences, the model showed a 78.5% accuracy rate. Our work pointed to the possibility of implementing open-source LLMs within a secure local network and using these models to perform various natural language processing tasks when large numbers of training examples are unavailable.

Biochemistry & Molecular Biology↗

CoverM: read alignment statistics for metagenomics

SUMMARY: Genome-centric analysis of metagenomic samples is a powerful method for understanding the function of microbial communities. Calculating read coverage is a central part of analysis, enabling differential coverage binning for recovery of genomes and estimation of microbial community composition. Coverage is determined by processing read alignments to reference sequences of either contigs or genomes. Per-reference coverage is typically calculated in an ad-hoc manner, with each software package providing its own implementation and specific definition of coverage. Here we present a unified software package CoverM which calculates several coverage statistics for contigs and genomes in an ergonomic and flexible manner. It uses "Mosdepth arrays" for computational efficiency and avoids unnecessary I/O overhead by calculating coverage statistics from streamed read alignment results. AVAILABILITY AND IMPLEMENTATION: CoverM is free software available at https://github.com/wwood/coverm. CoverM is implemented in Rust, with Python (https://github.com/apcamargo/pycoverm) and Julia (https://github.com/JuliaBinaryWrappers/CoverM_jll.jl) interfaces.

Aroney, Samuel T N↗

FluxRETAP: a REaction TArget Prioritization genome-scale modeling technique for selecting genetic targets

MOTIVATION: Metabolic engineering is rapidly evolving as a result of new advances in synthetic biology tools and automation platforms that enable high throughput strain construction, as well as the development of machine learning tools (ML) for biology. However, selecting genetic engineering targets that effectively guide the metabolic engineering process is still challenging. ML can provide predictive power for synthetic biology, but current technical limitations prevent the independent use of ML approaches without previous biological knowledge. RESULTS: Here, we present FluxRETAP, a simple and computationally inexpensive method that leverages the prior mechanistic knowledge embedded in genome-scale models for suggesting targets for genetic overexpression, downregulation or deletion, with the final goal of increasing the production of a desired metabolite. This method can provide a list of desirable engineering targets that can be combined with current ML pipelines. FluxRETAP captured 100% of reaction targets experimentally verified to improve Escherichia coli isoprenol production, 50% of targets that experimentally improved taxadiene production in E. coli and ∼60% of genetic targets from a verified minimal constrained cut-set in Pseudomonas putida, while providing additional high priority targets that could be tested. Overall, FluxRETAP is an efficient algorithm for identifying a prioritized list of testable genetic and reaction targets. AVAILABILITY AND IMPLEMENTATION: FluxRETAP is implemented in python and released under the creative commons license. The implementation and code are freely available at: https://github.com/JBEI/FluxRETAP.

Czajka, Jeffrey J↗

Fault-tolerant resource comparison of qudit and qubit encodings for diagonal quadratic operators

Finite local Hilbert-space truncations arise naturally in quantum simulations of lattice field theories and motivate qudit encodings, but their fault-tolerant advantage over qubit encodings remains unclear. We compare the non-Clifford cost of implementing quadratic diagonal evolutions, exemplified by 𝑈 = 𝑒$^{−𝑖⁢𝑡⁢𝜙^2_𝑥}$ in a uniform field-amplitude discretization of a real scalar field, using either one logical 𝑑-level qudit or 𝑛 𝑏 = ⌈log 2⁡ 𝑑⌉ logical qubits. We analyze two standard settings: product-formula simulation and linear combination of unitaries (LCU) per block encoding, taking the resource metric to be the number of non-Clifford gates after synthesis into a discrete logical gate set. Because tight synthesis bounds for general single-qudit rotations are not known, we express the qudit constructions in terms of embedded two-level SU⁡(2) rotations and derive explicit finite-𝑑 break-even conditions for their synthesis cost; these serve as compiler targets for when qudit encodings can outperform the qubit baseline. Within the constructive models studied here, product-formula implementations would require an exponentially stronger per-primitive synthesis advantage for qudits to win asymptotically, while in the LCU setting the qubit encoding is asymptotically cheaper in 𝑑. Nevertheless, the finite-𝑑 threshold analysis identifies low-dimensional regions in which qudits can yield meaningful constant-factor savings, particularly for LCU-based implementations. As a secondary analysis of the LCU construction, we use an idealized negligible-overhead qubit-qudit code-switching model to give an absolute 𝑇-count comparison and reinterpret the savings as an allowable per-switch overhead budget.

Godwood, Samuel [Univ. of Liverpool (United Kingdo↗

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗

Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits

Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from a small set of primitive gates, often resulting in a long gate sequence, which is typically a leading factor in the total accumulated error. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary, since an even longer gate sequence is required. Optimal control methods promise time- and resource-efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can directly implement any complex unitary on a quantum device. In this work, we demonstrate that any arbitrary qubit and qutrit gate can be realized with high fidelity, which can significantly reduce the length of a gate sequence. We generate and test pulses for a large set of randomly selected arbitrary unitaries on several quantum processing units (QPUs): the Lawrence Livermore National Laboratory Quantum Device and Integration Testbed’s (QuDIT’s) standard QPU and three of Rigetti’s QPUs: Ankaa-2, Ankaa-9Q-1, and Aspen-M-3. On the QuDIT platform’s standard QPU, the average fidelity of random qutrit gates is 97.9 ± 0.5% measured with conventional QPT and 98.8 ± 0.6% from QPT with gate folding. Rigetti’s Ankaa-2 achieves random qubit gates with an average fidelity of 98.4 ± 0.5% (conventional QPT) and 99.7 ± 0.1% (QPT with gate folding). On Ankaa-9Q-1 and Aspen-M-3, the average fidelities with conventional qubit QPT measurements were higher than 99% (see Appendix). Here we show that optimal control gates are robust to drift for at least 3 h and that the same calibration parameters can be used for all implemented gates. Our work promises that the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗