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 523 records · Page 29
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer

Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Reducing Randomized Quantum Algorithm Cost [Slides]

We derive the optimal sampling strategy for minimizing total resource cost in randomized quantum algorithms. Our framework is completely general, allowing for resources as diverse as gate counts circuit depth, runtime, or even dissipated energy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Programmable interactions and emergent geometry in an array of atom clouds

Interactions govern the flow of information and the formation of correlations between constituents of many-body quantum systems, dictating phases of matter found in nature and forms of entanglement generated in the laboratory. Typical interactions decay with distance and thus produce a network of connectivity governed by geometry—such as the crystalline structure of a material or the trapping sites of atoms in a quantum simulator. However, many envisioned applications in quantum simulation and computation require more complex coupling graphs including non-local interactions, which feature in models of information scrambling in black hole, and mappings of hard optimization problems onto frustrated classical magnets. Here we describe the realization of programmable non-local interactions in an array of atomic ensembles within an optical cavity, in which photons carry information between atomic spins. By programming the distance dependence of the interactions, we access effective geometries for which the dimensionality, topology and metric are entirely distinct from the physical geometry of the array. As examples, we engineer an antiferromagnetic triangular ladder, a Möbius strip with sign-changing interactions and a treelike geometry inspired by concepts of quantum gravity. The tree graph constitutes a toy model of holographic duality, in which the quantum system lies on the boundary of a higher-dimensional geometry that emerges from measured correlations. Overall, our work provides broader prospects for simulating frustrated magnets and topological phases, investigating quantum optimization paradigms and engineering entangled resource states for sensing and computation.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Faster Tensor Network Decoding for Topological Quantum Codes

We present a fast and Bayes-optimal-approximating tensor network decoder for planar quantum LDPC codes based on the tensor renormalization group algorithm, originally proposed by Levin, and Nave. By precomputing the renormalization group flow for the null syndrome, we need only recompute tensor contractions in the causal cone of the measured syndrome at the time of decoding. This allows us to achieve an overall runtime complexity of ($pnχ^6$) where p is the depolarizing noise rate, and χ is the cutoff value used to control singular value decomposition approximations used in the algorithm. We apply our decoder to the surface code in the code capacity noise model and compare its performance to the original matrix product state (MPS) tensor network decoder introduced by Bravyi, Suchara, and Vargo. The MPS decoder has a p-independent runtime complexity of $\mathcal{O}(nχ^3)$ resulting in significantly slower decoding times compared to our algorithm in the low-p regime.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Function Maximization with Dynamic Quantum Search

Finding the maximum value of a function in a dynamic model plays an important role in many application settings, including discrete optimization in the presence of hard constraints. We present an iterative quantum algorithm for finding the maximum value of a function in which prior search results update the acceptable response. Our approach is based on quantum search and utilizes a dynamic oracle function to mark items in a specified input set. As a realization of function optimization, we verify the correctness of the algorithm using numerical simulations of quantum circuits for the Knapsack problem. In conclusion, our simulations make use of an explicit oracle function based on arithmetic operations and a comparator subroutine, and we verify these implementations using numerical simulations up to 30 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Adiabatic quantum support vector machines

Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic quantum approach for training support vector machines. We show that the time complexity of our quantum approach is an order of magnitude better than the classical approach. Next, we compare the test accuracy of our quantum approach against a classical approach that uses the Scikit-learn library in Python across five benchmark datasets (Iris, Wisconsin Breast Cancer (WBC), Wine, Digits, and Lambeq). We show that our quantum approach obtains accuracies on par with the classical approach. Finally, we perform a scalability study in which we compute the total training times of the quantum approach and the classical approach with an increasing number of features and an increasing number of data points in the training dataset. In conclusion, our scalability results show that the quantum approach obtains a 3.5–4.5x speedup over the classical approach on datasets with many (millions of) features.

Computational Complexity↗
DOE OSTI2025

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗
DOE OSTI2025

Deterministic fabrication of highly reproducible monochromatic quantum emitters in hexagonal boron nitride

Quantum emitters in hexagonal boron nitride are important room temperature single-photon sources. However, conventional fabrication methods yield quantum emitters with dispersed and inconsistent spectral profiles, limiting their potential for practical quantum applications, which demand reproducible high quality single-photon sources. Here, we report the deterministic creation of highly reproducible monochromatic quantum emitters by applying carbon-ion implantation on freestanding hexagonal boron nitride flakes, while a carbon mask with suitable thickness was adapted to optimize the implantation results. Quantum emitters fabricated using this approach exhibited thermally limited monochromaticity, with an emission center wavelength of 590.7 ± 2.7 nm, a narrow full width at half maximum of 7.1 ± 1.7 nm, an emission rate of 1 MHz without optical engineering, and exceptional stability under ambient conditions. Density functional theory calculations and scanning transmission electron microscopy suggest that these emitters are comprised of boron centered carbon tetramers. This method provides a reliable single-photon source for optical quantum computing and potential future industry-scale applications.

Hua, Muchuan [Argonne National Laboratory (ANL), A↗
DOE OSTI2020

A multilayer multi-configurational approach to efficiently simulate large-scale circuit-based quantum computers on classical machines

Here, a multilayer multi-configurational theory framework is adapted to simulate circuit-based quantum computers. Quantum addition of superpositions of an exponential number of summands is performed in polynomial time with high accuracy. We demonstrate numerically accurate calculations including up to one million qubits for entangling benchmarks. Simulation cost can be assessed by entropy-based entanglement measures. For the considered systems, we show that the entanglement only grows weakly with the system size. The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Accelerated Selectrion of Optimal Perovskite Alloys for Solar PV using a Combined Quantum and Machine Learning Hierachiral Approach

The project aims to: (i) accelerate the discovery of “Missing HP alloys” by combining quantum mechanics and artificial intelligence machine learning approaches, and (ii) analyze the stabilities of candidate alloys, including those that do not pass selection filters (and are thus expected to degrade over time) to decipher the nature of the instabilities to guide the development of durable solar cell materials. Successful candidates will be subjected to validation experiments at NREL's state-of-the-art facilities. The discoveries this effort will provide will be directly testable and implementable and will greatly impact U.S. progress in HP PV as they will provide clear direction and motivation for experimental studies including specific material synthetic targets, device optimization, and device stability protocols. A key advantage of this effort is the feedback and guidance provided by the Industry Collaborative Work Group that we established to coordinate academic and national lab research with industry needs. The proposed work will provide a basis for and direct the development of robust and reliable HP PV. It will also provide a timely, valuable and extensive roadmap to the experimental HP PV community to enable it to focus its efforts on improving and fine-tuning promising HP compositions that this effort predicts will likely be the best performers rather than wandering in the vast chemical space for decades spending enormous resources mostly evaluating unpromising candidate materials.

14 SOLAR ENERGY↗
DOE OSTI2020

Field Programmable Gate Arrays for Enhancing the Speed and Energy Efficiency of Quantum Dynamics Simulations

We present the first application of field programmable gate arrays (FPGAs) as new, customizable hardware architectures for carrying out fast and energy-efficient quantum dynamics simulations of large chemical/material systems. Instead of tailoring the software to fixed hardware, which is the typical case for writing quantum chemistry code for central processing units (CPUs) and graphics processing units (GPUs), FPGAs allow us to directly customize the underlying hardware (even at the level of specific electrical signals in the circuit) to give a truly optimized computational performance for quantum dynamics calculations. By offloading the most intensive and repetitive calculations onto an FPGA, we show that the computational performance of our real-time electron dynamics calculations can even exceed that of optimized commercial mathematical libraries running on high-performance GPUs. In addition to this impressive computational speedup, we show that FPGAs are immensely energy-efficient and consume 4 times less energy than modern GPU or CPU architectures. These energy savings are a practical and important metric for supercomputing centers (many of which exceed over $1 million in power costs alone), as exascale computing capabilities become more widespread and commonplace. Taken together, the implementation techniques and performance metrics of our study demonstrate that FPGAs could play a promising role in upcoming quantum chemistry and materials science applications, particularly for the acceleration and energy-efficient execution of quantum dynamics calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2000

8-9 and 14-15 Micron Two-Color 640x486 GaAs/AlGaAs Quantum Well Infrared Photodetector (QWIP) Focal Plane Array Camera

An optimized long-wavelength two-color Quantum Well Infrared Photodetector (QWIP) device structure has been designed. This device structure was grown on a three inch semi-insulating GaAs substrate by molecular beam epitaxy (MBE). This wafer was processed into several 640x486 format monolithically integrated 8-9 and 14-15 micron two color (or dual wavelength) QWIP focal plane arrays (FPAs). These FPAs were then hybridized to 640x486 silicon CMOS readout multiplexers. A thinned (i.e., substrate removed) FPA hybrid was integrated into a liquid helium cooled dewar to perform electrical and optical characterization and to demonstrate simultaneous two-color imagery. The 8-9 micron detectors in the FPA have shown background limited performance (BLIP) at 70 K operating temperature, at 300 K background with f/2 cold stop. The 14-15 micron detectors of the FPA have reached BLIP at 40 K operating temperature at the same background conditions. In this presentation we discuss the performance of this long-wavelength dualband QWIP FPA in quantum efficiency, detectivity, noise equivalent temperature difference (NEAT), uniformity, and operability.

Gunapala, S. D.↗
DOE OSTI2020

A bis-vanadyl coordination complex as a 2-qubit quantum gate

A divanadyl complex anion is isolated through a new bis-hydroxyphenylpyrazolyl ligand and has optimal weak dipolar coupling and quantum coherence to implement electron-mediated nuclear quantum simulations in a 2-qubit molecular architecture.

Borilovic, Ivana↗
DOE OSTI2020

Quandary

Quandary numerically simulates and optimizes the time-evolution of open quantum systems. The underlying dynamics are modelled by Lindblad's master equation, a linear ordinary differential equation (ODE) describing quantum systems interacting with the environment. Quandary solves this ODE numerically by applying a time-stepping integration scheme, and utilizes a gradient-based optimization approach to determine optimal control pulses that drive the quantum system to a desired target state. Two optimization objectives are considered: (a) Unitary gate optimization that finds controls to realize a unitary gate transformation, and (b) optimal reset that aims to drive the quantum system to the ground states. Gradient-based optimization schemes utilizing Petsc's Tao optimization package are applied to generate control pulses that minimize the respective measure. To evaluate the gradient of the objective function, the discrete adjoint method is used while leveraging techniques from Algorithmic Differentiation to produce exact and consistent gradients. To mitigate excessive execution run times, the software can be build together with the XBraid software library which provides a parallelization strategy to distribute the time-evolution of the underlying dynamics onto multiple processor.

Petersson, NilsA.↗
DOE OSTI2022

Generation of bright monomeric red fluorescent proteins via computational design of enhanced chromophore packing

Red fluorescent proteins (RFPs) have found widespread application in chemical and biological research due to their longer emission wavelengths. Here, we use computational protein design to increase the quantum yield and thereby brightness of a dim monomeric RFP (mRojoA, quantum yield = 0.02) by optimizing chromophore packing with aliphatic residues, which we hypothesized would reduce torsional motions causing non-radiative decay. Experimental characterization of the top 10 designed sequences yielded mSandy1 (λ em = 609 nm, quantum yield = 0.26), a variant with equivalent brightness to mCherry, a widely used RFP. We next used directed evolution to further increase brightness, resulting in mSandy2 (λ em = 606 nm, quantum yield = 0.35), the brightest Discosoma sp. derived monomeric RFP with an emission maximum above 600 nm reported to date. Crystallographic analysis of mSandy2 showed that the chromophore p-hydroxybenzylidene moiety is sandwiched between the side chains of Leu63 and Ile197, a structural motif that has not previously been observed in RFPs, and confirms that aliphatic packing leads to chromophore rigidification. Our results demonstrate that computational protein design can be used to generate bright monomeric RFPs, which can serve as templates for the evolution of novel far-red fluorescent proteins.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗