Search NASA⌕ Search

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.

At least 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Destructive Error Interference in Product-Formula Lattice Simulation

Quantum computers can efficiently simulate the dynamics of quantum systems. Here, we study the cost of digitally simulating the dynamics of several physically relevant systems using the first-order product-formula algorithm. We show that the errors from different Trotterization steps in the algorithm can interfere destructively, yielding a much smaller error than previously estimated. In particular, we prove that the total error in simulating a nearest-neighbor interacting system of n sites for time t using the first-order product formula with r time slices is O ( n t / r + n t 3 / r 2 ) when n t 2 / r is less than a small constant. Given an error tolerance ϵ , the error bound yields an estimate of max { O ( n 2 t / ϵ ) , O ( n 2 t 3 / 2 / ϵ 1 / 2 ) } for the total gate count of the simulation. The estimate is tighter than previous bounds and matches the empirical performance observed in Childs et al. [ Proc. Natl. Acad. Sci. U.S.A. 115 , 9456 (2018) ]. We also provide numerical evidence for potential improvements and conjecture an even tighter estimate for the gate count.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Variational Simulation of the Lipkin-Meshkov-Glick Model on a Neutral Atom Quantum Computer

We simulate the Lipkin-Meshkov-Glick model using the variational-quantum-eigensolver algorithm on a neutral atom quantum computer. We test the ground-state energy of spin systems with up to 15 spins. Two different encoding schemes are used: an individual spin encoding where each spin is represented by one qubit, and an efficient Gray code encoding scheme that only requires a number of qubits that scales with the logarithm of the number of spins. This more efficient encoding, together with zero-noise extrapolation techniques, is shown to improve the fidelity of the simulated energies with respect to exact solutions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Evaluation of phase shifts for nonrelativistic elastic scattering using quantum computers

Simulations of scattering processes are essential in understanding the physics of our universe. Computing relevant scattering quantities from ab initio methods is extremely difficult on classical devices because of the substantial computational resources needed. Here, this work reports the development of an algorithm that makes it possible to obtain phase shifts for generic nonrelativistic elastic scattering processes on a quantum computer. This algorithm is based on extracting phase shifts from the direct implementation of the real-time evolution. The algorithm is improved by a variational procedure making it more accurate and resistant to the quantum noise. The reliability of the algorithm is first demonstrated by means of classical numerical simulations for different potentials and later tested on existing quantum hardware, specifically on IBM quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Cold ion beam in a storage ring as a platform for large-scale quantum computers and simulators: Challenges and directions for research and development

The purpose of this paper is to evaluate the possibility of constructing a large-scale storage-ring-type ion-trap system capable of storing, cooling, and controlling a large number of ions as a platform for scalable quantum computing (QC) and quantum simulations. In such a trap, the ions form a crystalline beam moving along a circular path with a constant velocity determined by the frequency and intensity of the cooling lasers. In this paper, we consider a large leap forward in terms of the number of ions that serve as qubits in QC, from fewer than 100 available in state of the art linear ion-trap devices today to an order of 10 5 crystallized ions in the storage-ring setup. This new trap design unifies two different concepts: the storage rings of charged particles and the linear ion traps used for QC and mass spectrometry. In this paper, we use the language of particle accelerators to discuss the ion state and dynamics. We outline the differences between the above concepts, analyze challenges of the large ring with a revolving chain of ions, and propose goals for the research and development required to enable future quantum computers with 1000 times more qubits than available today. The challenge of creating such a large-scale quantum system while maintaining the necessary coherence of the qubits and the high fidelity of quantum logic operations is significant. Performing analog quantum simulations may be an achievable initial goal for such a device. Quantum calculations and simulations of complex quantum systems will move forward both the fundamental science and the applied research. Nuclear and particle physics, many-body quantum systems, lattice gauge theories, and nuclear structure calculations are just a few examples in which a large-scale quantum simulation system will become a very powerful tool to move forward our understanding of nature.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Quantum Computing and Simulations for Energy-Related Applications

Quantum Information Science (QIS) is an emerging field that has the potential to cause revolutionary advances in many areas of science and engineering, and nations around the world are vying for dominance in the field. To support DOE urgent task to make sure the U.S. wins the quantum race, in Spring of 2019 NETL started to establish and maintain QIS competency by focusing on energy-related applications. After more than five years’ hard-working, NETL QUEST (quantum for energy systems & technologies) team has made great progress on quantum sensing and quantum computing for energy applications. Significant outcomes have been achieved. To report our research progress and to propose new research directions, in this presentation at the American Physical Society (APS) annual meeting, I'm highlighting the progress of QUEST team on quantum computing for energy-related applications.

quantum 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

Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices

The accurate computation of ground and excited states of many-fermion quantum systems is one of the most consequential, contemporary challenges in the physical and computational sciences whose solution stands to benefit significantly from the advent of quantum computing devices. Existing methodologies using phase estimation or variational algorithms have potential drawbacks such as deep circuits requiring substantial error correction or non-trivial high-dimensional classical optimization. In this work, we introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies and reduced density matrices of ground and excited states. The solver does not require deep circuits or difficult classical optimization and achieves an exponential speed-up over its classical counterpart. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Unfolding quantum computer readout noise

Abstract In the current era of noisy intermediate-scale quantum computers, noisy qubits can result in biased results for early quantum algorithm applications. This is a significant challenge for interpreting results from quantum computer simulations for quantum chemistry, nuclear physics, high energy physics (HEP), and other emerging scientific applications. An important class of qubit errors are readout errors. The most basic method to correct readout errors is matrix inversion, using a response matrix built from simple operations to probe the rate of transitions from known initial quantum states to readout outcomes. One challenge with inverting matrices with large off-diagonal components is that the results are sensitive to statistical fluctuations. This challenge is familiar to HEP, where prior-independent regularized matrix inversion techniques (“unfolding”) have been developed for years to correct for acceptance and detector effects, when performing differential cross section measurements. We study one such method, known as iterative Bayesian unfolding, as a potential tool for correcting readout errors from universal gate-based quantum computers. This method is shown to avoid pathologies from commonly used matrix inversion and least squares methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Unification of finite symmetries in the simulation of many-body systems on quantum computers

Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can result in significant overhead due to the exponentially growing size of some symmetry groups as the number of particles increases. Quantum computers hold the promise of achieving exponential speedup in simulating quantum many-body systems; however, a general method for utilizing symmetries in quantum simulations has not yet been established. In this work, we present a unified framework for incorporating symmetry group transforms on quantum computers to simulate many-body systems. The core of our approach lies in the development of efficient quantum circuits for symmetry-adapted projection onto irreducible representations of a group or pairs of commuting groups. We provide resource estimations for common groups, including the cyclic and permutation groups. Our algorithms demonstrate the capability to prepare coherent superpositions of symmetry-adapted states and to perform quantum evolution across a wide range of models in condensed-matter physics and ab initio electronic structure in quantum chemistry. Specifically, we execute a symmetry-adapted quantum subroutine for small molecules in first-quantization on noisy hardware and demonstrate the emulation of symmetry-adapted quantum phase estimation for preparing coherent superpositions of quantum states in various irreducible representations of a symmetry group. In addition, we present a discussion of open problems regarding treating symmetries in digital quantum simulations of many-body systems, paving the way for future systematic investigations into leveraging symmetries quantumly for practical quantum advantage. The broad applicability and rigorous resource estimation for symmetry transformations make our framework appealing for achieving provable quantum advantage on fault-tolerant quantum computers, especially for symmetry-related properties.

quantum algorithms↗
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

Matrix-Model Simulations Using Quantum Computing, Deep Learning, and Lattice Monte Carlo

Matrix quantum mechanics plays various important roles in theoretical physics, such as a holographic description of quantum black holes, and it underpins the only practical numerical approach to the study of complex high-dimensional supergravity theories. Understanding quantum black holes and the role of entanglement in a holographic setup is of paramount importance for the realization of a quantum theory of gravity. Moreover, a complete numerical understanding of the holographic duality and the emergence of geometric space-time features from microscopic degrees of freedom could pave the way for new discoveries in quantum information science. Euclidean lattice Monte Carlo simulations are the de facto numerical tool for understanding the spectrum of large matrix models and have been used to test the holographic duality. However, they are not tailored to extract dynamical properties or even the quantum wave function of the ground state of matrix models. Quantum computing and deep learning provide potentially useful approaches to study the dynamics of matrix quantum mechanics. If successful in the context of matrix models, these rapidly improving numerical techniques could become the new Swiss army knife of quantum gravity practitioners. In this paper, we perform the first systematic survey for quantum computing and deep-learning approaches to matrix quantum mechanics, comparing them to lattice Monte Carlo simulations. These provide baseline benchmarks before addressing more complicated problems. In particular, we test the performance of each method by calculating the low-energy spectrum.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Lithographic quantum dots for quantum computation and quantum simulation

Lithographic quantum dots (QDs) are highly controllable few-level quantum systems created in semiconductor nanoelectronic devices, with a variety of scientific applications. These include technologically-driven applications like quantum computing and more fundamental applications in which they serve as a platform for exploring basic many-body physics. This document is a brief summary of my Ph.D. research so far and the directions with which I intend to continue it. Highlights include theoretical efforts to understand and design qubits in germanium hole QDs, as well as explorations of the possibility of using QDs coupled to nearby baths for analog simulation of quantum impurity models.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Probing the Kitaev honeycomb model on a neutral-atom quantum computer

Quantum simulations of many-body systems are among the most promising applications of quantum computers. In particular, models based on strongly correlated fermions are central to our understanding of quantum chemistry and materials problems, and can lead to exotic, topological phases of matter. However, owing to the non-local nature of fermions, such models are challenging to simulate with qubit devices. Here we realize a digital quantum simulation architecture for two-dimensional fermionic systems based on reconfigurable atom arrays. We utilize a fermion-to-qubit mapping based on Kitaev’s model on a honeycomb lattice, in which fermionic statistics are encoded using long-range entangled states. We prepare these states efficiently using measurement and feedforward, realize subsequent fermionic evolution through Floquet engineering with tunable entangling gates interspersed with atom rearrangement, and improve results with built-in error detection. Leveraging this fermion description of the Kitaev spin model, we efficiently prepare topological states across its complex phase diagram and verify the non-Abelian spin-liquid phase by evaluating an odd Chern number. We further explore this two-dimensional fermion system by realizing tunable dynamics and directly probing fermion exchange statistics. Finally, we simulate strong interactions and study the dynamics of the Fermi–Hubbard model on a square lattice. These results pave the way for digital quantum simulations of complex fermionic systems for materials science, chemistry and high-energy physics.

atomic and molecular physics↗
DOE OSTI2022

An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation

Quantum computing is a promising technology that harnesses the peculiarities of quantum mechanics to deliver computational speedups for some problems that are intractable to solve on a classical computer. Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in terms of chip size and error rates. Shallow quantum circuits with uncomplicated topologies are essential for successful applications in the NISQ era. In this work, based on matrix analysis, we derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The depth of the compressed circuits is independent of simulation time and grows linearly with the number of spins. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond O(10 3 ) spins. The resulting quantum circuits have a simple nearest-neighbor topology, which makes them ideally suited for NISQ devices.

Hamiltonian simulation↗