Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computing for simulation”

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,189 records · Page 66

Multistage nucleation pathway in LiF molten salt mirrors the crystal–melt interface structure

Despite over a century of studies, fundamental questions remain about the processes governing crystal nucleation from melts or solutions. Research over the past three decades has presented mounting evidence for kinetic pathways of crystal nucleation that are more complex than envisioned by the simplest forms of classical theory. Such observations have been presented for colloidal and elemental systems with covalent and metallic bonding. Despite the technological and geochemical importance of molten salts, similar studies for these ionically bonded systems are currently lacking. Here we develop a machine learning interatomic potential for a model ionic system: LiF. The potential features quantum-level accuracy for both liquid and multiple solid polymorphs over wide temperature and pressure ranges and accurately reproduces experimentally measured properties. Thanks to the efficiency of the potential, which enables microsecond-scale molecular dynamics simulations, induction times for nucleation of LiF solids from their melts are computed over a range of undercoolings. With the aid of a set of robust local order parameters established here, the simulations reveal that homogeneous crystal nucleation in undercooled melts preferentially initiates from liquid regions showing slow dynamics and high bond orientational order simultaneously, and the second-shell order of both precritical nuclei and the surface of postcritical nuclei is dominated by hexagonal close packing and body-centered cubic local structure, even though the nucleus core is dominated by face-centered cubic structure corresponding to the stable rocksalt crystal structure. Finally, we establish a connection between the crystallization pathway and the equilibrium crystal-melt interface structure.

Applied Physical Sciences↗

Solar Spectrum Conversion for an Algae Bioreactor (CRADA Final Report)

This project focused on developing advanced optical coatings to improve solar energy utilization. The research aimed to create lanthanide-doped upconversion nanoparticles (UCNPs) capable of capturing unused near-infrared (NIR) light from the sun and converting it into visible light (blue and red photons) that can be used for photosynthesis. The primary goal was to identify, synthesize, and integrate highly efficient UCNPs into a transparent thin-film device. Through a comprehensive workflow involving computer simulations, high-throughput robotic synthesis, and detailed optical characterization, the project successfully developed a high-performance material. The key technical achievement was the creation of a core-shell UCNP (NaYF₄:20%Yb³⁺, 2%Er³⁺ coated with a 10 nm NaYF₄ shell) that demonstrated a quantum yield of 3.2% for converting 980 nm NIR light into visible light. Transparent thin films fabricated from these nanoparticles showed excellent optical properties, confirming their potential for practical applications. This research adds to the scientific understanding of energy transfer in lanthanide materials and demonstrates a technically effective method for creating efficient light-converting coatings. The primary benefit to the public lies in the potential for these coatings to enhance the efficiency of solar-driven processes, such as boosting the growth of algae in photobioreactors for biofuel production.

14 SOLAR ENERGY↗

Simulated rarefied entry of the Galileo probe into the atmosphere of Jupiter

Flow properties and aerodynamics are computed with a direct simulation Monte Carlo (DSMC) method for rarefied entry of the Galileo Probe into the atmosphere of Jupiter. Accurate predictions of vehicle drag coefficients are needed in order to assess atmospheric properties from the onboard Atmosphere Structure Experiment where highly-sensitive accelerometers will measure the drag force to within 10-6 barr during the initial entry phase at high altitudes. The corresponding flow rarefraction extends from the free molecule limit to the near continuum transition regime (Re less than 1000). Simulation results indicate that C(sub D) varies from 2.1 at the free molecule limit down to 1.6 at Re(infinity) = 1,000. Temperatures, densities, and internal energies throughout the flow field were also computed at each altitude ranging from 735 km to 353 km above the 1 barr level in the Jovian atmosphere. Surface heating and temperatures of the probe were computed directly in the DSMC code by assuming radiative equilibrium. Material response was re-asssessed accurately during entry by accounting for conductivity, heat capacity, and pyrolysis which led to surface material mass efflux several times that of the freestream mass influx. The simulation also accounted for the quantum nature of the rotational energy mode of the dominant atmospheric species H2 through partial internal excitation in the freestream gas.

Hass, Brian L.↗

Coherence-Induced Deep Thermalization Transition in Random Permutation Quantum Dynamics

We report a phase transition in the projected ensemble—the collection of postmeasurement wave functions of a local subsystem obtained by measuring its complement. The transition emerges in systems undergoing random permutation dynamics, a type of quantum time evolution wherein computational basis states are shuffled without creating superpositions. It separates a phase exhibiting deep thermalization, where the projected ensemble is distributed over Hilbert space in a maximally entropic fashion (Haar random), from a phase where it is minimally entropic (“classical bit-string ensemble”). Crucially, this deep thermalization transition is invisible to the subsystem’s density matrix, which always exhibits thermalization to infinite temperature across the phase diagram. Through a combination of analytical arguments and numerical simulations, we show that the transition is tuned by the total amount of injected by the input state and the measurement basis, and is exhibited robustly across different microscopic models. Our findings represent a novel form of ergodicity-breaking universality in quantum many-body dynamics, characterized not by a failure of regular thermalization, but rather by a failure of deep thermalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Zero-noise extrapolation for quantum-gate error mitigation with identity insertions

Quantum-gate errors are a significant challenge for achieving precision measurements on noisy intermediate-scale quantum (NISQ) computers. Here, this paper focuses on zero-noise extrapolation (ZNE), a technique that can be implemented on existing hardware, studying it in detail and proposing modifications to existing approaches. In particular, we consider identity insertion methods for amplifying noise because they are hardware agnostic. We build a mathematical formalism for studying existing ZNE techniques and show how higher order polynomial extrapolations can be used to systematically reduce depolarizing errors. Furthermore, we introduce a method for amplifying noise that uses far fewer gates than traditional methods. This approach is compared with existing methods for simulated quantum circuits. Comparable or smaller errors are possible with fewer gates, which illustrates the potential for empowering an entirely new class of moderate-depth circuits on near term hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗

Piecewise interaction picture density matrix quantum Monte Carlo

The density matrix quantum Monte Carlo (DMQMC) set of methods stochastically samples the exact N-body density matrix for interacting electrons at finite temperature. We introduce a simple modification to the interaction picture DMQMC (IP-DMQMC) method that overcomes the limitation of only sampling one inverse temperature point at a time, instead allowing for the sampling of a temperature range within a single calculation, thereby reducing the computational cost. At the target inverse temperature, instead of ending the simulation, we incorporate a change of picture away from the interaction picture. The resulting equations of motion have piecewise functions and use the interaction picture in the first phase of a simulation, followed by the application of the Bloch equation once the target inverse temperature is reached. We find that the performance of this method is similar to or better than the DMQMC and IP-DMQMC algorithms in a variety of molecular test systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Computing the Central Charge of the 3D Ising CFT Using Quantum Finite Elements

The 3D Ising conformal field theory (CFT) describes different physical systems, such as uniaxial magnets or fluids, at their critical points. In absence of an analytical solution for the 3D Ising model, the scaling dimensions and operator product expansion (OPE) coefficients characterizing this CFT must be determined numerically. The currently most-cited values for these quantities have been obtained from the conformal bootstrap, while lattice calculations have so far only produced reliable results for the scaling dimensions involved in calculating the critical exponents. Using Quantum Finite Elements to investigate critical \(\phi^4\)-theory on \(\mathbb{R}\times\mathbb{S}^2\), we show in this work that it is possible to extract scaling dimensions and OPE coefficients of the 3D Ising CFT by fitting the lattice four-point function with expectations from the operator product expansion for the radially quantized CFT and extrapolating to the continuum limit. This way, we have for the first time been able to use Monte Carlo simulations to compute the central charge of the theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes

The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin Hamiltonian representation of the discrete, finite, discounted Markov decision process with infinite horizon. This K-spin Hamiltonian furnishes a starting point from which to solve for an optimal policy using heuristic quantum algorithms such as adiabatic quantum annealing and the quantum approximate optimization algorithm on near-term quantum hardware. In arguing that the variational minimization of our Hamiltonian is approximately equivalent to the Bellman optimality condition for a prevalent class of environments we establish an interesting analogy with classical field theory. Along with proof-of-concept calculations to corroborate our formulation by simulated and quantum annealing against classical Q-Learning, we analyze the scaling of physical resources required to solve our Hamiltonian on quantum hardware.

Hamiltonian↗

Adaptive job and resource management for the growing quantum cloud

As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations. Altogether, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.

97 MATHEMATICS AND COMPUTING↗

Mitigating Depolarizing Noise on Quantum Computers with Noise-Estimation Circuits

A significant problem for current quantum computers is noise. While there are many distinct noise channels, the depolarizing noise model often appropriately describes average noise for large circuits involving many qubits and gates. We present a method to mitigate the depolarizing noise by first estimating its rate with a noise-estimation circuit and then correcting the output of the target circuit using the estimated rate. The method is experimentally validated on the simulation of the Heisenberg model. We find that our approach in combination with readout-error correction, randomized compiling, and zero-noise extrapolation produces results close to exact results even for circuits containing hundreds of CNOT gates.

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↗

PYSEQM

PYSEQM is a package for performing semi-empirical quantum mechanical (SEQM) simulations on molecular systems utilizing PyTorch. SEQM simulations determine molecular properties (energy, electron density, dipole moment, ect.) by solving an approximate Schrödinger equation for the motions of electrons in a molecule. The use of PyTorch provides three specific advantages. First, it allows the calculations to be offloaded to GPU accelerators, giving an order of magnitude increase in speed. Second, back propagation is used to get atomic forces (derivative of the total energy with respect to atomic position) at the same computational cost as the energy calculation itself. Finally, the use of PyTorch makes for a natural interface to modern machine learning methods, which can be used to adjust the semi-empirical parameters build into SEQM methods. Additionally, PYSEQM implements various other optimizations for performing quantum mechanics based molecular dynamics, including SP2 for rapid GPU based solution of the self-consistent field algorithm, and the extended Lagrangian method for rapid QM-MD.

Nebgen, Benjamin↗

Enhancing detection of topological order by local error correction

The exploration of topologically-ordered states of matter is a long-standing goal at the interface of several subfields of the physical sciences. Such states feature intriguing physical properties such as long-range entanglement, emergent gauge fields and non-local correlations, and can aid in realization of scalable fault-tolerant quantum computation. However, these same features also make creation, detection, and characterization of topologically-ordered states particularly challenging. Motivated by recent experimental demonstrations, we introduce a paradigm for quantifying topological states—locally error-corrected decoration (LED)—by combining methods of error correction with ideas of renormalization-group flow. Our approach allows for efficient and robust identification of topological order, and is applicable in the presence of incoherent noise sources, making it particularly suitable for realistic experiments. We demonstrate the power of LED using numerical simulations of the toric code under a variety of perturbations. We subsequently apply it to an experimental realization, providing new insights into a quantum spin liquid created on a Rydberg-atom simulator. Finally, we extend LED to generic topological phases, including those with non-abelian order.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient 3D Molecular Design with an E(3) Invariant Transformer VAE

This work introduces a three-dimensional (3D) invariant graph-to-string transformer variational autoencoders (VAE) (Vagrant) for generating molecules with accurate density functional theory (DFT)-level properties. Vagrant learns to model the joint probability distribution of a 3D molecular structure and its properties by encoding molecular structures into a 3D-aware latent space. Directed navigation through this latent space implicitly optimizes the 3D structure of a molecule, and the latent embedding can be used to condition a generative transformer to predict the candidate structure as a one-dimensional (1D) sequence. Additionally, we introduce two novel sampling methods that exploit the latent characteristics of a VAE to improve performance. Here, we show that our method outperforms comparable 3D autoregressive and diffusion methods for predicting quantum chemical property values of novel molecules in terms of both sample quality and computational efficiency.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Digital Twin of Scalable Quantum Clouds

Quantum computing has emerged as a transformative technology capable of solving complex problems beyond the limit of classical systems. The rapid development of quantum processors has led to the proliferation of cloud-based quantum computing services offered by platforms such as IBM, Google, and Amazon. These platforms introduce unique challenges in resource allocation, job scheduling, and multi-device orchestration as quantum workloads become increasingly complex. In this work, we present a digital twin of quantum cloud infrastructures: a framework designed to model and simulate the behavior of real quantum cloud systems. Developed in Python using the SimPy discrete-event simulation library, the framework replicates key aspects of quantum cloud environments, including detailed quantum device modeling, job lifecycle management, and job fidelity. It incorporates noise-aware fidelity estimation, making it the first of its kind to simulate superconducting gate-based quantum cloud systems at an administrative level with job fidelity. We present use cases as proof of concept, demonstrating that our quantum cloud simulation framework can act as a digital twin of a quantum cloud and support the modeling and implementation of practical systems.

Luo, Waylon [Kent State University]↗