Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum 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,441 records · Page 80
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Non-cancellation of the parity anomaly in the strong-field regime of QED 2+1

Quantum fluctuations lead to an anomalous violation of parity symmetry in quantum electrodynamics for an even number of spatial dimensions. While the leading parity-odd electric current vanishes in vacuum, we uncover a non-cancellation of the anomaly for strong electric fields with distinct macroscopic signatures. We perform real-time lattice simulations with fully dynamical gauge fields and Wilson fermions in 2 + 1 space-time dimensions. In the static field limit, relevant at early times, we solve the problem analytically. Our results point out the fundamental role of quantum anomalies for strong-field phenomena, relevant for a wide range of condensed matter and high-energy applications, but also for the next generation of gauge theory quantum simulators.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2026

Efficient Berry phase calculation via adaptive variational quantum computing approach

We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.

Mootz, Martin [Ames Laboratory (AMES), Ames, IA (U↗
DOE OSTI2025

Computational Power of Random Quantum Circuits in Arbitrary Geometries

Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized classical simulations based on tensor network techniques, and their limitations shed light on the improvements to quantum hardware required to frustrate classical simulability. In particular, quantum computers having in excess of approximately 50 qubits are primarily vulnerable to classical simulation due to restrictions on their gate fidelity and their connectivity, the latter determining how many gates are required (and, therefore, how much infidelity is suffered) in generating highly entangled states. Here, we describe recent hardware upgrades to Quantinuum’s H2 quantum computer, enabling it to operate on up to 56 qubits with arbitrary connectivity and 99.843(5)% two-qubit gate fidelity. We define a class of circuits with random geometries that become hard to classically simulate in very low depth and implement them utilizing the flexible connectivity of H2. A careful analysis demonstrating the fast saturation of classical simulation complexity with depth indicates that H2 can yield data well beyond the reach of state-of-the art classical simulation methods at unprecedented fidelities. We find that the considerable difficulty of classically simulating H2 is likely limited only by qubit number, demonstrating the promise and scalability of the quantum charge-coupled device architecture as continued progress is made toward building larger machines. Published by the American Physical Society 2025

DeCross, M.↗
DOE OSTI2020

Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Furthermore, extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Simulating long-range coherence of atoms and photons in quantum computers

Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by large fluctuations in the number of photons. In BECs of atoms, instead, the number of particles is conserved and the global phase is undefined. Here, we present a unified framework to simulate lasers and BECs states in gate-based quantum computers, by mapping bosonic particles to qubit excitations. Our approach relies on a scalable circuit that measures the total number of particles without destroying long-range coherence. We introduce complementary probes to measure the global and relative phase coherence of a quantum state, and demonstrate their functionality on a Rigetti quantum computer. Our work shows that particle-number conservation enhances long-range phase coherence, highlighting a mechanism used by superfluids and superconductors to gain phase stiffness.

Torre, Emanuele Dalla↗
DOE OSTI2025

Lower bounds on entanglement entropy without twin copy

We discuss the possibility of estimating experimentally the von Neumann entanglement entropy S A v N of a symmetric bipartite quantum system A B by using the basic measurement counts (bitstrings) for a single copy of a prepared state. Using exact diagonalization and analog simulations performed with the publicly available QuEra facilities for chains and ladders of Rydberg atoms, we calculate the Shannon entropy S A B X associated with the bitstrings of adiabatically prepared ground states and the reduced entropies S A X and S B X obtained from the marginal probabilities in A and B . We then calculate the classical mutual information I A B X = S A X + S B X − S A B X , which is a lower bound on S A v N . We show that for a broad range of lattice spacing and detuning, I A B X is typically 20% below S A v N in regions where S A v N is large and a less close bound in regions where S A v N is low. We argue that this use of the easily available bitstrings provides a robust and efficient way to explore empirically the phase diagram of qubit-based quantum simulators and identify critical regions. Published by the American Physical Society 2025

Meurice, Yannick (ORCID:0000000209959694)↗
DOE OSTI2024

Jet quenching: From theory to simulation

With the explosion of data on jet-based observables in relativistic heavy-ion collisions at the Large Hadron Collider and the Relativistic Heavy-Ion Collider, perturbative Quantum Chromodynamics (pQCD)-based simulations of these processes, often interacting with an expanding viscous fluid dynamical background, have taken center stage. This review is meant to bridge the gap between theory, simulation and phenomenology of jet modification in a dense medium. We will demonstrate how the existence of such end-to-end event generators with semi-realistic or even fully realistic final states allows for the most rigorous comparisons between pQCD-based jet modification theory and experiment. State-of-the-art calculations of several jet-based observables are presented. Extensions of this theory to jets in the small systems of p–A and e–A collisions are discussed.

Physics↗
DOE OSTI2026

FROMP-from-Monomer

This repository provides the 1D reaction-diffusion simulation engine for the multi-scale framework. It takes monomer-level kinetic and thermodynamic descriptors as inputs, approximated from quantum chemical calculations, to simulate and predict the macroscopic propagation behavior of Frontal Ring-Opening Metathesis Polymerization (FROMP). By solving a coupled 1D reaction-diffusion PDE system, this tool predicts front propagation speed, front temperature, and degree of conversion. The solver explicitly captures the three fundamental ROMP steps, initiator activation/inhibition, chain initiation, and propagation, while accounting for high-temperature cycloreversion as a competing pathway. The numerical implementation uses FEniCS to handle the coupled heat diffusion and reaction kinetics.

Chua, Lauren [Massachusetts Inst. of Technology (M↗
NASA NTRS1998

Simulation of Ultra-Small MOSFETs Using a 2-D Quantum-Corrected Drift-Diffusion Model

The continued down-scaling of electronic devices, in particular the commercially dominant MOSFET, will force a fundamental change in the process of new electronics technology development in the next five to ten years. The cost of developing new technology generations is soaring along with the price of new fabrication facilities, even as competitive pressure intensifies to bring this new technology to market faster than ever before. To reduce cost and time to market, device simulation must become a more fundamental, indeed dominant, part of the technology development cycle. In order to produce these benefits, simulation accuracy must improve markedly. At the same time, device physics will become more complex, with the rapid increase in various small-geometry and quantum effects. This work describes both an approach to device simulator development and a physical model which advance the effort to meet the tremendous electronic device simulation challenge described above. The device simulation approach is to specify the physical model at a high level to a general-purpose (but highly efficient) partial differential equation solver (in this case PROPHET, developed by Lucent Technologies), which then simulates the model in 1-D, 2-D, or 3-D for a specified device and test regime. This approach allows for the rapid investigation of a wide range of device models and effects, which is certainly essential for device simulation to catch up with, and then stay ahead of, electronic device technology of the present and future. The physical device model used in this work is the density-gradient (DG) quantum correction to the drift-diffusion model [Ancona, Phys. Rev. B 35(5), 7959 (1987)]. This model adds tunneling and quantum smoothing of carrier density profiles to the drift-diffusion model. We used the DG model in 1-D and 2-D (for the first time) to simulate both bipolar and unipolar devices. Simulations of heavily-doped, short-base diodes indicated that the DG quantum corrections do not have a large effect on the IN characteristics of electronic devices without heteroj unction s. On the other hand, ultra-small MOSFETs certainly exhibit important quantum effects that the DG model will include: quantum repulsion of the inversion and gate charges from the oxide interfaces, and quantum tunneling through thin gate oxides. We present initial results of 2-D DG simulations of ultra-small MOSFETs. Subtle but important issues involving the specification of the model, boundary conditions, and interface constraints for DG simulation of MOSFETs will also be illuminated.

Biegal, Bryan A.↗
DOE OSTI2026

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗
DOE OSTI2024

Error mitigation in variational quantum eigensolvers using tailored probabilistic machine learning

Quantum computing technology has the potential to revolutionize the simulation of materials and molecules in the near future. A primary challenge in achieving near-term quantum advantage is effectively mitigating the noise effects inherent in current quantum processing units (QPUs). This challenge is also decisive in the context of quantum-classical hybrid schemes employing variational quantum eigensolvers (VQEs) that have attracted significant interest in recent years. In this paper, we present a method that employs parametric Gaussian process regression (GPR) within an active learning framework to mitigate noise in quantum computations, focusing on VQEs. Our approach, grounded in probabilistic machine learning, exploits a custom prior based on the VQE ansatz to capture the underlying correlations between VQE outputs for different variational parameters, thereby enhancing both accuracy and efficiency. We demonstrate the effectiveness of our method on a two-site Anderson impurity model and a eight-site Heisenberg model, using the IBM open-source quantum computing framework, Qiskit, showcasing substantial improvements in the accuracy of VQE outputs while reducing the number of direct QPU energy evaluations. This paper contributes to the ongoing efforts in quantum-error mitigation and optimization, bringing us a step closer to realizing the potential of quantum computing in quantum matter simulations. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Quantum circuit fidelity estimation using machine learning

The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the computation has been performed. In this work, we introduce a machine learning-based technique to estimate the fidelity between the state produced by a noisy quantum circuit and the target state corresponding to ideal noise-free computation. Our machine learning model is trained in a supervised manner, using smaller or simpler circuits for which the fidelity can be estimated using other techniques like direct fidelity estimation and quantum state tomography. Here we demonstrate that, for simulated random quantum circuits with a realistic noise model, the trained model can predict the fidelities of more complicated circuits for which such methods are infeasible. In particular, we show that the trained model may make predictions for circuits with higher degrees of entanglement than were available in the training set and that the model may make predictions for non-Clifford circuits even when the training set included only Clifford-reducible circuits. This empirical demonstration suggests classical machine learning may be useful for making predictions about beyond-classical quantum circuits for some non-trivial problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Exploration of Quantum Machine Learning and AI Accelerators for Fusion Science

The dawn of the noisy intermediate-scale quantum (NISQ) era sparked rapid development in variational quantum algorithms. These algorithms, utilizing parameterized quantum circuit optimized by classical computers with feedback, are practical under the constraints of the current hardware and can potentially show quantum advantage. In recent years, these variational circuit are applied to neural networks, hoping to boost the triumphant success of deep learning. We simulate various of quantum-classical hybrid neural networks applied to scientific tasks, and seek to understand their capabilities and limitations. Specifically, we devise quantum convolutional layers and apply them to deep neural networks used for predicting plasma disruption in fusion reactors.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Designing a quantum-accurate machine-learning potential to enable large-scale simulations of deuterium under shock

Large-scale molecular dynamics of deuterium under shock can elucidate kinetic processes vital to the target design in inertial confinement fusion and high-energy-density experiments. However, modeling the complex evolution of this material from an insulating molecular state at ambient pressure to an ionized, atomic fluid under strong shock is beyond the capability of simple pair and even bond order potentials. We thus train a quantum-accurate and broadly transferable machine-learning interatomic potential for deuterium using the Chebyshev Interaction Model for Efficient Simulations framework. We show that due to an improved description of the molecular-to-atomic transition, our model is able to better reproduce the ab initio equation of state, radial distribution functions, and principal Hugoniot than bond order potentials. This represents an important step toward large-scale quantum-accurate and nonequilibrium simulations of complicated systems under dynamic changes including phase transitions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Pretreatment with Sodium Methyl Mercaptide Increases Carbohydrate Yield during Kraft Pulping

Kraft pulping is the predominant technology in the pulp and paper industry for removing lignin from wood carbohydrates to produce paper, board, packaging, tissue, and specialty cellulose. However, the kraft process is energy intensive and expensive, and its yield is limited by the degradation of carbohydrates. Pretreatment can increase carbohydrate yield by limiting degradation via primary peeling of reducing end groups. However, protection of galactoglucomannan (GGM), the primary hemicellulose component of softwood, is minimal when conventional pretreatments are used. Here, we investigated the effectiveness of sodium methyl mercaptide pretreatment on southern pine wood chips under a range of experimental conditions. We found that pretreatment of biomass with 4.38% sodium methyl mercaptide at pH 12 and 105 °C for 60 min provided small but significant increases in xylan and cellulose yields relative to control conditions, but preservation of GGM was minimal. Furthermore, to provide insight into molecular-scale details of primary peeling, pretreatment, and alkaline hydrolysis, we performed classical molecular dynamics (MD) simulations under selected process conditions and quantum mechanical (QM) calculations of selected reactions. MD simulations showed that C1 of the GGM reducing end is more readily accessible by HO – and CH 3 S – ions than in cellulose. The free energy barrier for peeling calculated with QM is lower for GGM than for cellulose, indicating increased susceptibility to peeling. In addition, we found that GGM may be more susceptible to internal chain cleavage than cellulose. Thus, even though reducing end groups may be protected initially through pretreatment, new unprotected reducing end groups may be generated through alkaline hydrolysis. Taken together, these findings show the promise of methyl mercaptide as a pretreatment technology for cellulose retention and also provide molecular insight for improving its effectiveness toward GGM.

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

Integrated Quantum-Classical Protocol for the Realistic Description of Solvated Multinuclear Mixed-Valence Transition-Metal Complexes and Their Solvatochromic Properties

Linear cyanide-bridged polymetallic complexes, which undergo photoinduced metal-to-metal charge transfer, represent prototypical systems for studying long-range electron-transfer reactions and understanding the role played by specific solute–solvent interactions in modulating the excited-state dynamics. Here, to tackle this problem, while achieving a statistically meaningful description of the solvent and of its relaxation, one needs a computational approach capable of handling large polynuclear transition-metal complexes, both in their ground and excited states, as well as the ability to follow their dynamics in several environments up to nanosecond time scales. Here, we present a mixed quantum classical approach, which combines large-scale molecular dynamics (MD) simulations based on an accurate quantum mechanically derived force field (QMD-FF) and self-consistent QMD polarized point charges, with IR and UV–vis spectral calculations to model the solvation dynamics and optical properties of a cyano-bridged trinuclear mixed-valence compound (trans-[(NC) 5 Fe III (μ-CN)Ru II (pyridine) 4 (μ-NC)Fe III (CN) 5 ] 4– ). We demonstrate the reliability of the QMD-FF/MD approach in sampling the solute conformational space and capturing the local solute–solvent interactions by comparing the results with higher-level quantum mechanics/molecular mechanics (QM/MM) MD reference data. The IR spectra calculated along the classical MD trajectories in different solvents correctly predict the red shift of the CN stretching band in the aprotic medium (acetonitrile) and the subtle differences measured in water and methanol, respectively. By explicitly including the solvent molecules around the cyanide ligands and calculating the thermal averaged absorption spectra using time-dependent density functional theory calculations within the Tamm–Dancoff approximation, the experimental solvatochromic shift is quantitatively reproduced going from water to methanol, while it is overestimated for acetonitrile. This discrepancy can likely be traced back to the lack of important dispersion interactions between the solvent cyano groups and the pyridine substituents in our micro solvation model. The proposed protocol is applied to the ground state in water, methanol, and acetonitrile and can be flexibly generalized to study excited-state nonequilibrium solvation dynamics.

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

Implementation and analysis of quantum computing application to Higgs boson reconstruction at the large Hadron Collider

With the advent of the High-Luminosity Large Hadron Collider (HL-LHC) era, high energy physics (HEP) event selection will require new approaches to rapidly and accurately analyze vast databases. The current study addresses the enormity of HEP databases in an unprecedented manner—a quantum search using Grover’s Algorithm (GA) on an unsorted database, ATLAS Open Data, from the ATLAS detector. A novel method to identify rare events at 13 TeV in CERN’s LHC using quantum computing (QC) is presented. As indicated by the Higgs boson decay channel H→ZZ*→4l , the detection of four leptons in one event may be used to reconstruct the Higgs boson and, more importantly, evince Higgs boson decay to some new phenomena, such as H→ZZ d →4l . Searching the dataset for collisions resulting in detection of four leptons using a Jupyter Notebook, a classical simulation of GA, and several quantum computers with multiple qubits, the current application was found to make the proper selection in the unsorted dataset. Quantum search efficacy was analyzed for the incoming HL-LHC by implementing the QC method on multiple classical simulators and IBM’s quantum computers with the IBM Qiskit Open Source Software. The current QC application provides a novel, high-efficiency alternative to classical database searches, demonstrating its potential utility as a rapid and increasingly accurate search method in HEP.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1996

Dynamical Simulation of Probabilities

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-Lipschitz dynamics, without utilization of any man-made devices(such as random number generators). Self-orgainizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed. Special attention was focused upon coupled stochastic processes, defined in terms of conditional probabilities, for which joint probability does not exist. Simulations of quantum probabilities are also discussed.

number generators quantum probabilities↗