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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Electronic excited states from a variance-based contracted quantum eigensolver

Electronic excited states of molecules are central to many physical and chemical processes, and yet they are typically more difficult to compute than ground states. Here, in this paper we leverage the advantages of quantum computers to develop an algorithm for the highly accurate calculation of excited states. We solve a contracted Schrödinger equation (CSE)—a contraction (projection) of the Schrödinger equation onto the space of two electrons—whose solutions correspond identically to the ground and excited states of the Schrödinger equation. While recent quantum algorithms for solving the CSE, known as contracted quantum eigensolvers (CQE), have focused on ground states, we develop a CQE based on the variance that is designed to optimize rapidly to a ground or excited state. We apply the algorithm to compute the ground and excited states of H 2 , H 4 , and BH.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Unitary quantum lattice simulations for Maxwell equations in vacuum and in dielectric media

Utilizing the similarity between the spinor representation of the Dirac and the Maxwell equations that has been recognized since the early days of relativistic quantum mechanics, a quantum lattice algorithm (QLA) representation of unitary collision-stream operators of Maxwell's equations is derived for both homogeneous and inhomogeneous media. A second-order accurate 4-spinor scheme is developed and tested successfully for two-dimensional (2-D) propagation of a Gaussian pulse in a uniform medium whereas for normal (1-D) incidence of an electromagnetic Gaussian wave packet onto a dielectric interface requires 8-component spinors because of the coupling between the two electromagnetic polarizations. In particular, the well-known phase change, field amplitudes and profile widths are recovered by the QLA asymptotic profiles without the imposition of electromagnetic boundary conditions at the interface. The QLA simulations yield the time-dependent electromagnetic fields as the wave packet enters and straddles the dielectric boundary. QLA involves unitary interleaved non-commuting collision and streaming operators that can be coded onto a quantum computer: the non-commutation being the very reason why one perturbatively recovers the Maxwell equations.

Physics↗
DOE OSTI2023

Faster spectral density calculation using energy moments

Abstract Accurate predictions of inclusive scattering cross sections in the linear response regime require efficient and controllable methods to calculate the spectral density in a strongly-correlated many-body system. In this work we reformulate the recently proposed Gaussian Integral Transform technique in terms of Fourier moments of the system Hamiltonian which can be computed efficiently on a quantum computer. One of the main advantages of this framework is that it allows for an important reduction of the computational cost by exploiting previous knowledge about the energy moments of the spectral density. For a simple model of medium mass nucleus like $$^{40}$$ 40 Ca and target energy resolution of 1 MeV we find an expected speed-up of $$\approx 125$$ ≈ 125 times for the calculation of the giant dipole response and of $$\approx 50$$ ≈ 50 times for the simulation of quasi-elastic electron scattering at typical momentum transfers.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Reflection and transmission of electromagnetic pulses at a planar dielectric interface -- theory and quantum lattice simulations

There is considerable interest in the application of quantum information science to advance computations in plasma physics. A particular point of curiosity is whether it is possible to take advantage of quantum computers to speed up numerical simulations relative to conventional computers. Many of the topics in fusion plasma physics are classical in nature. In order to implement them on quantum computers it will require couching a classical problem in the language of quantum mechanics. Electromagnetic waves are routinely used in fusion experiments to heat a plasma or to generate currents in the plasma. The propagation of electromagnetic waves is described by Maxwell equations with an appropriate description of the plasma as a dielectric medium. Before advancing to the tensor dielectric of a magnetized plasma, this paper considers electromagnetic wave propagation in a one-dimensional inhomogeneous scalar dielectric. The classic theory of scattering of plane electromagnetic waves at a planar interface, separating two different dielectric media, leads to Fresnel equations for reflection and transmission coefficients. In contrast to plane waves, this paper is on the reflection and transmission of a spatially confined electromagnetic pulse. Following an analytical formulation for the scattering of a Gaussian pulse, it is deduced that the maximum transmission coefficient for a pulse is $\sqrt{n_2/n_1}$ times that for a plane wave; the incident and transmitted pulses propagating in dielectric media with refractive indices $n_1$ and $n_2$, respectively. The analytical theory is complemented by numerical simulations using a quantum lattice algorithm for Maxwell equations. The algorithm, based on the Riemann-Silberstein-Weber representation of the electromagnetic fields and expressed in term of qubits, is an interleaved sequence of entangling operators at each lattice site and unitary streaming operators which transmit information from one site to an adjacent lattice site. Besides substantiating results from the theory for Gaussian pulses, numerical simulations show their validity for non-Gaussian pulses. Apart from their time-asymptotic forms, the simulations display an interplay between the incident, reflected, and transmitted pulses in the vicinity of the transition region between two dielectric media.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

QTRAJ 1.0: A Lindblad equation solver for heavy-quarkonium dynamics

Here we introduce an open-source package called QTraj that solves the Lindblad equation for heavy-quarkonium dynamics using the quantum trajectories algorithm. The package allows users to simulate the suppression of heavy-quarkonium states using externally-supplied input from 3+1D hydrodynamics simulations. The code uses a split-step pseudo-spectral method for updating the wave-function between jumps, which is implemented using the open-source multi-threaded FFTW3 package. This allows one to have manifestly unitary evolution when using real-valued potentials. In this paper, we provide detailed documentation of QTraj 1.0, installation instructions, and present various tests and benchmarks of the code.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗
DOE OSTI2021

Hybrid MEMS-CMOS ion traps for NISQ computing

Surging interest in engineering quantum computers has stimulated significant and focused research on technologies needed to make them manufacturable and scalable. In the ion trap realm this has led to a transition from bulk three-dimensional macro-scale traps to chip-based ion traps and included important demonstrations of passive and active electronics, waveguides, detectors, and other integrated components. At the same time as these technologies are being developed the system sizes are demanding more ions to run noisy intermediate scale quantum (NISQ) algorithms, growing from around ten ions today to potentially a hundred or more in the near future. To realize the size and features needed for this growth, the geometric and material design space of microfabricated ion traps must expand. In this paper we describe present limitations and the approaches needed to overcome them, including how geometric complexity drives the number of metal levels, why routing congestion affects the size and location of shunting capacitors, and how RF power dissipation can limit the size of the trap array. Finally, we also give recommendations for future research needed to accommodate the demands of NISQ scale ion traps that are integrated with additional technologies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Simultaneous prediction of structural properties in epitaxially–grown GaN with quantum and conventional multi–output learning algorithms

Hundreds of GaN thin film crystal plasma–assisted molecular beam epitaxy synthesis experiment records spanning two decades were organized into a dataset correlating the growth experiment design parameters with discrete, binary determinations of crystallinity and surface morphology. Conventional data science techniques as well as both quantum and classical multi–output supervised machine learning algorithms were implemented to investigate the relationships between the operating parameter data and the structural figures of merit. Correlation coefficients, decision tree nodes, p–values, and SHAP values all support substrate temperature and gallium effusion cell conditions as being statistically significant for simultaneously influencing GaN crystallinity and surface morphology. Here, a conventional deep neural network learned best from the data, followed by a quantum–classical hybrid gradient boosting algorithm. When combined with calculations of uncertainty intervals based on VennAbers predictors, machine learning predictions of both structural properties show good agreement with results reported in published experimental literature.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Using Reinforcement Learning to Optimize Quantum Circuits in thePresence of Noise

Many quantum computing frameworks currently use noise aware algorithms for implementing quantum circuits which do not scale efficiently as the size of the hardware architecture increases. As we move towards devices which utilize more qubits, it becomes increasing more important to map quantum circuits in a way that uses resources efficiently as well as maximizes the reliability of the results of that circuit. However, as the hardware increases to the point where Quantum supremacy is attainable, it will infeasible for a brute-force algorithm to find the most optimal circuit layout for circuits of medium to large depth sizes. To this end, we will to rely on reinforcement learning (RL) as a method of building quantum circuits based on observations of the noise characteristics in its environment. In this work, we create a working reinforcement learning environment in which an agent is able to make action which will build the class of circuits which creates the GHZ state. In addition to this, we also get preliminary results of the performance of a Deep Q Neural Network, which initially does not perform as well as we believe it can. In the future, we want to improve the performance of the agent and potentially generalize this environment to more classes of circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Kekulé valence bond order in the honeycomb lattice optical Su-Schrieffer-Heeger model and its relevance to graphene

We perform sign-problem-free determinant quantum Monte Carlo simulations of the optical Su- Schrieffer-Heeger model on a half-filled honeycomb lattice. In particular, we investigate the model’s semi-metal (SM) to Kekulé Valence Bond Solid (KVBS) phase transition at zero and finite temper- atures as a function of phonon energy and interaction strength. Using hybrid Monte Carlo sampling methods we can simulate the model near the adiabatic regime, allowing us to access regions of parameter space relevant to graphene. Our simulations suggest that the SM-KVBS transition is weakly first-order at all temperatures, with graphene situated close to the phase boundary in the SM region of the phase diagram. Furthermore, our results highlight the important role bond-stretching phonon modes play in the formation of KVBS order in strained graphene-derived systems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

Fast and scalable quantum Monte Carlo simulations of electron-phonon models

We introduce methodologies for highly scalable quantum Monte Carlo simulations of electron-phonon models, and report benchmark results for the Holstein model on the square lattice. The determinant quantum Monte Carlo (DQMC) method is a widely used tool for simulating simple electron-phonon models at finite temperatures, but incurs a computational cost that scales cubically with system size. Alternatively, near-linear scaling with system size can be achieved with the hybrid Monte Carlo (HMC) method and an integral representation of the Fermion determinant. Here, we introduce a collection of methodologies that make such simulations even faster. To combat "stiffness" arising from the bosonic action, we review how Fourier acceleration can be combined with time-step splitting. To overcome phonon sampling barriers associated with strongly-bound bipolaron formation, we design global Monte Carlo updates that approximately respect particle-hole symmetry. To accelerate the iterative linear solver, we introduce a preconditioner that becomes exact in the adiabatic limit of infinite atomic mass. Finally, we demonstrate how stochastic measurements can be accelerated using fast Fourier transforms. Here, these methods are all complementary and, combined, may produce multiple orders of magnitude speedup, depending on model details.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Is the Matrix Completion of Reduced Density Matrices Unique?

Reduced density matrices are central to describing observables in many-body quantum systems. In electronic structure theory, the two-particle reduced density matrix (2-RDM) suffices to determine the energy and other key properties. Recent work has used matrix completion, leveraging the low-rank structure of RDMs and approximate theoretical models, to reconstruct the 2-RDM from partial data and thus reduce the computational cost. However, matrix completion is, in general, an under-determined problem. Revisiting Rosina’s theorem (Rosina, M. Queen’s Papers on Pure and Applied Mathematics , 1968, No. 11, 369), we here show that the matrix completion is unique under certain conditions, identifying the subset of 2-RDM elements that enables its exact reconstruction from incomplete information. Building on this, we introduce a hybrid quantum–stochastic algorithm that achieves exact matrix completion, demonstrated through applications to the Fermi–Hubbard model.

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

Generation of thermofield double states and critical ground states with a quantum computer

Significance Our experiment prepares two types of nontrivial quantum states on a trapped ion quantum computer: the thermofield double state of the transverse-field Ising model at arbitrary temperature and the quantum critical state of the zero-temperature model. We use techniques motivated by the quantum approximate optimization algorithm, and we implement a hybrid quantum–classical optimization loop to prepare the quantum critical state. Our results pave the way for exploring strongly correlated models at finite temperature and teleportation protocols inspired by black hole physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Building spatial symmetries into parameterized quantum circuits for faster training

Abstract Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Simulations of frustrated Ising Hamiltonians using quantum approximate optimization

Novel magnetic materials are important for future technological advances. Theoretical and numerical calculations of ground-state properties are essential in understanding these materials, however, computational complexity limits conventional methods for studying these states. Here we investigate an alternative approach to preparing materials ground states using the quantum approximate optimization algorithm (QAOA) on near-term quantum computers. We study classical Ising spin models on unit cells of square, Shastry-Sutherland and triangular lattices, with varying field amplitudes and couplings in the material Hamiltonian. We find relationships between the theoretical QAOA success probability and the structure of the ground state, indicating that only a modest number of measurements (≲100) are needed to find the ground state of our nine-spin Hamiltonians, even for parameters leading to frustrated magnetism. We further demonstrate the approach in calculations on a trapped-ion quantum computer and succeed in recovering each ground state of the Shastry-Sutherland unit cell with probabilities close to ideal theoretical values. The results demonstrate the viability of QAOA for materials ground state preparation in the frustrated Ising limit, giving important first steps towards larger sizes and more complex Hamiltonians where quantum computational advantage may prove essential in developing a systematic understanding of novel materials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Bosonic field digitization for quantum computers

Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods that can accurately predict error scaling as a function of the resolution and parameters of the model and that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation number cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite-size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wave function sampling, and the finite representation size. Numerical simulations of small size Φ 4 problems demonstrate that the boson mass optimizing the sampling of the ground state wave function is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wave functions does not necessarily result in accurate representation. Finally, we develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Importance of kernel bandwidth in quantum machine learning

Quantum kernel methods are considered a promising avenue for applying quantum computers to machine learning problems. Identifying hyperparameters controlling the inductive bias of quantum machine learning models is expected to be crucial given the central role hyperparameters play in determining the performance of classical machine learning methods. In this work we introduce the hyperparameter controlling the bandwidth of a quantum kernel and show that it controls the expressivity of the resulting model. We use extensive numerical experiments with multiple quantum kernels and classical data sets to show consistent change in the model behavior from underfitting (bandwidth too large) to overfitting (bandwidth too small), with optimal generalization in between. We draw a connection between the bandwidth of classical and quantum kernels and show analogous behavior in both cases. Furthermore, we show that optimizing the bandwidth can help mitigate the exponential decay of kernel values with qubit count, which is the cause behind recent observations that the performance of quantum kernel methods decreases with qubit count. Here, we reproduce these negative results and show that if the kernel bandwidth is optimized, the performance instead improves with growing qubit count and becomes competitive with the best classical methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗