Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum query complexity”

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.

23 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Projection-Based Model Reduction for Coupled Conduction—Enclosure Radiation Systems

We report a projection-based reduced order model (pROM) methodology has been developed for transient heat transfer problems involving coupled conduction and enclosure radiation. The approach was demonstrated on two test problems of varying complexity. The reduced order models demonstrated substantial speedups (up to 185×) relative to the full order model with good accuracy (less than 3% L ∞ error). An attractive feature of pROMs is that there is a natural error indicator for the ROM solution: the final residual norm at each time-step of the converged ROM solution. Using example test cases, we discuss how to interpret this error indicator to assess the accuracy of the ROM solution. The approach shows promise for many-query applications, such as uncertainty quantification and optimization. The reduced computational cost of the ROM relative to the full-order model (FOM) can enable the analysis of larger and more complex systems as well as the exploration of larger parameter spaces.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2003

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗
DOE OSTI2025

Ansatz-Free Hamiltonian Learning with Heisenberg-Limited Scaling

Learning the unknown interactions that govern a quantum system is crucial for quantum information processing, device benchmarking, and quantum sensing. The problem, known as Hamiltonian learning, is well understood under the assumption that interactions are local, but this assumption may not hold for arbitrary Hamiltonians. Previous methods all require high-order inverse polynomial dependency with precision, unable to surpass the standard quantum limit and reach the gold-standard Heisenberg-limited scaling. Whether Heisenberg-limited Hamiltonian learning is possible without prior assumptions about the interaction structures, a challenge we term ansatz-free Hamiltonian learning , remains an open question. In this work, we present a quantum algorithm to learn arbitrary sparse Hamiltonians without any structure constraints using only black-box queries of the system’s real-time evolution and minimal digital controls to attain Heisenberg-limited scaling in estimation error. Our method is also resilient to state-preparation-and-measurement errors, enhancing its practical feasibility. We numerically demonstrate our ansatz-free protocol for learning physical Hamiltonians and validating analog quantum simulations, benchmarking our performance against the state-of-the-art Heisenberg-limited learning approach. Moreover, we establish a fundamental trade-off between total evolution time and quantum control on learning arbitrary interactions, revealing the intrinsic interplay between controllability and total evolution-time complexity for any learning algorithm. These results pave the way for further exploration into Heisenberg-limited Hamiltonian learning in complex quantum systems under minimal assumptions, potentially enabling new benchmarking and verification protocols.

machine learning↗
DOE OSTI2026

Transitions, Dynamics, and Driven States in Quantum Magnets (Final Report Revised)

Transitions into unusual electronic, optical, and magnetic states at the absolute zero of temperature display special properties that teach us about fundamental quantum mechanics and also underlie important technologies. These so-called quantum phase transitions intertwine the static and dynamical responses of the materials changing state. They are extremely sensitive to the effects of disorder and etch in high relief the role of quantum fluctuations. There are ample questions remaining about the character of such transitions and the nature of the competing quantum states. There are also opportunities to drive quantum materials out of equilibrium, with the possibility of new types of correlated and coherent order, and new ways to access the dynamical evolution of ground and excited states. We have investigated how the order develops in time and space, and the nature of the final configurations. We are able to compare and contrast classical and quantum excitations in our experimental system of choice, and thereby can trace the relative speed by which the system settles into its lowest-energy ground state. This comparison of quantum and classical annealing protocols lies at the heart of strategies for harnessing the power of quantum computers dedicated to optimization problems. A combination of magnetic susceptibility measurements at finite frequency where the magnetic spins are queried by an external ac field, dc magnetometry measurements that characterize the macroscopic strength of magnetic order and its resistance to change, noise measurements that reveal the microscopic fluctuations of the spins as they prepare to change state, and microwave spectroscopy to look at the response of both the electronic and nuclear degrees of freedom, have been performed as functions of temperature, magnetic field, frequency, excitation amplitude, magnetic spin concentration, and disorder. This combination of probes addresses issues of stability over time, overlap between spin states, the ability of the spins to respond independently or coherently, and the promise of control on the nanometer length scale. The research reported here provides insights into fundamental quantum physics. It also addresses the question of how best to use complex systems, such as magnetic solids, to stably process quantum information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Coarse-Grained Density Functional Theory Predictions via Deep Kernel Learning

Scalable electronic predictions are critical for soft materials design. Recently, the Electronic Coarse-Graining (ECG) method was introduced to renormalize all-atom quantum chemical (QC) predictions to coarse-grained (CG) resolutions using deep neural networks (DNNs). While DNNs can learn complex representations that prove challenging for kernel-based methods, they are susceptible to overfitting and the overconfidence of uncertainty estimations. Here, we develop ECG within a GPU-accelerated Deep Kernel Learning (DKL) framework to enable CG QC predictions using range-separated hybrid density functional theory (DFT), obtaining a 107 speedup relative to naive all-atom QC. By treating the predicted electronic properties as random Gaussian Processes, DKL incorporates CG mapping degeneracy by learning the distribution of electronic energies as a function of CG configuration. DKL-ECG accurately reproduces molecular orbital energies from range-separated DFT while facilitating efficient training via active learning using the uncertainties provided by DKL. Further, we show that while active learning algorithms enable efficient sampling of a more diverse configurational space relative to random sampling, all explored query methods exhibit comparable performance for the examined system. We attribute this result to the significant overlap of the feature space and output property distributions across multiple temperatures.

97 MATHEMATICS AND COMPUTING↗