Search NASA⌕ Search

SEARCH · Search NASA

Results for “IBM”

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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

The impact of kinetic and global effects on ideal ballooning 2nd stable pedestals of conventional and low aspect-ratio tokamaks

The EPED model (Snyder et al 2011 Nucl. Fusion 51 103016) has had success in describing the pedestal structure of Type-I ELM and QH-mode plasmas in tokamaks, by combining kinetic ballooning mode (KBM) and peeling–ballooning (PB) constraints. Within EPED, the KBM constraint is often approximated by a technique using calculated ideal ballooning mode (IBM) thresholds, fit to a functional form designed to capture non-local effects. It has been noted that quantitative differences between local ideal MHD and gyro-kinetic (GK) ballooning stability can be larger at low aspect ratio. KBM critical pedestals are consistent with observations in initial studies on conventional and spherical tokamaks. In this work, the application of a reduced model for the calculation of the kinetic ballooning stability boundary is presented based on a novel and newly developed gyro-fluid system (GFS) code (Staebler et al 2023 Phys. Plasmas 30 102501). GFS is observed to capture KBMs in DIII-D as well as the NSTX pedestals, opening a route to integrating this model into EPED. Finally, high but finite $n$ global ballooning modes are observed to limit the access to the local 2nd stability and thus provide a transport mechanism that constrains the pedestal evolution with $β_{p,\textrm{ped}}$. The high $n$ global ballooning stability is approximated by its ideal MHD analog using ELITE. It is shown that nearly-local high $n$ modes with $k_yρ_s$ ~ $0.25 - 0.5$ can provide a proxy for the critical $β_{p,\textrm{ped}}$ when a 2nd stable access exists on DIII-D plasmas. The use of GFS and ELITE scaling in EPED provides improved agreement to EPED1 in an initial comparison with DIII-D pedestal data.

Anastopoulos Tzanis, Michail Savvas [Oak Ridge Nat↗
DOE OSTI2026

Supporting multiple hardware architectures at CMS: the integration and validation of POWER9

Computing resources in the Worldwide LHC Computing Grid (WLCG) have been based entirely on the x86 architecture for more than two decades. In the near future, however, heterogeneous non-x86 resources, such as ARM, POWER and Risc-V, will become a substantial fraction of the resources that will be provided to the LHC experiments, due to their presence in existing and planned world-class HPC installations. The CMS experiment, one of the four large detectors at the LHC, has started to prepare for this situation, with the CMS software stack (CMSSW) already compiled for multiple architectures. In order to allow for a production use, the tools for workload management and job distribution need to be extended to be able to exploit heterogeneous architectures. Profiting from the opportunity to exploit the first sizable IBM Power9 allocation available on Marconi100 HPC system at CINECA, CMS developed all the needed modifications to the CMS workload management system. After a successful proof of concept, a full physics validation has been performed in order to bring the system in production. The experiences are of very high value, when it comes to commissioning of the similar (even larger) Summit HPC system at Oak Ridge, where CMS is also expecting a resource allocation. Moreover the compute power of those systems is being provided also via GPUs and this represents an extremely valuable opportunity to exploit the offloading capability already implemented in CMSSW. The status of the current integration including the exploitation of the GPUs, the results of the validation as well as the future plans will be shown and discussed.

Boccali, Tommaso [INFN, Pisa]↗
DOE OSTI2020

Domain-specific compilers for dynamic simulations of quantum materials on quantum computers

Abstract Simulation of the dynamics of quantum materials is emerging as a promising scientific application for noisy intermediate-scale quantum (NISQ) computers. Due to their high gate-error rates and short decoherence times, however, NISQ computers can only produce high-fidelity results for those quantum circuits smaller than some given circuit size. Dynamic simulations, therefore, pose a challenge as current algorithms produce circuits that grow in size with each subsequent time-step of the simulation. This underscores the crucial role of quantum circuit compilers to produce executable quantum circuits of minimal size, thereby maximizing the range of physical phenomena that can be studied within the NISQ fidelity budget. Here, we present two domain-specific (DS) quantum circuit compilers for the Rigetti and IBM quantum computers, specifically designed to compile circuits simulating dynamics under a special class of time-dependent Hamiltonians. The compilers outperform state-of-the-art general-purpose compilers in terms of circuit size reduction by around 25%–30% as well as wall-clock compilation time by around 40% (dependent on system size and simulation time-step). Drawing on heuristic techniques commonly used in artificial intelligence, both compilers scale well with simulation time-step and system size. Code for both compilers is open-source and packaged into a full-stack quantum simulation software with tutorials included for ease of use for future researchers wishing to perform dynamic simulations of quantum materials on quantum computers. As our DS compilers provide significant improvements in both compilation time and simulation fidelity, they provide a building block for accelerating progress toward physical quantum supremacy.

Physics↗
DOE OSTI2022

Experimental error mitigation using linear rescaling for variational quantum eigensolving with up to 20 qubits

Quantum computers have the potential to help solve a range of physics and chemistry problems, but noise in quantum hardware currently limits our ability to obtain accurate results from the execution of quantum-simulation algorithms. Various methods have been proposed to mitigate the impact of noise on variational algorithms, including several that model the noise as damping expectation values of observables. In this work, we benchmark various methods, including a new method proposed here. Here, we compare their performance in estimating the ground-state energies of several instances of the 1D mixed-field Ising model using the variational-quantum-eigensolver algorithm with up to 20 qubits on two of IBM's quantum computers. We find that several error-mitigation techniques allow us to recover energies to within 10% of the true values for circuits containing up to about 25 ansatz layers, where each layer consists of CNOT gates between all neighboring qubits and Y-rotations on all qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Quantum computer-enabled receivers for optical communication

Abstract Optical communication is the standard for high-bandwidth information transfer in today’s digital age. The increasing demand for bandwidth has led to the maturation of coherent transceivers that use phase- and amplitude-modulated optical signals to encode more bits of information per transmitted pulse. Such encoding schemes achieve higher information density, but also require more complicated receivers to discriminate the signaling states. In fact, achieving the ultimate limit of optical communication capacity, especially in the low light regime, requires coherent joint detection of multiple pulses. Despite their superiority, such joint detection receivers are not in widespread use because of the difficulty of constructing them in the optical domain. In this work we describe how optomechanical transduction of phase information from coherent optical pulses to superconducting qubit states followed by the execution of trained short-depth variational quantum circuits can perform joint detection of communication codewords with error probabilities that surpass all classical, individual pulse detection receivers. Importantly, we utilize a model of optomechanical transduction that captures non-idealities such as thermal noise and loss in order to understand the transduction performance necessary to achieve a quantum advantage with such a scheme. We also execute the trained variational circuits on an IBM-Q device with the modeled transduced states as input to demonstrate that a quantum advantage is possible even with current levels of quantum computing hardware noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Global adjoint tomography—model GLAD-M25

SUMMARY Building on global adjoint tomography model GLAD-M15, we present transversely isotropic global model GLAD-M25, which is the result of 10 quasi-Newton tomographic iterations with an earthquake database consisting of 1480 events in the magnitude range 5.5 ≤ Mw ≤ 7.2, an almost sixfold increase over the first-generation model. We calculated fully 3-D synthetic seismograms with a shortest period of 17 s based on a GPU-accelerated spectral-element wave propagation solver which accommodates effects due to 3-D anelastic crust and mantle structure, topography and bathymetry, the ocean load, ellipticity, rotation and self-gravitation. We used an adjoint-state method to calculate Fréchet derivatives in 3-D anelastic Earth models facilitated by a parsimonious storage algorithm. The simulations were performed on the Cray XK7 ‘Titan’ and the IBM Power 9 ‘Summit’ at the Oak Ridge Leadership Computing Facility. We quantitatively evaluated GLAD-M25 by assessing misfit reductions and traveltime anomaly histograms in 12 measurement categories. We performed similar assessments for a held-out data set consisting of 360 earthquakes, with results comparable to the actual inversion. We highlight the new model for a variety of plumes and subduction zones.

58 GEOSCIENCES↗
DOE OSTI2026

Scattering phase shift in quantum mechanics on quantum computers

Here, we investigate the feasibility of extracting infinite volume scattering phase shift on quantum computers in a simple one-dimensional quantum mechanical model, using the formalism established in the work by Guo and Gasparian [Phys. Rev. D 108, 074504 (2023)] that relates the integrated correlation functions for a trapped system to the infinite volume scattering phase shifts through a weighted integral. The system is first discretized in a finite box with periodic boundary conditions, and the formalism in real time is verified by employing a contact interaction potential with exact solutions. Quantum circuits are then designed and constructed to implement the formalism on current quantum computing architectures. To overcome the fast oscillatory behavior of the integrated correlation functions in real-time simulation, different methods of postdata analysis are proposed and discussed. Test results on IBM hardware show that good agreement can be achieved with two qubits, but complete failure ensues with three qubits due to two-qubit gate operation errors and thermal relaxation errors.

Guo, Peng [Dakota State Univ., Madison, SD (United↗
DOE OSTI2025

Collective neutrino oscillations in three flavors on qubit and qutrit processors

Collective neutrino flavor oscillations are of primary importance in understanding the dynamic evolution of core-collapse supernovae and subsequent terrestrial detection, but also among the most challenging aspects of numerical simulations. This situation is complicated by the quantum many-body nature of the problem due to neutrino-neutrino interactions, which demands a quantum treatment. An additional complication is the presence of three flavors, which often is approximated by the electron flavor and a heavy lepton flavor. In this work, we provide both qubit and qutrit encodings for all three flavors, and develop optimized quantum circuits for the time evolution and analyze the Trotter error. We conclude our study with a hardware experiment of a system of two neutrinos with superconducting hardware: the IBM Torino device for qubits and Advanced Quantum Testbed device at the Lawrence Berkeley National Laboratory for qutrits. We find that error mitigation greatly helps in obtaining a signal consistent with simulations. Finally, while hardware results are comparable at this stage, we expect the qutrit setup to be more convenient for large-scale simulations since it does not suffer from probability leakage into nonphysical qubit space, unlike the qubit setup.

Neutrino oscillations↗
DOE OSTI2026

Superdiffusion resilience in Heisenberg chains with two-dimensional interactions on a quantum processor

Superdiffusive spin transport in the one-dimensional (1D) Heisenberg model is a key theoretical discovery in nonequilibrium quantum many-body physics. Although extensively studied in 1D systems, the breakdown and sustenance of superdiffusion in two-dimensional (2D) lattices with integrability-breaking terms, as found in real materials, remains an open question. To address this, we develop a toy model that extends the 1D Heisenberg model with a representative set of 2D interaction types and tunable strengths. Our model exhibits varying degrees of superdiffusion breakdown depending on the interaction type, spanning ballistic to diffusive regimes. We establish and justify a hierarchy of 2D interactions based on their resilience against superdiffusion breakdown: Heisenberg >𝑋⁢𝑋 > Ising. This precise control over the superdiffusive behavior also enables rigorous benchmarking of quantum hardware, and our simulations on IBM's Heron devices confirm the hardware's ability to accurately capture these many-body nonequilibrium phenomena. Overall, our results are relevant not only to simulating superdiffusion in real materials, such as the 1D Heisenberg compound KCuF3, which contains modest nonintegrable 2D terms, but also to extending superdiffusive behavior to larger 2D qubit lattices and other 2D materials.

Alagarsamy Manikandan, Keerthi Kumaran [ORNL]↗
DOE OSTI2020

Benchmarking noise extrapolation with the OpenPulse control framework

Distilling precise estimates from noisy intermediate scale quantum (NISQ) data has recently attracted considerable attention Kandala et al., Nature (London) 567, 491 (2019). In order to augment digital qubit metrics, such as gate fidelity, we discuss analog error mitigability, i.e., the ability to accurately distill precise observable estimates, as a hybrid quantum classical computing benchmarking task. Specifically, using Rabi oscillations as a test program, we characterize single qubit error rates on IBM's Poughkeepsie superconducting quantum hardware, incorporate control-mediated noise dependence into a generalized rescaling protocol, and analyze how noise characteristics influence Richardson extrapolation-based error mitigation. Finally, our results identify regions in the space of Hamiltonian control fields and circuit depth which are most amenable to reliable noise extrapolation, as well as shed light on how low-level hardware characterization can be used as a predictive tool for uncertainty quantification in error-mitigated NISQ computations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Minimally entangled state preparation of localized wave functions on quantum computers

Initializing a single site of a lattice scalar field theory into an arbitrary state with support throughout the quantum register requires $O(2^{nQ})$ entangling gates on a quantum computer with $n_Q$ qubits per site. It is conceivable that instead initializing to functions that are good approximations to states may have utility in reducing the number of required entangling gates. In the case of a single site of a noninteracting scalar field theory, initializing to a symmetric exponential wave function requires $n_Q – 1$ entangling gates, the minimal number necessary to create an entangled state of all $n_Q$ qubits. This is compared with the $2^{nQ – 1} + n_Q – 3 + δ_{nQ, 1}$ required for a symmetric Gaussian wave function. In this work, we explore the initialization of one-site $(n_Q = 4)$, two-site $(n_Q = 3)$, and three-site ( n Q = 3 ) noninteracting scalar field theories with symmetric exponential wave functions using IBM's quantum simulators and quantum devices (Poughkeepsie and Tokyo). With the digitizations attainable with $n_Q = 3,4$, these tensor-product wave functions are found to have large overlap with a Gaussian wave function and provide a suitable low-noise initialization for improvement and Somma inflation. Further, in performing these simulations, we have employed a workflow that interleaves calibrations to mitigate systematic errors in production. The calibrations allow tolerance cuts on gate performance including the fidelity of the symmetrizing Hadamard gate, both in vacuum $(|\textbf{0}\gg^{\bigotimes nQ})$ and in medium ($n_Q –1$ qubits initialized to an exponential function). The results obtained in this work are relevant to systems beyond scalar field theories, such as the deuteron radial wave function, two- and three-dimensional Cartesian-space wave functions, and nonrelativistic multinucleon systems built on a localized eigenbasis.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark

The LINPACK benchmark reports the performance of a computer for solving a system of linear equations with dense random matrices. Although this task was not designed with a real application directly in mind, the LINPACK benchmark has been used to define the list of TOP500 supercomputers since the debut of the list in 1993. We propose that a similar benchmark, called the quantum LINPACK benchmark, could be used to measure the whole machine performance of quantum computers. The success of the quantum LINPACK benchmark should be viewed as the minimal requirement for a quantum computer to perform a useful task of solving linear algebra problems, such as linear systems of equations. We propose an input model called the Random Circuit Block-Encoded Matrix (RACBEM), which is a proper generalization of a dense random matrix in the quantum setting. The RACBEM model is efficient to be implemented on a quantum computer and can be designed to optimally adapt to any given quantum architecture, with relying on a black-box quantum compiler. Besides solving linear systems, the RACBEM model can be used to perform a variety of linear algebra tasks relevant to many physical applications, such as computing spectral measures, time series generated by a Hamiltonian simulation, and thermal averages of the energy. We implement these linear algebra operations on IBM Q quantum devices as well as quantum virtual machines, and demonstrate their performance in solving scientific computing problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Quantum simulation of nuclear inelastic scattering

We present a time-dependent quantum algorithm for nuclear inelastic scattering in the time-dependent basis function on qubits approach. This algorithm aims to quantum simulate a subset of the nuclear inelastic scattering problems that are of physical interest in which the internal degrees of freedom of the reaction system are excited by time-dependent external interactions. We expect that our algorithm will enable an exponential speedup in simulating the dynamics of the subset of the inelastic scattering problems, which would also be advantageous for the applications to more complicated scattering problems. For a demonstration problem, we solve for the Coulomb excitation of the deuteron, where the quantum simulations are performed with IBM Qiskit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum state preparation by adiabatic evolution with custom gates

Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These implementation times can be significantly reduced by realizing these circuits with custom gates. Using classical computing, we model the output of a realistic two-qubit processor implementing the adiabatic evolution of a two-spin system by means of custom gates. This modeled output is then compared with the results of quantum simulations solving the same problem on IBM Quantum (IBMQ) systems. Additionally, when used to emulate the behavior of the IBMQ quantum circuit, our realistic model yields state fidelities ranging from 65% to 85%, similar to the actual performance of a diverse set of IBMQ devices. When we reduced the implementation time by using custom gates, however, the loss of fidelity was reduced by at least a factor of 4, allowing us to accurately extract the energy of the target state. This improvement is enough to render adiabatic evolution useful for quantum state preparation for small systems or as a preconditioner for other state preparation methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Parametrized process characterization with reduced resource requirements

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This study proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the X and Y axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix χ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum simulation of quantum phase transitions using the convex geometry of reduced density matrices

Transitions of many-particle quantum systems between distinct phases at absolute-zero temperature, known as quantum phase transitions, require an exacting treatment of particle correlations. Here in this work, we present a general quantum-computing approach to quantum phase transitions that exploits the geometric structure of reduced density matrices. While typical approaches to quantum phase transitions examine discontinuities in the order parameters, the origin of phase transitions—their order parameters and symmetry breaking—can be understood geometrically in terms of the set of two-particle reduced density matrices (2-RDMs). The convex set of 2-RDMs provides a comprehensive map of the quantum system including its distinct phases as well as the transitions connecting these phases. Because 2-RDMs can potentially be computed on quantum computers at nonexponential cost, even when the quantum system is strongly correlated, they are ideally suited for a quantum-computing approach to quantum phase transitions. We compute the convex set of 2-RDMs for a Lipkin-Meshkov-Glick spin model on IBM superconducting-qubit quantum processors. Even though computations are limited to few-particle models due to device noise, comparisons with a classically solvable 1000-particle model reveal that the finite-particle quantum solutions capture the key features of the phase transitions including the strong correlation and the symmetry breaking.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Quantum simulations of hydrodynamics via the Madelung transformation

Developing numerical methods to simulate efficiently nonlinear fluid dynamics on universal quantum computers is a challenging problem. In this paper, a generalization of the Madelung transform is defined to solve quantum relativistic charged fluid equations interacting with external electromagnetic forces via the Dirac equation. The Dirac equation is discretized into discrete-time quantum walks which can be efficiently implemented on universal quantum computers. A variant of this algorithm is proposed to implement simulations using current noisy intermediate scale quantum (NISQ) devices in the case of homogeneous external forces. High resolution (up to N=2 17 grid points) numerical simulations of relativistic and nonrelativistic hydrodynamical shocks on current IBM NISQs are performed with this algorithm. Here, this paper demonstrates that fluid dynamics can be simulated on NISQs, and opens the door to simulating other fluids, including plasmas, with more general quantum walks and quantum automata.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗