Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum simulators”

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 415 records · Page 23

Linear-algebraic bath transformation for simulating complex open quantum systems

In studying open quantum systems, the environment is often approximated as a collection of non-interacting harmonic oscillators, a configuration also known as the star-bath model. It is also well known that the star-bath can be transformed into a nearest-neighbor interacting chain of oscillators. The chain-bath model has been widely used in renormalization group approaches. The transformation can be obtained by recursion relations or orthogonal polynomials. Based on a simple linear algebraic approach, we propose a bath partition strategy to reduce the system-bath coupling strength. As a result, the non-interacting star-bath is transformed into a set of weakly coupled multiple parallel chains. Furthermore, the transformed bath model allows complex problems to be practically implemented on quantum simulators, and it can also be employed in various numerical simulations of open quantum dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Coupled Lindblad Pseudomode Theory for Simulating Open Quantum Systems

Coupled Lindblad pseudomode theory is a promising approach for simulating non-Markovian quantum dynamics on both classical and quantum platforms, with dynamics that can be realized as a quantum channel. We provide theoretical evidence that the number of coupled pseudomodes only needs to scale as polylog⁡(𝑇/𝜖) in the simulation time 𝑇 and precision 𝜖. Inspired by the realization problem in control theory, we also develop a robust numerical algorithm for constructing the coupled modes that avoid the nonconvex optimization required by existing approaches. We demonstrate the effectiveness of our method by computing population dynamics and absorption spectra for the spin-boson model. Furthermore, this Letter provides a significant theoretical and computational improvement to the coupled Lindblad framework, which impacts a broad range of applications from classical simulations of quantum impurity problems to quantum simulations on near-term quantum platforms.

Anderson impurity model↗

A Quantum Analog Coprocessor for Correlated Electron Systems Simulation

Analog quantum simulation is an approach for studying physical systems that might otherwise be computationally intractable to simulate on classical high-performance computing (HPC) systems. The key idea behind analog quantum simulation is the realization of a physical system with a low-energy effective Hamiltonian that is the same as the low-energy effective Hamiltonian of some target system to be studied. Purpose-built nanoelectronic devices are a natural candidate for implementing the analog quantum simulation of strongly correlated materials that are otherwise challenging to study using classical HPC systems. However, realizing devices that are sufficiently large to study the properties of a non-trivial material system (e.g., those described by a Fermi-Hubbard model) will eventually require the fabrication, control, and measurement of at least 0(10) quantum dots, or other engineered quantum impurities. As a step toward large-scale analog or digital quantum simulation platforms based on nanoelectronic devices, we propose a new approach to analog quantum simulation that makes use of the large Hilbert space dimension of the electronic baths that are used to adjust the occupancy of one or a few engineered quantum impurities. This approach to analog quantum simulation allows us to study a wide array of quantum impurity models. We can further augment the computational power of such an approach by combining it with a classical computer to facilitate dynamical mean-field theory (DMFT) calculations. DMFT replaces the solution of a lattice impurity problem with the solution of a family of localized impurity problems with bath couplings that are adjusted to satisfy a self-consistency condition between the two models. In DMFT, the computationally challenging task is the high-accuracy solution of an instance of a quantum impurity model that is determined self-consistently in coordination with a mean-field calculation. We propose using one or a few engineered quantum impurities with adjustable couplings to baths to realize an analog quantum coprocessor that effects the solution of such a model through measurements of a physical quantum impurity, operating in coordination with a classical computer to achieve a self-consistent solution to a DMFT calculation. We focus on implementation details relevant to a number of technologies for which Sandia has design, fabrication, and measurement expertise. The primary technical advances outlined in this report concern the development of a supporting modeling capability. As with all analog quantum simulation platforms, the successful design and operation of individual devices depends critically on one's ability to predict the effective low-energy Hamiltonian governing its dynamics Our project has made this possible and lays the foundation for future experimental implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A graphene edge-mediated quantum gate

We propose a quantum gate architecture that allows for the systematic control of the effective exchange interactions between magnetic impurities embedded in nanoscale graphene flakes connected by a gated bridge. The entanglement between the magnetic moment and the edge states of the fragments is used to electrostatically tune the exchange interaction from ferro to antiferromagnetic by merely changing the bridge's carrier density. By characterizing the effects of size and coupling parameters, we explore different operation regimes of this device by means of exact calculations with the density matrix renormalization group. We analyze the results utilizing a simplified model that accounts for the main many-body mechanisms. Finally, we discuss how to use arrays of these devices to build quantum simulators for quantum many-body Hamiltonians.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cross Entropy Benchmark for Measurement-Induced Phase Transitions

Here, we investigate prospects of employing the linear cross entropy to experimentally access measurement-induced phase transitions without requiring any postselection of quantum trajectories. For two random circuits that are identical in the bulk but with different initial states, the linear cross entropy χ between the bulk measurement outcome distributions in the two circuits acts as an order parameter, and can be used to distinguish the volume law from area law phases. In the volume law phase (and in the thermodynamic limit) the bulk measurements cannot distinguish between the two different initial states, and χ = 1. In the area law phase χ < 1. For circuits with Clifford gates, we provide numerical evidence that χ can be sampled to accuracy ϵ from O⁢(1/ϵ 2 ) trajectories, by running the first circuit on a quantum simulator without postselection, aided by a classical simulation of the second. We also find that for weak depolarizing noise the signature of the measurement-induced phase transitions is still present for intermediate system sizes. In our protocol we have the freedom of choosing initial states such that the “classical” side can be simulated efficiently, while simulating the “quantum” side is still classically hard.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theory of Trotter Error with Commutator Scaling

The Lie-Trotter formula, together with its higher-order generalizations, provides a simple approach to decomposing the exponential of a sum of operators. Despite significant effort, the error scaling of such product formulas remains poorly understood. We develop a theory of Trotter error that overcomes the limitations of truncating the Baker-Campbell-Hausdorff expansion. Our analysis directly exploits the commutativity of operator summands, producing tighter error bounds for both real- and imaginary-time evolutions. Whereas previous work achieves similar goals for systems with geometric locality or Lie-algebraic structure, our approach holds in general. We give a host of improved algorithms for digital quantum simulation and quantum Monte Carlo methods, nearly matching or even outperforming the best previous results. Our applications include: (i) a simulation of second-quantized plane-wave electronic structure, nearly matching the interaction-picture algorithm of Low and Wiebe; (ii) a simulation of $k$-local Hamiltonians almost with induced one-norm scaling, faster than the qubitization algorithm of Low and Chuang; (iii) a simulation of rapidly decaying power-law interactions, outperforming the Lieb-Robinson-based approach of Tran et al.; (iv) a hybrid simulation of clustered Hamiltonians, dramatically improving the result of Peng, Harrow, Ozols, and Wu; and (v) quantum Monte Carlo simulations of the transverse field Ising model and quantum ferromagnets, tightening previous analyses of Bravyi and Gosset. We obtain further speedups using the fact that product formulas can preserve the locality of the simulated system. Specifically, we show that local observables can be simulated with complexity independent of the system size for power-law interacting systems, which implies a Lieb-Robinson bound nearly matching a recent result of Tran et al. Our analysis reproduces known tight bounds for first- and second-order formulas. We further investigate the tightness of our bounds for higher-order formulas. For quantum simulation of a one-dimensional Heisenberg model with an even-odd ordering of terms, our result overestimates the complexity by only a factor of $5$. Our bound is also close to tight for power-law interactions and other orderings of terms. This suggests that our theory can accurately characterize Trotter error in terms of both the asymptotic scaling and the constant prefactor.

quantum computing, numerical analysis↗

QUEST: QUantum Electron Simulation Toolbox

QUEST is a part of the SciDAC project on next generation multi-scale quantum simulation software for strongly correlated materials. It is a Fortran 90/95 package that implements the determinant quantum Monte Carlo (DQMC) method for simulation of magnetic, superconducting, and metal-insulator transitions in model Hamiltonians. In this paper, we show how QUEST is capable of treating lattices of unprecedentedly large sizes and how this can be fruitful in the study of the physics of trapped fermionic system, in the development of more efficient solvers for Dynamical Mean Field Theory (DMFT) and as a tool to test and, in the future, improve diagrammatic approaches such as the Parquet approximation. We will also present a range of synergistic activities on the development of stable and robust numerical algorithms and hybrid granularity parallelization scheme that combines algorithmic and implementation techniques to high-performance DQMC simulation. The work reported here is a key step forward in achieving the goals of our SciDAC project.

97 MATHEMATICS AND COMPUTING↗

Para-particle oscillator simulations on a trapped-ion quantum computer

Deformed oscillators allow for a generalization of the standard fermions and bosons, namely, for the description of para-particles. Such particles remain hypothetical and unobserved in nature; yet, they can model physical phenomena, such as topological phases of matter. Here, we report the digital quantum simulation of para-particle oscillators by mapping para-particle states to the state of a qubit register, which allows us to identify the para-particle oscillator Hamiltonian as an XY model and further digitize the system onto a universal set of gates. In both instances, the gate depth grows polynomially with the number of qubits used. To establish the validity of our results, we experimentally simulate the dynamics of para-fermions and para-bosons, demonstrating full control of para-particle oscillators on a quantum computer. Furthermore, we compare the overall performance of the digital simulation of dynamics of the driven para-Fermi oscillator to a recent analog quantum simulation result.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamical simulation via quantum machine learning with provable generalization

Much attention has been paid to dynamical simulation and quantum machine learning (QML) independently as applications for quantum advantage, while the possibility of using QML to enhance dynamical simulations has not been thoroughly investigated. Here we develop a framework for using QML methods to simulate quantum dynamics on near-term quantum hardware. We use generalization bounds, which bound the error a machine learning model makes on unseen data, to rigorously analyze the training data requirements of an algorithm within this framework. Our algorithm is thus resource efficient in terms of qubit and data requirements. Furthermore, our preliminary numerics for the XY model exhibit efficient scaling with problem size, and we simulate 20 times longer than Trotterization on IBMQ-Bogota. Published by the American Physical Society 2024

97 MATHEMATICS AND COMPUTING↗

A quantum algorithm for evolving open quantum dynamics on quantum computing devices

Abstract Designing quantum algorithms for simulating quantum systems has seen enormous progress, yet few studies have been done to develop quantum algorithms for open quantum dynamics despite its importance in modeling the system-environment interaction found in most realistic physical models. In this work we propose and demonstrate a general quantum algorithm to evolve open quantum dynamics on quantum computing devices. The Kraus operators governing the time evolution can be converted into unitary matrices with minimal dilation guaranteed by the Sz.-Nagy theorem. This allows the evolution of the initial state through unitary quantum gates, while using significantly less resource than required by the conventional Stinespring dilation. We demonstrate the algorithm on an amplitude damping channel using the IBM Qiskit quantum simulator and the IBM Q 5 Tenerife quantum device. The proposed algorithm does not require particular models of dynamics or decomposition of the quantum channel, and thus can be easily generalized to other open quantum dynamical models.

42 ENGINEERING↗

Gate-free state preparation for fast variational quantum eigensolver simulations

Abstract The variational quantum eigensolver is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers. The algorithm involves implementing a sequence of parameterized gates on quantum hardware to generate a target quantum state, and then measuring the molecular energy. Due to finite coherence times and gate errors, the number of gates that can be implemented remains limited. In this work, we propose an alternative algorithm where device-level pulse shapes are variationally optimized for the state preparation rather than using an abstract-level quantum circuit. In doing so, the coherence time required for the state preparation is drastically reduced. We numerically demonstrate this by directly optimizing pulse shapes which accurately model the dissociation of H 2 and HeH + , and we compute the ground state energy for LiH with four transmons where we see reductions in state preparation times of roughly three orders of magnitude compared to gate-based strategies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Clarification of the Mechanism of Acylation Reaction and Origin of Substrate Specificity of the Serine-Carboxyl Peptidase Sedolisin through QM/MM Free Energy Simulations

Quantum mechanical/molecular mechanical (QM/MM) free energy simulations are applied for understanding the mechanism of the acylation reaction catalyzed by sedolisin, a representative serine-carboxyl peptidase, leading to the acyl-enzyme (AE) and first product from the enzyme-catalyzed reaction. One of the interesting questions to be addressed in this work is the origin of the substrate specificity of sedolisin that shows a relatively high activity on the substrates with Glu at P1 site. It is shown that the bond making and breaking events of the acylation reaction involving a peptide substrate (LLE*FL) seem to be accompanied by local conformational changes, proton transfers as well as the formation of alternative hydrogen bonds. The results of the simulations indicate that the conformational change of Glu at P1 site and its formation of a low barrier hydrogen bond with Asp-170 (along with the transient proton transfer) during the acylation reaction might play a role in the relatively high specificity for the substrate with Glu at P1 site. The role of some key residues in the catalysis is confirmed through free energy simulations. Glu-80 is found to act as a general base to accept a proton from Ser-287 during the nucleophilic attack and then as a general acid to protonate the leaving group (N H of P1 -Phe) during the cleavage of the scissile peptide bond. Another acidic residue, Asp-170, acts as a general acid catalyst to protonate the carbonyl of P1-Glu during the formation of the tetrahedral intermediate and as a general base for the formation of the acyl-enzyme. The energetic results from the free energy simulations support the importance of proton transfer from Asp-170 to the carbonyl of P1-Glu in the stabilization of the tetrahedral intermediate and the formation of a low-barrier hydrogen bond between the carboxyl group of P1-Glu and Asp-170 in the lowering of the free energy barrier for the cleavage of the peptide bond. Detailed analyses of the proton transfers during acylation are also given.

08 HYDROGEN↗

Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements

The adaptive variational quantum dynamics simulation (AVQDS) method performs real-time evolution of quantum states using automatically generated parametrized quantum circuits that often contain substantially fewer gates than Trotter circuits. Here we report an improved version of the method, which we call AVQDS(T), by porting the tiling efficient trial circuits with rotations implemented simultaneously technique. The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold. Here we perform benchmark noiseless AVQDS(T) simulations of quench dynamics in local spin models and compare with an alternative adaptive variational approach on quantum resource requirement. Quantum dynamical simulations implementing realistic noise channels are also reported. Finally, we propose a way to substantially alleviate the measurement overhead of AVQDS(T) while maintaining high accuracy by synergistically integrating quantum circuit calculations on quantum processing units with classical calculations using, e.g., tensor networks to evaluate the quantum geometric tensor. We showcase that this approach enables AVQDS(T) to deliver more accurate results than simulations using a fixed ansatz of comparable final depth for a significant time duration with fewer quantum resources.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions.

97 MATHEMATICS AND COMPUTING↗

Mixed quantum-classical simulations of charge transport in organic materials: Numerical benchmark of the Su-Schrieffer-Heeger model

The electron-phonon coupling is critical in determining the intrinsic charge carrier and exciton transport properties in organic materials. In this study, we consider a Su-Schrieffer-Heeger (SSH) model for molecular crystals, and perform numerical benchmark studies for different strategies of simulating the mixed quantum-classical dynamics. These methods, which differ in the selection of initial conditions and the representation used to solve the time evolution of the quantum carriers, are shown to yield similar equilibrium diffusion properties. A hybrid approach combining molecular dynamics simulations of nuclear motion and quantum-chemical calculations of the electronic Hamiltonian at each geometric configuration appears as an attractive strategy to model charge dynamics in large size systems ''on the fly,'' yet it relies on the assumption that the quantum carriers do not impact the nuclear dynamics. We find that such an approximation systematically results in overestimated charge-carrier mobilities, with the associated error being negligible when the room-temperature mobility exceeds {approx}4.8 cm{sup 2}/Vs ({approx}0.14 cm{sup 2}/Vs) in one-dimensional (two-dimensional) crystals.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Deep quantum circuit simulations of low-energy nuclear states

Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that place demanding memory and processing requirements on conventional simulation methods. Here, we present advances in high-performance numerical simulations of deep quantum circuits to efficiently verify the accuracy of low-energy nuclear physics applications. Our approach employs novel methods for accelerating the numerical simulation including management of simulated mid-circuit measurements to verify projection based state preparation circuits. In this study, we test these methods across a variety of high-performance computing systems and our results show that circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Frequency-domain multiscale quantum mechanics/electromagnetics simulation method

A frequency-domain quantum mechanics and electromagnetics (QM/EM) method is developed. Compared with the time-domain QM/EM method [Meng et al., J. Chem. Theory Comput. 8, 1190–1199 (2012)], the newly developed frequency-domain QM/EM method could effectively capture the dynamic properties of electronic devices over a broader range of operating frequencies. The system is divided into QM and EM regions and solved in a self-consistent manner via updating the boundary conditions at the QM and EM interface. The calculated potential distributions and current densities at the interface are taken as the boundary conditions for the QM and EM calculations, respectively, which facilitate the information exchange between the QM and EM calculations and ensure that the potential, charge, and current distributions are continuous across the QM/EM interface. Via Fourier transformation, the dynamic admittance calculated from the time-domain and frequency-domain QM/EM methods is compared for a carbon nanotube based molecular device.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗