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 325 records · Page 18

Mechanical sensors for ultraheavy dark matter searches via long-range forces

Dark matter candidates with masses around the Planck scale are theoretically well-motivated, and it has been suggested that it might be possible to search for dark matter solely via gravitational interactions in this mass range. In this work, we explore the pathway towards searching for dark matter candidates with masses around the Planck scale using mechanical sensors while considering realistic experimental constraints, and develop analysis techniques needed to conduct such searches. These dark matter particles are expected to leave tracks as their signature in mechanical sensor arrays, and we show that we can effectively search for such tracks using statistical approaches to track-finding. We analyze a range of possible experimental setups and compute sensitivity projections for searches for ultraheavy dark matter coupling to the Standard Model via long-range forces. We find that while a search for Planck-scale dark matter purely via gravitational couplings would be exceedingly difficult, requiring ∼80 dB of quantum noise reduction with a 100 3 array of devices, there is a wide range of currently unexplored dark matter candidates which can be searched for with already existing or near-term experimental platforms.

Qin, Juehang [Rice Univ., Houston, TX (United Stat↗

Operator product expansion for radial lattice quantization of 3D ϕ 4 theory

At its critical point, the three-dimensional lattice Ising model is described by a conformal field theory (CFT), the 3D Ising CFT. Instead of carrying out simulations on Euclidean lattices, we use the quantum finite elements method to implement radially quantized critical ϕ 4 theory on simplicial lattices approaching R × S 2 . Computing the four-point function of identical scalars, we demonstrate the power of radial quantization by the accurate determination of the scaling dimensions Δ ε and Δ T as well as ratios of the operator product expansion coefficients f σ σ ε and f σ σ T of the first spin-0 and spin-2 primary operators ε and T of the 3D Ising CFT. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Picasso: Memory-Efficient Graph Coloring Using Palettes With Applications in Quantum Computing

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm’s parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68× memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5× more Pauli strings (vertex set in our graph) and 2,478× more edges than state-of-the-art parallel approaches.

artificial intelligence, quantum computing↗

Scaling dynamics in low-salt-rejection reverse osmosis for high-salinity produced water desalination: Mechanistic modeling and membrane autopsy

Membrane scaling remains a critical barrier to the reliable operation of desalination systems, particularly for hypersaline produced water (PW) treatment. This study fills the knowledge gap of autopsy-based model validation for PW desalination by elucidating scaling mechanisms in a Low-Salt-Rejection Reverse Osmosis (LSRRO) system through the integration of pilot-scale experimentation and complementary modeling approaches. A semi-empirical modeling framework was developed and applied to a multistage pilot LSRRO system equipped with nanofiltration and RO membranes treating high-salinity PW from the Permian Basin. Water quality analysis showed that total dissolved solids decreased from ~130,000 mg/L to ~1900 mg/L in the permeate, then further reduced to ~300 mg/L by a second-pass RO. Two different thermodynamic modeling approaches were evaluated: the first extends the LSRRO framework by incorporating system complexity and scaling phenomena, whereas the second method explicitly captures concentration polarization in localized supersaturation. Both methods illustrate the tendency for carbonate and sulfate scaling throughout the stages. Membrane autopsies revealed a silica-dominated deposit matrix, localized CaSO 4 at Stage 2, and minor barite/celestite despite their prominence in model predictions. Quantum-chemical calculations indicated silica scaling can be rationalized by favorable adsorption of H 4 SiO 4 on Fe-oxide surfaces (ΔG ≈ −44 kJ/mol), providing a kinetic pathway for interfacial inorganic polymerization even when bulk equilibrium predictions are conservative. Overall, the thermodynamic scaling modeling and membrane autopsy revealed heterogeneous, localized deposits with limited impact on LSRRO performance, while quantum analysis rationalized the thermodynamically unfavorable precipitation formation under bulk equilibrium, reconciling model–autopsy discrepancies. These insights support targeted pretreatment and silica-specific antiscalants to extend membrane lifetime and increase recovery, providing a transferable framework for hypersaline water desalination systems. The combined experimental–computational approach provides new mechanistic insight into scaling in hypersaline membrane systems and establishes a transferable framework for predicting and mitigating scaling in next-generation desalination technologies.

Low-salt-rejection reverse osmosis↗

Quantum Davidson algorithm for excited states

Abstract Excited state properties play a pivotal role in various chemical and physical phenomena, such as charge separation and light emission. However, the primary focus of most existing quantum algorithms has been the ground state, as seen in quantum phase estimation and the variational quantum eigensolver (VQE). Although VQE-type methods have been extended to explore excited states, these methods grapple with optimization challenges. In contrast, the quantum Krylov subspace (QKS) method has been introduced to address both ground and excited states, positioning itself as a cost-effective alternative to quantum phase estimation. However, conventional QKS methodologies depend on a pre-generated subspace through real or imaginary-time evolutions. This subspace is inherently expansive and can be plagued with issues like slow convergence or numerical instabilities, often leading to relatively deep circuits. Our research presents an economic QKS algorithm, which we term the quantum Davidson (QDavidson) algorithm. This innovation hinges on the iterative expansion of the Krylov subspace and the incorporation of a pre-conditioner within the Davidson framework. By using the residues of eigenstates to expand the Krylov subspace, we manage to formulate a compact subspace that aligns closely with the exact solutions. This iterative subspace expansion paves the way for a more rapid convergence in comparison to other QKS techniques, such as the quantum Lanczos. Using quantum simulators, we employ the novel QDavidson algorithm to delve into the excited state properties of various systems, spanning from the Heisenberg spin model to real molecules. Compared to the existing QKS methods, the QDavidson algorithm not only converges swiftly but also demands a significantly shallower circuit. This efficiency establishes the QDavidson method as a pragmatic tool for elucidating both ground and excited state properties on quantum computing platforms.

97 MATHEMATICS AND COMPUTING↗

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)↗

Unification of finite symmetries in the simulation of many-body systems on quantum computers

Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can result in significant overhead due to the exponentially growing size of some symmetry groups as the number of particles increases. Quantum computers hold the promise of achieving exponential speedup in simulating quantum many-body systems; however, a general method for utilizing symmetries in quantum simulations has not yet been established. In this work, we present a unified framework for incorporating symmetry group transforms on quantum computers to simulate many-body systems. The core of our approach lies in the development of efficient quantum circuits for symmetry-adapted projection onto irreducible representations of a group or pairs of commuting groups. We provide resource estimations for common groups, including the cyclic and permutation groups. Our algorithms demonstrate the capability to prepare coherent superpositions of symmetry-adapted states and to perform quantum evolution across a wide range of models in condensed-matter physics and ab initio electronic structure in quantum chemistry. Specifically, we execute a symmetry-adapted quantum subroutine for small molecules in first-quantization on noisy hardware and demonstrate the emulation of symmetry-adapted quantum phase estimation for preparing coherent superpositions of quantum states in various irreducible representations of a symmetry group. In addition, we present a discussion of open problems regarding treating symmetries in digital quantum simulations of many-body systems, paving the way for future systematic investigations into leveraging symmetries quantumly for practical quantum advantage. The broad applicability and rigorous resource estimation for symmetry transformations make our framework appealing for achieving provable quantum advantage on fault-tolerant quantum computers, especially for symmetry-related properties.

quantum algorithms↗

INSPIRED: Inelastic neutron scattering prediction for instantaneous results and experimental design

Inelastic neutron scattering (INS) has unique advantages in probing how atoms vibrate and how the vibrations propagate and interact. Such dynamic information is crucial in understanding various material properties, from heat capacity, thermal conductivity, phase transitions, and chemical reactions to more exotic quantum behavior. The analysis and interpretation of the INS spectra often start from a model structure of the sample, followed by a series of calculations to obtain the simulated spectra to compare with experiments. The conventional way to perform such calculations usually requires significant time, computing resources, and specialized expertise. Here, we present a new program named INSPIRED (Inelastic Neutron Scattering Prediction for Instantaneous Results and Experimental Design), which enables users to perform rapid INS simulations in several different ways on their personal computers in just a few clicks, with the crystal structure as the only input file. Specifically, the users can choose a pre-trained symmetry-aware neural network (coupled with an autoencoder) to predict the phonon density of states (DOS), 1D S(E) and 2D S(|Q|,E) spectra for any given structure. One can also choose an existing density functional theory (DFT) calculation from a database (containing over 12,000 crystals), and quickly obtain the simulated INS spectra for single crystals and powders. It is also possible to use pre-trained universal machine learning force fields to relax a given crystal structure, calculate the phonon dispersion and DOS, and, subsequently, the INS spectra. All these functions are implemented with a PyQt graphic user interface. Finally, we expect these new tools will benefit broad user communities and significantly improve the efficiency of experiment design, execution, and data analysis for INS.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Properties of Electronic Materials

This final technical report summarizes the research conducted under DOE Grant DE-SC0002623, "Properties of Electronic Materials," led by Principal Investigator Shengbai Zhang at Rensselaer Polytechnic Institute. Over the 16-year period, the project employed first-principles computational methods to investigate the structural, electronic, and dynamic properties of a wide range of electronic materials, with applications in energy technologies, optoelectronics, and data storage. Key areas included topological insulators, phase-change materials, graphene and two-dimensional systems, perovskites for photovoltaics, defect engineering in semiconductors, kagome lattices, and ultrafast carrier dynamics. The research resulted in 115 peer-reviewed publications, advancing fundamental understanding of material behaviors at the atomic scale and contributing to innovations in renewable energy, memory devices, and quantum materials. Findings have implications for improving energy efficiency, developing lead-free solar cells, and enabling high-speed data processing. The work has trained numerous graduate students and postdocs, fostering the next generation of computational materials scientists. The original goals were to develop theoretical models and computational tools to predict and optimize electronic properties of materials for energy applications. All objectives were accomplished, with no major departures from planned methodologies. Challenges in computational scaling were addressed through access to high-performance computing resources.

36 MATERIALS SCIENCE↗

Optimizing qubit control pulses for state preparation

In the burgeoning field of quantum computing, the precise design and optimization of quantum pulses are essential for enhancing qubit operation fidelity. This study focuses on refining the pulse engineering techniques for superconducting qubits, employing a detailed analysis of square and Gaussian pulse envelopes under various approximation schemes. We evaluated the effects of coherent errors induced by naive pulse designs. Furthermore, we identified the sources of these errors in the Hamiltonian model’s approximation level. We mitigated these errors through adjustments to the external driving frequency and pulse durations, thus implementing a pulse scheme with stroboscopic error reduction. Our results demonstrate that these refined pulse strategies improve performance and reduce coherent errors. Moreover, the techniques developed herein are applicable across different quantum architectures, such as ion-trap, atomic, and photonic systems.

Chirp modulation↗

Quantum Transfer Learning to Boost Dementia Detection

Dementia is a devastating condition with profound implications for individuals, families, and healthcare systems. Early and accurate detection of dementia is critical for timely intervention and improved patient outcomes. While classical machine learning and deep learning approaches have been explored extensively for dementia prediction, these solutions often struggle with high-dimensional biomedical data and large-scale datasets, quickly reaching computational and performance limitations. To address this challenge, quantum machine learning (QML) has emerged as a promising paradigm, offering faster training and advanced pattern recognition capabilities. This work aims to demonstrate the potential of quantum transfer learning (QTL) to enhance the performance of a weak classical deep learning model applied to a binary classification task for dementia detection. Besides, we show the effect of noise on the QTL-based approach, investigating the reliability and robustness of this method. Using the OASIS 2 dataset, we show how quantum techniques can transform a suboptimal classical model into a more effective solution for biomedical image classification, highlighting their potential impact on advancing healthcare technology.

Bhowmik, Sounak [University of Tennessee, Knoxvill↗

A Digital Twin of Scalable Quantum Clouds

Quantum computing has emerged as a transformative technology capable of solving complex problems beyond the limit of classical systems. The rapid development of quantum processors has led to the proliferation of cloud-based quantum computing services offered by platforms such as IBM, Google, and Amazon. These platforms introduce unique challenges in resource allocation, job scheduling, and multi-device orchestration as quantum workloads become increasingly complex. In this work, we present a digital twin of quantum cloud infrastructures: a framework designed to model and simulate the behavior of real quantum cloud systems. Developed in Python using the SimPy discrete-event simulation library, the framework replicates key aspects of quantum cloud environments, including detailed quantum device modeling, job lifecycle management, and job fidelity. It incorporates noise-aware fidelity estimation, making it the first of its kind to simulate superconducting gate-based quantum cloud systems at an administrative level with job fidelity. We present use cases as proof of concept, demonstrating that our quantum cloud simulation framework can act as a digital twin of a quantum cloud and support the modeling and implementation of practical systems.

Luo, Waylon [Kent State University]↗

Cavity Based Searches for New Particles and Gravitational Waves

The Superconducting Quantum Materials and Systems Center, led by Fermi National Accelerator Laboratory, is one of five research centers funded by the U.S. Department of Energy as part of a national initiative to develop and deploy the world’s most powerful quantum computers and sensors. The SQMS Center uses world-record quality-factor superconducting radio-frequency, or SRF, cavities as ultra-sensitive quantum probes. Within the quantum sensing thrust, researchers are developing experiments based on cavities and novel quantum devices to search for particles beyond the Standard Model, dark matter candidates, gravitational waves and fundamental material properties. The seminar will focus mostly on Dark SRF and MAGO activities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dark Sector and Gravitational Waves Searches with SRF Cavities at SQMS

The Superconducting Quantum Materials and Systems Center, led by Fermi National Accelerator Laboratory, is one of five research centers funded by the U.S. Department of Energy as part of a national initiative to develop and deploy the world’s most powerful quantum computers and sensors. The SQMS Center uses world-record quality-factor superconducting radio-frequency, or SRF, cavities as ultra-sensitive quantum probes. Within the quantum sensing thrust, researchers are developing experiments based on cavities and novel quantum devices to search for particles beyond the Standard Model, dark matter candidates, gravitational waves and fundamental material properties. The seminar will focus on Dark SRF and MAGO activities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficacious Qubit Mappings for Quantum Simulations of the 12 C Rotational Band

Solving atomic nuclei from first principles places enormous demands on computational resources, which grow exponentially with increasing number of particles and the size of the space they occupy. We present first quantum simulations based on the variational quantum eigensolver for the low-lying structure of the 12C nucleus that provide acceptable bound-state energies even in the presence of noise. Here, we achieve this by taking advantage of two critical developments. First, we utilize an almost perfect symmetry of atomic nuclei that, in a complete symmetry-adapted basis, drastically reduces the size of the model space. Second, we use the efficacious Gray encoding, for which it has been recently shown that it is resource efficient, especially when coupled with a near band-diagonal structure of the nuclear Hamiltonian.

Encoding↗

Improved Kelbg Potentials for Z > 1 and Application to Carbon Plasmas

In this work, we present a general form for the electron‐ion diffractive potential derived from the quantum pair density matrix and fit to the improved Kelbg potential for atomic numbers up to $Z = 54$. We apply classical molecular dynamics using the improved Kelbg potential for carbon with various forms of the Pauli potential to compute internal energies and pressures for hot, dense plasma conditions. Our results are compared to an equation of state model based on path integral Monte Carlo and density functional theory simulations to examine the extent to which the improved Kelbg potential reproduces the internal energy and pressure of carbon plasmas. The regions of validity for carbon agree generally with those derived previously for hydrogen once pressure ionization effects are incorporated. Based on our carbon results and previously published hydrogen studies, we discuss the general applicability and limitations of these potentials for equation of state studies in warm dense matter and high energy density plasmas.

general physics↗

Ancilla-entangling Floquet kicks for accelerating quantum algorithms

Quantum simulation with adiabatic annealing can provide insight into difficult problems that are impossible to study with classical computers. However, it deteriorates when the systems scale up due to the shrinkage of the excitation gap and thus places an annealing rate bottleneck for high success probability. Here, in this study, we accelerate quantum simulation using digital multiqubit gates that entangle primary system qubits with ancillary qubits. The practical benefits originate from tuning the ancillary gauge degrees of freedom to enhance the quantum algorithm's original functionality in the system registry. For simple but nontrivial short-ranged, infinite long-ranged transverse-field Ising models, and the hydrogen molecule model after qubit encoding, we show improvement in the time to solution by one hundred percent but with higher accuracy through exact state-vector numerical simulation in a digital-analog setting. The findings are further supported by time-averaged Hamiltonian theory.

97 MATHEMATICS AND COMPUTING↗