Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum optimization”

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 379 records · Page 21
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Lieb-Mattis States for Robust Entangled Differential Phase Sensing

We explore a two-node, entanglement-enhanced sensor network for differential phase sensing that exploits decoherence-free subspaces to suppress common-mode noise, a primary limitation of many state-of-the-art quantum sensors. We identify a class of entangled states that, while not strictly optimal, achieve the same asymptotic sensitivity scaling as optimal states and can be prepared efficiently from initially unentangled atomic ensembles. Importantly, the preparation time decreases with increasing system size, which makes the states compatible with realistic noise processes in present-day quantum sensors that operate with large particle numbers but lack full error correction. We illustrate these ideas using two cavity-mediated preparation protocols: (i) coherent, unitary entanglement generation analogous to bosonic two-mode squeezing, yielding Heisenberg scaling, and (ii) dissipative preparation through collective emission into a shared cavity mode, providing a square-root improvement beyond the standard quantum limit. Numerical simulations show that both approaches remain effective at experimentally realistic cavity cooperativities, establishing a practical path toward scalable, quantum-enhanced differential phase sensing.

Kaubruegger, Raphael [National Institute of Standa↗
DOE OSTI2026

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗
DOE OSTI2024

Efficient Mixed-Precision Matrix Factorization of the Inverse Overlap Matrix in Electronic Structure Calculations with AI-Hardware and GPUs

In recent years, a new kind of accelerated hardware has gained popularity in the artificial intelligence (AI) community which enables extremely high-performance tensor contractions in reduced precision for deep neural network calculations. In this article, we exploit Nvidia Tensor cores, a prototypical example of such AI-hardware, to develop a mixed precision approach for computing a dense matrix factorization of the inverse overlap matrix in electronic structure theory, S –1 . This factorization of S –1 , written as ZZT = S –1 , is used to transform the general matrix eigenvalue problem into a standard matrix eigenvalue problem. Here we present a mixed precision iterative refinement algorithm where Z is given recursively using matrix–matrix multiplications and can be computed with high performance on Tensor cores. To understand the performance and accuracy of Tensor cores, comparisons are made to GPU-only implementations in single and double precision. Additionally, we propose a nonparametric stopping criteria which is robust in the face of lower precision floating point operations. The algorithm is particularly useful when we have a good initial guess to Z, for example, from previous time steps in quantum-mechanical molecular dynamics simulations or from a previous iteration in a geometry optimization.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Bayesian optimization of PYTHIA 8 tunes

A new tune (set of model parameters) is found for the six most important parameters of the PYTHIA 8 final state parton shower and hadronization model using Bayesian optimization. The tune fits the Large Electron-Positron collider (LEPI) data from ALEPH better than the default tune in PYTHIA 8. To the best of our knowledge, we present the most comprehensive application of Bayesian optimization to the tuning of a parton shower and hadronization model using the LEPI data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Can ferric-oxyl excited states explain elongated iron-oxygen bonds in heme peroxidase catalytic intermediates?

The use of X-ray structures to determine and interpret the ferryl iron-oxygen bond order in molecular oxygen-activating heme enzymes has, in the past, been controversial. This has mainly stemmed from the susceptibility of ferryl species to X-ray-induced electronic state changes. In this work we establishe using time-resolved serial femtosecond X-ray crystallography (tr-SFX) on a dye-decolourising peroxidase that the ferryl intermediate species (Compounds I and II) captured following in situ mixing of microcrystals with H 2 O 2 have single, rather than the double bond character expected. X-ray emission validated tr-SFX data with quantum refinement, time-dependent-DFT calculations and QM/MM geometry optimizations together support the concept that the single iron-oxygen bond character is not an indication of ferryl reduction or a protonated form (Fe IV -OH) but is instead attributed to the existence of accessible excited states possessing ferric-oxyl (Fe III –O •– ) character. Such states offer insight into the nature of ferryl heme.

Williams, Lewis J. [University of Essex, Colcheste↗
DOE OSTI2025

Fast methods for multisite charge transfer processes. I. Constrained, state averaged CASSCF(1,n) and CASSCF(2n − 1,n) simulations

We design a dynamically weighted state-averaged constrained complete active space self-consistent field (DW-SA-cCASSCF) algorithm to treat electrons or holes moving between n molecular fragments (where n can be larger than 2). Within such a so-called eDSCn/hDSCn approach, we consider configurations that are mutually single excitations of each other, and we apply a generalized set of constraints to tailor the method for studying charge transfer problems. The constrained optimization problem is efficiently solved using a DIIS-SQP algorithm, thus maintaining computational efficiency. We demonstrate the method for a finite Su–Schrieffer–Heeger chain, successfully reproducing the expected exponential decay of diabatic couplings with distance. When combined with a gradient, the current extension immediately enables efficient nonadiabatic dynamics simulations of complex multi-state charge transfer processes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Realizing tunable Fermi level in SnTe by defect control

The tuning of the Fermi level in tin telluride, a topological crystalline insulator, is essential for accessing its unique surface states and optimizing its electronic properties for applications such as spintronics and quantum computing. In this study, we demonstrate that the Fermi level in tin telluride can be effectively modulated by controlling the tin concentration during chemical vapor deposition synthesis. By introducing tin-rich conditions, we observed a blue shift in the x-ray photoelectron spectroscopy core-level peaks of both tin and tellurium, indicating an upward shift in the Fermi level. Further, this shift is corroborated by a decrease in work function values measured via ultraviolet photoelectron spectroscopy, confirming the suppression of Sn vacancies. Our findings provide a low-cost, scalable method to achieve tunable Fermi levels in tin telluride, offering a significant advancement in the development of materials with tailored electronic properties for next-generation technological applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Arbitrary State Preparation via Quantum Walks Software

SF-24-077 Our software generates a circuit that prepares a specified target quantum state. It generates circuits with CNOT counts of O(mn), where m is the number of nonzero amplitudes of the state and n is the number of qubits. The method does not require ancillas. It is designed for sparse states, but works for any quantum state. Our method is based on the new perspective of dynamic continuous time quantum walks for quantum state preparation. This is an intuitive perspective where a graph is first constructed to traverse the basis states. The method works by 1.) construct a graph of the basis states, 2.) transform the graph into quantum walks, and 3.) construct the final gate based circuit optimized with our control reduction method.

Liu, Ji↗
NASA NTRS2008

Special Polymer/Carbon Composite Films for Detecting SO2

A family of polymer/carbon films has been developed for use as sensory films in electronic noses for detecting SO2 gas at concentrations as low as 1 part per million (ppm). Most previously reported SO2 sensors cannot detect SO2 at concentrations below tens of ppm; only a few can detect SO2 at 1 ppm. Most of the sensory materials used in those sensors (especially inorganic ones that include solid oxide electrolytes, metal oxides, and cadmium sulfide) must be used under relatively harsh conditions that include operation and regeneration at temperatures greater than 100 C. In contrast, the present films can be used to detect 1 ppm of SO2 at typical opening temperatures between 28 and 32 C and can be regenerated at temperatures between 36 and 40 C. The basic concept of making sensing films from polymer/carbon composites is not new. The novelty of the present family of polymer/carbon composites lies in formulating the polymer components of these composites specifically to optimize their properties for detecting SO2. First-principles quantum-mechanical calculations of the energies of binding of SO2 molecules to various polymer functionalities are used as a guide for selecting polymers and understanding the role of polymer functionalities in sensing. The polymer used in the polymer-carbon composite is a copolymer of styrene derivative units with vinyl pyridine or substituted vinyl pyridine derivative units. To make a substituted vinyl pyridine for use in synthesizing such a polymer, poly(2-vinyl pyridine) that has been dissolved in methanol is reacted with 3-chloropropylamine that has been dissolved in a solution of methanol. The methanol is then removed to obtain the copolymer. Later, the copolymer can be dissolved in an appropriate solvent with a suspension of carbon black to obtain a mixture that can be cast and then dried to obtain a sensory film.

Homer, Margie↗
DOE OSTI2025

Bias‐Dependent Quantum Efficiency Reveals Recombination Pathways in Thin Film Solar Cells

Identifying where recombination predominantly occurs—whether at the front interface, back interface, or throughout the bulk—is crucial for optimizing CdSeTe solar cells and many other photovoltaic device architectures. Here, a simple and effective diagnostic is demonstrated: measuring external quantum efficiency (QE) under varying forward biases. The drift–diffusion simulations reveal that each recombination pathway leaves a distinct bias-induced signature in the normalized QE: a progressive drop at long wavelengths for back-limited devices, a short-wavelength decline for front-limited devices, and a relatively uniform decrease across all wavelengths for bulk-limited devices. These predictions are validated with experiments on As-doped and Cu-doped CdSeTe devices, with and without passivation layers or different front buffers. In each case, the observed bias-dependent QE spectral changes align with the simulated recombination map. Because this method uses standard QE instrumentation, it offers a broadly accessible and cost-efficient means to diagnose recombination pathways—extending beyond CdSeTe to other thin-film and emerging solar cell technologies. By pinpointing recombination bottlenecks, researchers and manufacturers can strategically refine doping profiles, passivation schemes, and interface designs to further improve device performance.

CdTe↗
NASA NTRS1998

Recent Progress in Quantum Well Infrared Photodetector Research and Development at Jet Propulsion Laboratory

One of the simplest device realizations of the classic particle-in-the-box problem of basic quantum mechanics is the Quantum Well Infrared Photodetector (QWIP). In this paper we discuss the optimization of the detector design, material growth and processing that has culminated in realization of 15 micron cutoff 128x128 QWIP focal plane array camera, hand-held and palmsize 256x256 long-wavelength QWIP cameras and 648x480 long-wavelength cameras, holding forth great promise for myriad applications in 6-25 micron wavelength range in science, medicine, defense and industry.

quantum↗
DOE OSTI2025

Weak phonon coupling to nematic quantum critical mode in BaFe 2 ⁢(As 1−𝑥 ⁢P 𝑥 ) 2

Here, in this work, we investigate the softening of the in-plane transverse acoustic phonon driven by electronic nematicity in BaFe 2 ⁢(As 1−𝑥 ⁢P 𝑥 ) 2 using inelastic x-ray scattering, with a focus on the optimally doped sample (𝑥 = 0.31) sample—a system exhibiting signatures of a putative nematic quantum critical point and minimal disorder among iron pnictides. We observe only a modest softening of the phonon frequency and no evidence of critical damping, suggesting that the nematic quantum critical fluctuations couple only weakly to the lattice from our quantum critical model. Given the close proximity of the structural and magnetic transition temperatures in the underdoped sample—which implies that spin-nematic fluctuations couple strongly to the lattice—we conjecture that the quantum critical nematic fluctuations are predominantly orbital in origin.

Wu, S. [University of California, Berkeley, CA (Un↗
DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Solving the homogeneous Bethe-Salpeter equation with a quantum annealer

The homogeneous Bethe-Salpeter equation (hBSE), describing a bound system in a genuinely relativistic quantum-field theory framework, was solved for the first time by using a D-Wave quantum annealer. After applying standard techniques of discretization, the hBSE, in ladder approximation, can be formally transformed in a generalized eigenvalue problem (GEVP), with two square matrices: one symmetric and the other nonsymmetric. The latter matrix poses the challenge of obtaining a suitable formal approach for investigating the GEVP by means of a quantum annealer, i.e., to recast it as a quadratic unconstrained binary optimization problem. A broad numerical analysis of the proposed algorithms, applied to matrices of dimension up to 64, was carried out by using both the simulated-annealing package and the D-Wave . The numerical results very nicely compare with those obtained with standard classical algorithms, and also show interesting scalability features. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Ion-chain sympathetic cooling and gate dynamics

Sympathetic cooling is a technique often employed to mitigate motional heating in trapped-ion quantum computers. However, choosing system parameters such as number of coolants and cooling duty cycle for optimal gate performance requires evaluating trade-offs between motional errors and other slower errors such as qubit dephasing. The optimal parameters depend on cooling power, heating rate, and ion spacing in a particular system. In this study, we aim to analyze best practices for sympathetic cooling of long chains of trapped ions using analytical and computational methods. We use a case study to show that optimal cooling performance is achieved when coolants are placed at the center of the chain and provide a perturbative upper bound on the cooling limit of a mode given a particular set of cooling parameters. In addition, using computational tools, we analyze the trade-off between the number of coolant ions in a chain and the center-of-mass mode heating rate. We also show that cooling as often as possible when running a circuit is optimal when the qubit coherence time is otherwise long. These results provide a roadmap for how to choose sympathetic cooling parameters to maximize circuit performance in trapped-ion quantum computers using long chains of ions.

Cooling & trapping↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2024

Exponential concentration in quantum kernel methods

Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model’s parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.

97 MATHEMATICS AND COMPUTING↗