Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum algorithms”

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 1,693 records · Page 94

Fast optimization algorithms and the cosmological constant

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here in this paper, we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10 -120 in a randomly generated 10 9 -dimensional Arkani-Hamed–Dimopoulos–Kachru landscape.

79 ASTRONOMY AND ASTROPHYSICS↗

Chemo-mechanical modeling of tumor growth in elastic epithelial tissue

We propose a multiscale chemo-mechanical model of the cancer tumor development in the epithelial tissue. The epithelium is represented by an elastic 2D array of polygonal cells with its own gene regulation dynamics. The model allows the simulation of the evolution of multiple cells interacting via the chemical signaling or mechanically induced strain. The algorithm includes the division and intercalation of cells as well as the transformation of normal cells into a cancerous state triggered by a local failure of the spatial synchronization of the cellular rhythms driven by transcription/translation processes. Both deterministic and stochastic descriptions of the system are given for chemical signaling. The transformation of cells means the modification of their respective parameters responsible for chemo-mechanical interactions. The simulations reproduce a distinct behavior of invasive and localized carcinoma. Generally, the model is designed in such a way that it can be readily modified to take account of any newly understood gene regulation processes and feedback mechanisms affecting chemo-mechanical properties of cells.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Harnessing deep reinforcement learning to construct time-dependent optimal fields for quantum control dynamics

Here, we present an efficient deep reinforcement learning (DRL) approach to automatically construct time-dependent optimal control fields that enable desired transitions in dynamical chemical systems. Our DRL approach gives impressive performance in constructing optimal control fields, even for cases that are difficult to converge with existing gradient-based approaches. We provide a detailed description of the algorithms and hyperparameters as well as performance metrics for our DRL-based approach. Our results demonstrate that DRL can be employed as an effective artificial intelligence approach to efficiently and autonomously design control fields in quantum dynamical chemical systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Long-time simulations for fixed input states on quantum hardware

Publicly accessible quantum computers open the exciting possibility of experimental dynamical quantum simulations. While rapidly improving, current devices have short coherence times, restricting the viable circuit depth. Despite these limitations, we demonstrate long-time, high fidelity simulations on current hardware. Specifically, we simulate an XY-model spin chain on Rigetti and IBM quantum computers, maintaining a fidelity over 0.9 for 150 times longer than is possible using the iterated Trotter method. Our simulations use an algorithm we call fixed state Variational Fast Forwarding (fsVFF). Recent work has shown an approximate diagonalization of a short time evolution unitary allows a fixed-depth simulation. fsVFF substantially reduces the required resources by only diagonalizing the energy subspace spanned by the initial state, rather than over the total Hilbert space. We further demonstrate the viability of fsVFF through large numerical simulations, and provide an analysis of the noise resilience and scaling of simulation errors.

97 MATHEMATICS AND COMPUTING↗

SPARC-X: Quantum simulations at extreme scale - reactive dynamics from first principles

We have developed the massively parallel electronic structure code SPARC-X: a computational framework for performing Kohn-Sham Density Functional Theory (DFT) calculations that can scale linearly with the number of atoms in the system, while being able to leverage petascale and emerging exascale parallel computers to study chemical phenomena at unprecedented length and time scales. SPARC-X exploits a recent breakthrough in electronic structure methodologies: systematically improvable, strictly local, orthonormal, discontinuous real-space bases that efficiently and systematically capture the local chemistry of the system. With further adaptation using new machine-learning techniques and the use of the massively parallel Spectral Quadrature (SQ) electronic structure method, the algorithmic complexity and prefactor associated with DFT calculations involving semilocal as well as hybrid functionals are dramatically reduced. Using petascale computational resources, SPARC-X enables quantum mechanical simulations at length and time scales previously accessible only by empirical approaches, e.g., 1,000,000 atoms for a few picoseconds using semilocal functionals or 1,000 atoms for a few picoseconds using hybrid functionals. Using exascale resources, the sizes and times targeted are two orders of magnitude larger. Such a capability has applications in a wide variety of chemical sciences, including reactive interfaces where large length- and/or long time-scales are needed and traditional force fields fail. This is particularly important in dynamic catalysis, where bond breaking and formation must be understood in detail. We developed, tested, and employed the SPARC-X framework to understand the photocatalytic properties of TiO 2 nanoparticles, revealing finite size effects that cannot be captured with standard model systems or functionals. This integrated development and application strategy ensures that SPARC-X remains a robust, efficient, and scalable software package for quantum simulations on current petascale and emerging exascale computing resources.

97 MATHEMATICS AND COMPUTING↗

Memory effect and phase transition in a hierarchical trap model for spin glasses

Here, we introduce an efficient dynamical tree method that enables us to explicitly demonstrate the thermoremanent magnetization memory effect in a hierarchical energy landscape. Our simulation nicely reproduces the nontrivial waiting-time and waiting-temperature dependences in this nonequilibrium phenomenon. We further investigate the condensation effect, in which a small set of microstates dominates the thermodynamic behavior in the multilayer trap model. Importantly, a structural phase transition of the multilayer tree model is shown to coincide with the onset of the condensation phenomenon. Our results underscore the importance of hierarchical structure and demonstrate the intimate relation between the glassy behavior and structure of barrier trees.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solovay-Kitaev Algorithm and Randomized Compilation Data Availability

This zipped folder contains simulation notebooks, simulated data, and experimental data from the QSCOUT trapped-ion device that were used in the publication "Solovay-Kitaev Algorithm and Randomized Compilation" (https://doi.org/10.1103/ll6m-dbl7). The raw data is in the form of measurement outcomes of simple tomographic quantum circuits that were executed on the QSCOUT device and simulated using JAQALPAQ. These data are used to create plots within the jupyter notebooks that were included in the publication.

Quantum benchmarking↗

Leveraging Quantum Sensors for Dark Matter Detection

Recent measurements have demonstrated that superconducting qubit decoherence is affected by radiation. As a result, many groups around the world are working to better understand the relationship between different types of radiation and qubit response. This crucial to quantum error correction because radiation can cause correlated loss of information across multiple qubits on a chip, defeating error correction algorithms. Additionally, the fundamental energy scale at which superconducting qubits operate may enable their development as meV-scale detectors for HEP applications, such as the direct detection of dark matter. At Fermilab, we have two world-class underground facilities which are already being used to study this problem: NEXUS and QUIET. I will present on results from operating superconducting qubits in each of these facilities, and the potential implications towards utilizing qubits as sensors for a novel dark matter detector.

Baxter, Daniel [Texas U., Arlington]↗

Leveraging Quantum Sensors for Dark Matter Detection

Recent measurements have demonstrated that superconducting qubit decoherence is affected by radiation. As a result, many groups around the world are working to better understand the relationship between different types of radiation and qubit response. This crucial to quantum error correction because radiation can cause correlated loss of information across multiple qubits on a chip, defeating error correction algorithms. Additionally, the fundamental energy scale at which superconducting qubits operate may enable their development as meV-scale detectors for HEP applications, such as the direct detection of dark matter. At Fermilab, we have two world-class underground facilities which are already being used to study this problem: NEXUS and QUIET. I will present on results from operating superconducting qubits in each of these facilities, and the potential implications towards utilizing qubits as sensors for a novel dark matter detector.

Baxter, Daniel [Texas U., Arlington]↗

Scientific Discovery with Physics-Informed System Identification (Abbreviated Report)

My fellowship research focused on making physics-based simulations faster and more useful through machine learning. Many problems in science and engineering are governed by partial differential equations, but high-fidelity simulations are often too expensive to run repeatedly. I worked on improving Latent Space Dynamics Identification (LaSDI), a reduced-order modeling framework that compresses large simulation data sets into a smaller representation and then learns how that representation evolves over time. The motivation was to develop reduced models that remain accurate for more challenging systems, especially when predictions must remain reliable over long time intervals or when the underlying dynamics are more complicated than standard methods can easily handle. I also contributed to related work on Quandary, a high-performance software effort for simulation and control of open quantum systems, before focusing primarily on Latent Space Dynamics Identification methods. The main outcomes of the fellowship were two new algorithms (both of which were published), Rollout-LaSDI and Higher-Order LaSDI, together with supporting work on multi-stage Latent Space Dynamics Identification. Rollout-LaSDI improved long-term prediction by training the model to stay accurate over extended time horizons, and Higher-Order LaSDI broadened the method so it could model systems with higher-order time dynamics. My contributions to multistage Latent Space Dynamics Identification also helped show that its later training stages could be simplified without losing effectiveness, and that this behavior held across different model architectures and training strategies. Taken together, these advances improved the accuracy, flexibility, and practical value of reduced-order modeling tools for computational science.

97 MATHEMATICS AND COMPUTING↗

Exact Factorization Adventures: A Promising Approach for Non-Bound States

Modeling the dynamics of non-bound states in molecules requires an accurate description of how electronic motion affects nuclear motion and vice-versa. The exact factorization (XF) approach offers a unique perspective, in that it provides potentials that act on the nuclear subsystem or electronic subsystem, which contain the effects of the coupling to the other subsystem in an exact way. We briefly review the various applications of the XF idea in different realms, and how features of these potentials aid in the interpretation of two different laser-driven dissociation mechanisms. We present a detailed study of the different ways the coupling terms in recently-developed XF-based mixed quantum-classical approximations are evaluated, where either truly coupled trajectories, or auxiliary trajectories that mimic the coupling are used, and discuss their effect in both a surface-hopping framework as well as the rigorously-derived coupled-trajectory mixed quantum-classical approach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A PEPS Plugin for TNQVM

This work introduces an extension to the Tensor Network Quantum Virtual Machine (TNQVM) tool, enhancing the existing stack of ExaScale Tensor Network (ExaTN), ExaScale Accelerator (XACC), and TNQVM. It features a new plugin that enables efficient simulation of a Projected Entangled Pair State (PEPS), a 2D tensor network. To improve simulation efficiency for PEPS, we have implemented the snake boundary contraction algorithm. By integrating this capability into the existing stack, we enhance the overall functionality and versatility of the framework. We tested this new PEPS topology for a simple GHZ bell-pair generation quantum circuit and saw that its runtime is very close to that of the MPS topology. We estimate that the real potential of the PEPS topology becomes discernible when quantum circuits with multidimensional entanglement are simulated using tensor networks. In such cases, 1D tensor networks fail to represent or contract them efficiently.

Chundury, Srikar↗

Efficient use of quantum computers for collider physics

Most observables at particle colliders involve physics at a wide variety of distance scales. Due to asymptotic freedom of the strong interaction, the physics at short distances can be calculated reliably using perturbative techniques, while long distance physics is non-perturbative in nature. Factorization theorems separate the contributions from different scales, allowing to identify the pieces that can be determined perturbatively from those that require non-perturbative information, and if the non-perturbative pieces can be reliably determined, one can use experimental measurements to extract the short distance effects, sensitive to possible new physics. Without the ability to compute the non-perturbative ingredients from first principles one typically identifies observables for which the non-perturbative information is universal in the sense that it can be extracted from some experimental observables and then used to predict other observables. In this paper we argue that the future ability to use quantum computers to calculate non-perturbative matrix elements from first principles will allow to make predictions for observables with non-universal non-perturbative long-distance physics.

Algorithms and Theoretical Developments↗

Detection and Correction of Step Discontinuities in Kepler Flux Time Series

PDC 8.0 includes an implementation of a new algorithm to detect and correct step discontinuities appearing in roughly one of every 20 stellar light curves during a given quarter. The majority of such discontinuities are believed to result from high-energy particles (either cosmic or solar in origin) striking the photometer and causing permanent local changes (typically -0.5%) in quantum efficiency, though a partial exponential recovery is often observed [1]. Since these features, dubbed sudden pixel sensitivity dropouts (SPSDs), are uncorrelated across targets they cannot be properly accounted for by the current detrending algorithm. PDC detrending is based on the assumption that features in flux time series are due either to intrinsic stellar phenomena or to systematic errors and that systematics will exhibit measurable correlations across targets. SPSD events violate these assumptions and their successful removal not only rectifies the flux values of affected targets, but demonstrably improves the overall performance of PDC detrending [1].

Kolodziejczak, J. J.↗

New basis for Hamiltonian SU(2) simulations

Due to rapidly improving quantum computing hardware, Hamiltonian simulations of relativistic lattice field theories have seen a resurgence of attention. This computational tool requires turning the formally infinite-dimensional Hilbert space of the full theory into a finite-dimensional one. For gauge theories, a widely used basis for the Hilbert space relies on the representations induced by the underlying gauge group, with a truncation that keeps only a set of the lowest dimensional representations. This works well at large bare gauge coupling, but becomes less efficient at small coupling, which is required for the continuum limit of the lattice theory. In this work, we develop a new basis suitable for the simulation of an SU(2) lattice gauge theory in the maximal tree gauge. In particular, we show how to perform a Hamiltonian truncation so that the eigenvalues of both the magnetic and electric gauge-fixed Hamiltonian are mostly preserved, which allows for this basis to be used at all values of the coupling. Little prior knowledge is assumed, so this may also be used as an introduction to the subject of Hamiltonian formulations of lattice gauge theories. Published by the American Physical Society 2024

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Gauge loop-string-hadron formulation on general graphs and applications to fully gauge fixed Hamiltonian lattice gauge theory

We develop a gauge invariant, Loop-String-Hadron (LSH) based representation of SU(2) Yang-Mills theory defined on a general graph consisting of vertices and half-links. Inspired by weak coupling studies, we apply this technique to maximal tree gauge fixing. This allows us to develop a fully gauge-fixed representation of the theory in terms of LSH quantum numbers. We explicitly show how the quantum numbers in this formulation directly relate to the variables in the magnetic description. In doing so, we will also explain in detail how the Kogut-Susskind formulation, prepotentials, and point splitting work for general graphs. In the appendix of this work, we provide a self-contained exposition of the mathematical details of Hamiltonian pure gauge theories defined on general graphs.

Algorithms and Theoretical Developments↗