Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,045 records · Page 58
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Heterodyne efficiency for a coherent laser radar with diffuse or aerosol targets

The performance of a Coherent Laser Radar is determined by the statistics of the coherent Doppler signal. The heterodyne efficiency is an excellent indication of performance because it is an absolute measure of beam alignment and is independent of the transmitter power, the target backscatter coefficient, the atmospheric attenuation, and the detector quantum efficiency and gain. The theoretical calculation of heterodyne efficiency for an optimal monostatic lidar with a circular aperture and Gaussian transmit laser is presented including beam misalignment in the far-field and near-field regimes. The statistical behavior of estimates of the heterodyne efficiency using a calibration hard target are considered. For space based applications, a biased estimate of heterodyne efficiency is proposed that removes the variability due to the random surface return but retains the sensitivity to misalignment. Physical insight is provided by simulation of the fields on the detector surface. The required detector calibration is also discussed.

Frehlich, R. G.↗
NASA NTRS2005

High-Efficiency Multi-Junction Space Solar Development Utilizing Lattice Grading

Progress towards achieving a high one-sun air mass 0 (AM0) efficiency in a monolithic dual junction solar cell comprised of a 1.62 eV InGaP top cell and a 1.1 eV InGaAs bottom cell grown on buffered GaAs is reported. The performance of stand-alone 1.62 eV InGaP and 1.1 eV InGaAs cells is compared to that of the dual junction cell. Projected AM0 efficiencies of 15.7% and 16.5% are expected for the 1.62 eV InGaP and 1.1 eV InGaAs cells grown on buffered GaAs. The dual junction cell has a projected one-sun AM0 conversion efficiency of 17%. The projected efficiencies are based upon the application of an optimized anti-reflective coating (ARC) to the as-grown cells. Quantum efficiency (QE) data obtained from the dual junction cell indicate that is is bottom cell current limited with the top cell generating 50% more current than the bottom cell. A comparison of the QE data for the stand-alone 1.1 eV InGaAs cell to that of the 1.1 eV InGaAs bottom cell in the tandem configuration indicates a degradation of the bottom cell conversion efficiency in the tandem configuration. The origin of this performance degradation is at present unknown. If the present limitation can be overcome, then a one-sun AM0 efficiency of 26% is achievable with the 1.62 eV/1.1 eV dual junction cell grown lattice-mismatched to GaAs.

Stan, Mark A.↗
DOE OSTI2022

MemHC: An Optimized GPU Memory Management Framework for Accelerating Many-body Correlation

The many-body correlation function is a fundamental computation kernel in modern physics computing applications, e.g., Hadron Contractions in Lattice quantum chromodynamics (QCD). This kernel is both computation and memory intensive, involving a series of tensor contractions, and thus usually runs on accelerators like GPUs. Existing optimizations on many-body correlation mainly focus on individual tensor contractions (e.g., cuBLAS libraries and others). In contrast, this work discovers a new optimization dimension for many-body correlation by exploring the optimization opportunities among tensor contractions. More specifically, it targets general GPU architectures (both NVIDIA and AMD) and optimizes many-body correlation’s memory management by exploiting a set of memory allocation and communication redundancy elimination opportunities: first, GPU memory allocation redundancy: the intermediate output frequently occurs as input in the subsequent calculations; second, CPU-GPU communication redundancy: although all tensors are allocated on both CPU and GPU, many of them are used (and reused) on the GPU side only, and thus, many CPU/GPU communications (like that in existing Unified Memory designs) are unnecessary; third, GPU oversubscription: limited GPU memory size causes oversubscription issues, and existing memory management usually results in near-reuse data eviction, thus incurring extra CPU/GPU memory communications.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Counterdiabatic Driving with Performance Guarantees

Counterdiabatic (CD) driving has the potential to speed up adiabatic quantum state preparation by suppressing unwanted excitations. However, existing approaches either require intractable classical computations or are based on approximations that do not have performance guarantees. We propose and analyze a nonvariational, system-agnostic CD expansion method and analytically show that it converges exponentially quickly in the expansion order. In finite systems, the required resources scale inversely with the spectral gap, which we argue is asymptotically optimal. To extend our method to the thermodynamic limit and suppress errors stemming from high-frequency transitions, we leverage finite-time adiabatic protocols. In particular, we show that a time determined by the quantum speed limit is sufficient to prepare the desired ground state, without the need to optimize the adiabatic trajectory. Numerical tests of our method on the quantum Ising chain show that our method can outperform state-of-the-art variational CD approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2026

Optimization of X-ray Absorbers for High-Resolution TES Detectors in NewATHENA X-IFU

NewATHENA’s X-ray Integral Field Unit (X-IFU) uses a large-format array of Transition Edge Sensor (TES) microcalorimeters coupled with absorbers made of gold and bismuth providing 4 eV FWHM resolution up to 7 keV in the 0.2- 12 keV band. X-ray absorbers must be thick enough for photon absorption, maintain low heat capacity for energy resolution, and have good thermalization properties. The X-IFU requires total Quantum Efficiency (QE) of 96%, 87%, and 63% at 1, 7, and 9.5 keV, respectively. Optimal thicknesses are 1.05 µm gold and 5.5 µm bismuth to achieve 0.731 pJ/K at 90 mK and 87% QE at 7 keV. While typical TES absorbers are 3-4 µm thick, producing the required 5.5 µm Bi absorbers via standard electroplating creates enlarged grains and surface roughness. The increased roughness and grain size variability produced with our standard recipe have resulted in instances of 1) low energy spectral tails 2) spectral broadening of the energy resolution and 3) thermal shorts between pixels when a large grain bridges the gap between absorbers. In this study, we have introduced a new fabrication process and altered the morphology of the thick Bi through changes in the electroplating process. The process changes are intended to address all three issues as well as reduce particulate contamination observed on the finished detector arrays.

Absorber↗
DOE OSTI2025

Direct interpolative construction of the discrete Fourier transform as a matrix product operator

The quantum Fourier transform (QFT), which can be viewed as a reindexing of the discrete Fourier transform (DFT), has been shown to be compressible as a low-rank matrix product operator (MPO) or quantized tensor train (QTT) operator. However, the original proof of this fact does not furnish a construction of the MPO with a guaranteed error bound. Meanwhile, the existing practical construction of this MPO, based on the compression of a quantum circuit, is not as efficient as possible. We present a simple closed-form construction of the QFT MPO using the interpolative decomposition, with guaranteed near-optimal compression error for a given rank. This construction can speed up the application of the QFT and the DFT, respectively, in quantum circuit simulations and QTT applications. We also connect our interpolative construction to the approximate quantum Fourier transform (AQFT) by demonstrating that the AQFT can be viewed as an MPO constructed using a different interpolation scheme.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A fitting algorithm for optimizing ion implantation energies and fluences

In this work we describe a method to automatically generate an ion implantation recipe, a set of energies and fluences, to produce a desired defect density profile in a solid using the fewest required energies. We simulate defect density profiles for a range of ion energies, fit them with an appropriate function, and interpolate to yield defect density profiles at arbitrary ion energies. Given Ν energies, we then optimize a set of Ν energy-fluence pairs to match a given target defect density profile. Finally, we find the minimum Ν such that the error between the target defect density profile and the defect density profile generated by the Ν energy-fluence pairs is less than a given threshold. Inspired by quantum sensing applications with nitrogen-vacancy centers in diamond, we apply our technique to calculate optimal ion implantation recipes to create uniform-density 1 μm surface layers of 15 N or vacancies (using 4 He).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2021

Clifford Circuit Optimization with Templates and Symbolic Pauli Gates

The Clifford group is a finite subgroup of the unitary group generated by the Hadamard, the CNOT, and the Phase gates. This group plays a prominent role in quantum error correction, randomized benchmarking protocols, and the study of entanglement. Here we consider the problem of finding a short quantum circuit implementing a given Clifford group element. Our methods aim to minimize the entangling gate count assuming all-to-all qubit connectivity. First, we consider circuit optimization based on template matching and design Clifford-specific templates that leverage the ability to factor out Pauli and SWAP gates. Second, we introduce a symbolic peephole optimization method. It works by projecting the full circuit onto a small subset of qubits and optimally recompiling the projected subcircuit via dynamic programming. CNOT gates coupling the chosen subset of qubits with the remaining qubits are expressed using symbolic Pauli gates. Software implementation of these methods finds circuits that are only 0.2% away from optimal for 6 qubits and reduces the two-qubit gate count in circuits with up to 64 qubits by 64.7% on average, compared with the Aaronson-Gottesman canonical form.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

High polarization InAlGaAs/AlGaAs photocathodes grown using MBE

Strained superlattices of GaAs/GaAsP grown using molecular beam epitaxy (MBE) have been used for more than 20 years to generate high polarization electron beams for nuclear physics. GaAs/GaAsP superlattices have several manufacturing challenges, including the thick graded layer required for the virtual GaAsP substrate, the significant difference in optimal growth temperatures for GaAs and GaAsP, and the scarcity of MBE systems using phosphorus. InAlGaAs/AlGaAs strained superlattice photocathode are an alternative structure that eliminates many of hurdles to growing GaAs/GaAsP in MBE systems. Measurements of quantum efficiency and polarization from InAlGaAs/AlGaAs will be presented. These include studies on a variety of growth parameters to optimize performance, including digital alloys, growth temperature variations, and variation in structure.

Stutzman, Marcy L↗
DOE OSTI2018

Optimal structure and parameter learning of Ising models

Reconstruction of the structure and parameters of an Ising model from binary samples is a problem of practical importance in a variety of disciplines, ranging from statistical physics and computational biology to image processing and machine learning. The focus of the research community shifted toward developing universal reconstruction algorithms that are both computationally efficient and require the minimal amount of expensive data. Here, we introduce a new method, interaction screening, which accurately estimates model parameters using local optimization problems. The algorithm provably achieves perfect graph structure recovery with an information-theoretically optimal number of samples, notably in the low-temperature regime, which is known to be the hardest for learning. Here, the efficacy of interaction screening is assessed through extensive numerical tests on synthetic Ising models of various topologies with different types of interactions, as well as on real data produced by a D-Wave quantum computer. Finally, this study shows that the interaction screening method is an exact, tractable, and optimal technique that universally solves the inverse Ising problem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Electronic structure with direct diagonalization on a D-wave quantum annealer

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Two-Stage Quantum Reinforcement Learning Method for Multi-Objective Transmission Switching

Multi-objective transmission switching (MO-TS) problems involve the strategic reconfiguration of network topology to simultaneously optimize multiple objectives. As the system scale increases, finding feasible solutions becomes increasingly challenging due to the problem's nonlinearity and high computational complexity. To address these challenges, this paper proposes a two-stage quantum reinforcement learning method that leverages potential quantum advantages for MO-TS. In the first stage, candidate switching lines are identified using a graph-theoretical approach to reduce the problem's dimensionality. The second stage introduces a quantum-classical reinforcement learning framework, where a learnable measurement-based CNN-ResVQC architecture is developed to effectively reduce the input dimension for quantum processing, mitigate vanishing gradients, and enhance trainability while improving the quantum circuit's flexibility in modeling complex decision policies for MO-TS. Numerical studies on IEEE 14-bus, 57-bus, and 118-bus systems demonstrate that the proposed algorithm achieves superior training stability and faster convergence with approximately 1% of the network parameters required by classical algorithms, highlighting its effectiveness, efficiency, and scalability. Furthermore, the practicality is validated through its stable convergence under three common quantum noise channels.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2019

Nearly Optimal Lattice Simulation by Product Formulas

We consider simulating an n-qubit Hamiltonian with nearest-neighbor interactions evolving for time t on a quantum computer. We show that this simulation has gate complexity (nt)1+o(1) using product formulas, a straightforward approach that has been demonstrated by several experimental groups. While it is reasonable to expect this complexity—in particular, this was claimed without rigorous justification by Jordan, Lee, and Preskill—we are not aware of a straightforward proof. Furthermore, our approach is based on an analysis of the local error structure of product formulas, as introduced by Descombes and Thalhammer and significantly simplified here. We prove error bounds for canonical product formulas, which include well-known constructions such as the Lie-Trotter-Suzuki formulas. We also develop a local error representation for time-dependent Hamiltonian simulation, and we discuss generalizations to periodic boundary conditions, constant-range interactions, and higher dimensions. Combined with a previous lower bound, our result implies that product formulas can simulate lattice Hamiltonians with nearly optimal gate complexity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Unified architecture for quantum lookup tables

Quantum access to arbitrary classical data encoded in unitary black-box oracles underlies interesting data-intensive quantum algorithms, such as machine learning or electronic structure simulation. The feasibility of these applications depends crucially on gate-efficient implementations of these oracles, which are commonly some reversible versions of the Boolean circuit for a classical lookup table. Here, we present a general parametrized architecture for quantum circuits implementing a lookup table that encompasses all prior work in realizing a continuum of optimal trade-offs between qubits, non-Clifford gates, and error resilience, up to logarithmic factors. Our architecture assumes only local 2D connectivity, yet recovers results, with the appropriate parameters, polylogarithmic error scaling. We also identify regimes, such as simultaneous sublinear scaling, in all parameters. These results enable tailoring implementations of the commonly used lookup table primitive to any given quantum device with constrained resources.

quantum circuits↗
DOE OSTI2018

A necessary condition of Pontryagin type for fuzzy control systems

In the present paper, we prove necessary optimality conditions of Pontryagin type for a class of fuzzy optimal control problems. The new results are illustrated by computing the extremals of two fuzzy optimal control systems, which improve recent results of Najariyan and Farahi.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Design and optimization of high temperature optocouplers as galvanic isolation

The commercial InGaN-based (blue and green) and AlGaInP-based (red) multiple quantum well (MQW) lighting emitting diodes (LEDs) were studied in a wide range of temperatures up to 800 K for their light emission and detection (i.e., LEDs operated under reverse bias as photodiodes (PDs)) characteristics. The results indicate the feasibility of integrating a pair of selected LEDs to fabricate high temperature (HT) optocouplers, which can be utilized as galvanic isolation to replace the bulky isolation transforms in the high-density power modules. A detailed study on LEDs and PDs were performed. The external quantum efficiency (EQE) of the LED and PDs were calculated. Higher relative external quantum efficiency (EQE) and lower efficiency droops with temperatures are obtained from the blue and green LEDs for display compared with the blue one for lighting and red LED for display. The blue for lighting and red for display devices show superior responsivity, specific detectivity (D*), and EQE compared with blue and green for display when operated as PDs. The results suggest that red LED devices for display can be used to optimize HT optocouplers due to the highest wavelength overlapping compared with others.

42 ENGINEERING↗
DOE OSTI2022

Equation of State Optimization and Uncertainty Quantization: Implementation in the LANL EOS Production Code OpenSesame

We detail the approaches of particle swarm optimization and Bayesian inference through Markov chain Monte Carlo for equation of state development. This work includes formulation of the modeling for the equation of state, numeric optimization of the parametric models via particle swarm optimization, and generation of probability distributions of equations of state from Markov chain Monte Carlo.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Measure of quantum correlations that lies approximately between entanglement and discord

When a quantum system is divided into two local subsystems, measurements on the two subsystems can exhibit correlations beyond those possible in a classical joint probability distribution; these are partially explained by entanglement, and more generally by a wider class of measures such as the quantum discord. In this paper, I introduce a simple thought experiment defining a measure of quantum correlations, which I call the accord, and write the result as a minimax optimization over unitary matrices. I find the exact result for pure states as a simple function of the Schmidt coefficients and provide a complete proof, and I likewise provide and prove the result for several classes of mixed states, notably including all states of two qubits and the experimentally relevant case of a pure state mixed with colorless noise. I demonstrate that for two qubit states the accord provides a tight lower bound on the discord; for Bell diagonal states it is also an upper bound on entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗