Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum computing models”

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 415 records · Page 23

Optimizing the Heisenberg Vortex Tube for Hydrogen Cooling (Final Technical Report)

Hydrogen utilization at Plug Power sites ranges between 70-93% with the remainder vented and lost to the atmosphere. The goal of this project was to improve hydrogen utilization at Plug Power fulfillment centers via the patented Heisenberg vortex tube (HVT). The HVT combines conventional counterflow vortex tubes with para-orthohydrogen conversion catalyst to allow the cooling of hydrogen flows with no moving parts or external energy inputs. In year 1 of this project the HVT was evaluated to improve hydrogen utilization via the following concepts: 1) increasing liquid hydrogen pump volumetric efficiency by 20% through vapor separation and subcooling of the liquid, 2) reducing liquid hydrogen storage tank boil-off losses by 20% through thermal vapor shielding (TVS), and 3) increase isentropic efficiency of supercritical hydrogen expansion at 40-50 K, from 31% to over 40%. The TVS concept was selected as the most favorable application for further development. While the conceptual analysis was underway, the cryocatalysis hydrogen experiment facility (CHEF) was retrofitted with a new cryocooler, higher pressure condenser tanks, and in-situ fiber-optic Raman probes for ortho-parahydrogen composition analysis at the inlets and outlets of the HVT. To our knowledge this is the first in-situ implementation of cryogenic Raman probes for ortho-parahydrogen analysis. Subsequent testing of catalyzed and non-catalyzed HVT identified a low flow rate, high-conversion efficacy regime well suited for TVS development. Computational fluid dynamics (CFD), Reduced order modeling (ROM), and quantum Monte Carlo atomistic simulations were applied to optimize the design of the HVT implemented for TVS. The simulations and analysis identified a ruthenium-based catalyst as the most optimal for high conversion with little pressure losses and was matched to experimental measurements. These results indicated the design could achieve the 20% boil-off reduction target. An HVT field-trial was designed and constructed by Plug Power and implemented at a customer site. However, budget limitations reduced the amount of catalyst that could be applied to the HVT. With the reduced amount of catalyst, CFD analysis estimated about 3% reduction in boil-off. A similar amount of boil-off reduction was observed during preliminary measurements during tank commissioning. However, the results have a large margin for error and were operated at relatively low tank temperatures when the HVT has the lowest potential for improvement. This project demonstrated the use of para-orthohydrogen catalysis for reducing liquid hydrogen tank boil-off losses. The field trial system is anticipated to provide long-term experimental measurements on tank operational performance that will allow Plug Power to instrument additional tanks in the future. Recommendations for future work include the development of higher activity, lower cost para-orthohydrogen conversion catalyst for use in the HVT. Tank process optimizations could maximize the efficacy of the HVT and further improve hydrogen utilization.

08 HYDROGEN↗

Unified approach to topological quantum computation with anyons: From qubit encoding to Toffoli gate

Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasiparticle excitations. We develop an efficient means to map between dense and sparse representations of quantum information (qubits) and a simple construction of multiqubit gates, for all anyon models from Chern-Simons-Witten SU(2){sub k} theory that support universal quantum computation by braiding (k{>=}3, k{ne}4). In the process, we show how the constructions of topological quantum memory and gates for k=2,4 connect naturally to those for k{>=}3, k{ne}4, unifying these concepts in a simple framework. Furthermore, we illustrate potential extensions of these ideas to other anyon models outside of Chern-Simons-Witten field theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Towards quantum machine learning with tensor networks

Machine learning is a promising application of quantum computing, but challenges remain for implementation today because near-term devices have a limited number of physical qubits and high error rates. Motivated by the usefulness of tensor networks for machine learning in the classical context, we propose quantum computing approaches to both discriminative and generative learning, with circuits based on tree and matrix product state tensor networks, that could already have benefits with such near-term devices. The result is a unified framework in which classical and quantum computing can benefit from the same theoretical and algorithmic developments, and the same model can be trained classically then transferred to the quantum setting for additional optimization. Tensor network circuits can also provide qubit-efficient schemes in which, depending on the architecture, the number of physical qubits required scales only logarithmically with, or independently of the input or output data sizes. Here, we demonstrate our proposals with numerical experiments, training a discriminative model to perform handwriting recognition using a hybrid quantum-classical optimization procedure that could be carried out on quantum hardware today, and testing the noise resilience of the trained model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

State preparation and evolution in quantum computing: a perspective from Hamiltonian moments

Quantum algorithms on the noisy intermediate-scale quantum (NISQ) devices are expected to simulate quan- tum systems that are classically intractable to demonstrate quantum advantages. However, the non-negligible gate error on the NISQ devices impedes the conventional quantum algorithms to be implemented. Practical strategies usually exploit hybrid quantum-classical quantum algorithms to demonstrate potentially useful ap- plications of quantum computing in the NISQ era. Among the numerous hybrid quantum-classical algorithms, recent efforts highlight the development of quantum algorithms based upon quantum computed Hamiltonian moments, ?f|Hˆn|f? (n = 1, 2, · · · ), with respect to quantum state |f?. In this tutorial, we will give a brief review of these quantum algorithms with focuses on the typical ways of computing Hamiltonian moments using quantum hardware and improving the accuracy of the estimated state energies based on the quantum computed moments. Furthermore, we will present a tutorial to show how we can measure and compute the Hamiltonian moments of a four-site Heisenberg model, and compute the energy and magnetization of the model utilizing the imaginary time evolution in the real IBM-Q NISQ hardware environment. Along this line, we will further discuss some practical issues associated with these algorithms. We will conclude this tutorial review by overviewing some possible developments and applications in this direction in the near future.

Aulicino, Joseph C.↗

Relationship between quantum walks and relativistic quantum mechanics

Quantum walk models have been used as an algorithmic tool for quantum computation and to describe various physical processes. This article revisits the relationship between relativistic quantum mechanics and the quantum walks. We show the similarities of the mathematical structure of the decoupled and coupled forms of the discrete-time quantum walk to that of the Klein-Gordon and Dirac equations, respectively. In the latter case, the coin emerges as an analog of the spinor degree of freedom. Discrete-time quantum walk as a coupled form of the continuous-time quantum walk is also shown by transforming the decoupled form of the discrete-time quantum walk to the Schroedinger form. By showing the coin to be a means to make the walk reversible and that the Dirac-like structure is a consequence of the coin use, our work suggests that the relativistic causal structure is a consequence of conservation of information. However, decoherence (modeled by projective measurements on position space) generates entropy that increases with time, making the walk irreversible and thereby producing an arrow of time. The Lieb-Robinson bound is used to highlight the causal structure of the quantum walk to put in perspective the relativistic structure of the quantum walk, the maximum speed of walk propagation, and earlier findings related to the finite spread of the walk probability distribution. We also present a two-dimensional quantum walk model on a two-state system to which the study can be extended.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum many-body calculations using body-centered cubic lattices

It is often computationally advantageous to model space as a discrete set of points forming a lattice grid. This technique is particularly useful for computationally difficult problems such as quantum many-body systems. For reasons of simplicity and familiarity, nearly all quantum many-body calculations have been performed on simple cubic lattices. Since the removal of lattice artifacts is often an important concern, it would be useful to perform calculations using more than one lattice geometry. In this paper we show how to perform quantum many-body calculations using auxiliary-field Monte Carlo simulations on a three-dimensional body-centered cubic (BCC) lattice. As a benchmark test we compute the ground state energy of 33 spin-up and 33 spin-down neutrons in the unitary limit, which is an idealized limit where the interaction range is zero and scattering length is infinite. As a fraction of the free Fermi gas energy E FG , we find that the ground state energy is E 0 /E FG =0.369(2),0.371(2), using two different definitions of the finite-system energy ratio. This is in excellent agreement with recent results obtained on a cubic lattice [He et al., Phys. Rev. A 101, 063615 (2020)]. We find that the computational effort and performance on a BCC lattice is approximately the same as that for a cubic lattice with the same number of lattice points. We discuss how the lattice simulations with different geometries can be used to constrain the size of lattice artifacts in simulations of continuum quantum many-body systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Fast Machine Learning for Quantum Control of Microwave Qudits on Edge Hardware

Quantum optimal control is a promising approach to improve the accuracy of quantum gates, but it relies on complex algorithms to determine the best control settings. CPU or GPU-based approaches often have delays that are too long to be applied in practice. It is paramount to have systems with extremely low delays to quickly and with high fidelity adjust quantum hardware settings, where fidelity is defined as overlap with a target quantum state. Here, we utilize machine learning (ML) models to determine control-pulse parameters for preparing Selective Number-dependent Arbitrary Phase (SNAP) gates in microwave cavity qudits, which are multi-level quantum systems that serve as elementary computation units for quantum computing. The methodology involves data generation using classical optimization techniques, ML model development, design space exploration, and quantization for hardware implementation. Our results demonstrate the efficacy of the proposed approach, with optimized models achieving low gate trace infidelity near $10^{-3}$ and efficient utilization of programmable logic resources.

Sanders, Flor [Columbia U.]↗

Simulation of Silicon Nanodevices at Cryogenic Temperatures for Quantum Computing

Cryogenic nanoscale semiconductor devices are crucial for a wide variety of applications. The accurate design of such devices involve solving their electrostatics from fundamental semiconductor equations at low temperatures. We employ COMSOL to model a prototype cryogenic nanostructure, that can be used to readout the spin of a single electron in silicon, for quantum computing applications. By achieving convergence down to 15 Kelvin (K), we provide a guideline of techniques that aid to enhance convergence at cryogenic temperatures. We further compare the device electrostatics at different temperatures, which aids us to estimate the accuracy with temperature.

Mohiyaddin, Fahd A.↗

Field–potential finite-difference time-domain (FiPo FDTD) technique for computational electromagnetics

Modeling light–matter interactions at the nanoscale requires accurate handling of coupled quantum and electromagnetic systems. This coupling requires information about the electric scalar potential Φ and the magnetic vector potential A, which are not typically calculated in standard computational electromagnetics implementations. To that end, we have developed a field–potential finite-difference time-domain (FiPo FDTD) algorithm, which solves a set of first-order equations for Φ and A alongside equations for the electric and magnetic fields E and H. The FiPo Basic code is essentially conventional FDTD, but with an added module that calculates the potentials. The FiPo Hybrid code self-consistently calculates both fields and potentials and is particularly suitable for coupling with quantum electronic transport solvers because it can be sourced by the potentials themselves. To terminate the domain and mimic infinite space, we have derived and implemented a convolutional perfectly matched layer (CPML) absorbing boundary condition for FiPo FDTD whose performance is on par with state-of-the-art CPMLs for standard FDTD. We present FiPo simulation results on several example systems.

Avazpour, L. [University of Wisconsin-Madison, WI ↗

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Hard computational tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their simulation, analysis, and data resources. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. In this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

Alexeev, Yuri↗

A kinetic model for the transport of electrons in a graphene layer

In this article, we propose a new numerical scheme for the computation of the transport of electrons in a graphene device. The underlying quantum model for graphene is a massless Dirac equation, whose eigenvalues display a conical singularity responsible for non-adiabatic transitions between the two modes. We first derive a kinetic model which takes the form of two Boltzmann equations coupled by a collision operator modeling the non-adiabatic transitions. This collision term includes a Landau–Zener transfer term and a jump operator whose presence is essential in order to ensure a good energy conservation during the transitions. We propose an algorithmic realization of the semi-group solving the kinetic model, by a particle method. We give analytic justification of the model and propose a series of numerical experiments studying the influences of the various sources of errors between the quantum and the kinetic models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Early Exploration of a Flexible Framework for Efficient Quantum Linear Solvers in Power Systems

The rapid integration of renewable energy resources presents formidable challenges in managing power grids. While advanced computing and machine learning techniques offer some solutions for accelerating grid modeling and simulation, there remain complex problems that classical computers cannot effectively address. Quantum computing, a promising technology, has the potential to fundamentally transform how we manage power systems, especially in scenarios with a higher proportion of renewable energy sources. One critical aspect is solving linear systems of equations, crucial for power system applications like power flow analysis, for which the Harrow-Hassidim-Lloyd (HHL) algorithm is a well-known quantum solution. However, HHL quantum circuits often exhibit excessive depth, making them impractical for current Noisy-Intermediate-Scale-Quantum (NISQ) devices. In this paper, we introduce a versatile framework, powered by NWQSim, that bridges the gap between power system applications and quantum linear solvers available in Qiskit. This framework empowers researchers to efficiently explore power system applications using quantum linear solvers. Through innovative gate fusion strategies, reduced circuit depth, and GPU acceleration, our simulator significantly enhances resource efficiency. Power flow case studies have demonstrated up to a eight-fold speedup compared to Qiskit Aer, all while maintaining comparable levels of accuracy.

quantum computing, Harrow-Hassidim-Lloyd, high-per↗

Capturing electronic decoherence in quantum-classical dynamics using the ring-polymer-surface-hopping–density-matrix approach

Simulations of coupled electronic and nuclear dynamics in molecules can be quite challenging due to the involved interplay of the many degrees of freedom. Because a full quantum treatment of both electrons and nuclei is computationally very demanding, it is generally restricted to model systems or rather small molecules and short timescales. Mixed quantum-classical dynamics methods such as Tully's fewest switches surface hopping (FSSH) can be used to overcome this limitation. However, FSSH is known to poorly describe electronic coherences and decoherence phenomena. Here, we present an approach that combines FSSH with ring-polymer molecular dynamics (RPMD) in a specific way that aims to alleviate the coherence problem. Termed the ring-polymer-surface-hopping–density-matrix approach, this method uses an electronic density-matrix formulation to calculate surface hopping rates. Additionally, this incorporates decoherence effects into FSSH in a natural way by taking into account the spatial spreading of the ring polymer that mimics the width of a nuclear wave packet in each RPMD trajectory. By applying our method to Tully's one-dimensional model system, we demonstrate that this method captures a crucial decoherence mechanism that is missing in FSSH. Furthermore, our method turns out to be superior at describing electronic coherences compared with earlier attempts at combining RPMD and FSSH.

74 ATOMIC AND MOLECULAR PHYSICS↗

Quantum simulation of fundamental particles and forces

Key static and dynamic properties of matter — from creation in the Big Bang to evolution into subatomic and astrophysical environments — arise from the underlying fundamental quantum fields of the standard model and their effective descriptions. However, the simulation of these properties lies beyond the capabilities of classical computation alone. Advances in quantum technologies have improved control over quantum entanglement and coherence to the point at which robust simulations of quantum fields are anticipated in the foreseeable future. In this Perspective article, we discuss the emerging area of quantum simulations of standard-model physics, outlining the challenges and opportunities for progress in the context of nuclear and high-energy physics.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Building an ab initio solvated DNA model using Euclidean neural networks

Accurately modeling large biomolecules such as DNA from first principles is fundamentally challenging due to the steep computational scaling of ab initio quantum chemistry methods. This limitation becomes even more prominent when modeling biomolecules in solution due to the need to include large numbers of solvent molecules. We present a machine-learned electron density model based on a Euclidean neural network framework that includes a built-in understanding of equivariance to model explicitly solvated double-stranded DNA. By training the machine learning model using molecular fragments that sample the key DNA and solvent interactions, we show that the model predicts electron densities of arbitrary systems of solvated DNA accurately, resolves polarization effects that are neglected by classical force fields, and captures the physics of the DNA-solvent interaction at the ab initio level.

59 BASIC BIOLOGICAL SCIENCES↗

Quantum-centric supercomputing for materials science: A perspective on challenges and future directions

Computational models are an essential tool for the design, characterization, and discovery of novel materials. Computationally hard tasks in materials science stretch the limits of existing high-performance supercomputing centers, consuming much of their resources for simulation, analysis, and data processing. Quantum computing, on the other hand, is an emerging technology with the potential to accelerate many of the computational tasks needed for materials science. In order to do that, the quantum technology must interact with conventional high-performance computing in several ways: approximate results validation, identification of hard problems, and synergies in quantum-centric supercomputing. Here in this paper, we provide a perspective on how quantum-centric supercomputing can help address critical computational problems in materials science, the challenges to face in order to solve representative use cases, and new suggested directions.

36 MATERIALS SCIENCE↗

Symmetry reduction of quasi-free states

Given a group-invariant quasi-free state on the algebra of canonical commutation relations (CCR), we show how group averaging techniques can be used to obtain a symmetry-reduced CCR algebra and reduced quasi-free state. When the group is compact, this method of symmetry reduction leads to standard results which can be obtained using other methods. When the group is noncompact, the group averaging prescription relies on technically favorable conditions which we delineate. As an example, we consider symmetry reduction of the usual vacuum state for a Klein-Gordon field on Minkowski spacetime by a noncompact subgroup of the Poincare group consisting of a 1-parameter family of boosts, a 1-parameter family of spatial translations and a set of discrete translations. We show that the symmetry-reduced CCR algebra and vacuum state correspond to that used by each of Berger, Husain, and Pierri for the polarized Gowdy T{sup 3} quantum gravity model.

97 MATHEMATICS AND COMPUTING↗