Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “variational quantum eigensolver”

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 145 records · Page 8

Visualizing effective potentials and using the IBM-Q to study quantum field theory models in 0+1 dimensions

This work explores the utility of two novel techniques applied to studying quantum field theory, namely quantum computing and visualizing effective potentials. We studied the ground state properties of the anharmonic oscillator and the Wess-Zumino model using the variational quantum eigensolver algorithm. We performed calculations for three and four qubit systems using IBM’s open source quantum computing simulation software. Using effective potentials, we study a simple dark mat-ter system with a Higgs and dark Higgs like particle interacting through a porthole fermion.

97 MATHEMATICS AND COMPUTING↗

Simulating 0+1 Dimensional Quantum Gravity on Quantum Computers: Mini-Superspace Quantum Cosmology and the World Line Approach in Quantum Field Theory

Quantum computers are promising candidates to radically expand the domain of computational science by their increased computing power and more effective algorithms. In particular, quantum computing could have a tremendous impact on the field of quantum cosmology. The goal of quantum cosmology is to describe the evolution of the universe through the Wheeler-DeWitt equation or path integral methods without having to first formulate a full theory of quantum gravity. The quantum computer provides an advantage in this endeavor because it can perform path integrals directly in Lorentzian space and does not require constructing contour integrations in Euclidean gravity. Also, quantum computers can provide advantages in systems with fermions which are difficult to simulate on classical computers. In this study, we first employed classical computational methods to analyze a Friedmann-Robertson-Walker mini-superspace with a scalar field and visualize the calculated wavefunction of the universe for a variety of different values of the curvature of the universe and the cosmological constant. We then used IBM’s Quantum Information Science Kit Python library and the variational quantum eigensolver algorithm to study the same systems on a quantum computer. The framework was extended to the world line approach to quantum field theory.

97 MATHEMATICS AND COMPUTING↗

Quantum computation of nanosheets in a background magnetic field for external control of nanosystems

We ran quantum simulations on lattices of interacting fermions in a background magnetic field [1]. We created discretized Hamiltonian matrices for each system and pre-processed them so that they could be read by the quantum simulator implemented in IBM's Qiskit package [2]. The simulator uses the variational quantum eigensolver (VQE) algorithm [3] to approximate the ground state energy of the input Hamiltonian, which is then compared to the classically-calculated exact value. This classical evaluation is possible because the systems studied are still within the grasp of classical computers. We also investigated ways to simplify the system before the pre-processing step. We found that in almost all cases these simplifications made our quantum calculations converge to better answers using simpler starting conditions. We are exploring other ways to interface with IBM's quantum computing software so that we no longer need to explicitly define the Hamiltonian matrices for our systems, a problem which will itself soon become intractable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Thermo Field Dynamics on a Quantum Computer

In this project we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we implemented a real-time therom field dynamics formalism, which has the added benefit of being able to compute quantities that are both time-and temperature-dependent. To implement thermo field dynamics we apply a unitary transformation [1] to discrete quantum mechanical operators to make new Hamiltoni-ans with encoded temperature dependence. The method works normally for fermions, which have a finite representation, but needs some modification to work with bosons. These Hamilto-nians are then processed into a Pauli matrix representation in order to be used as input for IBM's Qiskit package [2]. We then use IBM's quantum simulator to calculate an approximation to the Hamiltonaian's ground state energy via the variational quantum eigensolver (VQE) algorithm [3]. This approximation is then compared to a classically calculated value for the exact energy. The thermo field dynamics quantum algorithm has general applications to material science, high-energy physics and nuclear physics, particularly in those situations involving realtime evolution at high temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum computation for early universe cosmology

With the emergence of quantum computing we can, in theory, run complex simulations with many variables. For the field of cosmology, this could lend itself to applications in modeling the early universe as a quantum system to better understand large scale properties of the universe today. Here we utilize the hybrid variational quantum eigensolver (VQE) algorithm applied to an anharmonic oscillator system using QISKit to examine it's effectiveness for these cosmological questions. We then analyze a 1+1 dimensional ring of scalar bosons acting on a lattice as a naive model of the early universe. We chose to focus on rings of 3 and 5 massive scalars in 1+1 dimensions for our study to test the effectiveness of our approach.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Description of reaction and vibrational energetics of CO 2 –NH 3 interaction using quantum computing algorithms

CO 2 capture is critical to solving global warming. Amine-based solvents are extensively used to chemically absorb CO 2 . Thus, it is crucial to study the chemical absorption of CO 2 by amine-based solvents to better understand and optimize CO 2 capture processes. Here, we use quantum computing algorithms to quantify molecular vibrational energies and reaction pathways between CO 2 and a simplified amine-based solvent model—NH 3 . Molecular vibrational properties are important to understanding kinetics of reactions. However, the molecule size correlates with the strength of anharmonicity effect on vibrational properties, which can be challenging to address using classical computing. Quantum computing can help enhance molecular vibrational calculations by including anharmonicity. We implement a variational quantum eigensolver (VQE) algorithm in a quantum simulator to calculate ground state vibrational energies of reactants and products of the CO 2 and NH 3 reaction. The VQE calculations yield ground vibrational energies of CO 2 and NH 3 with similar accuracy to classical computing. In the presence of hardware noise, Compact Heuristic for Chemistry (CHC) ansatz with shallower circuit depth performs better than Unitary Vibrational Coupled Cluster. The “Zero Noise Extrapolation” error-mitigation approach in combination with CHC ansatz improves the vibrational calculation accuracy. Excited vibrational states are accessed with quantum equation of motion method for CO 2 and NH 3 . Using quantum Hartree–Fock (HF) embedding algorithm to calculate electronic energies, the corresponding reaction profile compares favorably with Coupled Cluster Singles and Doubles while being more accurate than HF. Our research showcases quantum computing applications in the study of CO 2 capture reactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Enabling Scalable VQE Simulation on Leading HPC Systems

Large-scale simulations of quantum circuits pose significant challenges, especially in the context of quantum chemistry, due to the number of qubits, circuit depth, and the number of circuits needed per problem. High-performance computing (HPC) systems offer massive computational capabilities that could help overcome these obstacles. We developed a high-performance quantum circuit simulator, called NWQ-Sim, and demonstrate its capability to simulate large quantum chemistry problems on NERSC's Perlmutter supercomputer. Integrating NWQ-Sim with XACC, we have executed QPE and VQE algorithms for downfolded quantum chemistry systems at unprecedented scales. Our work demonstrates the potential of leveraging HPC resources to advance quantum chemistry and other applications of near-term quantum devices.

Wang, Meng↗

NISQ Benchmarking

Test suite of quantum algorithms for Noisy Intermediate Scale Quantum (NISQ) computers. The test suite includes benchmark-style code for quantum volume circuits (QV), fairness sampling circuits, quantum telecloning circuits, and other NISQ benchmark style algorithms on small problems (i.e., up to 100 qubits), such as Variational Quantum Eigensolver (VQE), Hamiltonian Simulation, and Grover unstructured search example circuits. These benchmark-style applications are implemented in quantum software packages, mostly IBM's QISKIT, but may include vendor-specific frameworks, such as PyQuil (for Rigetti) or Q\# for Microsoft, or CirQ (for Google) as the test suite grows with the vendor sample. The test suite also includes numerical simulation code for Quantum Alternating Operator Ansatz (QAOA) algorithms, VQE, Hamiltonian Simulation and search examples. Numerical simulation code simulates quantum computers on classical computers, which is only possible for small problem instances; the implementation framework of choice is typically within Python, using the numpy/scipy libraries as well as extensions to the Julia language.

Pelofske, Elijah↗

Optimization performance, fidelity, and cost: SIAM VQE

This dataset contains files storing results from classically-simulated quantum subroutines within a dynamical mean-field theory workflow, and jupyter notebooks processing the data in these files to generate plots. The files store: (1) Results from variational quantum eigensolver (VQE) simulations searching for optimal parameters allowing parametrized quantum circuits to prepare approximations to ground states of different Anderson impurity models (AIMs) (2) Results from simulations of a quantum Lanczos algorithm (QLA) estimating the Lanczos coefficients defining the continued-fraction representation of an (AIM) Green’s function Description: Any file named vqe_gs_results* stores approximations to the ground state and energy of a given AIM estimated using three different methods: (1) Numerical diagonalization (2) Ideal VQE simulation (3) VQE simulation with sampling noise For each VQE simulations metadata about the optimization (optimization results plus number of quantum circuits that would have been executed on real hardware) is also stored. Any file named qla_dos_results* estimations for the Lanczos coefficients defining the Green’s function of an AIM. The stored estimations are achieved using different methods: (1) Numerical Lanczos algorithm from initial states obtained from numerical diagonalization (2) Simulated quantum Lanczos algorithm from initial states prepared from parametrized quantum circuits yielded by corresponding ideal and noisy VQE subroutines. The dataset is used and described in M. Karabin et al., "Quantum solver for single-impurity Anderson models with particle-hole symmetry", Phys. Rev. Research 8, 033066 (2026). DOI: https://doi.org/10.1103/7ys3-tl4l

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Validating quantum-classical programming models with tensor network simulations

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force statevector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

97 MATHEMATICS AND COMPUTING↗

Approaching scalable VQE of interacting bosons with NISQ devices [Slides]

Scaling up variational quantum eigensolver (VQE) algorithms to practical applications utilizing quantum advantage with noisy intermediate-scale quantum (NISQ) devices is challenging. The expansive cost-function evaluation and demanding optimization quickly exhaust the precious quantum resource available on NISQ devices. In this work, we discuss the appropriate VQE strategy suitable for multi-site interacting boson systems, for example, the Holstein model and the Rabi lattice model. We investigate the cost-function setup and the optimization tactics to utilize the limited quantum resource efficiently. Our strategy illustrates that the scalable VQE algorithms of interacting bosons have a promising future.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum Computing for Energy-Related Applications

Growing interest in quantum computing and simulations have created opportunities for its deployment to improve processes pertaining to energy production, distribution, and consumption. While quantum computing is considered as a paradigm shift in our basic understanding of physical computation, effective implementation of quantum computing in energy applications also depends on progress and development in the dimensions of both quantum computing hardware and quantum computing algorithms. To fully address the status and future challenges of quantum information science (QIS) applied within the energy sector, in this presentation, we firstly summarize recent advancements on the applications of quantum computing to energy infrastructure and materials, complex energy system processes, advanced manufacturing, and energy system security. Then, we will demonstrate the results of quantum computing both on a simulator and a quantum device accessing from OLCF. Our first example is to use the variational quantum eigensolver (VQE) with a unitary coupled cluster with singles and doubles (UCCSD) ansatz to simulate a series of LixHyq molecules (q=-1, 0, +1). The obtained results showed that the quantum computing VQE-UCCSD is comparable to classical CCSD for small systems like LiH with respect to full configuration interaction (FCI). Targeting on CO2 capture application, our second example is to use VQE to quantify molecular vibrational energies and reaction pathways between CO2 and a simplified amine-based solvent model—NH3 to form H2NCOOH. This research showcases quantum computing applications in the study of CO2 capture reactions.

Duan, Yuhua↗

Assessing Ground State Energy of Molecules and Energy Profile of the NH3 Capturing CO2 System Using the Quantum Computing Algorithms

Molecule size correlates with the number of electrons on electronic energies and strength of anharmonicity on vibrational properties, however, it is challenging to address using classical computing. In this study, variational quantum eigensolver (VQE) algorithm was implemented on a quantum simulator to quantify electronic and vibrational energies and reaction pathways of CO2 + NH3 = NH2COOH. The VQE-based Hartree-Fock-Embedding algorithm was adopted to benchmark electronic energies for a series of molecules (doi.org/10.1063/5.0188249) and quantify the reaction energy profile of the CO2 capture reaction (doi.org/10.1116/5.0137750). The generated reaction profile is in good agreement with the classical high-level Coupled-Cluster-Singles-and-Doubles (CCSD) results. The quantum computing algorithm also helps enhance the calculation of vibrational ground-state energies by considering the many-body coupling using the Vibrational Self-Consistent Field method, providing results for CO2 and NH3 molecules with accuracy comparable to the direct diagonalization method. Our approach indicates quantum computing can be applied to solve practical problems.

Lee, Yueh-Lin↗

Towards a Description of the Ground State Properties of LiHm Complexes and Reaction Energetics of Hydrogenation of Small Li Clusters using VQE-based Quantum Chemical Calculations

<span style="font-family: Roboto; font-size: 11pt;">This presentation describes the utilization of the variational quantum eigensolver (VQE) using a unitary coupled cluster with singles and doubles (UCCSD) ansatz to simulate a series of LiH</span><sub style="font-family: Roboto; font-size: 11pt;">n</sub><span style="font-family: Roboto; font-size: 11pt;"> molecules (n=1-3), including their singly charged ions. The performance is considered using a simulator by systematically increasing system size, providing data to compare against future VQE calculations. The predicted energy profiles are in semi-quantitative agreement with highly accurate CCSD/FCI methods.</span>

quantum computing↗

Unitary Selective Coupled-Cluster Method

Simulating molecules using the Variational Quantum Eigensolver method is one of the promising applications for NISQ-era quantum computers. Designing an efficient ansatz to represent the electronic wave function is crucial in such simulations. Standard unitary coupled-cluster with singles and doubles (UCCSD) ansatz tends to have a large number of insignificant terms that do not lower the energy of the system. In this work, we present a unitary selective coupled-cluster method, a way to construct a unitary coupled-cluster ansatz iteratively using a selection procedure with excitations up to fourth order. This approach uses the electronic Hamiltonian matrix elements and the amplitudes for excitations already present in the ansatz to find the important excitations of higher order and to add them to the ansatz. The important feature of the method is that it systematically reduces the energy error with increasing ansatz size for a set of test molecules. {The main advantage of the proposed method is that the effort to increase the ansatz does not require any additional measurements on a quantum computer.}

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust measurement of wave function topology on NISQ quantum computers

Topological quantum phases of quantum materials are defined through their topological invariants. These topological invariants are quantities that characterize the global geometrical properties of the quantum wave functions and thus are immune to local noise. Here, we present a strategy to measure topological invariants on quantum computers. We show that our strategy can be easily integrated with the variational quantum eigensolver (VQE) so that the topological properties of generic quantum many-body states can be characterized on current quantum hardware. We demonstrate the robust nature of the method by measuring topological invariants for both non-interacting and interacting models, and map out interacting quantum phase diagrams on quantum simulators and IBM quantum hardware.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗