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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Generalized echo squeezing protocol with near-Heisenberg-limit sensitivity and strong robustness against detection noise and variation in squeezing parameter

We present a generalized echo squeezing protocol (GESP) as a generalization of the Schrödinger cat state protocol with the value of the squeezing parameter being an arbitrary number rather than π / 2 . We show analytically that over a very broad range of the squeezing parameter the sensitivity of the GESP reaches the Heisenberg limit within a factor of 2 . For a large number of atoms, N , this plateau interval is almost the whole range from zero to π / 2 , and the sensitivity is independent of the parity of N . Therefore, it is possible to operate a sensor over a wide interval of the squeezing parameter without changing the sensitivity. This is to be contrasted with the conventional echo squeezing protocol (CESP) which only works for a very small interval of the squeezing parameter. We also show that, in contrast to the CESP, the sensitivity of the GESP is close to the quantum Cramér-Rao bound over the whole range of the squeezing parameter, indicating that the phase-shift information contained in the quantum state is near-optimally extracted. We find that the enhancement in sensitivity in the case of the GESP is due to a combination of two parameters: the phase magnification factor (PMF) and the noise amplification factor (NAF). As the value of the squeezing parameter increases, both PMF and NAF increase, while keeping the ratio of the PMF to the NAF essentially constant, yielding a net enhancement of sensitivity at the Heisenberg limit within a factor of 2 over the whole plateau interval. An important consequence of this behavior is that the robustness of the GESP against detection noise easily exceeds that of the CESP for a broad range of values of the squeezing parameter. As such, in the context of an experimental study, it should be possible to achieve a net enhancement in sensitivity higher than that for the CESP, under typical conditions where detection noise exceeds the quantum projection noise of an unsqueezed state with the same number of atoms. Finally, we consider the fragility of the GESP against decoherence mechanisms, and show how a balance between the fragility against the decoherence mechanisms and the robustness against detection noise would in practice determine the optimal choice of parameters for the GESP.

Li, Jinyang↗
DOE OSTI2026

Blueprint for DOE Quantum Supercomputing: Ensuring U.S. Leadership in the Quantum Decade

Quantum computing stands at the threshold of a transformative decade, where the field will evolve from small-scale demonstrations toward practical scientific computing at scale. This Blueprint identifies fault-tolerant quantum computers (FTQCs) as a viable, scalable, and broadly applicable path to achieving “quantum scientific utility,” defined as solving scientifically valuable problems beyond the reach of conventional, classical computers. This capability is expected to show scientific demonstrations in the late 2020s and to mature in the early-to-mid 2030s. This Blueprint outlines a strategy to prepare the U.S. Department of Energy (DOE) for FTQCs and their integration into the U.S. national scientific computing infrastructure. Its purpose is to identify the steps, milestones, and research directions necessary for DOE to enable initial deployment of FTQCs in 2028 as a scientific tool for the nation and mature this capability into the 2030s. DOE has a long history of supporting quantum information science and technology, contributing significantly to research advancements, training a quantum-ready workforce, and providing access to early small-scale quantum hardware. Given recent demonstrations of logical operations on error-corrected logical qubits and the advancement of commercial hardware roadmaps, DOE should begin preparations for large-scale, fault-tolerant quantum computing deployment for DOE science missions. This Blueprint proposes that DOE focus on (1) deploying first-generation scientifically relevant quantum computers with at least 100 logical qubits and performing at least 10,000 to 100,000 hard logical operations in scientifically relevant calculations; (2) developing essential FTQC programming competencies, system software, and facility readiness; and (3) investing in cutting edge focused R&D that fosters breakthroughs in scientific applications, algorithms, and logical architectures needed to accelerate the advent of scientific utility. This effort will position DOE to transition to larger systems: production-scale quantum computers that comprise 1,000 to 10,000 logical qubits, perform 1 to 10 billion hard logical operations, and execute scientifically useful computations at scale. Achieving these goals will require DOE facilities to evolve with urgency to support scientific campaigns that integrate quantum and classical computing resources into efficient workflows, novel software and firmware environments for compiling and routing quantum programs on FTQC machines, and suitable infrastructure for quantum hardware. It will also require further development and optimization of scientific applications from the fields of materials science, quantum chemistry, and high-energy and nuclear physics. The Blueprint calls for transformative R&D and collective action to accelerate the advent of scientific quantum utility and bring it within reach by 2028.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1996

Sharp Infrared Eyes The Journey of QWIPs from Concept to Large Inexpensive Sensitive Arrays in Hand-held Infrared Cameras

One of the simplest device realizations of the classic particle-in-a-box problem of basic quantum mechanics is the Quantum Well Infrared Photodetector (QWIP). Optimization of the detector design and material growth and processing has culminated in the realization of a camera with a large (256x256 pixel) focal plane array of QWIPs which can see at 8.5 mu m, holding forth great promise for a variety of applications in the 6-25 mu m wavelength range.

Quantum Well Infrared Photodetector QWIP quantum m↗
DOE OSTI2024

Systematic Improvement of Quantum Monte Carlo Calculations in Transition Metal Oxides: sCI-Driven Wavefunction Optimization for Reliable Band Gap Prediction

Accurate determination of the electronic properties of correlated oxides remains a significant challenge for computational theory. Traditional Hubbard-corrected density functional theory (DFT+U) frequently encounters limitations in precisely capturing electron correlation, particularly in predicting band gaps. We introduce a systematic methodology to enhance the accuracy of diffusion Monte Carlo (DMC) simulations for both ground and excited states, focusing on LiCoO 2 as a case study. By employing a selected configuration interaction (sCI) approach, we demonstrate the capability to optimize wavefunctions beyond the constraints of single-reference DFT+U trial wavefunctions. Here, we show that the sCI framework enables accurate prediction of band gaps in LiCoO 2 , closely aligning with experimental values and substantially improving traditional computational methods. The study uncovers a nuanced mixed state of t 2g and e g orbitals at the band edges that is not captured by conventional single-reference methods, further elucidating the limitations of PBE+U in describing d-d excitations. Our findings advocate for the adoption of beyond-DFT methodologies, such as sCI, to capture the essential physics of excited-state wavefunctions in strongly correlated materials. The improved accuracy in band gap predictions and the ability to generate more reliable trial wavefunctions for DMC calculations underscore the potential of this approach for broader applications in the study of correlated oxides. This work not only provides a pathway for more accurate simulations of electronic structures in complex materials but also suggests a framework for future investigations of the excited states of other challenging systems.

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

Generalized Quantum Convolution for Multidimensional Data

The convolution operation plays a vital role in a wide range of critical algorithms across various domains, such as digital image processing, convolutional neural networks, and quantum machine learning. In existing implementations, particularly in quantum neural networks, convolution operations are usually approximated by the application of filters with data strides that are equal to the filter window sizes. One challenge with these implementations is preserving the spatial and temporal localities of the input features, specifically for data with higher dimensions. In addition, the deep circuits required to perform quantum convolution with a unity stride, especially for multidimensional data, increase the risk of violating decoherence constraints. In this work, we propose depth-optimized circuits for performing generalized multidimensional quantum convolution operations with unity stride targeting applications that process data with high dimensions, such as hyperspectral imagery and remote sensing. We experimentally evaluate and demonstrate the applicability of the proposed techniques by using real-world, high-resolution, multidimensional image data on a state-of-the-art quantum simulator from IBM Quantum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Non-commutative disintegrations: Existence and uniqueness in finite dimensions

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes of 2-positive (resp. positive) unital maps form a category. We prove non-commutative disintegrations are a.e. unique whenever they exist. We provide an explicit characterization for when disintegrations exist in the setting of finite-dimensional C*-algebras, and we give formulas for the associated disintegrations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

In situ ligand restraints from quantum-mechanical methods

In macromolecular crystallographic structure refinement, ligands present challenges for the generation of geometric restraints due to their large chemical variability, their possible novel nature and their specific interaction with the binding pocket of the protein. Quantum-mechanical approaches are useful for providing accurate ligand geometries, but can be plagued by the number of minima in flexible molecules. In an effort to avoid these issues, the Quantum Mechanical Restraints (QMR) procedure optimizes the ligand geometry in situ , thus accounting for the influence of the macromolecule on the local energy minima of the ligand. The optimized ligand geometry is used to generate target values for geometric restraints during the crystallographic refinement. As demonstrated using a sample of >2330 ligand instances in >1700 protein–ligand models, QMR restraints generally result in lower deviations from the target stereochemistry compared with conventionally generated restraints. In particular, the QMR approach provides accurate torsion restraints for ligands and other entities.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Mitigating the Sign Problem through Basis Rotations

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. Herein, we show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β ≳ 100, this accelerates such simulation by many orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1996

Long Wavelength Quantum Well Infrared Photodetector (QWIP) Research 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). Optimization of the detector design and material growth and processing has culminated in the realization of a 15 ??utoff 128x128 focal plane array camera and a camera with large (256x256 pixel) focal plane array of QWIPs which can see at 8.5 ??holding forth great promise for a variety of applications in the 6-25 ??avelength range. This paper discusses the physics of the QWIP and QWIP technology development at Jet Propulsion Laboratory

QWIP↗
NASA NTRS2002

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗
NASA NTRS2002

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗
DOE OSTI2022

Correlation between thickness dependent nanoscale structural chemistry and superconducting properties of ultrathin epitaxial NbN films

NbN-based superconductors have attracted interest for superconducting circuits, quantum computation and high frequency devices. The superconducting properties of NbN films are predominately reliant on the microstructure, therefore, an atomic-level understanding of the structure-chemistry is required to achieve high quality epitaxial NbN films. Here, in this study, the thickness-dependent superconducting properties of NbN films (5, 10, and 50 nm) within NbN/AlN/Al 2 O 3 heterostructures are investigated. NbN and AlN were epitaxially grown by an industrial scale physical vapor deposition technique. The role of nanoscale chemistry on the ultrathin NbN superconducting film is investigated at the atomic level for the first time via atom probe tomography, providing three-dimensional atomic distribution, chemical homogeneity, effect of impurities, specially, in secondary phase formations and interfacial abruptness. The NbN film with 5 nm of thickness demonstrates a superconducting transition temperature of 11.2 K as compared to 50 nm NbN films with a transition temperature of 15.3 K. These thickness dependent variation of superconducting properties are associated with the chemical inhomogeneity in terms of in-plane N:Nb distribution, secondary phase formations and NbN/AlN interfacial abruptness as a function of the NbN films thicknesses. The analysis depicts the interplay between the surface/interface and the superconducting properties of ultrathin NbN films. These results provide insights on material design and growth that will enable the development of optimized superconducting NbN films for quantum devices.

36 MATERIALS SCIENCE↗
DOE OSTI2024

Quantum communications work at SQMS

The Superconducting Quantum Materials and Systems (SQMS) Center is focused on advancing low-loss interconnectivity between quantum processing units (QPUs) to enable scalable quantum computing. In the short term, our goals include the development and optimization of 2D and 3D platforms with remotely entangled modules, refinement in microwave design and control schemes, and the achievement of high-fidelity quantum state transfer between superconducting quantum modules. Looking ahead, we aim to realize modular quantum computing with low-loss interconnects, maximize remote entanglement fidelity and implement robust quantum operations with error correction. We will leverage advanced microwave engineering and material science to optimize the performance of quantum interconnects and the coupling interfaces between the interconnects and the QPUs.

Vallières, André↗
NASA NTRS1994

Uncertainty relations as Hilbert space geometry

Precision measurements involve the accurate determination of parameters through repeated measurements of identically prepared experimental setups. For many parameters there is a 'natural' choice for the quantum observable which is expected to give optimal information; and from this observable one can construct an Heinsenberg uncertainty principle (HUP) bound on the precision attainable for the parameter. However, the classical statistics of multiple sampling directly gives us tools to construct bounds for the precision available for the parameters of interest (even when no obvious natural quantum observable exists, such as for phase, or time); it is found that these direct bounds are more restrictive than those of the HUP. The implication is that the natural quantum observables typically do not encode the optimal information (even for observables such as position, and momentum); we show how this can be understood simply in terms of the Hilbert space geometry. Another striking feature of these bounds to parameter uncertainty is that for a large enough number of repetitions of the measurements all V quantum states are 'minimum uncertainty' states - not just Gaussian wave-packets. Thus, these bounds tell us what precision is achievable as well as merely what is allowed.

Braunstein, Samuel L.↗
DOE OSTI2023

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗