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 397 records · Page 22
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Accuracy Guarantees and Quantum Advantage in Analog Open Quantum Simulation with and without Noise

Many-body open quantum systems, described by Lindbladian master equations, are a rich class of physical models that display complex equilibrium and out-of-equilibrium phenomena which remain to be understood. In this paper, we theoretically analyze noisy analog quantum simulation of geometrically local open quantum systems and provide evidence that this problem both is hard to simulate on classical computers and could be approximately solved on near-term quantum devices. First, given a noiseless quantum simulator, we show that the dynamics of local observables and the fixed-point expectation values of rapidly mixing local observables in geometrically local Lindbladians can be obtained to a precision of ϵ in time that is poly ( ϵ − 1 ) and uniform in system size. Furthermore, we establish that the quantum simulator would provide a superpolynomial advantage, in run-time scaling with respect to the target precision and either the evolution time (when simulating dynamics) or the Lindbladian’s decay rate (when simulating fixed points), over any classical algorithm for these problems, assuming BQP ≠ BPP . We then consider the presence of noise in the quantum simulator in the form of additional geometrically local Lindbladian terms. We show that the simulation tasks considered in this paper are stable to errors; i.e., they can be solved to a noise-limited, but system-size independent, precision. Finally, we establish that, assuming BQP ≠ BPP , there are stable geometrically local Lindbladian simulation problems such that, as the noise rate on the simulator is reduced, classical algorithms must take time superpolynomially longer in the inverse noise rate to attain the same precision as the analog quantum simulator. Published by the American Physical Society 2025

Kashyap, Vikram (ORCID:0000000208195207)↗
DOE OSTI2020

Quantum Information for Particle Theorists

Lectures given at the Theoretical Advanced Study Institute (TASI 2020), 1-26 June 2020. The topics covered include quantum circuits, entanglement, quantum teleportation, Bell inequalities, quantum entropy and decoherence, classical versus quantum measurement, the area law for entanglement entropy in quantum field theory, and simulating quantum field theory on a quantum computer. Along the way we confront the fundamental sloppiness of how we all learned (and some of us taught) quantum mechanics in college. Links to a Python notebook and Mathematica notebooks will allow the reader to reproduce and extend the calculations, as well as perform five experiments on a quantum simulator.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Quantum Gauge Networks: A New Kind of Tensor Network

Although tensor networks are powerful tools for simulating low-dimensional quantum physics, tensor network algorithms are very computationally costly in higher spatial dimensions. We introduce quantum gauge networks: a different kind of tensor network ansatz for which the computation cost of simulations does not explicitly increase for larger spatial dimensions. We take inspiration from the gauge picture of quantum dynamics, which consists of a local wavefunction for each patch of space, with neighboring patches related by unitary connections. A quantum gauge network (QGN) has a similar structure, except the Hilbert space dimensions of the local wavefunctions and connections are truncated. We describe how a QGN can be obtained from a generic wavefunction or matrix product state (MPS). All 2k-point correlation functions of any wavefunction for M many operators can be encoded exactly by a QGN with bond dimension O(M k ). In comparison, for just k = 1, an exponentially larger bond dimension of 2 M/6 is generically required for an MPS of qubits. We provide a simple QGN algorithm for approximate simulations of quantum dynamics in any spatial dimension. The approximate dynamics can achieve exact energy conservation for time-independent Hamiltonians, and spatial symmetries can also be maintained exactly. We benchmark the algorithm by simulating the quantum quench of fermionic Hamiltonians in up to three spatial dimensions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Emergent quantum mechanics at the boundary of a local classical lattice model

We formulate a model in which quantum mechanics emerges from classical mechanics. Given a local Hamiltonian H acting on n qubits, we define a local classical model with an additional spatial dimension whose boundary dynamics is approximately—but to arbitrary precision—described by Schrödinger's equation and H. The bulk consists of a lattice of classical bits that propagate towards the boundary through a circuit of stochastic matrices. The bits reaching the boundary are governed by a probability distribution whose deviation from the uniform distribution can be interpreted as the quantum-mechanical wave function. Bell nonlocality is achieved because information can move through the bulk much faster than the boundary speed of light. Finally, we analytically estimate how much the model deviates from quantum mechanics, and we validate these estimates using computer simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Efficient fully-coherent quantum signal processing algorithms for real-time dynamics simulation

Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the simulation of electronic dynamics, which plays an essential role in chemical reactions, non-equilibrium dynamics, and material design. These systems are time-dependent, which requires that the corresponding simulation algorithm can be successfully concatenated with itself over different time intervals to reproduce the overall coherent quantum dynamics of the system. In this paper, we quantify such simulation algorithms by the property of being fully-coherent: the algorithm succeeds with arbitrarily high success probability 1 − δ while only requiring a single copy of the initial state. Here we subsequently develop fully-coherent simulation algorithms based on quantum signal processing (QSP), including a novel algorithm that circumvents the use of amplitude amplification while also achieving a query complexity additive in time t, ln(1/δ), and ln(1/ϵ) for error tolerance ϵ: $Θ‖\mathscr{H}‖|t|+ln(1/ϵ)+ln(1/δ)$. Furthermore, we numerically analyze these algorithms by applying them to the simulation of the spin dynamics of the Heisenberg model and the correlated electronic dynamics of an H2 molecule. Since any electronic Hamiltonian can be mapped to a spin Hamiltonian, our algorithm can efficiently simulate time-dependent ab initio electronic dynamics in the circuit model of quantum computation. Accordingly, it is also our hope that the present work serves as a bridge between QSP-based quantum algorithms and chemical dynamics, stimulating a cross-fertilization between these exciting fields.

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

Variational Adiabatic Gauge Transformation on Real Quantum Hardware for Effective Low-Energy Hamiltonians and Accurate Diagonalization

Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their applicability to weak interactions. Here we introduce the Variational Adiabatic Gauge Transformation (VAGT), a nonperturbative hybrid quantum algorithm that can use nowadays quantum computers to learn the variational parameters of the unitary circuit that brings the Hamiltonian to either its block-diagonal or full-diagonal form. If a Hamiltonian can be diagonalized via a shallow quantum circuit, then VAGT can learn the optimal parameters using a polynomial number of runs. The accuracy of VAGT is tested through numerical simulations, as well as simulations on Rigetti and IonQ quantum computers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Spectral analysis of product formulas for quantum simulation

We consider the time-independent Hamiltonian simulation using the first order Lie–Trotter–Suzuki product formula under the assumption that the initial state is supported on a low-dimension subspace. By comparing the spectral decomposition of the original Hamiltonian and the effective Hamiltonian, we obtain better upper bounds for various conditions. Especially, we show that the Trotter step size needed to estimate an energy eigenvalue within precision ϵ using quantum phase estimation can be improved in scaling from ϵ to ϵ 1/2 for a large class of systems. Our results also depend on the gap condition of the simulated Hamiltonian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Efficient Berry phase calculation via adaptive variational quantum computing approach

We present an adaptive variational quantum algorithm to estimate the Berry phase accumulated by a nondegenerate ground state under cyclic, adiabatic evolution of a time-dependent Hamiltonian. Our method leverages cyclic adiabatic evolution of the Hamiltonian and employs adaptive variational quantum algorithms for state preparation and evolution, optimizing circuit efficiency while maintaining high accuracy. We benchmark our approach on dimerized Fermi–Hubbard chains with four sites, demonstrating precise Berry phase simulations in both noninteracting and interacting regimes. Our results show that circuit depths reach up to 106 layers for noninteracting systems and increase to 279 layers for interacting systems due to added complexity. In addition, we demonstrate the robustness of our scheme across a wide range of parameters governing adiabatic evolution and variational algorithms. These findings highlight the potential of adaptive variational quantum algorithms for advancing quantum simulations of topological materials and computing geometric phases in strongly correlated systems.

Mootz, Martin [Ames Laboratory (AMES), Ames, IA (U↗
DOE OSTI2026

High-fidelity entanglement and coherent multi-qubit mapping in an atom array

Neutral atoms in optical tweezer arrays possess broad applicability for quantum technologies, such as computing, analogue simulation and metrology. The atomic species ytterbium-171 is able to host multiple types of qubits, making it a strong candidate for bridging various applications of tweezer arrays. Realizing this potential requires high-fidelity generation and transfer of many-body entanglement between these distinct qubit degrees of freedom. Here, in this study, we demonstrate the creation and coherent mapping of entangled quantum states across multiple qubits in ytterbium-171 tweezer arrays. We map entangled states onto the optical clock qubit from the nuclear spin qubit or the Rydberg qubit. We coherently transfer Z 2 -ordered Greenberger–Horne–Zeilinger states of up to 20 atoms from the interacting Rydberg manifold to the metastable nuclear spin manifold. Furthermore, we find that clock-qubit-based spin detection, when applied to Rydberg and nuclear spin qubits, facilitates atom-loss-detectable qubit measurements and Rydberg decay detection. This enables delayed-erasure detection, yielding an error-detected two-qubit gate fidelity of 99.78(4)% in metastable qubits. These results establish a versatile architecture that advances multiple fields of quantum information science while also establishing bridges between them.

Senoo, Aruku [University of Colorado, Boulder, CO ↗
DOE OSTI2025

Practical Introduction to Benchmarking and Characterization of Quantum Computers

Rapid progress in quantum technology has transformed quantum computing and quantum information science from theoretical possibilities into tangible engineering challenges. Breakthroughs in quantum algorithms, quantum simulations, and quantum error correction are bringing useful quantum computation closer to fruition. These remarkable achievements have been facilitated by advances in quantum characterization, verification, and validation (QCVV). QCVV methods and protocols enable scientists and engineers to scrutinize, understand, and enhance the performance of quantum information-processing devices. In this tutorial, we review the fundamental principles underpinning QCVV, and introduce a diverse array of QCVV tools used by quantum researchers. We define and explain QCVV’s core models and concepts—quantum states, measurements, and processes—and illustrate how these building blocks are leveraged to examine a target system or operation. We survey and introduce protocols ranging from simple qubit characterization to advanced benchmarking methods. Along the way, we provide illustrated examples and detailed descriptions of the protocols, highlight the advantages and disadvantages of each, and discuss their potential scalability to future large-scale quantum computers. This tutorial serves as a guidebook for researchers unfamiliar with the benchmarking and characterization of quantum computers, and also as a detailed reference for experienced practitioners.

open quantum systems & decoherence↗
DOE OSTI2022

Report of the Snowmass 2021 Topical Group on Lattice Gauge Theory

Lattice gauge theory continues to be a powerful theoretical and computational approach to simulating strongly interacting quantum field theories, whose applications permeate almost all disciplines of modern-day research in High-Energy Physics. Whether it is to enable precision quark- and lepton-flavor physics, to uncover signals of new physics in nucleons and nuclei, to elucidate hadron structure and spectrum, to serve as a numerical laboratory to reach beyond the Standard Model, or to invent and improve state-of-the-art computational paradigms, the lattice-gauge-theory program is in a prime position to impact the course of developments and enhance discovery potential of a vibrant experimental program in High-Energy Physics over the coming decade. This projection is based on abundant successful results that have emerged using lattice gauge theory over the years: on continued improvement in theoretical frameworks and algorithmic suits; on the forthcoming transition into the exascale era of high-performance computing; and on a skillful, dedicated, and organized community of lattice gauge theorists in the U.S. and worldwide. The prospects of this effort in pushing the frontiers of research in High-Energy Physics have recently been studied within the U.S. decadal Particle Physics Planning Exercise (Snowmass 2021), and the conclusions are summarized in this Topical Report.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Robust Measurements of n -Point Correlation Functions of Driven-Dissipative Quantum Systems on a Digital Quantum Computer

We propose and demonstrate a unified hierarchical method to measure n -point correlation functions that can be applied to driven, dissipative, or otherwise open or nonequilibrium quantum systems. In this method, the time evolution of the system is repeatedly interrupted by interacting an ancilla qubit with the system through a controlled operation, and measuring the ancilla immediately afterward. We discuss the robustness of this method as compared to other ancilla-based interferometric techniques (such as the Hadamard test), and highlight its advantages for near-term quantum simulations of open quantum systems. We implement the method on a quantum computer in order to measure single-particle Green’s functions of a driven-dissipative fermionic system. This Letter shows that dynamical correlation functions for driven-dissipative systems can be robustly measured with near-term quantum computers. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Programmable Heisenberg interactions between Floquet qubits

Abstract The trade-off between robustness and tunability is a central challenge in the pursuit of quantum simulation and fault-tolerant quantum computation. In particular, quantum architectures are often designed to achieve high coherence at the expense of tunability. Many current qubit designs have fixed energy levels and consequently limited types of controllable interactions. Here by adiabatically transforming fixed-frequency superconducting circuits into modifiable Floquet qubits, we demonstrate an XXZ Heisenberg interaction with fully adjustable anisotropy. This interaction model can act as the primitive for an expressive set of quantum operations, but is also the basis for quantum simulations of spin systems. To illustrate the robustness and versatility of our Floquet protocol, we tailor the Heisenberg Hamiltonian and implement two-qubit iSWAP, CZ and SWAP gates with good estimated fidelities. In addition, we implement a Heisenberg interaction between higher energy levels and employ it to construct a three-qubit CCZ gate, also with a competitive fidelity. Our protocol applies to multiple fixed-frequency high-coherence platforms, providing a collection of interactions for high-performance quantum information processing. It also establishes the potential of the Floquet framework as a tool for exploring quantum electrodynamics and optimal control.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.

Fang, Bo↗
DOE OSTI2021

Quantum Algorithm for High Energy Physics Simulations

Simulating quantum field theories is a flagship application of quantum computing. However, calculating experimentally relevant high energy scattering amplitudes entirely on a quantum computer is prohibitively difficult. It is well known that such high energy scattering processes can be factored into pieces that can be computed using well established perturbative techniques, and pieces which currently have to be simulated using classical Markov chain algorithms. These classical Markov chain simulation approaches work well to capture many of the salient features, but cannot capture all quantum effects. To exploit quantum resources in the most efficient way, we introduce a new paradigm for quantum algorithms in field theories. This approach uses quantum computers only for those parts of the problem which are not computable using existing techniques. In particular, we develop a polynomial time quantum final state shower that accurately models the effects of intermediate spin states similar to those present in high energy electroweak showers with a global evolution variable. The algorithm is explicitly demonstrated for a simplified quantum field theory on a quantum computer.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Neutrons in Structural Biology: Challenges and Opportunities (Workshop Report)

Gaining a thorough understanding of biological systems requires building our knowledge about biological processes from the level of atoms and electrons, and up to whole organisms. Such comprehensive knowledge will allow for a predictive understanding of complex biological systems behavior. It will guide us in the design and development of novel therapeutics and vaccines to tackle existing health threats and to prepare for future pandemics, and it will provide information necessary to create new biomaterials and bio-inspired technologies through manipulation of biological macromolecules, their assemblies, single cells and even microorganisms. Reaching these goals will require a synergistic combination of multiple experimental techniques with molecular calculations and predictive simulations, and the design and development of new techniques and capabilities that bridge current knowledge and technology gaps. Neutron scattering provides unique information about the biomacromolecular structure and function and can play a major role in achieving these goals. A workshop was held to engage the scientific community in identifying pressing challenges in biochemistry, structural biology, enzymology and structure-guided drug design not solved with the current neutron scattering technologies or utilizing other structural biology techniques such as X-ray crystallography, NMR, and cryo-EM. The workshop brought together structural biology, biochemistry and computational experts, as well as early career researchers and students, creating a forum for discussing scientific advancement and collaboration. The workshop included a one-day satellite training workshop where graduate students and postdoctoral researchers were educated in the application of neutron crystallography and small-angle scattering in structural biology. Furthermore, the Instrument Scientific Advisory Board (ISAB) for the development of a macromolecular neutron diffractometer at ORNL’s Second Target Station was introduced at the workshop. The major outcome was that neutrons can provide atomic-level understanding of biomacromolecular structure, function and dynamics which is of paramount importance for addressing the identified challenges. Neutron crystallography, in particular, can resolve long-standing biochemical issues regarding enzyme function by delineating the underlying chemistry and can have a major impact on the design of small-molecule therapeutics, especially in combination with molecular computation (quantum chemistry and molecular dynamics simulations) and the emerging artificial intelligence (AI)-assisted drug design technologies. The unique properties of neutrons, including their high sensitivity to hydrogen and their non-destructive nature, make them ideal probes of biological matter. There is a palpable need in the scientific community to expand and enhance the impact of neutron sciences on biology. Neutron crystallography is the only structural biology method capable of determining positions of all hydrogen atoms in proteins, nucleic acids and their complexes at near-physiological temperatures and of unstable species at cryogenic temperatures. Moreover, neutron analysis is non-ionizing, non-destructive and does not perturb the structure or redox chemistry of active site metal centers and clusters in proteins, which can be invaluable for studying radiation-sensitive metalloprotein complexes. Further, neutron energies used in scattering applications are similar to atomic motions, permitting neutron spectroscopies to characterize the dynamics of biomacromolecules on the picosecond to microsecond timescales. The different sensitivities of neutrons to protium (H) and deuterium (D) isotopes of hydrogen allow enhanced visibility of specific parts of biological complexes through isotopic labeling. The impact of neutrons will be most powerful when neutron scattering is combined with complementary experimental techniques that use photons and electrons, and with high-performance computing. The interconnection and mutuality of the experimental and theoretical capabilities will drive discoveries in biological and health sciences to generate more complete picture of complex biological systems. The major limitation in the field of biological neutron crystallography has been signal-to-noise, demanding large samples that are difficult to produce for the majority of biomacromolecules and limiting the applicability of this technique in biological sciences. A neutron crystallography instrument at the Second Target Station will revolutionize biological science with neutrons by engaging a large scientific community of structural biologists, enabling successful neutron diffraction experiments from radically smaller biomacromolecular crystals, resolving unanswered biochemical questions, and meaningfully contributing to rational drug design. The meeting highlighted 10 grand challenges that will be addressed with this advanced capability over the next decade and beyond, and the recommendations required to help address them are given below.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2020

Gluon field digitization via group space decimation for quantum computers

Efficient digitization is required for quantum simulations of gauge theories. Schemes based on discrete subgroups use fewer qubits at the cost of systematic errors. We systematize this approach by deriving a single plaquette action for approximating general continuous gauge groups through integrating out field fluctuations. This provides insight into the effectiveness of these approximations, and how they could be improved. We accompany the scheme by simulations of pure gauge over the largest discrete subgroup of SU(3) up to the third order.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2020

Quantum Simulation of Field Theories Without State Preparation

We propose an algorithm for computing real-time observables using a quantum processor while avoiding the need to prepare the full quantum state. This reduction in quantum resources is achieved by classically sampling configurations in imaginary-time using standard lattice field theory. These configurations can then be passed to quantum processor for time-evolution. This method encounters a signal-to-noise problem which we characterize, and we demonstrate the application of standard lattice QCD methods to mitigate it.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗