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 397 records · Page 22

A Perspective on Multiscale Modeling of Explicit Solvation-Enabled Simulations of Catalysis at Liquid–Solid Interfaces

Catalysis at liquid-solid interfaces is profoundly influenced by the interfacial solvent structure, which affects catalytic activity, selectivity, and reaction pathways. This perspective discusses state-of-the-art multiscale modeling methods that integrate quantum mechanics and molecular mechanics approaches to apply explicit solvent molecules to capture these interfacial phenomena. Specifically, the construction of multiscale models, the importance of capturing the interfacial solvent structure, and the computational strategies used to achieve this are explored, and the challenges in balancing chemical accuracy with computational expense are highlighted. Additionally, this perspective addresses the limitations of current methods. Opportunities for integrating machine learning are proposed. Here, by advancing the efficiency and user friendliness of multiscale modeling, it is argued that deeper insights into heterogeneous catalysis in liquid phases can be provided, which will ultimately contribute to the development of more efficient catalytic processes.

Ab initio molecular dynamics↗

Learning Quantum States and Unitaries of Bounded Gate Complexity

While quantum state tomography is notoriously hard, most states hold little interest to practically minded tomographers. Given that states and unitaries appearing in nature are of bounded gate complexity, it is natural to ask if efficient learning becomes possible. In this work, we prove that to learn a state generated by a quantum circuit with G two-qubit gates to a small trace distance, a sample complexity scaling linearly in G is necessary and sufficient. We also prove that the optimal query complexity to learn a unitary generated by G gates to a small average-case error scales linearly in G . While sample-efficient learning can be achieved, we show that under reasonable cryptographic conjectures, the computational complexity for learning states and unitaries of gate complexity G must scale exponentially in G . We illustrate how these results establish fundamental limitations on the expressivity of quantum machine-learning models and provide new perspectives on no-free-lunch theorems in unitary learning. Together, our results answer how the complexity of learning quantum states and unitaries relate to the complexity of creating these states and unitaries. Published by the American Physical Society 2024

Zhao, Haimeng (ORCID:0000000166751489)↗

Fault Tolerant Decoding of QLDPC-GKP Codes with Circuit Level Soft Information

Concatenated bosonic-stabilizer codes have recently gained prominence as promising candidates for achieving low-overhead fault-tolerant quantum computing in the long term. In such systems, analog information obtained from the syndrome measurements of an inner bosonic code is used to inform decoding for an outer code layer consisting of a discrete-variable stabilizer code such as a surface code. The use of Quantum Low-Density Parity Check (QLDPC) codes as an outer code is of particular interest due to the significantly higher encoding rates offered by these code families, leading to a further reduction in overhead for large-scale quantum computing. Recent works have investigated the performance of QLDPC-GKP codes in detail, and the use of analog information from the inner code significantly boosts decoder performance. However, the noise models assumed in these works are typically limited to depolarizing or phenomenological noise. In this paper, we investigate the performance of QLDPC-GKP concatenated codes under circuit-level noise, based on a model introduced by Noh et al. in the context of the surface-GKP code. To demonstrate the performance boost from analog information, we investigate three scenarios: (a) decoding without soft information, (b) decoding with precomputed error probabilities but without real-time soft information, and (c) decoding with real-time soft information obtained from round-to-round decoding of the inner GKP code. Results show minimal improvement between (a) and (b), but a significant boost in (c), indicating that real-time soft information is critical for concatenated decoding under circuit-level noise. We also study the effect of measurement schedules with varying depths and show that using a schedule with minimum depth is essential for obtaining reliable soft information from the inner code.

Borah, Shantom K. [Arizona U. (main)]↗

Two-Tower Quantum Matrix Chain Multiplication: Trading Qubits for Depth

Matrix chain multiplication -- computing $\mathcal{W} = M^{(0)}\cdots M^{(K-1)}$ where $M^{(k)} \in \mathbb{R}^{P_k \times P_{k+1}}$-- arises in scientific computing, machine learning, and graph analysis. Despite the importance of this problem, for chains of distinct matrices, the classical number of operations grows linearly with the chain length $K$ and polynomially in the matrix dimensions. We present \emph{Two-Tower Matrix Multiplication}, a quantum subroutine that encodes the product $\mathcal{W}$ of the $K$ matrices into a quantum state in circuit depth $\mathcal{O}(\max_{k} \mathrm{polylog} (P_k P_{k+1}))$, which is independent of~$K$ within the QRAM-based state-preparation model, whereas the qubit count is $\mathcal{O}\bigl(\sum_{k} \log P_k \bigr)$; the total gate count remains linear in $K$, so the gain is in the circuit depth. The construction interleaves state-preparation operators across two layers; within each layer, all operators act on disjoint registers and execute in parallel. This subroutine can be specialized for the chain-vector case, which computes the product of $K-1$ matrices applied to a vector. We prove the correctness of the subroutine for all $K$ and provide two implementations using the Qiskit and QCLAB frameworks. The subroutine is applicable to any downstream quantum algorithm that operates on a matrix encoded in the statevector, including norm estimation, graph-matrix powers, linear system solving, and quantum machine learning kernels.

Antonioli, Giacomo [Pisa U.] (ORCID:00090000668703↗

STEPs-SOL, a Peptoid Force Field Parameterization to Include Solvent Effects

As peptoids (N-substituted glycines) continue to gain popularity as a class of biomimetic polymers, the importance and demand for accurate force fields in molecular simulations also grow. Building on the vacuum-optimized Systematic and Extensible Force Field for Peptoids (STEPs) force field, here we present STEPs-SOL, a novel peptoid force field parametrization that effectively incorporates solvent effects to enhance the accuracy of peptoid simulations. The development of STEPs-SOL is based on the need for precise electrostatic modeling achieved through solvent-specific partial charge optimization. Here, our systematic approach significantly improves agreement with experimental measurements, reducing the mean absolute error in cis/trans ratio predictions (ΔG c/t ) by an average of 38% across multiple peptoid residues and solvent environments. This improved parametrization addresses computational challenges associated with nonbonded energies while maintaining a workflow that relies on high-level quantum mechanical data rather than depending solely on limited experimental equilibrium properties. By evaluating the effects of conformational bias in restrained electrostatic potential (RESP) charge generation and examining their impact on peptoid conformations in various solvents, we enhance our understanding of peptoid structural dynamics while providing a more accurate modeling framework.

force field↗

Modeling and Simulation of Semiconductor Quantum Well Structures and Lasers

In this talk I will cover two aspects of modeling and simulation efforts at NASA Ames Research Center. In the quantum well structure simulation, we typically start from the quantum mechanical calculation of the quantum well structures for the confined/and unconfined eigen states and functions. A bandstructure calculation of the k*p type is then performed for the confined valence states. This information is then used to computer the optical gain and refractive index of the quantum well structures by solving the linearized multiband semiconductor Bloch equations with the many-body interactions included. In our laser simulation, we typically solve the envelope equations for the laser field in space-time domain, coupled with a reduced set of material equations using the microscopic calculation of the first step. Finally I will show some examples of both aspects of simulation and modeling.

Ning, Cun-Zheng↗

VOTCA: multiscale frameworks for quantum and classical simulations in soft matter

Many physical phenomena in liquids and soft matter are multiscale by nature and can involve processes with quantum and classical degrees of freedom occurring over a vast range of length- and timescales. Examples range from structure formation processes of complex polymers or even polymer blends (Svaneborg & Everaers, 2023) on the classical side to charge and energy transport and conversion processes (Lee et al., 2019) involving explicit electronic and, therefore, quantum information. The Versatile Object-oriented Toolkit for Coarse-graining Applications (VOTCA) provides multiscale frameworks built on a comprehensive set of methods for the development of classical coarse-grained potentials (VOTCA-CSG) as well as state-of-the art excited state electronic structure methods based on density-functional and many-body Green’s function theories, coupled in mixed quantum-classical models and used in kinetic network models (VOTCA-XTP).

97 MATHEMATICS AND COMPUTING↗

Magnon damping and mode softening in quantum double-exchange ferromagnets

We present a comprehensive analysis of the magnetic excitations and electronic properties of fully quantum double-exchange ferromagnets, i.e. systems where ferromagnetic (FM) ordering emerges from the competition between spin, charge, and orbital degrees of freedom, but without the canonical approximation of using classical localized spins. Specifically, we investigate spin excitations within the Kondo lattice-like model, as well as a two-orbital Hubbard Hamiltonian in proximity to the orbital-selective Mott phase. Computational analysis of the magnon dispersion, damping, and spectral weight within these models reveals unexpected phenomena, such as magnon mode softening and the anomalous decoherence of magnetic excitations as observed in earlier experimental efforts, but explained here without the use of the phononic degrees of freedom. We show that these effects are intrinsically linked to incoherent spectral features near the Fermi level, which arise due to the quantum nature of the local (on-site) triplets. This incoherent spectrum leads to a Stoner-like continuum on which spin excitations scatter, governing magnon lifetime and strongly influencing the dynamical spin structure factor. Our study explores the transition from coherent to incoherent magnon spectra by varying the electron density. Furthermore, we demonstrate that the magnitude of the localized spin mitigates decoherence by suppressing the incoherent spectral contributions near the Fermi level. We also discuss the effective J 1 –J 2 spin Hamiltonian, which can accurately describe the large doping region characterized by the magnon-mode softening. Finally, we show that this behavior is also present in multiorbital models with partially filled orbitals, namely, in systems without localized spin moments, provided that the model is in a strong coupling regime. Our results potentially have far-reaching implications for understanding FM ordering in various multi-band systems. These findings establish a previously unknown direct connection between the electronic correlations of those materials and spin excitations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Automating Rabi & Ramsey Measurements via ML

As quantum computers scale up, the manual process of qubit tune-up becomes increasingly impractical due to its time-consuming and repetitive nature. While existing research has explored some automation techniques, many models remain underutilized for this purpose. This research aims to answer the question: is qubit tune-up able to be automated using the Long Short-Term Memory (LSTM) model? For the purposes of this project, only the rabi and ramsey measurement cycle was automated. These measurements are used to fine-tune a rough qubit frequency by repeating them until the optimal qubit frequency is obtained. The LSTM model uses the qubit frequency at one time step to forecast the qubit frequency at the next time step. A rabi-ramsey simulation was made to fabricate a dataset to train and test the LSTM model. As the model was trained, the error of the model decreased. Although there wasn't enough training data to generate perfect predictions, this shows it is possible to utilize forecasting models in automating the tune-up process.

Roberts, Rachel↗

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the QVAE has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the MODIS dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.

Data mining, similarity search, quantum machine le↗

Automating Rabi & Ramsey Measurements via ML

As quantum computers scale up, the manual process of qubit tune-up becomes increasingly impractical due to its time-consuming and repetitive nature. While existing research has explored some automation techniques, many models remain underutilized for this purpose. This research aims to answer the question: can qubit tune-up be automated using the Long Short-Term Memory (LSTM) model? For the purposes of this project, only the rabi and ramsey measurement cycle was automated. These measurements are used to fine-tune a rough qubit frequency by repeating them until the optimal qubit frequency is obtained. The LSTM model uses the qubit frequency at one time step to forecast the qubit frequency at the next time step. A rabi-ramsey simulation was made to fabricate a dataset to train and test the LSTM model. As the model was trained, the error of the model decreased. Although there wasn t enough training data to generate perfect predictions, this shows it is possible to utilize forecasting models in automating the tune-up process.

Roberts, Rachel↗

Automating Rabi & Ramsey Measurements via Machine Learning

As quantum computers scale up, the manual process of qubit tune-up becomes increasingly impractical due to its time-consuming and repetitive nature. While existing research has explored some automation techniques, many models remain underutilized for this purpose. This research aims to answer the question: can qubit tune-up be automated using the Long Short-Term Memory (LSTM) model? For the purposes of this project, only the rabi and ramsey measurement cycle was automated. These measurements are used to fine-tune a rough qubit frequency by repeating them until the optimal qubit frequency is obtained. The LSTM model uses the qubit frequency at one time step to forecast the qubit frequency at the next time step. A rabi-ramsey simulation was made to fabricate a dataset to train and test the LSTM model. As the model was trained, the error of the model decreased. Although there wasn't enough training data to generate perfect predictions, this shows it is possible to utilize forecasting models in automating the tune-up process.

Roberts, Rachel↗

Similarity Metric for Data Optimization and Efficient Training of Reactive Machine Learning Force Fields for Hydrocarbon Radiolysis

Radiolysis is a common approach to sterilize polymers, chemically modify them for upcycling, and accelerate their decomposition for recycling purposes. Reactive molecular dynamics (MD) simulations provide a powerful tool to generate atomic-level trajectories of the reactive processes and quantify radiolytic chemical degradation pathways. For this, machine learning (ML) surrogate models for reactive force fields with quantum mechanical accuracy are now widely used, which require ML training data sets that can provide information on atomic environments for target chemical systems. However, radiolysis chemistry can be highly complex and diverse, which poses significant challenges for generating training data to parametrize ML models. In this regard, we developed a method for optimizing the training data set using a cosine similarity metric to help guide training set selection for radiolysis of polyethylene, a model hydrocarbon polymer, as well as to enhance the transferability of our reactive ML force field (MLFF) to a variety of molecular and polymeric systems. Our approach performs atom-by-atom comparisons between local atomic environments to pinpoint important data points associated with rare and localized events, such as radiolysis damage within structures. We apply this approach to train the Chebyshev Interaction Model for Efficient Simulation (ChIMES) MLFF model, which expresses the atomic interaction potentials in terms of linear combinations of many-body Chebyshev polynomials. We first show that our method can reduce our training set size by ∼70% while improving overall accuracy compared to more standard MD model fitting approaches. We then validate our optimum model against diverse hydrocarbon simulation data, including simple alkanes and systems with unsaturated carbon bonds, over a wide range of thermodynamic conditions. Finally, we use our ChIMES model to perform MD simulations of radiolytic damage with large-scale systems that help avoid system size effects. Overall, our approach yields an MD force field that retains most of the accuracy of the underlying quantum method while yielding many orders of improvement in computational efficiency. In conclusion, our efforts will have impact on future hydrocarbon polymer radiolysis studies, where the chemical details of the polymer–radiation interactions can have a strong effect on the resulting products observed in experiments.

Hydrocarbons↗

Probing Excited-State Dynamics of Transmon Ionization

The fidelity and quantum nondemolition character of the dispersive readout in circuit QED are limited by unwanted transitions to highly excited states at specific photon numbers in the readout resonator. This observation can be explained by multiphoton resonances between computational states and highly excited states in strongly driven nonlinear systems, analogous to multiphoton ionization in atoms and molecules. In this work, we utilize the multilevel nature of high-𝐸 𝐽 /𝐸 𝐶 transmons to probe the excited-state dynamics induced by strong drives during readout. With up to ten resolvable states, we quantify the critical photon number of ionization, the resulting state after ionization, and the fraction of the population transferred to highly excited states. Moreover, using pulse shaping to control the photon number in the readout resonator in the high-power regime, we tune the adiabaticity of the transition and verify that transmon ionization is a Landau-Zener-type transition. We further extend these methods to a typical transmon with 𝐸 𝐽 /𝐸 𝐶 ≈ 55 and probe the offset-charge dependence of ionization dynamics in a timed-resolved manner. Our experimental results agree well with the theoretical prediction from a semiclassical driven transmon model and may guide future exploration of strongly driven nonlinear oscillators.

cavity quantum electrodynamics↗

Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

open quantum systems & decoherence↗

High dimensional similarity search with quantum assisted variational autoencoder

Recent progress in quantum algorithms and hardware is indicator of the potential importance of quantum computing in the next future. However, finding suitable application areas remains an active area of research. Quantum machine learning [1] is touted as a potential approach to demonstrate quantum advantage within both the gate-model [2,3] and the adiabatic [4,5] schemes. For instance, the Quantum-assisted Variational Autoencoder (QVAE) [6] has been proposed as a quantum enhancement to the discrete VAE [7]. We extend on previous work and study the real-world applicability of a QVAE, specifically, for similarity search in large-scale high dimensional datasets. While similarity search algorithms are available for low dimensional datasets, scaling to billion-scale datasets with thousands of dimensions is non-trivial. We show how the latent-space representation of a QVAE can be used to construct a space-efficient search index. We back up our claims by experimental results which show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset. Further, we show real-world speedups compared to linear search and demonstrate memory efficient scaling to large-scale datasets.

Nicholas D Gao↗

Using Quantum Sensors to Probe the Quasiparticle Excess in Quantum Circuits due to Ionizing Radiation

This project quantified natural ionizing radiation as a source of excess quasiparticles in superconducting quantum circuits. Thermal Kinetic Inductance Detectors (TKIDs) were developed and deployed to measure event‑by‑event energy deposition in silicon substrates at millikelvin temperatures. Measurements and radiation transport simulations showed strong agreement across keV–MeV energies, providing validated background models and design guidance to mitigate radiation‑induced decoherence in superconducting qubits and detectors.

97 MATHEMATICS AND COMPUTING↗

Numerical simulations of liquid jetting with solid inclusions

The dynamics of finite-sized particles in fluids, and their influence on the overall flow, are of great interest across several industrial, environmental, and medical fields. In the context of inkjet printing, the presence of solid inclusions can be either intentional, as in additive manufacturing, or unintentional, as in standard printing processes. These inclusions can strongly impact the jetting process, causing effects such as jet asymmetry, bubble entrapment, and the formation of satellite droplets. Understanding and controlling particle behavior is therefore essential, particularly to predict how and when particles are ejected over multiple jetting cycles. It is therefore critical to develop reliable models that allow for a deeper understanding of the complex interplay between particle and fluid during the whole printing process. To address this, we present a tailored implementation of the Color-Gradient multicomponent Lattice Boltzmann Method for fully resolved three-dimensional (3D) simulations of multicycle liquid jetting with particles. Our method supports realistic parameter settings aligned with industrial inkjet systems, and we provide both qualitative and quantitative validation against experimental data. Additionally, we introduce a simplified model based on the Stokes drag law, in which solid particles are represented as point particles and do not influence the fluid flow. Despite this limitation, the model offers a computationally efficient means to explore the vast parameter space typically encountered in industrial applications, allowing, e.g., identifying critical ejection regions and estimating the number of cycles required for particle release. These qualitative insights are valuable for guiding and complement fully two-way coupled simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗