A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
Not Available
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
SEARCH · Search NASA
Results for “quantum computing for simulation”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Materials and devices for fundamental quantum science and quantum technologies
Technologies operating on the basis of quantum mechanical laws and resources such as phase coherence and entanglement are expected to revolutionize our future. Quantum technologies are often divided into four main pillars: computing, simulation, communication, and sensing & metrology. Moreover, a great deal of interest is currently also nucleating around energy-related quantum technologies. In this Perspective, we focus on advanced superconducting materials, van der Waals materials, and moiré quantum matter, summarizing recent exciting developments and highlighting a wealth of potential applications, ranging from high-energy experimental and theoretical physics to quantum materials science and energy storage.
Polini, Marco↗
Mitigating the Sign Problem through Basis Rotations
Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. Herein, we show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β ≳ 100, this accelerates such simulation by many orders of magnitude.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Improved Fermion Hamiltonians for Quantum Simulations
Constructing improved hamiltonians for gauge theories coupled to fermonic matter will be important for improving continuum limit extrapolations of quantum computations. In this talk we will present a formulation for simulating ASQTAD fermions for lattice computation and provide fault tolerant resource costs in terms of primitive group operations. We additionally show that the scaling of energies with respect to the lattice spacing are better than for the unimproved Hamiltonian for toy models.
Erik Joseph Gustafson↗
Improved Fermion Hamiltonians for Quantum Simulations
Constructing improved hamiltonians for gauge theories coupled to fermonic matter will be important for improving continuum limit extrapolations of quantum computations. In this talk we will present a formulation for simulating ASQTAD fermions for lattice computation and provide fault tolerant resource costs in terms of primitive group operations. We additionally show that the scaling of energies with respect to the lattice spacing are better than for the unimproved Hamiltonian for toy models.
Erik Gustafson↗
Efficient formulation of multitime generalized quantum master equations: Taming the cost of simulating 2D spectra
Modern 4-wave mixing spectroscopies are expensive to obtain experimentally and computationally. In certain cases, the unfavorable scaling of quantum dynamics problems can be improved using a generalized quantum master equation (GQME) approach. However, the inclusion of multiple (light–matter) interactions complicates the equation of motion and leads to seemingly unavoidable cubic scaling in time. In this paper, we present a formulation that greatly simplifies and reduces the computational cost of previous work that extended the GQME framework to treat arbitrary numbers of quantum measurements. Specifically, we remove the time derivatives of quantum correlation functions from the modified Mori–Nakajima–Zwanzig framework by switching to a discrete-convolution implementation inspired by the transfer tensor approach. We then demonstrate the method’s capabilities by simulating 2D electronic spectra for the excitation-energy-transfer dimer model. In our method, the resolution of data can be arbitrarily coarsened, especially along the t2 axis, which mirrors how the data are obtained experimentally. Even in a modest case, this demands O(103) fewer data points. We are further able to decompose the spectra into one-, two-, and three-time correlations, showing how and when the system enters a Markovian regime where further measurements are unnecessary to predict future spectra and the scaling becomes quadratic. This offers the ability to generate long-time spectra using only short-time data, enabling access to timescales previously beyond the reach of standard methodologies.
Chemistry↗
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↗
Atomically Precise Manufacturing for 2D-Designed Materials
The primary purpose of this program was to develop atomically precise fabrication techniques for semiconductor systems that places dopant atoms in a single buried (100) atomic plane in silicon with near atomic precision to create unprecedented structures that can be used for a wide variety of quantum experiments, devices, and potentially designer quantum materials. The potential impacts on reducing industrial energy use are many: 1) optimized and more energy efficient industrial processes via more efficient computational approaches, 2) dramatically improved materials for industrial use including higher critical-temperature superconductors eliminating losses in electrical transmission, 3) the better understanding of quantum chemistry via Analog Quantum Simulation(AQS) in the near term and universal quantum computing in the longer term that will lead to new industrial processes with smaller or zero production of greenhouse gases.
36 MATERIALS SCIENCE↗
Spinbox: tools for many-body quantum systems in a Monte Carlo context
Spinbox is a piece of software that facilitates quantum mechanical calculations relevant to Monte Carlo simulation of atomic nuclei. At the front lines of research on the nuclear many-body problem are a large number of supercomputer-scale simulation codes. These codes produce valuable results but can be hard to understand, especially for those without intimate knowledge of the relevant theoretical methods. Thus, tools that fill pedagogical roles are extremely valuable. Spinbox makes it easy for one to replicate and analyze the computational processes relevant to a Quantum Monte Carlo (QMC) simulation that may be difficult to understand/debug/analyze due to the scale of the corresponding simulation software. Spinbox is written in Python using other state-of-the-art Python modules for numerical calculations. While a number of Python libraries exist that are suited to general quantum many-body calculations, the motivation of Spinbox is quite particular. In Diffusion Monte Carlo methods (DMC, GFMC, AFDMC), the central calculation is the imaginary-time propagation of individual samples of the many-body wavefunction. Although quantum wavefunctions generally must be described by a probability distribution over a basis, DMC imbues particles (within one sample) with classical spatial coordinates. This method is unusual, so other Python packages are typically not set up to do this easily. Furthermore, the software has built-in options for nuclear systems assuming isospin symmetry, which can be set up with other libraries but is a nontrivial process to do so. Features: - numerical representation of samples of the many-body wavefunctions, including tensor-product states (used in AFDMC) - numerical representation of many-body operators, including tensor-product operators: general, spin, imaginary-time propagation, etc. - the correct associated arithmetic and algebra, implemented as class methods - classes for representing realistic nuclear two- and three-body Hamiltonians (e.g. Argonne V18, Illinois NNN) - large-scale parallel integration over random variables, crucial for the AFDMC method My goal is to make this package open source so that anyone may use it and contribute to it, particularly other researchers doing AFDMC calculations
Fox, Jordan↗
Quantum Optimization: Potential, Challenges, and the Path Forward
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of the most pronounced domains. Across computer science and physics, there are a number of algorithmic approaches, often with little linkage. This is further complicated by the fragmented nature of the field of mathematical optimization, where major classes of optimization problems, such as combinatorial optimization, convex optimization, non-convex optimization, and stochastic extensions, have devoted communities. With these aspects in mind, this work draws on multiple approaches to study quantum optimization. Provably exact versus heuristic settings are first explained using computational complexity theory — highlighting where quantum advantage is possible in each context. Then, the core building blocks for quantum optimization algorithms are outlined to subsequently define prominent problem classes and identify key open questions that, if answered, will advance the field. The effects of scaling relevant problems on noisy quantum devices are also outlined in detail, alongside meaningful benchmarking problems. We underscore the importance of benchmarking by proposing clear metrics to conduct appropriate comparisons with classical optimization techniques. Lastly, we highlight two domains – finance and sustainability – as rich sources of optimization problems that could be used to benchmark, and eventually validate, the potential real-world impact of quantum optimization.
97 MATHEMATICS AND COMPUTING↗
Quantum utility-scale error mitigation for quantum quench dynamics in Heisenberg spin chains
Here, we implement a quantum error mitigation method termed self-mitigation, which is comparable to zero-noise extrapolation, at large scales to achieve quantum utility on near-term, noisy quantum computers. We investigate the effectiveness of several quantum error mitigation strategies, including self-mitigation, by simulating quantum quench dynamics for Heisenberg spin chains with system sizes up to 104 qubits using IBM quantum processors. In particular, we discuss the limitations of zero-noise extrapolation and the advantages offered by self-mitigation at large scales. The self-mitigation method demonstrates stable accuracy with large systems of 104 qubits comprising more than 3,000 CNOT gates. Also, we combine the discussed quantum error mitigation methods with practical entanglement entropy measuring methods, and it shows a good agreement with the theoretical estimation. Our study illustrates the usefulness of near-term noisy quantum hardware in examining the quantum quench dynamics of many-body systems at large scales and lays the groundwork for surpassing classical simulations with quantum methods prior to the development of fault-tolerant quantum computers.
97 MATHEMATICS AND COMPUTING↗
Quantum simulations employing connected moments expansions
Further advancement of quantum computing (QC) is contingent on enabling many-body models that avoid deep circuits and excessive use of CNOT gates. To this end, we develop a QC approach employing finite-order connected moment expansions (CMX) and affordable procedures for initial state preparation. We demonstrate the performance of our approach employing several quantum variants of CMX through the classical emulations on the H2 molecule potential energy surface and the Anderson model with a broad range of correlation strength. The results show that our approach is robust and flexible. Good agreements with exact solutions can be maintained even at the dissociation and strong correlation limits.
quantum computing, quantum chemistry, Electron cor↗
Lowering tomography costs in quantum simulation with a symmetry projected operator basis
Measurement in quantum simulations provides a means for extracting meaningful information from a complex quantum state, and for quantum computing, reducing the complexity of measurement will be vital for near-term applications. For most quantum simulations, the targeted state will obey several symmetries inherent to the system Hamiltonian. Here, we obtain an alternative symmetry projected basis of measurement that reduces the number of measurements needed by a constant factor. Our scheme can be implemented at no additional cost on a quantum computer, can be implemented under various measurement or tomography schemes, and is reasonably resilient under noise.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Predicting Melt Properties Using Atomistic Simulations With A Highly Accurate Physically Informed Neural Network Interatomic Potential
The use of a recently developed machine learning (ML) interatomic potential for molecular dynamics simulations of aluminum melt properties will be presented. Such properties are critical for process modeling in additive manufacturing, including the melt pool size, solidification, and formation of solidification microstructures. Direct first-principles modeling of these processes is computationally prohibitive whereas simulations employing ML potentials combine the high accuracy of quantum-mechanical methods with high computational speeds. The physically-informed neural network (PINN) method used herein, integrates a high-dimensional regression implemented by an artificial neural network with a physics-based bond-order interatomic potential. PINN potentials can accurately reproduce many properties of aluminum in both crystalline-solid and liquid phases. We examine the accuracy of a PINN Al potential in predicting the density, self-diffusivity, viscosity, and the tension of the liquid surface and liquid-solid interfaces. Comparison with experimental data and ab initio molecular dynamics calculations shows very good agreement for all properties tested.
molecular dynamics↗
Quantum approximate multi-objective optimization
The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Stout Smearing on a Quantum Computer
Smearing of gauge-field configurations in lattice field theory improves the results of lattice simulations by suppressing high energy modes from correlation functions. In quantum simulations, high kinetic energy eigenstates are introduced when the time evolution operator is approximated such as Trotterization. While improved Trotter product formulae exist to reduce the errors, they have diminishing accuracy returns with respect to resource costs. Therefore having an algorithm that has fewer resources than an improved Trotter formula is desirable. In this work I develop a representation agnostic method for quantum smearing and show that it reduces the coupling to high energy modes in the discrete nonabelian gauge theory $D_4$
Gustafson, Erik J.↗
Determining quantum phase diagrams of topological Kitaev-inspired models on NISQ quantum hardware
Topological protection is employed in fault-tolerant error correction and in developing quantum algorithms with topological qubits. But, topological protection intrinsic to models being simulated , also robustly protects calculations, even on NISQ hardware. We leverage it by simulating Kitaev-inspired models on IBM quantum computers and accurately determining their phase diagrams. This requires constructing conventional quantum circuits for Majorana braiding to prepare the ground states of Kitaev-inspired models. The entanglement entropy is then measured to calculate the quantum phase boundaries. We show how maintaining particle-hole symmetry when sampling through the Brillouin zone is critical to obtaining high accuracy. This work illustrates how topological protection intrinsic to a quantum model can be employed to perform robust calculations on NISQ hardware, when one measures the appropriate protected quantum properties. It opens the door for further simulation of topological quantum models on quantum hardware available today.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Continuous-variable quantum computation of the O(3) model in 1+1 dimensions
We formulate the $O(3)$ non-linear sigma model in $1+1$ dimensions as a limit of a three-component scalar field theory restricted to the unit sphere in the large squeezing limit. This allows us to describe the model in terms of the continuous variable (CV) approach to quantum computing. Here we construct the ground state and excited states using the coupled cluster ansatz and find excellent agreement with the exact diagonalization results for a small number of lattice sites. We then present the simulation protocol for the time evolution of the model using CV gates, estimate the discretization error, and present numerical results obtained from a photonic quantum simulator. We expect that the methods developed in this work will be useful for exploring interesting dynamics for a wide class of sigma models and gauge theories, as well as for simulating scattering events on quantum hardware in the coming decade.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗