Quantum simulation of open quantum systems in heavy-ion collisions
Not Available
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
SEARCH · Search NASA
Results for “Quantum 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.
Digital quantum simulation of non-equilibrium quantum many-body systems
Digital quantum simulation uses the capabilities of quantum computers to determine the dynamics of quantum systems, which are beyond the computability of modern classical computers. A notoriously challenging task in this field is the description of non-equilibrium dynamics in quantum many-body systems. In this study, we used the IBM quantum computers to simulate the non-equilibrium dynamics of few spin and fermionic systems. Our results reveal that with a combination of error mitigation, noise extrapolation and optimized initial state preparation, one can tackle the most important drawbacks of modern quantum devices. The systems we simulate demonstrate the potential for large-scale quantum simulations of light–matter interactions in the near future.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Analog Quantum Simulation of the Dynamics of Open Quantum Systems with Quantum Dots and Microelectronic Circuits
We introduce a general setup for the analog quantum simulation of the dynamics of open quantum systems based on semiconductor quantum dots electrically connected to a chain of quantum RLC electronic circuits. The dots are chosen to be in the regime of spin-charge hybridization to enhance their sensitivity to the RLC circuits while mitigating the detrimental effects of unwanted noise. In this context, we establish an experimentally realizable map between the hybrid system and a qubit coupled to thermal harmonic environments of arbitrary complexity that enables the analog quantum simulation of open quantum systems. We assess the utility of the simulator by numerically exact emulations that indicate that the experimental setup can faithfully mimic the intended target even in the presence of its natural inherent noise. We further provide a detailed analysis of the physical requirements on the quantum dots and the RLC circuits needed to experimentally realize this proposal that indicates that the simulator can be created with existing technology. The approach can exactly capture the effects of highly structured non-Markovian quantum environments typical of photosynthesis and chemical dynamics, and offer clear potential advantages over conventional and even quantum computation. The proposal opens a general path for effective quantum dynamics simulations based on semiconductor quantum dots.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Simulating Quantum Systems with NWQ-Sim on HPC
NWQ-Sim is a cutting-edge quantum system simulation environment designed to run on classical multi-node, multi-CPU/GPU heterogeneous HPC systems. In this work, we provide a brief overview of NWQ-Sim and its implementation in simulating quantum circuit applications, such as the transverse field Ising model. We also demonstrate how NWQ-Sim can be used to examine the effects of errors that occur on real quantum devices, using a combined device noise model. Moreover, NWQ-Sim is particularly well-suited for implementing variational quantum algorithms where circuits are dynamically generated. Therefore, we also illustrate this with the variational quantum eigensolver (VQE) for the Ising model. In both cases, NWQ-Sim's performance is comparable to or better than alternative simulators. We conclude that NWQ-Sim is a useful and flexible tool for simulating quantum circuits and algorithms, with performance advantages and noise-aware simulation capabilities.
Suh, In-Saeng↗
Engineering an effective three-spin Hamiltonian in trapped-ion systems for applications in quantum simulation
Trapped-ion quantum simulators, in analog and digital modes, are considered a primary candidate to achieve quantum advantage in quantum simulation and quantum computation. The underlying controlled ion–laser interactions induce all-to-all two-spin interactions via the collective modes of motion through Cirac–Zoller or Mølmer–Sørensen schemes, leading to effective two-spin Hamiltonians, as well as two-qubit entangling gates. In this work, the Mølmer–Sørensen scheme is extended to induce three-spin interactions via tailored first- and second-order spin–motion couplings. The scheme enables engineering single-, two-, and three-spin interactions, and can be tuned via an enhanced protocol to simulate purely three-spin dynamics. Analytical results for the effective evolution are presented, along with detailed numerical simulations of the full dynamics to support the accuracy and feasibility of the proposed scheme for near-term applications. With a focus on quantum simulation, the advantage of a direct analog implementation of three-spin dynamics is demonstrated via the example of matter-gauge interactions in the U(1) lattice gauge theory within the quantum link model. The mapping of degrees of freedom and strategies for scaling the three-spin scheme to larger systems, are detailed, along with a discussion of the expected outcome of the simulation of the quantum link model given realistic fidelities in the upcoming experiments. The applications of the three-spin scheme go beyond the lattice gauge theory example studied here and include studies of static and dynamical phase diagrams of strongly interacting condensed-matter systems modeled by two- and three-spin Hamiltonians.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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↗
Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic
We introduce a quantum information theory-inspired method to improve the characterization of many-body Hamiltonians on near-term quantum devices. We design a new class of similarity transformations that, when applied as a preprocessing step, can substantially simplify a Hamiltonian for subsequent analysis on quantum hardware. By design, these transformations can be identified and applied efficiently using purely classical resources. In practice, these transformations allow us to shorten requisite physical circuit-depths, overcoming constraints imposed by imperfect near-term hardware. Importantly, the quality of our transformations is t u n a b l e : we define a 'ladder' of transformations that yields increasingly simple Hamiltonians at the cost of more classical computation. Using quantum chemistry as a benchmark application, we demonstrate that our protocol leads to significant performance improvements for zero and finite temperature free energy calculations on both digital and analog quantum hardware. Specifically, our energy estimates not only outperform traditional Hartree-Fock solutions, but this performance gap also consistently widens as we tune up the quality of our transformations. In short, our quantum information-based approach opens promising new pathways to realizing useful and feasible quantum chemistry algorithms on near-term hardware.
Physics↗
Ground state property calculations of LiH n complexes using IBM Qiskit’s quantum simulator
In this study, the variational quantum eigensolver (VQE) on a quantum simulator is used in calculating ground state electronic structure properties of the LiH n , n = 1–3, complexes including their singly charged ions. Results calculated using classical electronic structure algorithms are also included. We investigate the use of the unitary coupled cluster with singles and doubles (UCCSD) Ansatz using VQE within Qiskit and compare results to full configuration interaction (FCI) calculations. Computed ground state energies, electron affinities, ionization potentials, and dipole moments are considered. We report the first-of-its-kind simulated quantum computing results of selected LiH n species and use the parity orbital to qubit mapping scheme. We find that VQE/UCCSD results are comparable to classical coupled clusters with singles and doubles for all considered systems with respect to FCI. A VQE calculation cost evaluation is included in which we evaluate performance using both Jordan–Wigner and parity orbital to qubit mapping schemes. We also discuss some of the current limitations of utilizing VQE for the study of chemical systems.
97 MATHEMATICS AND COMPUTING↗
Preliminary Assessment of Qiskit Quantum Simulator Capabilities for Development of Quantum Hopfield Neural Network for Anomaly Detection Applications (Q4 Report)
Quantum information processing offers potentially faster performance compared to the classical counterpart. The goal of this work is to investigate performance of Quantum Hopfield Neural Network for applications to anomaly detection. Preliminary study consist of assessment of computational capabilities of Qiskit quantum simulator. Eventual objective is to implement Quantum Hopfield Network algorithm for detection of weak nuisance and anomaly signal in the presence of strong and highly varying background in gamma radiation data measured during environmental screening.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Hidden Statistics Approach to Quantum Simulations
Recent advances in quantum information theory have inspired an explosion of interest in new quantum algorithms for solving hard computational (quantum and non-quantum) problems. The basic principle of quantum computation is that the quantum properties can be used to represent structure data, and that quantum mechanisms can be devised and built to perform operations with this data. Three basic non-classical properties of quantum mechanics superposition, entanglement, and direct-product decomposability were main reasons for optimism about capabilities of quantum computers that promised simultaneous processing of large massifs of highly correlated data. Unfortunately, these advantages of quantum mechanics came with a high price. One major problem is keeping the components of the computer in a coherent state, as the slightest interaction with the external world would cause the system to decohere. That is why the hardware implementation of a quantum computer is still unsolved. The basic idea of this work is to create a new kind of dynamical system that would preserve the main three properties of quantum physics superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. In other words, such a system would reinforce the advantages and minimize limitations of both quantum and classical aspects. Based upon a concept of hidden statistics, a new kind of dynamical system for simulation of Schroedinger equation is proposed. The system represents a modified Madelung version of Schroedinger equation. It preserves superposition, entanglement, and direct-product decomposability while allowing one to measure its state variables using classical methods. Such an optimal combination of characteristics is a perfect match for simulating quantum systems. The model includes a transitional component of quantum potential (that has been overlooked in previous treatment of the Madelung equation). The role of the transitional potential is to provide a jump from a deterministic state to a random state with prescribed probability density. This jump is triggered by blowup instability due to violation of Lipschitz condition generated by the quantum potential. As a result, the dynamics attains quantum properties on a classical scale. The model can be implemented physically as an analog VLSI-based (very-large-scale integration-based) computer, or numerically on a digital computer. This work opens a way of developing fundamentally new algorithms for quantum simulations of exponentially complex problems that expand NASA capabilities in conducting space activities. It has been illustrated that the complexity of simulations of particle interaction can be reduced from an exponential one to a polynomial one.
Zak, Michail↗
Fast-forwarding quantum simulation with real-time quantum Krylov subspace algorithms
Quantum subspace diagonalization (QSD) algorithms have emerged as a competitive family of algorithms that avoid many of the optimization pitfalls associated with parameterized quantum circuit algorithms. While the vast majority of the QSD algorithms have focused on solving the eigenpair problem for ground, excited-state, and thermal observable estimation, there has been a lot less work in considering QSD algorithms for the problem of quantum dynamical simulation. In this work, we propose several quantum Krylov fast-forwarding (QKFF) algorithms capable of predicting long-time dynamics well beyond the coherence time of current quantum hardware. Our algorithms use real-time evolved Krylov basis states prepared on the quantum computer and a multi-reference subspace method to ensure convergence towards high-fidelity, long-time dynamics. In particular, we show that the proposed multi-reference methodology provides a systematic way of trading off circuit depth with classical post-processing complexity. Further, we also demonstrate the efficacy of our approach through numerical implementations for several quantum chemistry problems including the calculation of the auto-correlation and dipole moment correlation functions.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Introduction to Quantum Simulation
This viewgraph presentation addresses the problem of efficiently simulating the evolution of a quantum system. The contents include: 1) Quantum Simulation; 2) Extracting Answers from Quantum Simulations; 3) Quantum Fourier Transform; 4) Eigenvalue Estimation; 5) Fermionic Simulations.
quantum simulation↗
Improved Fermion Hamiltonians for Quantum Simulation
The Symanzik improvement program has been quite successful in classical simulations of quantum chromodynamics allowing calculations to be performed at coarser lattice spacings and with reduced computational resource costs. It is expected that improved Hamiltonians will be essential to simulate lattice field theories using quantum computers. In this work I will discuss the formulation of an ASQTAD and HISQ Hamiltonian amenable for quantum simulations. I will also show preliminary results that demonstrate significant tree-level contributions are removed in the spectrum of the 1 flavor Schwinger model.
quantum computing↗
Efficiently Verifiable Quantum Advantage on Near-Term Analog Quantum Simulators
Existing schemes for demonstrating quantum computational advantage are subject to various practical restrictions, including the hardness of verification and challenges in experimental implementation. Meanwhile, analog quantum simulators have been realized in many experiments to study novel physics. In this work, we propose a quantum advantage protocol based on verification of an analog quantum simulation, in which the verifier need only run an O ( λ 2 ) -time classical computation, and the prover need only prepare O ( 1 ) samples of a history state and perform O ( λ 2 ) single-qubit measurements, for a security parameter λ . We also propose a near-term feasible strategy for honest provers and discuss potential experimental realizations. Published by the American Physical Society 2025
Liu, Zhenning (ORCID:000000020794419X)↗
Quantum simulations in effective model spaces: Hamiltonian-learning variational quantum eigensolver using digital quantum computers and application to the Lipkin-Meshkov-Glick model
Quantum simulations offer the potential to predict the structure and dynamics of nuclear many-body systems that are beyond the capabilities of classical computing. Generally, preparing the ground state of strongly-interacting many-body systems relevant to nuclear physics is however inefficient, even using ideal quantum computers. In addition, currently available NISQ-era quantum devices possess modest numbers of qubits, limiting the size of quantum many-body systems that can be simulated. In this context, a reformulation of the quantum many-body problems using truncated model spaces and Hamiltonians is desirable to make them more amenable to near-term quantum computers. The importance of symmetries in low-energy theories, including effective field theories (EFTs), lattice quantum chromodynamics (QCD), and effective model spaces for nuclear systems, in particular their interplay with the reduction of active Hilbert spaces, is well known. Lesser known is the fact that the non-commutivity of some symmetries and truncations of the model space can be profitably combined with variational calculations to rearrange the entanglement into localized structures and enable more efficient simulations. Here, the goal of the present study is to explore and utilize the non-commutivity of symmetries and model-space truncations of quantum many-body systems important to nuclear physics, particularly in combination with variational algorithms for quantum simulations and effective Hamiltonian learning. We introduce an iterative hybrid classical-quantum algorithm, Hamiltonian learning variational quantum eigensolver (HL-VQE), that simultaneously optimizes an effective Hamiltonian, thereby rearranging entanglement into the effective model space, and the associated ground-state wavefunction. Quantum simulations, using classical computers and IBM's superconducting-qubit quantum computers, are performed to demonstrate the HL-VQE algorithm, in the context of the Lipkin-Meshkov-Glick (LMG) model of interacting fermions, where the Hamiltonian transformation corresponds to an orbital rotation. We use a mapping where the number of qubits scales with the $\log$ of the size of the effective model space, rather than the particle number. HL-VQE is found to provide an exponential improvement in LMG-model calculations of the ground-state energy and wavefunction, compared to naive truncations without Hamiltonian learning, throughout a significant fraction of the Hilbert space. In the context of EFT, this corresponds to counterterms scaling exponentially with the cut-off as opposed to power law. Implementations on IBM's QExperience quantum computers and simulators for 1- and 2-qubit effective model spaces are shown to provide accurate and precise results, reproducing classical predictions. For a range of parameters defining the LMG model, the HL-VQE algorithm is found to have better scaling of quantum resources requirements than previously explored algorithms. In particular, the HL-VQE scales efficiently over a large fraction of the model space, in contrast to VQE alone. This work constitutes a step in the development of entanglement-driven quantum algorithms for descriptions of nuclear many-body systems. This, in part, leverages the potential of noisy intermediate-scale quantum (NISQ) devices. The exponential scaling of counterterms observed in this study suggests the possibility of more general applicability to other non-perturbative EFTs.
73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
Quantum Simulation of Molecular Dynamics Processes─A Benchmark Study Using a Classical Simulator and Present-Day Quantum Hardware
Here, we explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM’s superconducting qubits and IonQ’s trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Towards quantum simulations in particle physics and beyond on noisy intermediate-scale quantum devices
We review two algorithmic advances that bring us closer to reliable quantum simulations of model systems in high-energy physics and beyond on noisy intermediate-scale quantum (NISQ) devices. The first method is the dimensional expressivity analysis of quantum circuits, which allows for constructing minimal but maximally expressive quantum circuits. The second method is an efficient mitigation of readout errors on quantum devices. Both methods can lead to significant improvements in quantum simulations, e.g. when variational quantum eigensolvers are used. This article is part of the theme issue ‘Quantum technologies in particle physics’.
Science & Technology - Other Topics↗
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)↗