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,657 records · Page 92

Feasibility of DEIM for retrieving the initial field via dimensionality reduction

When parameter estimation is solved in a high-dimensional space, the dimensionality reduction strategy becomes the primary consideration for alleviating the tremendous computational cost. Here, the discrete empirical interpolation method (DEIM) is explored to retrieve the initial condition (IC) by combining the polynomial chaos (PC) based ensemble Kalman filter (i.e. PC-EnKF), where a non-intrusive PC expansion is considered as a surrogate model in place of the forward model in the prediction step of the ensemble Kalman filter, resulting in fewer forward model integrations but with a comparable accuracy as Monte Carlo-based approaches. The DEIM acts as a hyper-reduction tool to provide the low-dimensional input for the high-dimensional initial field, which can be reconstructed using the information on the sparse interpolation grid points that is adaptively obtained through PC-EnKF data assimilation method. Thus an innovative framework to reconstruct the IC is developed. The detailed procedure at each assimilation iteration includes: the determination of the spatial interpolation points, the estimation of the initial values on the interpolation locations using the optimal observations, and the reconstruction of IC in the full space. The current study uses the reconstruction field of initial conditions of the Navier-Stokes equations as an example to illustrate the efficacy of our method. The experimental results demonstrate the proposed algorithm achieves a satisfactory reconstruction for the initial field. The proposed method helps to extend the applicable area of DEIM in solving inverse problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A second-order distributed memory parallel fast sweeping method for the Eikonal equation

The Eikonal equation is used to calculate wave propagation and distance fields, and due to its complexity requires numerical treatment for its solution. In this work, we present a second-order distributed memory parallel fast sweeping method. The second-order solution switches on a two-point stencil when two upwind points are available, and reverts to first-order otherwise. In all examples, the second-order method improves the solution over the first-order, allowing for significant savings in memory while achieving the same accuracy. Parallelization over distributed memory saw good weak scaling with optimal convergence. The computational time for second-order was approximately 2.5 times slower than first-order, where the largest amount of mesh points ran on 144 cores (512 GB) was ≈20 billion. The savings in memory from the second-order method combined with the distributed memory algorithm result in the ability to solve problems much larger than are possible with the serial first-order method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal control of coupled quantum systems based on the first-order Magnus expansion: Application to multiple dipole-dipole-coupled molecular rotors

This paper presents a method for performing approximate optimal control simulations for quantum systems with multiple coupled degrees of freedom. In this work, the time evolution is simulated using the first-order Magnus expansion in the interaction picture, where the couplings between different degrees of freedom are treated as the perturbation. A numerical implementation procedure is presented that leverages upon pairwise couplings and the separability of the zeroth-order time evolution operator to achieve a reduced computational cost, which is analyzed with respect to the number of degrees of freedom. The formulation is compatible with gradient-free methods to optimize the control field, and a stochastic hill climbing algorithm is adopted for this purpose. As illustrations, optimal control simulations are performed for systems of two and three dipole-dipole-coupled molecular rotors under the influence of a control field. For the two-rotor system, the field is optimized to achieve either orientation or entanglement objectives. For the three-rotor system, the field is optimized either to orient all three rotors in the same direction or to orient one rotor in a particular direction while the other two rotors point in the opposite direction.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Orientation reversal and the Chern-Simons natural boundary

We show that the fundamental property of preservation of relations, underlying resurgent analysis, provides a new perspective on crossing a natural boundary, an important general problem in theoretical and mathematical physics. This reveals a deeper rigidity aspect of resurgence in a quantum field theory path integral. The physical context here is the non-perturbative completion of complex Chern-Simons theory that associates to a 3-manifold a collection of q-series invariants labeled by Spinc structures, for which crossing the natural boundary corresponds to orientation reversal of the 3-manifold. Our new resurgent perspective leads to a practical numerical algorithm that generates q-series which are dual to unary q-series composed of false theta functions. Until recently, these duals were only known in a limited number of cases, essentially based on Ramanujan’s mock theta functions, and the common belief was that the duals might not even exist in the general case. Resurgence analysis identifies as primary objects Mordell integrals: up to changes of variables, they are Laplace transforms of resurgent functions. Their unique Borel summed transseries decomposition on either side of the Stokes line is simply the unique decomposition into real and imaginary parts. In turn, the latter are combinations of unary q-series in terms of q and its modular counterpart $\overset{\sim }{q}$ , and are resurgent by construction. The Mordell integral is analytic across the natural boundary of the q and $\overset{\sim }{q}$ series, and uniqueness of a similar decomposition which preserves algebraic relations on the other side of the boundary defines the unique boundary crossing of the q series. We demonstrate that this continuation can be efficiently implemented numerically. In the cases where unique mock modular identities are known, they are found by this numerical procedure, but the procedure can go well beyond the known list of identities. A particularly interesting feature of the resurgent approach is that it reveals new aspects, and is very different from other known approaches based on indefinite theta series, Appell-Lerch sums, and representation theory of logarithmic vertex operator algebras.

Chern-Simons theories↗

Classical eikonal from Magnus expansion

In a classical scattering problem, the classical eikonal is defined as the generator of the canonical transformation that maps in-states to out-states. It can be regarded as the classical limit of the log of the quantum S-matrix. In a classical analog of the Born approximation in quantum mechanics, the classical eikonal admits an expansion in oriented tree graphs, where oriented edges denote retarded/advanced worldline propagators. The Magnus expansion, which takes the log of a time-ordered exponential integral, offers an efficient method to compute the coefficients of the tree graphs to all orders. We exploit a Hopf algebra structure behind the Magnus expansion to develop a fast algorithm which can compute the tree coefficients up to the 12th order (over half a million trees) in less than an hour. In a relativistic setting, our methods can be applied to the post-Minkowskian (PM) expansion for gravitational binaries in the worldline formalism. We demonstrate the methods by computing the 3PM eikonal and find agreement with previous results based on amplitude methods. Importantly, the Magnus expansion yields a finite eikonal, while the naïve eikonal based on the time-symmetric propagator is infrared-divergent from 3PM on.

Black Holes↗

Quantum embedding for material chemistry based on domain separation and open subsystems

Our perspective considers two theories we recently proposed to perform quantum embedding calculations for chemical systems: domain-separated density functional theory (DSDFT) and locally coupled open subsystems (LCOS). The development includes both the fundamentals of each theory as well as potential applications, some technical aspects, and related challenges. DS-DFT is suited to study intramolecular effects, where one can apply a high level of theory (based on DFT or wave function theory) to a region of interest inside a molecule or solid, and lower level theory elsewhere, with smooth switching between the regions. LCOS, in contrast, is a fragment-based embedding which offers computational advantages to study intermolecular behavior such as electron hopping, spin-environment interaction, and charge transfer excitations. Yet, both theories can exchange roles when appropriate. In addition, these theories allow for control of computational scaling of their algorithms. We investigate paths to determine the charge-transfer operator used in LCOS, and suggest an auxiliary energy minimization that can provide a practical estimate to this operator. We also briefly discuss how to implement density fitting techniques in domain separation, and how domain separation can be used for pure wavefunction-based embedding.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Mixed quantum–classical approach to model non-adiabatic electron–nuclear dynamics: Detailed balance and improved surface hopping method

We develop a density matrix formalism to describe coupled electron–nuclear dynamics. To this end, we introduce an effective Hamiltonian formalism that describes electronic transitions and small (quantum) nuclear fluctuations along a classical trajectory of the nuclei. Using this Hamiltonian, we derive equations of motion for the electronic occupation numbers and for the nuclear coordinates and momenta. We show that, in the limit, when the number of nuclear degrees of freedom coupled to a given electronic transition is sufficiently high (i.e., the strong decoherence limit), the equations of motion for the electronic occupation numbers become Markovian. Furthermore, the transition rates in these (rate) equations are asymmetric with respect to the lower-to-higher energy transitions and vice versa. In thermal equilibrium, such asymmetry corresponds to the detailed balance condition. We also study the equations for the electronic occupations in the non-Markovian regime and develop a surface hopping algorithm based on our formalism. To treat the decoherence effects, we introduce additional “virtual” nuclear wave packets whose interference with the “real” (physical) wave packets leads to the reduction in coupling between the electronic states (i.e., decoherence) as well as to the phase shifts that improve the accuracy of the numerical approach. Remarkably, the same phase shifts lead to the detailed balance condition in the strong decoherence limit.

74 ATOMIC AND MOLECULAR PHYSICS↗

Jet fragmentation function and groomed substructure of bottom quark jets in proton-proton collisions at 5.02 TeV

A measurement of the substructure of bottom quark jets (b jets) in proton-proton (pp) collisions is presented. The measurement uses data collected in pp collisions at $\sqrt{s}=5.02$ TeV, with a low number of simultaneous interactions per bunch crossing, recorded by the CMS experiment in 2017, corresponding to an integrated luminosity of 301 pb −1 . An algorithm to identify and cluster the charged decay daughters of b hadrons is developed for this analysis, which facilitates the exposure of the gluon radiation pattern of b jets using iterative Cambridge-Aachen declustering. The soft-drop-groomed jet radius, R g , and momentum balance, z g , of b quark jets are presented. These observables can be used to test perturbative quantum chromodynamics predictions that account for mass effects. Because the b hadron is partially reconstructed from its charged decay daughters, only charged particles are used for the jet substructure studies. In addition, a jet fragmentation function, z b,ch , is measured, which is defined as the distribution of the ratio of the transverse momentum (p T ) of the partially reconstructed b hadron with respect to the charged-particle component of the jet p T . The substructure variable distributions are unfolded to the charged-particle level. The b jet substructure is compared to the substructure of jets in an inclusive jet sample that is dominated by light-quark and gluon jets in order to assess the role of the b quark mass. A strong suppression of emissions at small R g values is observed for b jets when compared to inclusive jets, consistent with the dead-cone effect. The measurement is also compared with theoretical predictions from Monte Carlo event generators. This is the first substructure measurement of b jets that clusters together the b hadron decay daughters independent of the b hadron species and decay channel.

boosted jets↗

An Ab Initio Multiple Cloning Method for Non-Adiabatic Excited-State Molecular Dynamics in NWChem

The recently developed ab-initio multiple cloning (AIMC) approach based on the multicongurational Ehrenfest (MCE) method provides a powerful and accurate way of describing the excited-state dynamics of molecular systems. The AIMC method is a controlled approximation to non-adiabatic dynamics with a particular strength in the proper description of decoherence effects due to branching of vibrational wavepackets at a level crossing. In this work, we report a new implementation of the AIMC algorithm in the open source NWChem computational chemistry program. The framework combines linear-response time-dependent density functional theory with Ehrenfest mean-eld theory to determine the equations of motion for classical trajectories. The multi-dimensional wave function is decomposed into a superposition of Gaussian coherent states guided by Ehrenfest trajectories (i.e., MCE approach), which can clone with fully quantum mechanical amplitudes and phases. By using an efficient time-derivative based non-adiabatic coupling approach within the AIMC method, all observable are calculated on-the-y in the non-adiabatic molecular dynamics process. As a representative example, we apply our implementation to study the ultrafast photoinduced electronic and vibrational energy transfer in a pyridine molecule. The effects of the cloning procedure on electronic and vibrational coherence, relaxation and unidirectional energy transfer are discussed. This new AIMC implementation provides a high-level non-adiabatic molecular dynamics framework for simulating photoexcited dynamics in complex molecular systems and experimentally relevant ultrafast spectroscopic probes, such as nonlinear coherent optical and X-ray signals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Importance learning estimator for the site-averaged turnover frequency of a disordered solid catalyst

For disordered catalysts such as atomically dispersed “single-atom” metals on amorphous silica, the active sites inherit different properties from their quenched-disordered local environments. The observed kinetics are site-averages, typically dominated by a small fraction of highly active sites. Standard sampling methods require expensive ab initio calculations at an intractable number of sites to converge on the siteaveraged kinetics. We present a new method that efficiently estimates the site-averaged turnover frequency (TOF). The new estimator uses the same importance learning algorithm [Vandervelden et al., React. Chem. Eng. 5, 77 (2020)] that we previously used to compute the siteaveraged activation energy. We demonstrate the method by computing the site-averaged TOF for a simple disordered lattice model of an amorphous catalyst. The results show that with the importance learning algorithm, the site-averaged TOF and activation energy can now be obtained concurrently with orders of magnitude reduction in required ab initio calculations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗

LigninGraphs: lignin structure determination with multiscale graph modeling

Lignin is an aromatic biopolymer found in ubiquitous sources of woody biomass. Designing and optimizing lignin valorization processes requires a fundamental understanding of lignin structures. Experimental characterization techniques, such as 2D-heteronuclear single quantum coherence (HSQC) nuclear magnetic resonance (NMR) spectra, could elucidate the global properties of the polymer molecules. Computer models could extend the resolution of experiments by representing structures at the molecular and atomistic scales. We introduce a graph-based multiscale modeling framework for lignin structure generation and visualization. The framework employs accelerated rejection-free polymerization and hierarchical Metropolis Monte Carlo optimization algorithms. We obtain structure libraries for various lignin feedstocks based on literature and new experimental NMR data for poplar wood, pinewood, and herbaceous lignin. The framework could guide researchers towards feasible lignin structures, efficient space exploration, and future kinetics modeling. Its software implementation in Python, LigninGraphs, is open-source and available on GitHub.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Impact of Emerging Computing Architectures and Opportunities for Process Systems Engineering Applications

Moore’s “law” was the observation that the number of transistors in an integrated circuit doubled approximately every two years. This trend has distinctly failed to hold in recent years. The death of Moore’s law has left researchers and practitioners in the computational sciences searching for technologies to provide the speedups formerly supported by Moore’s law. Previously overlooked chip architectures and other computing technologies are now receiving more development resources. Critically, these technologies are gaining more mature software support, opening their adoption by researchers in algorithms and applications. In this article, we review some of these computing technologies, their relationship with various algorithms and applications, and their potential benefits (or pitfalls). We close with recommendations for future work by the process systems engineering community specifically.

Emerging hardware↗

Contextual subspace variational quantum eigensolver calculation of the dissociation curve of molecular nitrogen on a superconducting quantum computer

Abstract We present an experimental demonstration of the Contextual Subspace Variational Quantum Eigensolver on superconducting hardware. Calculating the potential energy curve of molecular nitrogen proves challenging for many conventional quantum chemistry techniques, since static correlation dominates in the dissociation limit. Our quantum simulations retain good agreement with the Full Configuration Interaction energy, outperforming all benchmarked single-reference wavefunction techniques in capturing the bond-breaking appropriately. Moreover, our methodology is competitive with multiconfigurational approaches but at a saving of quantum resource, meaning larger active spaces can be treated for a fixed qubit allowance. To achieve this result, we deploy an error mitigation/suppression strategy comprised of Dynamical Decoupling, Measurement-Error Mitigation and Zero-Noise Extrapolation. Circuit parallelization also provides passive noise-averaging and improves the effective shot yield to reduce the measurement overhead. Furthermore, we introduce a modified adaptive ansatz construction algorithm that incorporates hardware awareness into our variational circuits, minimizing the transpilation cost for the target qubit topology.

Physics↗

Quantum Criticality Under Imperfect Teleportation

Entanglement, measurement, and classical communication together enable teleportation of quantum states between distant parties, in principle, with perfect fidelity. To what extent do correlations and entanglement of a many-body wave function transfer under teleportation protocols? We address this question for the case of an imperfectly teleported quantum critical wave function, focusing on the ground state of a critical Ising chain. We demonstrate that imperfections, e.g., in the entangling gate adopted for a given protocol, effectively manifest as weak measurements acting on the otherwise pristinely teleported critical state. Armed with this perspective, we leverage and further develop the theory of measurement-altered quantum criticality to quantify the resilience of critical-state teleportation. We identify classes of teleportation protocols for which imperfection (i) preserves both the universal long-range entanglement and correlations of the original quantum critical state, (ii) weakly modifies these quantities away from their universal values, and (iii) obliterates long-range entanglement altogether while preserving power-law correlations, albeit with a new set of exponents. We also show that mixed states describing the average over a series of sequential imperfect teleportation events retain pristine power-law correlations due to a “built-in” decoding algorithm, though their entanglement structure measured by the negativity depends on errors similarly to individual protocol runs. These results may allow one to design teleportation protocols that optimize against errors—highlighting a potential practical application of measurement-altered criticality. Published by the American Physical Society 2024

Physics↗

Dynamical tuning of the chemical potential to achieve a target particle number in grand canonical Monte Carlo simulations

We present a method to facilitate Monte Carlo simulations in the grand canonical ensemble given a target mean particle number. The method imposes a fictitious dynamics on the chemical potential, to be run concurrently with the Monte Carlo sampling of the physical system. Corrections to the chemical potential are made according to time-averaged estimates of the mean and variance of the particle number, with the latter being proportional to thermodynamic compressibility. Here, we perform a variety of tests, and in all cases find rapid convergence of the chemical potential—inexactness of the tuning algorithm contributes only a minor part of the total measurement error for realistic simulations.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient quantum simulation of QCD jets on the light front

Quark and gluon jets provide one of the best ways to probe the matter produced in ultrarelativistic high-energy collisions, from cold nuclear matter to hot quark-gluon plasma. In this work, we propose a unified framework for efficient quantum simulation of many-body dynamics using the ( 3 + 1 )-dimensional QCD Hamiltonian on the light front, particularly suited for studying the scattering of quark and gluon jets on nuclear matter in heavy-ion collisions. We describe scalable methods for mapping physical degrees of freedom onto qubits and for simulating in-medium jet evolution. We then validate our framework by implementing an algorithm that directly maps second-quantized Fock states onto qubits and uses Trotterized simulation for simulating time dynamics. Using a classical emulator, we investigate the evolution of quark and gluon jets with up to three particles in Fock states, extending prior studies. These calculations enable the study of key observables, including jet momentum broadening, particle production, and parton distribution functions. Published by the American Physical Society 2025

Qian, Wenyang (ORCID:0000000155250996)↗

Computing an Optimal Entanglement Path with Throughput and Fidelity Considerations

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing a end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics to be NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

Xue, Guoliang [Arizona State University]↗