SEARCH · Search NASA

Results for “quantum algorithm”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Leveraging Quantum Sensors for Dark Matter Detection

Recent measurements have demonstrated that superconducting qubit decoherence is affected by radiation. As a result, many groups around the world are working to better understand the relationship between different types of radiation and qubit response. This crucial to quantum error correction because radiation can cause correlated loss of information across multiple qubits on a chip, defeating error correction algorithms. Additionally, the fundamental energy scale at which superconducting qubits operate may enable their development as meV-scale detectors for HEP applications, such as the direct detection of dark matter. At Fermilab, we have two world-class underground facilities which are already being used to study this problem: NEXUS and QUIET. I will present on results from operating superconducting qubits in each of these facilities, and the potential implications towards utilizing qubits as sensors for a novel dark matter detector.

Baxter, Daniel [Texas U., Arlington]↗

DOE OSTI2026

Leveraging Quantum Sensors for Dark Matter Detection

Baxter, Daniel [Texas U., Arlington]↗

DOE OSTI2026

Scientific Discovery with Physics-Informed System Identification (Abbreviated Report)

My fellowship research focused on making physics-based simulations faster and more useful through machine learning. Many problems in science and engineering are governed by partial differential equations, but high-fidelity simulations are often too expensive to run repeatedly. I worked on improving Latent Space Dynamics Identification (LaSDI), a reduced-order modeling framework that compresses large simulation data sets into a smaller representation and then learns how that representation evolves over time. The motivation was to develop reduced models that remain accurate for more challenging systems, especially when predictions must remain reliable over long time intervals or when the underlying dynamics are more complicated than standard methods can easily handle. I also contributed to related work on Quandary, a high-performance software effort for simulation and control of open quantum systems, before focusing primarily on Latent Space Dynamics Identification methods. The main outcomes of the fellowship were two new algorithms (both of which were published), Rollout-LaSDI and Higher-Order LaSDI, together with supporting work on multi-stage Latent Space Dynamics Identification. Rollout-LaSDI improved long-term prediction by training the model to stay accurate over extended time horizons, and Higher-Order LaSDI broadened the method so it could model systems with higher-order time dynamics. My contributions to multistage Latent Space Dynamics Identification also helped show that its later training stages could be simplified without losing effectiveness, and that this behavior held across different model architectures and training strategies. Taken together, these advances improved the accuracy, flexibility, and practical value of reduced-order modeling tools for computational science.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Efficient use of quantum computers for collider physics

Most observables at particle colliders involve physics at a wide variety of distance scales. Due to asymptotic freedom of the strong interaction, the physics at short distances can be calculated reliably using perturbative techniques, while long distance physics is non-perturbative in nature. Factorization theorems separate the contributions from different scales, allowing to identify the pieces that can be determined perturbatively from those that require non-perturbative information, and if the non-perturbative pieces can be reliably determined, one can use experimental measurements to extract the short distance effects, sensitive to possible new physics. Without the ability to compute the non-perturbative ingredients from first principles one typically identifies observables for which the non-perturbative information is universal in the sense that it can be extracted from some experimental observables and then used to predict other observables. In this paper we argue that the future ability to use quantum computers to calculate non-perturbative matrix elements from first principles will allow to make predictions for observables with non-universal non-perturbative long-distance physics.

Algorithms and Theoretical Developments↗

NASA NTRS2011

Detection and Correction of Step Discontinuities in Kepler Flux Time Series

PDC 8.0 includes an implementation of a new algorithm to detect and correct step discontinuities appearing in roughly one of every 20 stellar light curves during a given quarter. The majority of such discontinuities are believed to result from high-energy particles (either cosmic or solar in origin) striking the photometer and causing permanent local changes (typically -0.5%) in quantum efficiency, though a partial exponential recovery is often observed [1]. Since these features, dubbed sudden pixel sensitivity dropouts (SPSDs), are uncorrelated across targets they cannot be properly accounted for by the current detrending algorithm. PDC detrending is based on the assumption that features in flux time series are due either to intrinsic stellar phenomena or to systematic errors and that systematics will exhibit measurable correlations across targets. SPSD events violate these assumptions and their successful removal not only rectifies the flux values of affected targets, but demonstrably improves the overall performance of PDC detrending [1].

Kolodziejczak, J. J.↗

DOE OSTI2025

Gauge loop-string-hadron formulation on general graphs and applications to fully gauge fixed Hamiltonian lattice gauge theory

We develop a gauge invariant, Loop-String-Hadron (LSH) based representation of SU(2) Yang-Mills theory defined on a general graph consisting of vertices and half-links. Inspired by weak coupling studies, we apply this technique to maximal tree gauge fixing. This allows us to develop a fully gauge-fixed representation of the theory in terms of LSH quantum numbers. We explicitly show how the quantum numbers in this formulation directly relate to the variables in the magnetic description. In doing so, we will also explain in detail how the Kogut-Susskind formulation, prepotentials, and point splitting work for general graphs. In the appendix of this work, we provide a self-contained exposition of the mathematical details of Hamiltonian pure gauge theories defined on general graphs.

Algorithms and Theoretical Developments↗

DOE OSTI2024

Generative deep-learning reveals collective variables of Fermionic systems

Complex processes of fermionic systems ranging from protein folding to nuclear fission often follow a low-dimensional reaction path parametrized in terms of a few collective variables. In nuclear theory, variables related to the shape of the nuclear density in a mean-field picture are key to describing the large amplitude collective motion of the neutrons and protons. Exploring the adiabatic energy landscape spanned by these degrees of freedom reveals the possible reaction channels while simulating the dynamics in this reduced space yields their respective probabilities. Unfortunately, this theoretical framework breaks down whenever the systems encounters a quantum phase transition with respect to the collective variables. Here, in this study, we introduce a novel generative deep-learning algorithm designed to build reaction paths that ensure that the many-fermion wave function stays differentiable with respect to the collective variables. This approach is applicable to any fermionic system described by a coherent state. We use the case of potential energy curves in the 16 O nucleus within the Hartree-Fock theory to illustrate its main features.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2024

Denoising of imaginary time response functions with Hankel projections

Imaginary-time response functions of finite-temperature quantum systems are often obtained with methods that exhibit stochastic or systematic errors. Reducing these errors comes at a large computational cost—in quantum Monte Carlo simulations, the reduction of noise by a factor of two incurs a simulation cost of a factor of four. In this paper, we relate certain imaginary-time response functions to an inner product on the space of linear operators on Fock space. We then show that data with noise typically does not respect the positive definiteness of its associated Gramian. The Gramian has the structure of a Hankel matrix. As a method for denoising noisy data, we introduce an alternating projection algorithm that finds the closest positive definite Hankel matrix consistent with noisy data. We test our methodology at the example of fermion Green's functions for continuous-time quantum Monte Carlo data and show remarkable improvements of the error, reducing noise by a factor of up to 20 in practical examples. We argue that Hankel projections should be used whenever finite-temperature imaginary-time data of response functions with errors is analyzed, be it in the context of quantum Monte Carlo, quantum computing, or in approximate semianalytic methodologies. Published by the American Physical Society 2024

Yu, Yang (ORCID:0000000186178878)↗

DOE OSTI2024

Continuous automatic polarization channel stabilization from heterodyne detection of coexisting dim reference signals

Quantum networking continues to encode information in polarization states due to ease and precision. The variable environmental polarization transformations induced by deployed fiber need correction for deployed quantum networking. Here, we present a method for automatic polarization compensation (APC) and demonstrate its performance on a metropolitan quantum network. Designing an APC involves many design decisions as indicated by the diversity of previous solutions in the literature. Our design leverages heterodyne detection of wavelength-multiplexed dim classical references for continuous high-bandwidth polarization measurements used by newly developed multi-axis (non-)linear control algorithm(s) for complete polarization channel stabilization with no downtime. This enables continuous relatively high-bandwidth correction without significant added noise from classical reference signals. We demonstrate the performance of our APC using a variety of classical and quantum characterizations. Finally, we use C-band and L-band APC versions to demonstrate continuous high-fidelity entanglement distribution on a metropolitan quantum network with an average relative fidelity of 0.94 ± 0.03 for over 30 hrs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Advanced Shuttle Strategies for Parallel QCCD Architectures

Trapped ions (TIs) are at the forefront of quantum computing implementation, offering unparalleled coherence, fidelity, and connectivity. However, the scalability of TI systems is hampered by the limited capacity of individual ion traps, necessitating intricate ion shuttling for advanced computational tasks. The quantum charge-coupled device (QCCD) framework has emerged as a promising solution, facilitating ion mobility for universal quantum computation. Current QCCD architectures predominantly feature a linear topology, which is increasingly recognized as inefficient for complex quantum operations. Anticipating the shift toward more efficacious designs, this article introduces an innovative quantum scheduling strategy optimized for parallel QCCD topologies. Our strategy proposes a probabilistic formula for ion movement, alongside ingenious methods for local layer generation and layer compression, yielding a significant reduction in ion shuttle times. Through simulations, we demonstrate that our strategy not only substantially outstrips the linear model but also exhibits better performance over other parallel strategies that employ greedy algorithms. This is achieved through our nuanced resolution of complexities, such as traffic blocks and trap capacity limitations. The consequent reduction in shuttle operations leads to lower energy consumption and an enhancement in the quantum computer's fidelity, ultimately accelerating program execution times.

43 PARTICLE ACCELERATORS↗

DOE OSTI2026

Tori, Klein bottles, and modulo 8 parity/time-reversal anomalies of 2+1d staggered fermions

We study the symmetries of lattice staggered fermions in 2+1d. Using the symmetries, we can place the system on any sheared torus or Klein bottle. These different backgrounds provide diagnostics of various ’t Hooft anomalies associated with the crystalline symmetries. We then compare the lattice model to its continuum limit. The symmetries of the lattice system are mapped in a nontrivial way to the symmetries of the continuum theories. Using this map, we match the ’t Hooft anomalies on the lattice and the continuum. Along the way, we develop a general formalism to study Hamiltonian lattice models on nontrivial, compact, flat spaces.

Algorithms and Theoretical Developments↗

NASA NTRS2012

Methods for Detection and Correction of Sudden Pixel Sensitivity Drops

PDC 8.0 includes implementation of a new algorithm to detect and correct step discontinuities appearing in roughly one of every twenty stellar light curves during a given quarter. An example of such a discontinuity in an actual light curve is shown in fig. 1. The majority of such discontinuities are believed to result from high-energy particles (either cosmic or solar in origin) striking the photometer and causing permanent local changes (typically -0.5% in summed apertures) in quantum efficiency, though a partial exponential recovery is often observed. Since these features, dubbed sudden pixel sensitivity dropouts (SPSDs), are uncorrelated across targets they cannot be properly accounted for by the current detrending algorithm. PDC de-trending is based on the assumption that features in flux time series are due either to intrinsic stellar phenomena or to systematic errors and that systematics will exhibit measurable correlations across targets. SPSD events violate these assumptions and their successful removal not only rectifies the flux values of affected targets, but demonstrably improves the overall performance of PDC de-trending.

Kolodziejczak, Jeffery↗

DOE OSTI2025

Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements

The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parametrized quantum circuits that often contain substantially fewer gates than Trotter circuits. Here we report an improved version of the method, which we call AVQDS(T), by porting the tiling efficient trial circuits with rotations implemented simultaneously technique. The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. Here we perform benchmark noiseless AVQDS(T) simulations of quench dynamics in local spin models and compare with an alternative adaptive variational approach on quantum resource requirement. Quantum dynamical simulations implementing realistic noise channels are also reported. Finally, we propose a way to substantially alleviate the measurement overhead of AVQDS(T) while maintaining high accuracy by synergistically integrating quantum circuit calculations on quantum processing units with classical calculations using, e.g., tensor networks to evaluate the quantum geometric tensor. We showcase that this approach enables AVQDS(T) to deliver more accurate results than simulations using a fixed ansatz of comparable final depth for a significant time duration with fewer quantum resources.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2025

Clifford Circuit-Based Heuristic Optimization of Fermion-To-Qubit Mappings

Simulation of interacting Fermionic Hamiltonians is one of the most promising applications of quantum computers. However, the feasibility of analyzing Fermionic systems with a quantum computer hinges on the efficiency of Fermion-to-qubit mappings that encode nonlocal Fermionic degrees of freedom in local qubit degrees of freedom. While recent studies have highlighted the importance of designing Fermion-to-qubit mappings that are tailored to specific problem Hamiltonians, the methods proposed so far either are restricted to a narrow class of mappings or they use computationally expensive and unscalable brute-force search algorithms. Here, in this work, we address this challenge by designing a heuristic numerical optimization framework for Fermion-to-qubit mappings. To this end, we first translate the Fermion-to-qubit mapping problem to a Clifford circuit optimization problem and then use simulated annealing to optimize the average Pauli weight of the problem Hamiltonian. For all Fermionic Hamiltonians we have considered, the numerically optimized mappings outperform their conventional counterparts, including ternary-tree-based mappings that are known to be optimal for single creation and annihilation operators. We find that our optimized mappings yield between 15% and 40% improvements on the average Pauli weight when the simulation Hamiltonian has an intermediate level of complexity. Most remarkably, the optimized mappings improve the average Pauli weight for 6 × 6 nearest-neighbor hopping and Hubbard models by more than 40% and 20%, respectively. Surprisingly, we also find specific interaction Hamiltonians for which the optimized mapping outperforms any ternary-tree-based mapping. Our results establish heuristic numerical optimization as an effective method for obtaining mappings tailored for specific Fermionic Hamiltonian.

Hamiltonians↗

DOE OSTI2024

Quantum Computing and Simulations for Energy Applications

While quantum computing (QC) is considered as a paradigm shift in our basic understanding of physical computation, effective implementation of QC in energy applications also depends on progress and development in the dimensions of both QC hardware and algorithms. To fully address the status and future challenges of QC applied within the energy sector, in this presentation, we firstly summarize recent advancements on the applications of QC to energy infrastructure and materials, complex energy system processes, advanced manufacturing, and energy system security. Then, we will demonstrate the results of QC performed both on a simulator and a quantum device targeting on energy-related applications.

Paudel, Hari P.↗

DOE OSTI2026

Ab initio Molecular Dynamics Beyond Density Functional Theory

The funding from this award supported the development of new theoretical methods that both increase the accuracy of quantum simulations beyond that of density functional theory, as well as reduce the cost of such simulations, for example, through machine learning and algorithmic improvements. The improvements lead to, in some cases, orders of magnitude increases in simulation speed as well as orders of magnitude increase in accuracy, compared to before this work was started. This translates to both greater certainty in making predictions about chemical phenomena that are currently studied computationally, as well as laying the ground-work for the study of new areas of chemistry that have not traditionally been simulated, because of the new time-scales and accuracies that can be reached.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS2000

"Genetically Engineered" Nanoelectronics

The quantum mechanical functionality of nanoelectronic devices such as resonant tunneling diodes (RTDs), quantum well infrared-photodetectors (QWIPs), quantum well lasers, and heterostructure field effect transistors (HFETs) is enabled by material variations on an atomic scale. The design and optimization of such devices requires a fundamental understanding of electron transport in such dimensions. The Nanoelectronic Modeling Tool (NEMO) is a general-purpose quantum device design and analysis tool based on a fundamental non-equilibrium electron transport theory. NEW was combined with a parallelized genetic algorithm package (PGAPACK) to evolve structural and material parameters to match a desired set of experimental data. A numerical experiment that evolves structural variations such as layer widths and doping concentrations is performed to analyze an experimental current voltage characteristic. The genetic algorithm is found to drive the NEMO simulation parameters close to the experimentally prescribed layer thicknesses and doping profiles. With such a quantitative agreement between theory and experiment design synthesis can be performed.

Klimeck, Gerhard↗

DOE OSTI2024

The black hole interior from non-isometric codes and complexity

Quantum error correction has given us a natural language for the emergence of spacetime, but the black hole interior poses a challenge for this framework: at late times the apparent number of interior degrees of freedom in effective field theory can vastly exceed the true number of fundamental degrees of freedom, so there can be no isometric (i.e. inner-product preserving) encoding of the former into the latter. In this paper we explain how quantum error correction nonetheless can be used to explain the emergence of the black hole interior, via the idea of “non-isometric codes protected by computational complexity”. We show that many previous ideas, such as the existence of a large number of “null states”, a breakdown of effective field theory for operations of exponential complexity, the quantum extremal surface calculation of the Page curve, post-selection, “state-dependent/state-specific” operator reconstruction, and the “simple entropy” approach to complexity coarse-graining, all fit naturally into this framework, and we illustrate all of these phenomena simultaneously in a soluble model.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗