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 811 records · Page 45
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

How Well Can Quantum Embedding Method Predict the Reaction Profiles for Hydrogenation of Small Li Clusters?

Quantum computing leverages the principles of quantum mechanics in novel ways to tackle complex chemistry problems that cannot be accurately addressed using traditional quantum chemistry methods. However, the high computational cost and available number of physical qubits with high fidelity limit its application to small chemical systems. This work employed a quantum-classical framework which features a quantum active space-embedding approach to perform simulations of chemical reactions that require up to 14 qubits. This framework was applied to prototypical example metal hydrogenation reactions: the coupling between hydrogen and Li 2 , Li 3 , and Li 4 clusters. Particular attention was paid to the computation of barriers and reaction energies. The predicted reaction profiles compare well with advanced classical quantum chemistry methods, demonstrating the potential of the quantum embedding algorithm to map out reaction profiles of realistic gas-phase chemical reactions to ascertain qualitative energetic trends. Additionally, the predicted potential energy curves provide a benchmark to compare against both current and future quantum embedding approaches.

36 MATERIALS SCIENCE↗
DOE OSTI2020

A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Charged particle tracking with quantum annealing optimization

Abstract At the High Luminosity Large Hadron Collider (HL-LHC), traditional track reconstruction techniques that are critical for physics analysis will need to be upgraded to scale with track density. Quantum annealing has shown promise in its ability to solve combinatorial optimization problems amidst an ongoing effort to establish evidence of a quantum speedup. As a step towards exploiting such potential speedup, we investigate a track reconstruction approach by adapting the existing geometric Denby-Peterson (Hopfield) network method to the quantum annealing framework for HL-LHC conditions. We develop additional techniques to embed the problem onto existing and near-term quantum annealing hardware. Results using simulated annealing and quantum annealing with the D-Wave 2X system on the TrackML open dataset are presented, demonstrating the successful application of a quantum annealing algorithm to the track reconstruction challenge. We find that combinatorial optimization problems can effectively reconstruct tracks, suggesting possible applications for fast hardware-specific implementations at the HL-LHC while leaving open the possibility of a quantum speedup for tracking.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗
DOE OSTI2021

Robust implementation of generative modeling with parametrized quantum circuits

Although the performance of hybrid quantum-classical algorithms is highly dependent on the selection of the classical optimizer and the circuit ansätze, a robust and thorough assessment on-hardware of such features has been missing to date. From the optimizer perspective, the primary challenge lies in the solver’s stochastic nature, and their significant variance over the random initialization. Therefore, a robust comparison requires one to perform several training curves for each solver before one can reach conclusions about their typical performance. Since each of the training curves requires the execution of thousands of quantum circuits in the quantum computer, such a robust study remained a steep challenge for most hybrid platforms available today. In this work, we leverage on Rigetti’s Quantum Cloud Services (QCS™) to overcome this implementation barrier, and we study the on-hardware performance of the data-driven quantum circuit learning (DDQCL) for three different state-of-the-art classical solvers, and on two-different circuit ansätze associated to different entangling connectivity graphs for the same task. Additionally, we assess the gains in performance from varying circuit depths. To evaluate the typical performance associated with each of these settings in this benchmark study, we use at least five independent runs of DDQCL towards the generation of quantum generative models capable of capturing the patterns of the canonical Bars and Stripes dataset. In this experimental benchmarking, the gradient-free optimization algorithms show an outstanding performance compared to the gradient-based solver. In particular, one of them had better performance when handling the unavoidable noisy objective function to be minimized under experimental conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Gene Expression Programming for Quantum Computing

Here, we introduce QuantumGEP, a scientific computer program that uses gene expression programming (GEP) to find a quantum circuit that either (1) maps a given set of input states to a given set of output states or (2) transforms a fixed initial state to minimize a given physical quantity of the output state. QuantumGEP is a driver program that uses evendim, a generic computational engine for GEP, both of which are free and open source. We apply QuantumGEP as a powerful solver for MaxCut in graphs and for condensed matter quantum many-body Hamiltonians.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2003

Quantum Search in Hilbert Space

A proposed quantum-computing algorithm would perform a search for an item of information in a database stored in a Hilbert-space memory structure. The algorithm is intended to make it possible to search relatively quickly through a large database under conditions in which available computing resources would otherwise be considered inadequate to perform such a task. The algorithm would apply, more specifically, to a relational database in which information would be stored in a set of N complex orthonormal vectors, each of N dimensions (where N can be exponentially large). Each vector would constitute one row of a unitary matrix, from which one would derive the Hamiltonian operator (and hence the evolutionary operator) of a quantum system. In other words, all the stored information would be mapped onto a unitary operator acting on a quantum state that would represent the item of information to be retrieved. Then one could exploit quantum parallelism: one could pose all search queries simultaneously by performing a quantum measurement on the system. In so doing, one would effectively solve the search problem in one computational step. One could exploit the direct- and inner-product decomposability of the unitary matrix to make the dimensionality of the memory space exponentially large by use of only linear resources. However, inasmuch as the necessary preprocessing (the mapping of the stored information into a Hilbert space) could be exponentially expensive, the proposed algorithm would likely be most beneficial in applications in which the resources available for preprocessing were much greater than those available for searching.

Zak, Michail↗
DOE OSTI2021

TEAM Project Review, Year 2

This report summarizes our research activities within the TEAM project between December 2020 and December 2021, funded by the ASCR Advanced Research in Quantum Computing program. During the reporting period the LLNL-MSU team has made progress on several fronts. An overarching goal of the team is to provide a comprehensive suite of software tools that can be used for the Characterize-Optimize-Compute loop needed to implement and execute algorithms on quantum devices. We are concurrently developing lightweight solvers that can be used on desktop computers to find optimal control pulses and to characterize small quantum systems (consisting of a few transmons and cavities). However, desktop computers are insufficient for simulating and characterizing larger quantum systems. We have therefore also developed parallel, distributed memory, simulators and optimization solvers, both for open and closed quantum systems. These parallel solvers have, for example, been used to study quantum optimal control for pure-state preparation, utilizing 1000’s of cores on a modern high-performance computing (HPC) platform.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Scalable qubit representations of neutrino mixing matrices

Oscillating neutrino beams exhibit quantum coherence over distances of thousands of kilometers. Their unambiguously quantum nature suggests an appealing test system for direct quantum simulation. Such techniques may enable presently analytically intractable calculations involving multi-neutrino entanglements, such as collective neutrino oscillations in supernovae, but only once oscillation phenomenology is properly re-expressed in the language of quantum circuits. Here we resolve outstanding conceptual issues regarding encoding of arbitrarily mixed neutrino flavor states in the Hilbert space of an n-qubit quantum computer. We introduce algorithms to encode mixing and oscillation of any number of flavor-mixed neutrinos, both with and without CP-violation, with an efficient number of prescriptive input parameters in terms of sub-rotations of the PMNS matrix in standard form. As a result, examples encoded for an IBM-Q quantum computer are shown to converge to analytic predictions both with and without CP-violation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Search for efficient formulations for Hamiltonian simulation of non-Abelian lattice gauge theories

Hamiltonian formulation of lattice gauge theories (LGTs) is the most natural framework for the purpose of quantum simulation, an area of research that is growing with advances in quantum-computing algorithms and hardware. It, therefore, remains an important task to identify the most accurate, while computationally economic, Hamiltonian formulation(s) in such theories, considering the necessary truncation imposed on the Hilbert space of gauge bosons with any finite computing resources. This paper is a first step toward addressing this question in the case of non-Abelian LGTs, which further require the imposition of non-Abelian Gauss’s laws on the Hilbert space, introducing additional computational complexity. Focusing on the case of SU(2) LGT in 1+1 dimensions coupled to one flavor of fermionic matter, a number of different formulations of the original Kogut-Susskind framework are analyzed with regard to the dependence of the dimension of the physical Hilbert space on boundary conditions, system’s size, and the cutoff on the excitations of gauge bosons. The impact of such dependencies on the accuracy of the spectrum and dynamics obtained from a Hamiltonian computation is examined, and the (classical) computational-resource requirements given these considerations are studied. Besides the well-known angular-momentum formulation of the theory, the cases of purely fermionic and purely bosonic formulations (with open boundary conditions), and the Loop-String-Hadron formulation are analyzed, along with a brief discussion of a Quantum-Link-Model formulation of the same theory. Clear advantages are found in working with the Loop-String-Hadron framework which implements non-Abelian Gauss’s laws a priori using a complete set of gauge-invariant operators. Although small lattices are studied in the numerical analysis of this work, and only the simplest algorithms are considered, a range of conclusions will be applicable to larger systems and potentially to higher dimensions. Future studies will extend this investigation to the analysis of resource requirements for quantum simulations of non-Abelian LGT, with the goal of shedding light on the most efficient Hamiltonian formulation of gauge theories of relevance in nature

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Experimental quantum learning of a spectral decomposition

Currently available quantum hardware allows for small-scale implementations of quantum machine learning algorithms. Such experiments aid the search for applications of quantum computers by benchmarking the near-term feasibility of candidate algorithms. Here we demonstrate the quantum learning of a two-qubit unitary by a sequence of three parameterized quantum circuits containing a total of 21 variational parameters. Moreover, we variationally diagonalize the unitary to learn its spectral decomposition, i.e., its eigenvalues and eigenvectors. We illustrate how this can be used as a subroutine to compress the depth of dynamical quantum simulations. One can view our implementation as a demonstration of entanglement-enhanced machine learning, as only a single (entangled) training data pair is required to learn a 4 × 4 unitary matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Toward a microscopic picture of hadronization and multi-parton processes

This project advanced the understanding of how quarks and gluons produced in high-energy collisions transform into the hadrons observed in particle detectors, a fundamental process known as quantum chromodynamics (QCD) hadronization. By combining theoretical calculations, quantum simulation methods, and modern AI techniques, the research developed new tools to study multi-parton dynamics and nonperturbative effects that are essential for interpreting data from current and future nuclear physics experiments. Key outcomes include new theoretical frameworks for jet and hadron measurements, pioneering quantum simulation algorithms for real-time dynamics in field theories, and the development of advanced machine-learning models, such as diffusion models and explainable classifiers, to simulate and analyze collider events. These results are directly relevant to experiments at Jefferson Lab, Brookhaven National Laboratory, and the future Electron-Ion Collider, and they also have a broader impact in areas such as quantum information science and data-driven modeling of complex systems. The project supported the training of graduate students and postdoctoral fellows and contributed to the broader scientific community through publications, workshops, and collaborative activities. Overall, this work provides new insights into the microscopic mechanisms of hadron formation and establishes a foundation for future studies at the intersection of nuclear physics, artificial intelligence, and quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Solving differential‐algebraic equations in power system dynamic analysis with quantum computing

Abstract Power system dynamics are generally modeled by high dimensional non‐linear differential‐algebraic equations (DAEs) given a large number of components forming the network. These DAEs' complexity can grow exponentially due to the increasing penetration of distributed energy resources, whereas their computation time becomes sensitive due to the increasing interconnection of the power grid with other energy systems. This paper demonstrates the use of quantum computing algorithms to solve DAEs for power system dynamic analysis. We leverage a symbolic programming framework to equivalently convert the power system's DAEs into ordinary differential equations (ODEs) using index reduction methods and then encode their data into qubits using amplitude encoding. The system non‐linearity is captured by Hamiltonian simulation with truncated Taylor expansion so that state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can solve the power system's DAEs accurately with a computational complexity polynomial in the logarithm of the system dimension. We also illustrate the use of recent advanced tools in scientific machine learning for implementing complex computing concepts, that is, Taylor expansion, DAEs/ODEs transformation, and quantum computing solver with abstract representation for power engineering applications.

computational complexity↗
DOE OSTI2026

Efficient Preparation of Dicke States

Here, we present an algorithm utilizing midcircuit measurement and feedback that prepares Dicke states with polylogarithmically many ancillae and polylogarithmic depth. Our algorithm uses only global midcircuit projective measurements and adaptively chosen global rotations. This improves over prior work that was only efficient for Dicke states of low weight or was not efficient in both depth and width. Our algorithm can also naturally be implemented in a cavity QED context using logarithmic time, zero ancillae, and atom-photon coupling scaling with the square root of the system size.

cavity methods↗
DOE OSTI2023

Stochastic quantum Krylov protocol with double-factorized Hamiltonians

Here we propose a class of randomized quantum Krylov diagonalization (rQKD) algorithms capable of solving the eigenstate estimation problem with modest quantum resource requirements. Compared to previous real-time evolution quantum Krylov subspace methods, our approach expresses the time evolution operator e –i$\widehat{H}$$\tau$ as a linear combination of unitaries and subsequently uses a stochastic sampling procedure to reduce circuit depth requirements. While our methodology applies to any Hamiltonian with fast-forwardable subcomponents, we focus on its application to the explicitly double-factorized electronic-structure Hamiltonian. To demonstrate the potential of the proposed rQKD algorithm on near-term quantum devices, we provide numerical benchmarks for a variety of molecular systems with circuit-based state-vector simulators including the effects of sampling noise, achieving ground-state energy errors of less than 1 kcal mol -1 with circuit depths orders of magnitude shallower than those required for low-rank deterministic Trotter-Suzuki decompositions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Interactive Quantum Chemistry Enabled by Machine Learning, Graphical Processing Units, and Cloud Computing

Modern quantum chemistry algorithms are increasingly able to accurately predict molecular properties that are useful for chemists in research and education. Despite this progress, performing such calculations is currently unattainable to the wider chemistry community, as they often require domain expertise, computer programming skills, and powerful computer hardware. In this review, we outline methods to eliminate these barriers using cutting-edge technologies. We discuss the ingredients needed to create accessible platforms that can compute quantum chemistry properties in real time, including graphical processing units–accelerated quantum chemistry in the cloud, artificial intelligence–driven natural molecule input methods, and extended reality visualization. We end by highlighting a series of exciting applications that assemble these components to create uniquely interactive platforms for computing and visualizing spectra, 3D structures, molecular orbitals, and many other chemical properties.

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

Quantum frequency resampling

In signal processing, resampling algorithms can modify the number of resources encoding a collection of data points. Downsampling reduces the cost of storage and communication, while upsampling interpolates new data from limited one, e.g., when resizing a digital image. We present a toolset of quantum algorithms to resample data encoded in the probabilities of a quantum register, using the quantum Fourier transform to adjust the number of high-frequency encoding qubits. We discuss advantage over classical resampling algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗