Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum algorithms”

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,405 records · Page 78

Development of Large-Scale Magnetic Calorimeter Arrays

We describe performance of large-scale arrays of metallic magnetic calorimeters (MMCs) we are developing to meet requirements of the Lynx X-ray Microcalorimeter (LXM) instrument in the astrophysics mission concept Lynx. We have fabricated prototypes with 55,800 x-ray pixels thermally connected to 5,688 MMC sensors. Subarrays demonstrate three types of pixels, which have different energy and spatial resolution goals in LXM. Pixel pitch is 50 or 25 µm. For two subarrays, use of position sensitive detectors, in a "hydra" configuration with 25 x-ray absorbers per sensor, helps achieve a large focal plane by increasing pixel count relative to readout channels. Since each absorber has a different thermal link to its sensor, it generates a different pulse shape and enables discrimination of pixel position. Superconducting wiring from all sensors was brought out to the perimeter of the overall array using multiple buried metal layers planarized by Chemical Mechanical Planarization to achieve high critical current, low inductance, and high fabrication yield. An automated, algorithmic approach was used to layout the complex wiring pattern. For readout with existing small arrays of Superconducting Quantum Interference (SQUID) amplifiers, 112 selected pixels were connected to wire bond pads. In hydras, we successfully identified 25 pulse shapes using rise-time and pulse height. Pulse shapes were similar to simulations. We measured noise and responsivity to substrate temperature and applied x-ray pulses. While we designed sensors to have high inductance to relative to stray inductance of wiring, we had only mismatched (lower input inductance) SQUIDs available in our current apparatus, giving non-optimized resolution. We compared measured and calculated energy resolutions. We have the required sensitivity to reach < 3 eV FWHM resolution for 6 keV x-rays, required for the LXM Main Array, and the ability to discriminate the 25 different absorber pixels down to energies < 300 eV.

microcalorimeters↗

The matrix product approximation for the dynamic cavity method

Stochastic dynamics of classical degrees of freedom, defined on vertices of locally tree-like graphs, can be studied in the framework of the dynamic cavity method which is exact for tree graphs. Such models correspond for example to spin-glass systems, Boolean networks, neural networks, and other technical, biological, and social networks. The central objects in the cavity method are edge messages—conditional probabilities of two vertex variable trajectories. In this paper, we discuss a rather pedagogical derivation for the dynamic cavity method, give a detailed account of the novel matrix product edge message (MPEM) algorithm for the solution of the dynamic cavity equation as introduced, and present optimizations and extensions. Matrix product approximations of the edge messages are constructed recursively in an iteration over time. Computation costs and precision can be tuned by controlling the matrix dimensions of the MPEM in truncations. Without truncations, the dynamics is exact. Data for Glauber–Ising dynamics shows a linear growth of computation costs in time. In contrast to Monte Carlo simulations, the approach has a much better error scaling. Hence, it gives for example access to low probability events and decaying observables like temporal correlations. Here, we discuss optimized truncation schemes and an extension that allows to capture models which have a continuum time limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational Modeling of Vertical-Cavity Surface-Emitting Lasers

Vertical-Cavity Surface-Emitting Lasers (VCSELs) have become increasingly important for many applications, such as optical interconnects and optical data storages. In many applications, critical requirements are very often high beam quality and/or high output powers. To help the design and optimization of VCSELs for such applications, it is essential to have a simulation model that includes the time evolution of the transverse space dependence of the hewn. Such models allow arbitrary transverse profiles of laser intensity or carrier density to develop in time without any a priori assumption about the number and types of transverse modes. In addition, extensive research in the past has shown that many-body effects are important in influencing the optical gain and the refractive index of semiconductor quantum wells. It is thus important to include the key many-body effects in simulation models for semiconductor lasers. A computational model, called the Maxwell-Effective Bloch Equations (MEBE) was developed recently that simulates the above features and effects. This model combines the space-time resolution with microscopic many-body effects in a way that is both accurate enough and computationally manageable. This model has been used to simulate edge-emitting high power lasers recently. A new finite-difference algorithm has been developed for solving these equations and will be shown in the presentation. That algorithm will be used to calculate the detailed time evolution of the transverse mode profiles of VCSELs. The VCSELs are based on InGaAs/GaAs quantum well structures. Effects of pumping current and refractive index profiles will be investigated in detail. The simulation results will be compared with other results the use the rate-equation model.

Goorjian, Peter M.↗

Computational Nonlinear of Vertical-Cavity Surface-Emitting Lasers

Vertical-Cavity Surface-Emitting Lasers (VCSELs) have become increasingly important for many applications, such as optical interconnects and optical data storages. In many applications, critical requirements are very often high beam quality and/or high output powers. To help the design and optimization of VCSELs for such applications, it is essential to have a simulation model that includes the time evolution of the transverse space dependence of the beam. Such models allow arbitrary transverse profiles of laser intensity or carrier density to develop in time without any a priori assumption about the number and types of transverse modes. In addition, extensive research in the past has shown that many-body effects are important in influencing the optical gain and the refractive index of semiconductor quantum wells. It is thus important to include the key many-body effects in simulation models for semiconductor lasers. A computational model, called the Maxwell-Effective Bloch Equations (MEBE) was developed recently that simulates the above features and effects. This model combines the space-time resolution with microscopic many-body effects in a way that is both accurate enough and computationally manageable. This model has been used to simulate edge-emitting high power lasers recently. A new finite-difference algorithm has been developed for solving these equations and will be shown in the presentation. That algorithm will be used to calculate the detailed time evolution of the transverse mode profiles of VCSELs. The VCSELs are based on InGaAs/GaAs quantum well structures. Effects of pumping current and refractive index profiles will be investigated in detail. The simulation results will be compared with other results the use the rate-equation model.

Goorjian, Peter M.↗

Reinforcement learning pulses for transmon qubit entangling gates

The utility of a quantum computer is highly dependent on the ability to reliably perform accurate quantum logic operations. For finding optimal control solutions, it is of particular interest to explore model-free approaches, since their quality is not constrained by the limited accuracy of theoretical models for the quantum processor—in contrast to many established gate implementation strategies. In this work, we utilize a continuous control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits; specifically, our agent constructs cross-resonance and CNOT gates without any prior information about the physical system. Using a simulated environment of fixed-frequency fixed-coupling transmon qubits, we demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates in both fidelity and gate duration, while maintaining a comparable susceptibility to stochastic unitary noise. We further showcase an augmentation in training and input information that allows our agent to adapt its pulse design abilities to drifting hardware characteristics, importantly, with little to no additional optimization. Our results exhibit clearly the advantages of unbiased adaptive-feedback learning-based optimization methods for transmon gate design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Studying the hadron structure with PANDA and CLAS using machine learning techniques

The hadron spectroscopy and structure are currently very active fields of research to study the non-perturbative regime of quantum chronodynamics. The first one studies the complex structure of excited hadrons by looking at their decay products, while the latter uses lepton scattering on nucleons. Both methods require reconstruction algorithms with great efficiency and good particle identification and background rejection rates. This work aims to provide these by either improving the existing methods or developing new ones. The first part of this document presents a feasibility study of a predicted hybrid charmonium state for the PANDA experiment. Lattice QCD calculations predict the ground state hybrid charmonium to be a spin exotic with quantum numbers of JP C = 1?+ at a mass of around 4.3 GeV with a width to be around 20 MeV. A machine learning based data analysis scheme is proposed to further improve the signal efficiency and the background reduction, alongside with improvements of the analysis software (PandaRoot), that are vital for this study. These improvements include a reworked clustering algorithm for the electromagnetic calorimeter (EMC) and an optimized monte carlo matching for neutral particles. The second part of this document is about studying the proton structure. A multidimensional study of the structure function ratio Fsin(?)LU /FUU has been performed for K±, based on the measurement of beam-spin asymmetries. It uses the high statistics data recorded with the CLAS12 spectrometer at Jefferson Laboratory. Fsin(?)LU is a twist-3 quantity that provides information about the quark gluon correlations in the proton. This document will present for the first time a simultaneous analysis of two kaon channels over a large kinematic range of z, xB , PT and Q2 with virtualities Q2 ranging from 1 GeV2 up to 8 GeV2 using machine learning techniques for improved particle identification.

Kripko, Aron↗

A Backend-agnostic, Quantum-classical Framework for Simulations of Chemistry in C ++

As quantum computing hardware systems continue to advance, the research and development of performant, scalable, and extensible software architectures, languages, models, and compilers is equally as important to bring this novel coprocessing capability to a diverse group of domain computational scientists. For the field of quantum chemistry, applications and frameworks exist for modeling and simulation tasks that scale on heterogeneous classical architectures, and we envision the need for similar frameworks on heterogeneous quantum-classical platforms. Furthermore, we present the XACC system-level quantum computing framework as a platform for prototyping, developing, and deploying quantum-classical software that specifically targets chemistry applications. We review the fundamental design features in XACC, with special attention to its extensibility and modularity for key quantum programming workflow interfaces and provide an overview of the interfaces most relevant to simulations of chemistry. A series of examples demonstrating some of the state-of-the-art chemistry algorithms currently implemented in XACC are presented, while also illustrating the various APIs that would enable the community to extend, modify, and devise new algorithms and applications in the realm of chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Exploring the Adoption Challenges of Post-Quantum Cryptography in EV Charging Infrastructure

The rapid evolution of electric vehicle (EV) technology and the corresponding growth of the Electric Vehicle Charging Infrastructure (EVCI) brings to light significant cybersecurity concerns, notably in the context of emerging post-quantum computing capabilities. This report, prepared by Pacific Northwest National Laboratory (PNNL) under the U.S. Department of Energy contract, delves into the challenges associated with integrating Post-Quantum Cryptography (PQC) into EVCI to safeguard against potential quantum computing threats. Post-quantum computers will eventually be able to invalidate technologies secured through public key cryptography. As part of this effort, the primary gaps and challenges in the EVCI were investigated with a focus on comparing traditional algorithms against PQC algorithms. One of the notable findings was that the P-521 algorithm was frequently surpassed in performance by PQC algorithms. This document provides a thorough examination of the hurdles the industry can expect when transitioning to PQC within the EVCI, such as interoperability concerns, the computational and memory demands of PQC algorithms, and the organizational readiness for such a transition. It emphasizes the necessity of a forward-thinking approach to cybersecurity, advocating for early and strategic engagement among EVCI stakeholders to ensure a seamless and cost-effective migration to quantum-resistant cryptographic standards. Through this report, the authors aim to catalyze awareness and action among policymakers, industry leaders, and cybersecurity professionals towards fortifying the EVCI against emerging quantum threats, thereby securing the infrastructure essential for the future of electric mobility.

33 ADVANCED PROPULSION SYSTEMS↗

Gauge constrained algorithm of variational discrete action theory at N = 3 for the multiorbital Hubbard model

The recently developed variational discrete action theory (VDAT) provides a systematic variational approach to the ground state of the quantum many-body problem, where the quality of the solution is controlled by an integer N, and increasing N monotonically approaches the exact solution. VDAT can be exactly evaluated in the d = ∞ multiorbital Hubbard model using the self-consistent canonical discrete action theory (SCDA), which requires a self-consistency condition for the integer time Green's functions. Previous work demonstrates that N = 3 accurately captures multiorbital Mott/Hund physics at a cost similar to the Gutzwiller approximation. Here we employ a gauge constraint to automatically satisfy the self-consistency condition of the SCDA at N = 3, yielding an even more efficient algorithm with enhanced numerical stability. We derive closed form expressions of the gauge constrained algorithm for the multiorbital Hubbard model with general density-density interactions, allowing VDAT at N = 3 to be straightforwardly applied to the seven-orbital Hubbard model. We present results and a performance analysis using N = 2 and N = 3 for the SU⁡(2⁢N orb ) Hubbard model in d = ∞ with N orb = 2–8, and compare to numerically exact dynamical mean-field theory solutions where available. Finally, the developments in this work will greatly facilitate the application of VDAT at N = 3 to strongly correlated electron materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers

With current semiconductor technology reaching its physical limits, special-purpose hardware has emerged as an option to tackle specific computing-intensive challenges. Optimization in the form of solving quadratic unconstrained binary optimization problems, or equivalently Ising spin glasses, has been the focus of several new dedicated hardware platforms. These platforms come in many different flavors, from highly-efficient hardware implementations on digital-logic of established algorithms to proposals of analog hardware implementing new algorithms. In this work, we use a mapping of a specific class of linear equations whose solutions can be found efficiently, to a hard constraint satisfaction problem (three-regular three-XORSAT, or an Ising spin glass) with a 'golf-course' shaped energy landscape, to benchmark several of these different approaches. We perform a scaling and prefactor analysis of the performance of Fujitsu's digital annealer unit (DAU), the D-Wave advantage quantum annealer, a virtual MemComputing machine, Toshiba's simulated bifurcation machine (SBM), the SATonGPU algorithm from Bernaschi et al, and our implementation of parallel tempering. We identify the SATonGPU and DAU as currently having the smallest scaling exponent for this benchmark, with SATonGPU having a small scaling advantage and in addition having by far the smallest prefactor thanks to its use of massive parallelism. Furthermore, our work provides an objective assessment and a snapshot of the promise and limitations of dedicated optimization hardware relative to a particular class of optimization problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal resource allocation for flexible-grid entanglement distribution networks

We use a genetic algorithm (GA) as a design aid for determining the optimal provisioning of entangled photon spectrum in flex-grid quantum networks with arbitrary numbers of channels and users. After introducing a general model for entanglement distribution based on frequency-polarization hyperentangled biphotons, we derive upper bounds on fidelity and entangled bit rate for networks comprising one-to-one user connections. Simple conditions based on user detector quality and link efficiencies are found that determine whether entanglement is possible. We successfully apply a GA to find optimal resource allocations in four different representative network scenarios and validate features of our model experimentally in a quantum local area network in deployed fiber. Our results show promise for the rapid design of large-scale entanglement distribution networks.

97 MATHEMATICS AND COMPUTING↗

Image-Based Methods to Score Fungal Pathogen Symptom Progression and Severity in Excised Arabidopsis Leaves

Image-based symptom scoring of plant diseases is a powerful tool for associating disease resistance with plant genotypes. Advancements in technology have enabled new imaging and image processing strategies for statistical analysis of time-course experiments. There are several tools available for analyzing symptoms on leaves and fruits of crop plants, but only a few are available for the model plant Arabidopsis thaliana (Arabidopsis). Arabidopsis and the model fungus Botrytis cinerea (Botrytis) comprise a potent model pathosystem for the identification of signaling pathways conferring immunity against this broad host-range necrotrophic fungus. Here, we present two strategies to assess severity and symptom progression of Botrytis infection over time in Arabidopsis leaves. Thus, a pixel classification strategy using color hue values from red-green-blue (RGB) images and a random forest algorithm was used to establish necrotic, chlorotic, and healthy leaf areas. Secondly, using chlorophyll fluorescence (ChlFl) imaging, the maximum quantum yield of photosystem II (Fv/Fm) was determined to define diseased areas and their proportion per total leaf area. Both RGB and ChlFl imaging strategies were employed to track disease progression over time. This has provided a robust and sensitive method for detecting sensitive or resistant genetic backgrounds. A full methodological workflow, from plant culture to data analysis, is described.

59 BASIC BIOLOGICAL SCIENCES↗

Suppressing Quantum Circuit Errors Due to System Variability

We present a quantum circuit optimization technique that takes into account the variability in error rates that is inherent across present-day noisy quantum computing platforms. This method can be run after qubit routing or postcompilation and consists of computing isomorphic subgraphs to input circuits and scoring each using heuristic cost functions derived from system calibration data. Using an independent standard algorithmic test suite, we show that it is possible to recover on average nearly 40% of missing fidelity using better qubit selection via efficient to compute cost functions. We demonstrate additional performance gains by considering qubit placement over multiple quantum processors. The overhead from these tools is minimal with respect to other compilation steps, such as qubit routing, as the number of qubits increases. As such, our method can be used to find qubit mappings for problems at the scale of quantum advantage and beyond.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ground state property calculations of LiH n complexes using IBM Qiskit’s quantum simulator

In this study, the variational quantum eigensolver (VQE) on a quantum simulator is used in calculating ground state electronic structure properties of the LiH n , n = 1–3, complexes including their singly charged ions. Results calculated using classical electronic structure algorithms are also included. We investigate the use of the unitary coupled cluster with singles and doubles (UCCSD) Ansatz using VQE within Qiskit and compare results to full configuration interaction (FCI) calculations. Computed ground state energies, electron affinities, ionization potentials, and dipole moments are considered. We report the first-of-its-kind simulated quantum computing results of selected LiH n species and use the parity orbital to qubit mapping scheme. We find that VQE/UCCSD results are comparable to classical coupled clusters with singles and doubles for all considered systems with respect to FCI. A VQE calculation cost evaluation is included in which we evaluate performance using both Jordan–Wigner and parity orbital to qubit mapping schemes. We also discuss some of the current limitations of utilizing VQE for the study of chemical systems.

97 MATHEMATICS AND COMPUTING↗

Harnessing deep reinforcement learning to construct time-dependent optimal fields for quantum control dynamics

Here, we present an efficient deep reinforcement learning (DRL) approach to automatically construct time-dependent optimal control fields that enable desired transitions in dynamical chemical systems. Our DRL approach gives impressive performance in constructing optimal control fields, even for cases that are difficult to converge with existing gradient-based approaches. We provide a detailed description of the algorithms and hyperparameters as well as performance metrics for our DRL-based approach. Our results demonstrate that DRL can be employed as an effective artificial intelligence approach to efficiently and autonomously design control fields in quantum dynamical chemical systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

SPARC-X: Quantum simulations at extreme scale - reactive dynamics from first principles

We have developed the massively parallel electronic structure code SPARC-X: a computational framework for performing Kohn-Sham Density Functional Theory (DFT) calculations that can scale linearly with the number of atoms in the system, while being able to leverage petascale and emerging exascale parallel computers to study chemical phenomena at unprecedented length and time scales. SPARC-X exploits a recent breakthrough in electronic structure methodologies: systematically improvable, strictly local, orthonormal, discontinuous real-space bases that efficiently and systematically capture the local chemistry of the system. With further adaptation using new machine-learning techniques and the use of the massively parallel Spectral Quadrature (SQ) electronic structure method, the algorithmic complexity and prefactor associated with DFT calculations involving semilocal as well as hybrid functionals are dramatically reduced. Using petascale computational resources, SPARC-X enables quantum mechanical simulations at length and time scales previously accessible only by empirical approaches, e.g., 1,000,000 atoms for a few picoseconds using semilocal functionals or 1,000 atoms for a few picoseconds using hybrid functionals. Using exascale resources, the sizes and times targeted are two orders of magnitude larger. Such a capability has applications in a wide variety of chemical sciences, including reactive interfaces where large length- and/or long time-scales are needed and traditional force fields fail. This is particularly important in dynamic catalysis, where bond breaking and formation must be understood in detail. We developed, tested, and employed the SPARC-X framework to understand the photocatalytic properties of TiO 2 nanoparticles, revealing finite size effects that cannot be captured with standard model systems or functionals. This integrated development and application strategy ensures that SPARC-X remains a robust, efficient, and scalable software package for quantum simulations on current petascale and emerging exascale computing resources.

97 MATHEMATICS AND COMPUTING↗

Memory effect and phase transition in a hierarchical trap model for spin glasses

Here, we introduce an efficient dynamical tree method that enables us to explicitly demonstrate the thermoremanent magnetization memory effect in a hierarchical energy landscape. Our simulation nicely reproduces the nontrivial waiting-time and waiting-temperature dependences in this nonequilibrium phenomenon. We further investigate the condensation effect, in which a small set of microstates dominates the thermodynamic behavior in the multilayer trap model. Importantly, a structural phase transition of the multilayer tree model is shown to coincide with the onset of the condensation phenomenon. Our results underscore the importance of hierarchical structure and demonstrate the intimate relation between the glassy behavior and structure of barrier trees.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗