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.

SourceResearch connectionFrom yearThrough year

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

At least 289 records · Page 16

All sources NASA NTRS DOE OSTI

DOE OSTI2025

A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem

Solving problems related to planning and operations of large-scale power systems is challenging on classical computers due to their inherent nature as mixed-integer and nonlinear problems. Quantum computing provides new avenues to approach these problems. We develop a hybrid quantum-classical algorithm for the Unit Commitment (UC) problem in power systems which aims at minimizing the total cost while optimally allocating generating units to meet the hourly demand of the power loads. The hybrid algorithm combines a variational quantum algorithm (VQA) with a classical Benders-type heuristic. The resulting algorithm computes approximate solutions to UC in three stages: i) a collection of UC vectors capable meeting the power demand with lowest possible operating costs is generated based on VQA; ii) a classical sequential least squares programming (SLSQP) routine is leveraged to find the optimal power level corresponding to a predetermined number of candidate vectors; iii) in the last stage, the approximate solution of UC along with generating units power level combination is given. To demonstrate the effectiveness of the presented method, three different systems with 3 generating units, 10 generating units, and 26 generating units were tested for different time periods. In addition, convergence of the hybrid quantum-classical algorithm for select time periods is proven out on IonQ's Forte system.

Aboumrad, Willie [IonQ, Inc]↗

DOE OSTI2024

How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits

In the span of four decades, quantum computation has evolved from an intellectual curiosity to a potentially realizable technology. Today, small-scale demonstrations have become possible for quantum algorithmic primitives on hundreds of physical qubits and proof-of-principle error-correction on a single logical qubit. Nevertheless, despite significant progress and excitement, the path toward a full-stack scalable technology is largely unknown. There are significant outstanding quantum hardware, fabrication, software architecture, and algorithmic challenges that are either unresolved or overlooked. These issues could seriously undermine the arrival of utility-scale quantum computers for the foreseeable future. Here, we provide a comprehensive review of these scaling challenges. We show how the road to scaling could be paved by adopting existing semiconductor technology to build much higher-quality qubits, employing system engineering approaches, and performing distributed quantum computation within heterogeneous high-performance computing infrastructures. These opportunities for research and development could unlock certain promising applications, in particular, efficient quantum simulation/learning of quantum data generated by natural or engineered quantum systems. To estimate the true cost of such promises, we provide a detailed resource and sensitivity analysis for classically hard quantum chemistry calculations on surface-code error-corrected quantum computers given current, target, and desired hardware specifications based on superconducting qubits, accounting for a realistic distribution of errors. Furthermore, we argue that, to tackle industry-scale classical optimization and machine learning problems in a cost-effective manner, heterogeneous quantum-probabilistic computing with custom-designed accelerators should be considered as a complementary path toward scalability.

Mohseni, Masoud↗

DOE OSTI2025

One Pot Synthesis of Cyan Emitting CdZnSSe Quantum Dots for Human Centric Lighting

A one pot synthesis of blue and green emissive CdZnSSe quantum dots (QDs) from thio- and selenoureas and Cd and Zn carboxylates is optimized using high throughput robotic optimization. A large set of spectral data (N = 192) is used to train machine learning models that accurately predict the photoluminescence emission wavelength (λmax) and full-width half-maximum, and the relative photoluminescence quantum yield (PLQY) from the S:Se and Zn:Cd stoichiometries and reaction time. ZnS shells are deposited on the crude QD heterostructures using 4-tert-butylbenzyl mercaptan, a more reactive source of sulfide that enables shell growth below the temperature where ion diffusion in the QD can broaden its optical spectrum (≤275 °C). These optimized procedures provide gram quantities of blue-green emitting QDs (PLQY = 85–99%) in a single reaction vessel. A solid state lighting device (4260 K) that incorporates cyan emissive QDs achieved a higher luminous efficacy of 179 lm/W and melanopic daylight efficiency ratio (0.71) than existing commercial human centric lighting devices.

Jordan, Abraham J↗

DOE OSTI2026

Optimized cryogenic setup for microwave loss characterization of superconducting coaxial cables

As superconducting quantum systems scale up to enable applications like large-scale quantum computing, challenges such as fabrication yield, wiring complexity, and microwave crosstalk drive the need for high-fidelity, low-loss, modular interconnects. In recent experiments, the performance of these interconnects is often limited by cable loss, a factor that becomes even more critical as we aim for higher fidelity operations and connect increasingly coherent modules. In this talk, we present our cryogenic microwave loss characterization setup, carefully designed to minimize losses external to the coaxial cables under test. We also share results for several commercially-available superconducting cables measured with this setup and briefly discuss our ongoing efforts to develop custom coaxial cables capable of achieving state-of-the-art performance.

Vallières, André [Northwestern U.]↗

DOE OSTI2026

Optimized cryogenic setup for microwave loss characterization of superconducting coaxial cables

Vallières, André [Northwestern U.]↗

DOE OSTI2024

Optimizing fictitious states for Bell inequality violation in bipartite qubit systems with applications to the t t ¯ system

There is a significant interest in testing quantum entanglement and Bell inequality violation in high-energy experiments. Since the analyses in high-energy experiments are performed with events statistically averaged over phase space, the states used to determine observables depend on the choice of coordinates through an event-dependent basis and are thus not genuine quantum states, but rather “fictitious states.” We find that the basis which diagonalizes the spin-spin correlations is optimal for constructing fictitious states to test the violation of Bell’s inequality. This result is applied directly to the bipartite qubit system of a top and antitop produced at a hadron collider. We show that the beam axis is the optimal basis choice near the t t ¯ threshold production for measuring Bell inequality violation, while at high transverse momentum the basis that aligns along the momentum direction of the top is optimal. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

DOE OSTI2025

Energy Shifts and Broadening of Excitonic Resonances in Electrostatically Doped Semiconductors

Tuning the density of resident electrons or holes in semiconductors through electrostatic doping provides crucial insight into the composition of the many excitonic complexes that are routinely observed as absorption or photoluminescence resonances in optical studies. Moreover, we can change the way these resonances shift and broaden in energy by controlling the quantum numbers (e.g., spin and valley) of the resident carriers with applied magnetic fields and doping levels, as well as by selecting the quantum numbers of the photoexcited or recombining electron-hole (𝑒−ℎ) pair through optical polarization. Here, we discuss the roles of distinguishability and optimality of excitonic complexes, showing them to be key ingredients that determine the energy shifts and broadening of optical resonances in charge-tunable semiconductors. A distinguishable 𝑒−ℎ pair means that the electron and hole undergoing photoexcitation or recombination have quantum numbers that are not shared by any of the resident carriers. An optimal excitonic complex refers to a complex whose particles come with all available quantum numbers of the resident carriers. Based on the carrier density, magnetic field, and light polarization, all optical resonances may be classified as either distinct or indistinct depending on the distinguishability of the 𝑒−ℎ pair, and the underlying excitonic complex can be classified as either optimal or suboptimal. The universality of these classifications, inherited from the fundamental Pauli exclusion principle, allows us to understand how optical resonances shift in energy and whether they should broaden as doping is increased. This understanding is supported by conclusive evidence that the broadening and decay of optical resonances cannot be simply attributed to enhanced screening when resident carriers are added to a semiconductor. Finally, applying the classification scheme in either monolayer or moiré heterobilayer semiconductor systems, we relate the energy shift and amplitude of the neutral-exciton resonance to the compressibility of the resident carrier gas.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

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↗

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↗

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↗