Criticality of quantum energy teleportation at phase transition points in quantum field theory
Not Available
79 ASTRONOMY AND ASTROPHYSICS↗
SEARCH · Search NASA
Results for “Information theory and computation”
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.
Quantum Computing Algorithms and Applications for Coherent and Strongly Correlated Chemical Systems
This project advanced quantum algorithms, quantum information theory, strongly correlated electronic structure methods, molecular quantum materials, and exciton transport imaging in coherent condensed phase systems. Across the award period, the team developed new methods for open-quantum-system simulation, Hamiltonian learning, state tomography, reduced-density-matrix and contracted-quantum eigensolver approaches, and quantum diagnostics for device capability and openness.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Quantum Computation of Dynamical Quantum Phase Transitions and Entanglement Tomography in a Lattice Gauge Theory
Strongly coupled gauge theories far from equilibrium may exhibit unique features that could illuminate the physics of the early universe and of hadron and ion colliders. Studying real-time phenomena has proven challenging with classical-simulation methods but is a natural application of quantum simulation. To demonstrate this prospect, we quantum compute nonequal-time correlation functions and perform entanglement tomography of nonequilibrium states of a simple lattice gauge theory, the Schwinger model, using a trapped-ion quantum computer by IonQ Inc. As an ideal target for near-term devices, a recently predicted dynamical quantum phase transition in this model is studied by preparing, quenching, and tracking the subsequent nonequilibrium dynamics in three ways: (i) overlap echos signaling dynamical transitions, (ii) nonequal-time correlation functions with an underlying topological nature, and (iii) the entanglement structure of nonequilibrium states, including entanglement Hamiltonians. These results constitute the first observation of a dynamical quantum phase transition in a lattice gauge theory on a quantum computer and are a first step toward investigating topological phenomena in nuclear and high-energy physics using quantum technologies.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Actinide Molten Salts: A Machine-Learning Potential Molecular Dynamics Study
We know that actinide molten salts represent a class of important materials in nuclear energy. Understanding them at a molecular level is critical to proper and optimal design of relevant technological applications. Yet, owing to the complexity of electronic structure due to the 5f orbitals, computational studies of heavy elements in condensed phases using ab initio potentials to study the structure and dynamics of these elements embedded in molten salts are difficult. This lack of efficient computational protocols makes it difficult to obtain information on properties that require extensive statistical sampling like transport. To tackle this problem, we adopted a machine-learning approach to study ThCl 4 -NaCl and UCl 3 -NaCl binary systems. The machine-learning potential, with the density functional theory accuracy, allows us to obtain long molecular dynamics trajectories (ns) for large systems (10 3 atoms) at a considerably low computing cost, thereby efficiently gaining information about their bonding structures, thermodynamics, and dynamics at a range of temperature. We observed a considerable change in the coordination environments of actinide elements and their characteristic coordination-sphere lifetime. Our study also suggests that actinides in molten salts may not follow well known entropy-scaling laws.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NANO.PTML model for read-across prediction of nanosystems in neurosciences. computational model and experimental case of study
Abstract Neurodegenerative diseases involve progressive neuronal death. Traditional treatments often struggle due to solubility, bioavailability, and crossing the Blood-Brain Barrier (BBB). Nanoparticles (NPs) in biomedical field are garnering growing attention as neurodegenerative disease drugs (NDDs) carrier to the central nervous system. Here, we introduced computational and experimental analysis. In the computational study, a specific IFPTML technique was used, which combined Information Fusion (IF) + Perturbation Theory (PT) + Machine Learning (ML) to select the most promising Nanoparticle Neuronal Disease Drug Delivery (N2D3) systems. For the application of IFPTML model in the nanoscience, NANO.PTML is used. IF-process was carried out between 4403 NDDs assays and 260 cytotoxicity NP assays conducting a dataset of 500,000 cases. The optimal IFPTML was the Decision Tree (DT) algorithm which shown satisfactory performance with specificity values of 96.4% and 96.2%, and sensitivity values of 79.3% and 75.7% in the training (375k/75%) and validation (125k/25%) set. Moreover, the DT model obtained Area Under Receiver Operating Characteristic (AUROC) scores of 0.97 and 0.96 in the training and validation series, highlighting its effectiveness in classification tasks. In the experimental part, two samples of NPs (Fe 3 O 4 _A and Fe 3 O 4 _B) were synthesized by thermal decomposition of an iron(III) oleate (FeOl) precursor and structurally characterized by different methods. Additionally, in order to make the as-synthesized hydrophobic NPs (Fe 3 O 4 _A and Fe 3 O 4 _B) soluble in water the amphiphilic CTAB (Cetyl Trimethyl Ammonium Bromide) molecule was employed. Therefore, to conduct a study with a wider range of NP system variants, an experimental illustrative simulation experiment was performed using the IFPTML-DT model. For this, a set of 500,000 prediction dataset was created. The outcome of this experiment highlighted certain NANO.PTML systems as promising candidates for further investigation. The NANO.PTML approach holds potential to accelerate experimental investigations and offer initial insights into various NP and NDDs compounds, serving as an efficient alternative to time-consuming trial-and-error procedures.
60 APPLIED LIFE SCIENCES↗
Uncertainty-Based Information Theory for Heterogenous Data Fusion [Slides]
Abstract not provided.
97 MATHEMATICS AND COMPUTING↗
Li1−xNiO2 Many-body DMC Benchmark Dataset
The dataset contains all numerical data generated in support of the manuscript “Many‑body Benchmark of Electronic Charge and Spin Densities for Li1–xNiO2” (Journal of Chemical Theory and Computation, DOI: 10.1021/acs.jctc.5c02097, URL: https://pubs.acs.org/doi/10.1021/acs.jctc.5c02097). The materials included in this repository are: 1. Data files used to produce all figures and tables in the main manuscript and supporting information. 2. Benchmark density‑functional theory (DFT) datasets used for the charge‑ and spin‑density analyses. 3. Reference many‑body diffusion Monte Carlo (DMC) calculations and associated input/output files.
36 MATERIALS SCIENCE↗
Large scale multi-node simulations of $\mathbb{Z}_2$ gauge theory quantum circuits using Google Cloud Platform
Simulating quantum field theories on a quantum computer is one of the most exciting fundamental physics applications of quantum information science. Dynamical time evolution of quantum fields is a challenge that is beyond the capabilities of classical computing, but it can teach us important lessons about the fundamental fabric of space and time. Whether we may answer scientific questions of interest using near-term quantum computing hardware is an open question that requires a detailed simulation study of quantum noise. Here we present a large scale simulation study powered by a multi-node implementation of qsim using the Google Cloud Platform. We additionally employ newly-developed GPU capabilities in qsim and show how Tensor Processing Units -- Application-specific Integrated Circuits (ASICs) specialized for Machine Learning -- may be used to dramatically speed up the simulation of large quantum circuits. We demonstrate the use of high performance cloud computing for simulating $\mathbb{Z}_2$ quantum field theories on system sizes up to 36 qubits. We find this lattice size is not able to simulate our problem and observable combination with sufficient accuracy, implying more challenging observables of interest for this theory are likely beyond the reach of classical computation using exact circuit simulation.
Gustafson, Erik↗
Towards Z-Next: The Integration of Theory, Experiments, and Computational Simulation in a Bayesian Data Assimilation Framework
Making reliable predictions in the presence of uncertainty is critical to high-consequence modeling and simulation activities, such as those encountered at Sandia National Laboratories. Surrogate or reduced-order models are often used to mitigate the expense of performing quality uncertainty analyses with high-fidelity, physics-based codes. However, phenomenological surrogate models do not always adhere to important physics and system properties. This project develops surrogate models that integrate physical theory with experimental data through a maximally-informative framework that accounts for the many uncertainties present in computational modeling problems. Correlations between relevant outputs are preserved through the use of multi-output or co-predictive surrogate models; known physical properties (specifically monotoncity) are also preserved; and unknown physics and phenomena are detected using a causal analysis. By endowing surrogate models with key properties of the physical system being studied, their predictive power is arguably enhanced, allowing for reliable simulations and analyses at a reduced computational cost.
97 MATHEMATICS AND COMPUTING↗
Explaining word embeddings with perfect fidelity: a case study in predicting research impact
The best-performing approaches for scholarly document quality prediction are based on embedding models. In addition to their performance when used in classifiers, embedding models can also provide predictions even for words that were not contained in the labelled training data for the classification model, which is important in the context of the ever-evolving research terminology. Although model-agnostic explanation methods, such as Local interpretable model-agnostic explanations, can be applied to explain machine learning classifiers trained on embedding models, these produce results with questionable correspondence to the model. We introduce a new feature importance method, Self-Model Entities Rated (SMER), for logistic regression-based classification models trained on word embeddings. We show that SMER has theoretically perfect fidelity with the explained model, as the average of logits of SMER scores for individual words (SMER explanation) exactly corresponds to the logit of the prediction of the explained model. Quantitative and qualitative evaluation is performed through five diverse experiments conducted on 50,000 research articles (papers) from the CORD-19 corpus. In conclusion, through an AOPC curve analysis, we experimentally demonstrate that SMER produces better explanations than LIME, SHAP and global tree surrogates.
Coarse-grained models↗
A practical approach to determine minimal quantum gate durations using amplitude-bounded quantum controls
Here, we present an iterative scheme to estimate the minimal duration in which a quantum gate can be realized while satisfying hardware constraints on the control pulse amplitudes. The scheme performs a sequence of unconstrained numerical optimal control cycles that each minimize the gate fidelity for a given gate duration alongside an additional penalty term for the control pulse amplitudes. After each cycle, the gate duration is adjusted based on the inverse of the resulting maximum control pulse amplitudes by re-scaling the dynamics to a new duration where control pulses satisfy the amplitude constraints. Those scaled controls then serve as an initial guess for the next unconstrained optimal control cycle, using the adjusted gate duration. We provide multiple numerical examples that each demonstrate fast convergence of the scheme toward a gate duration that is close to the quantum speed limit, given the control pulse amplitude bound. The proposed technique is agnostic to the underlying system and control Hamiltonian models, as well as the target unitary gate operation, making the time-scaling iteration an easy to implement and practically useful scheme for reducing the durations of quantum gate operations.
97 MATHEMATICS AND COMPUTING↗
Quantum Chemistry-Informed Active Learning to Accelerate the Design and Discovery of Sustainable Energy Storage Materials
Here we employed Density Functional Theory (DFT) to compute oxidation potentials of 1,400 homobenzylic ether molecules to search for the ideal sustainable redoxmer design. The generated data were used to construct an active learning model based on Bayesian optimization (BO) that targets candidates with desired oxidation potentials utilizing only a minimal number of DFT calculations. The active learning model demonstrated not only significant efficiency improvement over the random selection approach but also robust capability in identifying desired candidates in an untested set of 112,000 homobenzylic ether molecules. Our findings highlight the efficacy of quantum chemistry-informed active learning to accelerate the discovery of materials with desired properties from a vast chemical space.
25 ENERGY STORAGE↗
Competing ionization and dissociation: Extension of the energy-dependent frame transformation to the gerade symmetry of H 2
This article solves two major tasks that frequently arise in the theory of electron collisions with a target molecular cation. First, it extends the energy-dependent frame transformation (EDFT) treatment, which is needed to map fixed-nuclei electron-molecule scattering matrices into an energy-dependent laboratory-frame scattering matrix with vibrational channel indices. The EDFT mapping can now be carried out even when the target molecule possesses multiple low-energy potential curves, significantly transcending previous applications. Second, it implements a method to extract the rest of the full laboratory-frame scattering matrix, i.e., the columns and rows describing input and/or output dissociation channels. The treatment is benchmarked in this article against the essentially exact solution of a refined two-dimensional model of the singlet gerade Σ symmetry of H 2 . Our tests demonstrate that the theory accurately maps fixed-nuclei scattering information, of the type provided by existing electron-molecule computer codes, into a laboratory-frame scattering matrix that includes both ionization and dissociation. Furthermore, this treatment can provide a general framework applicable to a broad class of electron collision processes involving diatomic target ions, suitable for an accurate description of challenging processes such as dissociative recombination.
74 ATOMIC AND MOLECULAR PHYSICS↗
Computing nuclear response functions with time-dependent coupled-cluster theory
We compute nuclear response functions by solving the time-dependent 𝐴-body Schrödinger equation, recording the time-dependent transition moment and extracting spectral information via Fourier transforms. The solution of the time-dependent many-body problem accounts for correlations on top of the mean field by taking advantage of a time-dependent formulation of coupled-cluster theory. As a validation, we focus on electric dipole transitions in 4 He and 16 O and compare moments of the response function distribution to the results of an equivalent static framework, finding negligible discrepancies. We investigate how proton and neutron densities evolve in time, and we see the traditional picture of soft and giant dipole resonances as collective oscillations of protons and neutrons emerging from our calculations in 16 O and 24 O. Furthermore, this method also allows us to investigate the behavior of the nucleus in the presence of a strong electric field. In that regime, the behavior of the system becomes chaotic. Qualitatively, the spectral information obtained in this limit is in line with previous time-dependent mean-field results.
Ab initio calculations↗
Information-Theoretic Exploration of Multivariate Time-Varying Image Databases
Modern scientific simulations produce very large datasets, making interactive exploration of such data computationally prohibitive. An increasingly common data reduction technique is to store visualizations and other data extracts in a database. The Cinema project is one such approach, storing visualizations in an image database for post hoc exploration and interactive image-based analysis. This work focuses on developing efficient algorithms that can quantify various types of multivariate dependencies existing within multi-variable datasets. It applies specific mutual information measures for the quantification of salient regions from multivariate image data. Here, using such information measures, the opacity of the images is modulated so that the salient regions are automatically highlighted and the domain scientists can interactively explore the most relevant regions for scientific discovery.
97 MATHEMATICS AND COMPUTING↗
Tools for analysis of optimization models
The software is code for analyzing, debugging, and solving optimization models. The code implements several algorithms and provides convenient APIs to apply these algorithms to optimization models. The algorithms are primarily based on graph theory. They compute well-known partitions of graphs, and use these partitions to provide the user information about their optimization model, including diagnosing certain types of structural modeling errors. Some algorithms may be used as a subroutine to solve an optimization problem, and may call an optimization solver to facilitate this. Well-known linear algebra routines are called to provide further diagnostics. The software contains no data and no models other than toy models used for testing.
Parker, Robert↗
Diffusion Codes: Self-Correction from Small(er)-Set Expansion with Tunable Non-locality
Optimal constructions of classical LDPC codes can be obtained by choosing the Tanner graph uniformly at random among biregular graphs. We introduce a class of codes that we call ``diffusion codes'', defined by placing each edge connecting bits and checks on some graph, and acting on that graph with a random SWAP network. By tuning the depth of the SWAP network, we can tune a tradeoff between the amount of randomness -- and hence the optimality of code parameters -- and locality with respect to the underlying graph. For diffusion codes defined on the cycle graph, if the SWAP network has depth $\sim Tn$ with $T> n^{2β}$ for arbitrary $β>0$, then we prove that almost surely the Tanner graph is a lossless ``smaller set'' vertex expander for small sets up size $δ\sim \sqrt T \sim n^β$, with bounded bit and check degree. At the same time, the geometric size of the largest stabilizer is bounded by $\sqrt T$ in graph distance. We argue, based on physical intuition, that this result should hold more generally on arbitrary graphs. By taking hypergraph products of these classical codes we obtain quantum LDPC codes defined on the torus with smaller-set boundary and co-boundary expansion and the same expansion/locality tradeoffs as for the classical codes. These codes are self-correcting and admit single-shot decoding, while having the geometric size of the stabilizer growing as an arbitrarily small power law. Our proof technique establishes mixing of a random SWAP network on small subsystems at times scaling with only the subsystem size, which may be of independent interest.
Combinatorics (math.CO)↗