Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum”

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 613 records · Page 34
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Quantum description of wave dark matter

We outline a fundamentally quantum description of bosonic dark matter (DM) from which the conventional classical-wave picture emerges in the limit 𝑚 ≪10 eV. As appropriate for a quantum system, we start from the density matrix, which encodes the full information regarding the possible measurements we could make of DM and their fluctuations. Following fundamental results in quantum optics, we argue that for DM it is most likely that the density matrix takes the explicitly mixed form of a Gaussian over the basis of coherent states. Deviations from this would generate non-Gaussian fluctuations in DM observables, allowing a direct probe of the quantum state of DM. Our quantum optics–inspired approach allows us to rigorously define and interpret various quantities that are often only described heuristically, such as the coherence time or length. The formalism further provides a continuous description of DM through the wave-particle transition, which we exploit to study how density fluctuations over various physical scales evolve between the two limits and to reveal the unique behavior of DM near the boundary of the wave and particle descriptions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Quantum imaging with positronium-decay-emitted gamma rays

The use of entangled gamma rays from positronium decay for quantum-enhanced imaging of dense materials is demonstrated. Quantum ghost images, where only one of the entangled 511-keV photons interacts with the object, are obtained for tantalum samples of varying density using a 210-ps time-resolution dual detector system and a Na-22 positron source. An analysis comparing both classical and quantum imaging modalities is employed to isolate true 511-keV events from background noise. Image quality is quantitatively assessed using transmission ratios and the Michelson contrast. Quantum-correlated images are found to exhibit superior (up to approximately 1.7x, from 0.49 to 0.83 in the thickest sample measured) contrast compared to classical methods and align well with theoretical expectations. These results suggest that quantum ghost imaging with positronium-based entangled gamma rays could significantly enhance noninvasive imaging of high-density objects, with potential applications in areas such as cargo inspection and security screening.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Quantum confining excitons with an electrostatic moiré superlattice

Quantum confining excitons has been a persistent challenge in the pursuit of strong exciton interactions and quantum light generation. Unlike electrons, which can be readily controlled via electric fields, imposing strong nanoscale potentials on excitons to enable quantum confinement has proven challenging. In this study, we utilize piezoelectric force microscopy to image the domain structures of twisted hexagonal boron nitride (h – BN), revealing evidence of strong in-plane electric fields at the domain boundaries. By placing a monolayer MoSe 2 only one to two nanometers away from the twisted h – BN interface, we observe energy splitting of neutral excitons and Fermi polarons by several millielectronvolts at the moiré domain boundaries. By directly correlating local structural and optical properties, we attribute such observations to excitons confined in a nanoscale one-dimensional electrostatic potential created by the strong in-plane electric fields at the moiré domain boundaries. Intriguingly, this 1D quantum confinement results in pronounced polarization anisotropy in the excitons’ reflection and emission, persistent to temperatures as high as ~80 Kelvins. Furthermore, these findings open new avenues for exploring and controlling strongly interacting excitons for classical and quantum optoelectronics.

2-dimensional systems↗
DOE OSTI2024

Distributionally Robust Variational Quantum Algorithms With Shifted Noise

Given their potential to demonstrate near-term quantum advantage, variational quantum algorithms (VQAs) have been extensively studied. Although numerous techniques have been developed for VQA parameter optimization, it remains a significant challenge. A practical issue is the high sensitivity of quantum noise to environmental changes, and its propensity to shift in real time. This presents a critical problem as an optimized VQA ansatz may not perform effectively under a different noise environment. For the first time, we explore how to optimize VQA parameters to be robust against unknown shifted noise. We model the noise level as a random variable with an unknown probability density function (PDF), and we assume that the PDF may shift within an uncertainty set. This assumption guides us to formulate a distributionally robust optimization problem, with the goal of finding parameters that maintain effectiveness under shifted noise. We utilize a distributionally robust Bayesian optimization solver for our proposed formulation. This provides numerical evidence in both the Quantum Approximate Optimization Algorithm (QAOA) and the Variational Quantum Eigensolver (VQE) with hardware-efficient ansatz, indicating that we can identify parameters that perform more robustly under shifted noise. We regard this work as the first step towards improving the reliability of VQAs influenced by real-time noise.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses [log 2 n] queries for a list of length n. Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of log 2 n for exact quantum algorithms is only known to lie between (ln2)/π ≈ 0.221 and 4/log 2 605 ≈ 0.4333. We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k-query quantum algorithm for ordered search can be implemented by a k-query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses 5 log 7265 n ≈ 0.390 log 2 n quantum queries.

Translation-invariant quantum algorithms↗
DOE OSTI2025

Quantum nonlocal modulation cancelation with distributed clocks

We demonstrate nonlocal modulation of entangled photons with truly distributed radio frequency (RF) clocks. Leveraging a custom radio-over-fiber (RFoF) system characterized via classical spectral interference, we validate its effectiveness for quantum networking by multiplexing the RFoF clock with one photon from a frequency-bin-entangled pair and distributing the coexisting quantum-classical signals over fiber. Phase modulation of the two photons reveals nonlocal correlations in excellent agreement with theory: in-phase modulation produces additional sidebands in the joint spectral intensity, while out-of-phase modulation is nonlocally canceled. Our simple, feedback-free design attains subpicosecond synchronization—namely, drift less than ~0.5 ps in a 5.5 km fiber over 30 min (fractionally only ~2×10 -8 of the total fiber delay)—and should facilitate frequency-encoded quantum networking protocols such as high-dimensional quantum key distribution and entanglement swapping, unlocking frequency-bin qubits for practical quantum communications in deployed metropolitan-scale networks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Polaritonic quantum matter

Polaritons are quantum mechanical superpositions of photon states with elementary excitations in molecules and solids. The light–matter admixture causes a characteristic frequency-momentum dispersion shared by all polaritons irrespective of the microscopic nature of material excitations that could entail charge, spin, lattice or orbital effects. Polaritons retain the strong nonlinearities of their matter component and simultaneously inherit ray-like propagation of light. Polaritons prompt new properties, enable new opportunities for spectroscopy/imaging, empower quantum simulations and give rise to new forms of synthetic quantum matter. Here, we review the emergent effects rooted in polaritonic quasiparticles in a wide variety of their physical implementations. We present a broad portfolio of the physical platforms and phenomena of what we term polaritonic quantum matter. We discuss the unifying aspects of polaritons across different platforms and physical implementations and focus on recent developments in: polaritonic imaging, cavity electrodynamics and cavity materials engineering, topology and nonlinearities, as well as quantum polaritonics.

light–matter interaction↗
DOE OSTI2024

A retrospective review of von Neumann’s analysis of hidden variables in quantum mechanics

This article reviews the history of J. von Neumann’s analysis of hidden variables in quantum mechanics and the subsequent analysis by others. In his book The Mathematical Foundations of Quantum Mechanics , published in 1932, von Neumann performed an analysis of the consequences of introducing hidden parameters (hidden variables) into quantum mechanics. He arrived at two principal conclusions: first, hidden variables cannot be incorporated into the existing theory of quantum mechanics without major modifications, and second, if they did exist, the theory would have already failed in situations where it has been successfully applied. This analysis has been taken as an “incorrect proof” against the existence of hidden variables, possibly due to a mistranslation of the German word prufen . von Neumann’s so-called proof isn’t even wrong as such a proof does not exist, but it is an examination of the limitations imposed by internal consistency of the Hilbert space formulation of the theory. One of the earliest attempts to eliminate uncertainty, by D. Bohm, requires a major modification of quantum mechanics (observables are not represented by Hermitian operators), which supports von Neumann’s first principal conclusion. However, testing the Bohm theory requires constructing a physically impossible initial state. As such, the theory has no experimental consequences, so W. Pauli referred to it as an “uncashable check”. As there are no observable consequences, the Bohm theory is possibly a counterexample to von Neumann’s second conclusion that hidden variables in particular would have already led to a failure of the theory.

density matrix↗
DOE OSTI2025

Multiscale Nuclear-Electronic Orbital Quantum Dynamics in Complex Environments

Many renewable energy conversion processes rely on the movement of protons as well as electrons through either electrocatalysis or photoexcitation. The simulation of such processes requires a quantum mechanical description of coupled nuclear-electronic dynamics in a solvent or heterogeneous chemical environment. The overall objective of this project is the development of theoretical and computational capabilities for simulating nuclear-electronic quantum dynamics in complex environments and the creation of high-performance, open-source software. This multiscale framework will enable simulations of the real-time dynamics of nonequilibrium excited state proton-coupled electron transfer, quantum decoherence, vibronic energy transfer, and ultrafast radiolysis, as well as their associated time-resolved multidimensional spectroscopies. An important outcome of this project will be a sustainable, reusable, and interoperable open-source software ecosystem. This software will be designed for emerging exascale and future national leadership computers. Another key outcome will be a multiscale quantum dynamics method and software enabling simulations of nonequilibrium nuclear-electronic quantum dynamics in complex environments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Planar Systems for Quantum Information

This project aims to develop two‐dimensional (2D) moiré materials as a quantum simulator to implement model Hamiltonians and their phase diagrams. Progress in quantum information science (QIS) requires the development of advanced quantum materials systems. The rich family of layered van der Waals materials and their heterostructures present opportunities to create previously unrealized types of applications for QIS. Specifically, when two layers of van der Waals materials are overlaid with a small twist angle or/and lattice mismatch, a moiré superlattice with a period of about ten nanometers is formed. This provides a periodic trapping potential for electrons. Electrons can tunnel between the traps and repel each other by their mutual Coulomb interactions. The platform of 2D moiré materials provides many attractive features, including tunability of length and energy scales, charge density, and even lattice symmetry. It presents new possibilities for realizing quantum simulation of the many-body physics in a solid-state platform. This integrated team of six investigators seeks to develop relevant theoretical treatments to link ab-initio studies of 2D moiré materials to model Hamiltonians and to evaluate correlated phases predicted by these model Hamiltonians in the relevant regimes. On the experimental side, the team aims to develop methods to realize a homogeneous and highly controlled potential landscape for the electrons and to initiate, protect, and measure their quantum many-body states.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Problem-tailored Simulation of Energy Transport on Noisy Quantum Computers

The transport of conserved quantities like spin and charge is fundamental to characterizing the behavior of quantum many-body systems. Numerically simulating such dynamics is generically challenging, which motivates the consideration of quantum computing strategies. However, the relatively high gate errors and limited coherence times of today's quantum computers pose their own challenge, highlighting the need to be frugal with quantum resources. In this work we report simulations on quantum hardware of infinite-temperature energy transport in the mixed-field Ising chain, a paradigmatic many-body system that can exhibit a range of transport behaviors at intermediate times. We consider a chain with L = 12 sites and find results broadly consistent with those from ideal circuit simulators over 90 Trotter steps, containing up to 990 entangling gates. To obtain these results, we use two key problem-tailored insights. First, we identify a convenient basis – the Pauli Y basis – in which to sample the infinite-temperature trace and provide theoretical and numerical justifications for its efficiency relative to, e.g., the computational basis. Second, in addition to a variety of problem-agnostic error mitigation strategies, we employ a renormalization strategy that compensates for global nonconservation of energy due to device noise. We discuss the applicability of the proposed sampling approach beyond the mixed-field Ising chain and formulate a variational method to search for a sampling basis with small sample-to-sample fluctuations for an arbitrary Hamiltonian. This opens the door to applying these techniques in more general models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

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↗
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↗
NASA NTRSDate not supplied

Quantum-Accelerated Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees

We present two algorithms in the Quantum CONGEST-CLIQUE model of distributed computation that succeed with high probability; one for producing an approximately optimal Steiner Tree, and one for producing an exact spanning arborescence of minimum weight, the analog of a Minimum Spanning Tree in a directed graph, each of which uses O~(n^(1/4)) rounds of communication and O~(n^(9/4)) messages, achieving a lower round and message complexity than any known algorithms in the classical CONGEST-CLIQUE model. The CONGEST distributed computational model allows limited-sized messages to be transmitted within a network described by a communication graph of size n in a series of rounds to address a computational problem. The size limitation for such messages isO(log(n)) bits at each edge of the communication graph per round. The communication graph in the CONGEST-CLIQUE model is fully connected. In the Quantum CONGEST-CLIQUE model, at most O(log(n)) classical and quantum bits (qubits) can be communicated across each edge of the communication graph per round. At a high level, we achieve these results by combining classical algorithms with fast quantum subroutines. These speedups further contribute to understanding what problems can be solved more efficiently when we allow quantum communication in this CONGEST-CLIQUE model of distributed computation.

quantum distributed algorithms↗
NASA NTRSDate not supplied

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗