Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum computing models”

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

Sparse non-Markovian Noise Modeling of Transmon-Based Multi-Qubit Operations

The influence of noise on quantum dynamics is one of the main factors preventing current quantum processors from performing accurate quantum computations. Sufficient noise characterization and modeling can provide key insights into the effect of noise on quantum algorithms and inform the design of targeted error protection protocols. However, constructing effective noise models that are sparse in model parameters, yet predictive can be challenging. In this work, we present an approach for effective noise modeling of multi-qubit operations on transmon-based devices. Through a comprehensive characterization of seven devices offered by the IBM Quantum Platform, we show that the model can capture and predict a wide range of single- and two-qubit behaviors, including non-Markovian effects resulting from spatiotemporally correlated noise sources. The model’s predictive power is further highlighted through multi-qubit dynamical decoupling demonstrations and an implementation of the variational quantum eigensolver. As a training proxy for the hardware, we show that the model can predict expectation values within a relative error of 0.5%; this is a sevenfold improvement over default hardware noise models. Through these demonstrations, we highlight key error sources in superconducting qubits and illustrate the utility of reduced noise models for predicting hardware dynamics.

open quantum systems & decoherence↗
DOE OSTI2025

HPC-Driven Modeling with ML-Based Surrogates for Magnon-Photon Dynamics in Hybrid Quantum System

Here, we introduce a hybrid computational framework that merges HPC-based numerical solvers with physics-informed ML surrogates for efficient modeling of magnon-photon interactions. By running short-duration, high-fidelity Maxwell-LLG simulations and feeding their results into an ML model, we substantially cut simulation time while achieving accurate predictions across larger spatiotemporal domains.

Accuracy↗
NASA NTRSDate not supplied

Quantum-Compatible Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

Wildfire occurrences have been increasing for the past decade, leaving devastating traces across the world. In the recent efforts, remote sensing and airborne missions have been utilized to better understand and manage wildfires. This has resulted in an exponential increase in volume of remote sensing data, which has pushed the need for intelligent automation of data extraction for wildfire studies. Machine learning offers accurate automation in detecting such natural anomalies and enable decision-makers to take actions in a timely manner. Recent advances in machine learning algorithms, namely probabilistic generative methods, allow researchers and decisionmakers to step beyond detection and study “what-if” scenarios for wildfire occurrences. Additionally, they offer better imitations to the stochastic behavior of nature, and wildfire events. However, optimizing the performance of these probabilistic generative models is a computationally expensive process, specially using digital computers. On the other hand, quantum computers have recently shown a promise to reduce computationally costly training of such models and provide performance improvements. There is a body of research investigating the potential for improved machine learning methods in which key operations are performed on a quantum computer. In this study, we propose a probabilistic image-toimage segmentation approach combining a very well-known segmentation method, U-NET, with a Conditional Variational Auto-Encoder (CVAE) to not only detect wildfires but also describe the stochasticity of the phenomenon and be capable of running “what-if” scenarios. Our proposed model is compatible with training on quantum computers, which results in a quantum-assisted image-to-image segmentation approach and can be used to benchmark the potential benefit of quantum computing over the classical one.

quantum↗
DOE OSTI2026

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗
DOE OSTI2025

Surrogate-constructed scalable-circuits adaptive variational quantum eigensolver in the Schwinger model

Inspired by recent advancements in simulating periodic systems on quantum computers, we develop an approach to further advance the simulation of these systems, named (SC) 2 -ADAPT-VQE. Our approach extends the scalable-circuits ADAPT-VQE framework, which builds an ansatz from a pool of coordinate-invariant operators defined for arbitrarily large, though not arbitrarily small, volumes. Our method uses a classically tractable “surrogate constructed” method to remove irrelevant operators from the pool, reducing the minimum size for which the scalable circuits are defined. Bringing together the scalable circuits and the surrogate constructed approaches forms the core of the (SC) 2 methodology. Our approach allows for a wider set of classical computations on small volumes, which can be used for a more robust extrapolation protocol. While developed in the context of lattice models, the surrogate construction portion is applicable to a wide variety of problems where information about the relative importance of operators in the pool is available. As an example, we use it to compute the properties of the Schwinger model—quantum electrodynamics for a single, massive fermion in 1 +1 dimensions—and show that our method can be used to accurately extrapolate to the continuum limit.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗
DOE OSTI2026

Quantum simulation of massive Thirring and Gross--Neveu models for arbitrary number of flavors

The study of fermionic quantum field theories is an important problem for realizing the standard model of particle physics on a quantum computer. As a step towards this goal, we consider the massive Thirring and Gross--Neveu models with arbitrary number of fermion flavors, $N_f$, discretized on a spatial one-dimensional lattice of size $L$ in the Hamiltonian formulation. We compute the gate complexity using the higher-order product formula and using block-encoding/qubitization and quantum singular value transformations in the limit of large $N_f$ and $L$. We also prepare the ground states of both models with excellent fidelity for system sizes up to 20 qubits with $N_f = 1,2,3,4$ using the adaptive-variational quantum imaginary time algorithm. In addition, we also classify the dynamical Lie algebras of these relativistic fermionic models and show that they belong to the same isomorphism class. Our work is a concrete step towards the quantum simulation of real-time dynamics of large $N_f$ fermionic quantum field theories models relevant for chiral symmetry breaking, understanding dimensional transmutation, and exploring the conformal window of field theories on near-term and early fault-tolerant quantum computers.

FOS: Physical sciences↗
DOE OSTI2026

Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications

This tutorial offers a pedagogical guide to hybrid quantum processors that integrate discrete-variable (DV) qubits and continuous-variable (CV) oscillators. Aimed at computer scientists, engineers, and physicists, it provides an overview of the experimental, algorithmic, and architectural aspects of this novel and rapidly developing hardware model. Experimental realizations of this model include superconducting, trapped-ion, and neutral-atom platforms. By combining DV and CV components, hybrid oscillator-qubit processors enable a powerful new paradigm that offers complementary strengths for quantum control, error correction, computation, and simulation. Working toward the goal of a full-stack system connecting applications to CV-DV hardware, we define and formulate abstract machine models and instruction set architectures. These essential abstractions enable codesign of hardware and software, and resource estimation for exploring the potential of current and future hardware for computational and simulation tasks. Using these abstractions, we present both new and existing examples that illustrate the benefits of hybrid CV-DV processors relative to traditional DV-only hardware in computation as well as quantum simulation of physical models. Examples include algorithms for transferring states between DV and CV systems, performing the quantum Fourier transform, and simulation of lattice gauge theories. Relative to qubit-only hardware, the bosonic degrees of freedom natively available in hybrid architectures can substantially reduce the circuit complexity of simulations for physical models containing bosons. A key technique is the extension of quantum signal processing ideas to CV-DV systems. This work is intended to serve as a timely and comprehensive guide to this relatively unexplored yet promising approach to quantum computation and to provide a road map to guide future development.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Capturing the Page curve and entanglement dynamics of black holes in quantum computers

Quantum computers are emerging technologies expected to become important tools for exploring various aspects of fundamental physics in the future. Therefore, we pose the question of whether quantum computers can help us to study the Page curve and the black hole information dynamics, which has been a key focus in fundamental physics. In this regard, we rigorously examine the qubit transport model, a toy qubit model of black hole evaporation on IBM’s superconducting quantum computers, to shed light on this question. Specifically, we implement the quantum simulation of the scrambling dynamics in black holes using an efficient random unitary circuit. Furthermore, we employ the swap-based many-body interference protocol and the randomized measurement protocol to measure the entanglement entropy of Hawking radiation qubits in this model. Finally, by incorporating quantum error mitigation techniques into our challenging implementation of entanglement entropy measurement protocols on the IBM quantum hardware, we accurately determine the Rényi entropy in the qubit transport model, thus showcasing the utility of quantum computers for future investigations of complex quantum systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Trigonometric continuous-variable gates and hybrid quantum simulations of the sine-Gordon model

Hybrid qubit-qumode quantum computing platforms provide a natural setting for simulating interacting bosonic quantum field theories. However, existing continuous-variable gate constructions rely predominantly on polynomial functions of canonical quadratures. In this work, we introduce a complementary universality paradigm based on trigonometric continuous-variable gates, which enable a Fourier-like representation of bosonic operators and are particularly well suited for periodic and non-perturbative interactions. We present an ancilla-based framework for implementing trigonometric gates with arguments given by arbitrary Hermitian functions of qumode quadratures. The protocol yields unitary gates deterministically, and non-unitary gates through probabilistic post-selection. As a concrete application, we develop a hybrid qubit-qumode quantum simulation of the lattice sine-Gordon model. Using these gates, we prepare ground states via quantum imaginary-time evolution, simulate real-time dynamics, compute time-dependent vertex two-point correlation functions, and extract quantum kink profiles under topological boundary conditions. Our results demonstrate that trigonometric continuous-variable gates provide a physically natural framework for simulating interacting field theories on near-term hybrid quantum hardware, while establishing a parallel route to universality beyond polynomial gate constructions. We expect that the trigonometric gates introduced here to find broader applications, including quantum simulations of condensed matter systems, quantum chemistry, and biological models.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

Cryogenic thermal modeling of microwave high density signaling

Superconducting quantum computers require microwave control lines running from room temperature to the mixing chamber of a dilution refrigerator. Adding more lines without preliminary thermal modeling to make predictions risks overwhelming the cooling power at each thermal stage. In this paper, we investigate the thermal load of SC-086/50-SCN-CN semi-rigid coaxial cable, which is commonly used for the control and readout lines of a superconducting quantum computer, as we increase the number of lines to a quantum processor. We investigate the makeup of the coaxial cables, verify the materials and dimensions, and experimentally measure the total thermal conductivity of a single cable as a function of the temperature from cryogenic to room temperature values. We also measure the cryogenic DC electrical resistance of the inner conductor as a function of temperature, allowing for the calculation of active thermal loads due to Ohmic heating. Fitting this data produces a numerical thermal conductivity function used to calculate the static heat loads due to thermal transfer within the wires resulting from a temperature gradient. The resistivity data is used to calculate active heat loads, and we use these fits in a cryogenic model of a superconducting quantum processor in a typical Bluefors XLD1000-SL dilution refrigerator, investigating how the thermal load increases with processor sizes ranging from 100 to 225 qubits. We conclude that the theoretical upper limit of the described architecture is approximately 200 qubits. However, including an engineering margin in the cooling power and the available space for microwave readout circuitry at the mixing chamber, the practical limit is approximately 140 qubits.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2025

Simulators for quantum network modeling: A comprehensive review

Quantum network research is exploring new networking protocols, physics-based hardware and novel experiments to demonstrate how quantum distribution will work over large distances. Current work explores much of these concepts in simulations, that are developed to understand how quantum networking will be set up and researchers can experiment virtually. Exposing flaws in network designs, like unsustainable topologies, or develop protocols that efficiently utilize network resources, simulators can also help assess whether workloads are balanced across virtual machines in the network. However, much of these simulation models come without reliable verification methods, for testing performance in real deployments. Here, in this paper, we present a review of, to the best of our knowledge, currently used toolkits for modeling quantum networks. With these toolkits and standardized validation techniques, we can lay down the foundations for more accurate and reliable quantum network simulators.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Classical combinatorial optimization scaling for random Ising models on 2D heavy-hex graphs

Motivated by near term quantum computing hardware limitations, combinatorial optimization problems that can be addressed by current quantum algorithms and noisy hardware with little or no overhead are used to probe capabilities of quantum algorithms such as the quantum approximate optimization algorithm. In this study, a specific class of near term quantum computing hardware defined combinatorial optimization problems, Ising models on heavy-hex graphs both with and without geometrically local cubic terms, are examined for their classical computational hardness via empirical computation time scaling quantification. Specifically the time-to-solution (TTS) metric using the classical heuristic simulated annealing is measured for finding optimal variable assignments (ground states), as well as the time required for the optimization software Gurobi to find an optimal variable assignment. Because of the sparsity of these Ising models, the classical algorithms are able to find optimal solutions efficiently even for large instances (i.e. 100 000 spin variables). The Ising models both with and without geometrically local cubic terms exhibit average-case linear-time or weakly quadratic scaling when solved exactly using Gurobi, and the Ising models with no cubic terms show evidence of exponential-time TTS scaling when sampled using simulated annealing. These findings point to the necessity of developing and testing more complex, namely more densely connected, optimization problems in order for quantum computing to ever have a practical advantage over classical computing. Our results are another illustration that different classical algorithms can indeed have exponentially different running times, thus making the identification of the best practical classical technique important in any quantum computing vs. classical computing comparison.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1984

Reversibility and stability of information processing systems

Classical and quantum models of dynamically reversible computers are considered. Instabilities in the evolution of the classical 'billiard ball computer' are analyzed and shown to result in a one-bit increase of entropy per step of computation. 'Quantum spin computers', on the other hand, are not only microscopically, but also operationally reversible. Readoff of the output of quantum computation is shown not to interfere with this reversibility. Dissipation, while avoidable in principle, can be used in practice along with redundancy to prevent errors.

Zurek, W. H.↗
NASA NTRS2003

Switching and Rectification in Carbon-Nanotube Junctions

Multi-terminal carbon-nanotube junctions are under investigation as candidate components of nanoscale electronic devices and circuits. Three-terminal "Y" junctions of carbon nanotubes (see Figure 1) have proven to be especially interesting because (1) it is now possible to synthesize them in high yield in a controlled manner and (2) results of preliminary experimental and theoretical studies suggest that such junctions could exhibit switching and rectification properties. Following the preliminary studies, current-versus-voltage characteristics of a number of different "Y" junctions of single-wall carbon nanotubes connected to metal wires were computed. Both semiconducting and metallic nanotubes of various chiralities were considered. Most of the junctions considered were symmetric. These computations involved modeling of the quantum electrical conductivity of the carbon nanotubes and junctions, taking account of such complicating factors as the topological defects (pentagons, heptagons, and octagons) present in the hexagonal molecular structures at the junctions, and the effects of the nanotube/wire interfaces. A major component of the computational approach was the use of an efficient Green s function embedding scheme. The results of these computations showed that symmetric junctions could be expected to support both rectification and switching. The results also showed that rectification and switching properties of a junction could be expected to depend strongly on its symmetry and, to a lesser degree, on the chirality of the nanotubes. In particular, it was found that a zigzag nanotube branching at a symmetric "Y" junction could exhibit either perfect rectification or partial rectification (asymmetric current-versus-voltage characteristic, as in the example of Figure 2). It was also found that an asymmetric "Y" junction would not exhibit rectification.

Srivastava, Deepak↗
DOE OSTI2025

A Quantum Computational Determination of the Weak Mixing Angle in the Standard Model

The weak mixing angle $s_W$ is a fundamental constant in the Standard Model (SM) and measured at the $Z$ boson mass to be $\widehat{s}^2_W(m_Z) = 0.23129 \pm 0.00004$ in the $\overline{\rm MS}$ renormalization scheme, where $m_Z=91.2\ \text{GeV}$. On the other hand, non-stabilizerness - the magic - characterizes the computational advantage of a quantum system over classical computers. We consider the production of magic from stabilizer initial states, which carry zero magic, in the 2-to-2 scattering of charged leptons in the SM at the tree level, which is mediated by the photon and the $Z$ boson. Using the second order stabilizer Rényi entropy, and averaging over all 60 initial stabilizer states and the scattering angle, we compute and minimize the magic production as a function of $s^2_W$ in the Møller scattering $e^-e^-\to e^-e^-$, which is free of kinematic thresholds. At the centre-of-mass energy $\sqrt{s}=m_Z$, there is a unique minimum in magic production at $\mathbf{s}^{2}_W(m_Z)=0.2317$, which agrees with the measured $\widehat{s}^2_W(m_Z)$ at the sub-percent level. At higher energies, the magic-minimizing $\mathbf{s}^{2}_W$ continues to agree with the empirical value at the percent level or better, up to 10 TeV. The finding suggests the electroweak sector of the SM tends to generate minimal quantum resources from the computational viewpoint.

Liu, Qiaofeng [Northwestern U.]↗
DOE OSTI2025

A Quantum Computational Determination of the Weak Mixing Angle in the Standard Model

The weak mixing angle $s_W$ is a fundamental constant in the Standard Model (SM) and measured at the $Z$ boson mass to be $\widehat{s}^2_W(m_Z) = 0.23129 \pm 0.00004$ in the $\overline{\rm MS}$ renormalization scheme, where $m_Z=91.2\ \text{GeV}$. On the other hand, non-stabilizerness - the magic - characterizes the computational advantage of a quantum system over classical computers. We consider the production of magic from stabilizer initial states, which carry zero magic, in the 2-to-2 scattering of charged leptons in the SM at the tree level, which is mediated by the photon and the $Z$ boson. Using the second order stabilizer Rényi entropy, and averaging over all 60 initial stabilizer states and the scattering angle, we compute and minimize the magic production as a function of $s^2_W$ in the Møller scattering $e^-e^-\to e^-e^-$, which is free of kinematic thresholds. At the centre-of-mass energy $\sqrt{s}=m_Z$, there is a unique minimum in magic production at $\mathbf{s}^{2}_W(m_Z)=0.2317$, which agrees with the measured $\widehat{s}^2_W(m_Z)$ at the sub-percent level. At higher energies, the magic-minimizing $\mathbf{s}^{2}_W$ continues to agree with the empirical value at the percent level or better, up to 10 TeV. The finding suggests the electroweak sector of the SM tends to generate minimal quantum resources from the computational viewpoint.

Liu, Qiaofeng [Northwestern U.]↗