Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed quantum computing”

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 253 records · Page 14

Cluster truncated Wigner approximation in strongly interacting systems

We present a general method by which linear quantum Hamiltonian dynamics with exponentially many degrees of freedom is replaced by approximate classical nonlinear dynamics with the number of degrees of freedom (phase space dimensionality) scaling polynomially in the system size. This method is based on generalization of the truncated Wigner approximation (TWA) to a higher dimensional phase space, where phase space variables are associated with a complete set of quantum operators spanning finite size clusters. The method becomes asymptotically exact with increasing cluster size. The crucial feature of TWA is fluctuating initial conditions, which we approximate by a Gaussian distribution. We show that such fluctuations dramatically increase accuracy of TWA over traditional cluster mean-field approximations. In this way we can treat on equal footing quantum and thermal fluctuations as well as compute entanglement and various equal and non-equal time correlation functions. The main limitation of the method is exponential scaling of the phase space dimensionality with the cluster size, which can be significantly reduced by using the language of Schwinger bosons and can likely be further reduced by truncating the local Hilbert space variables. We demonstrate the power of this method analyzing dynamics in various spin chains with and without disorder and show that we can capture such phenomena as long time hydrodynamic relaxation, many-body localization and the ballistic spread of entanglement.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Microwave-photonic control of optically accessible spin defects in diamond

A growing variety of optically accessible spin qubits have emerged in recent years as key components for quantum sensors, computers, and memories. However, the scalability of conventional spin-based quantum architectures remains limited by direct microwave delivery, which introduces thermal noise, electromagnetic crosstalk, and design constraints for cryogenic, high-field, and distributed systems. In this work, we present a unified framework for RF-over-fiber (RFoF) control of spins accessible through optically detected magnetic resonance (ODMR) spectroscopy of nitrogen-vacancy (NV) centers in diamond. The RFoF platform relies on an intensity-modulated 1310 nm laser carrying microwave signals over fiber and a high-speed photodiode for optical-to-electrical conversion to drive NV spin transitions. We report an RFoF power-conversion efficiency of 3.42% for an RF output PRF,out=-5.5 dBm at 2.87 GHz, enabling clear resolution of Zeeman splitting in

Rahman, M Reefaz [ORNL] (ORCID:0000000323541611)↗

Quantum-Inspired Bayesian Sampling for Uncertainty Quantification and Machine Learning (Final Technical Report)

With increasing simulation and measurement data, machine learning and artificial intelligence have been widely used in computational decision-making of complex engineering systems. The resulting tools, such as uncertainty quantification solvers, reinforcement learning, and physics-informed machine learning, have achieved great success in critical DOE tasks such as material discovery and design, energy system modeling and control, and numerical weather and climate prediction. A core topic in scientific machine learning and artificial intelligence is Bayesian inference: given an observed data set, people want to estimate the posterior distribution of a (possibly large) number of hidden parameters. Due to the flexibility and weak assumptions, Bayesian sampling has been the mainstream Bayesian inference solvers despite the rapid progress of approximate Bayesian inference. Classical Bayesian sampling methods such as Markov-chain Monte Carlo suffer from a low-acceptance rate due to the random walk nature, therefore state-of-the-art techniques use Hamiltonian Monte Carlo and its variants to efficiently draw posterior samples in a high dimension. The key idea of Hamiltonian Monte Carlo and its variants is to simulate the Hamiltonian dynamics of a classical particle with a fixed mass, and their performance significantly degrades when the posterior distribution is highly spiky or has multiple modes. Leveraging the idea of quantum physics, this project has investigated new theory, algorithms and applications of Bayesian inference (especially Bayesian sampling). The main results include: (1) novel quantum-inspired Bayesian sampling methods that can lead to better accuracy for challenging multi-modal or spiky distributions, (2) more scalable machine learning framework leveraging tensor-compressed Bayesian inference, and (3) Bayesian and sampling approaches for verifying the robustness of continuous and binary neural networks.

97 MATHEMATICS AND COMPUTING↗

Nuclear Computational Low Energy Initiative (NUCLEI)

This is the final report for University of Washington for the NUCLEI SciDAC-3. The NUCLEI -project, as defined by the scope of work, will develop, implement and run codes for large-scale computations of many topics in low-energy nuclear physics. Physics to be studied include the properties of nuclei and nuclear decays, nuclear structure and reactions, and the properties of nuclear matter. The computational techniques to be used include Quantum Monte Carlo, Configuration Interaction, Coupled Cluster, and Density Functional methods. The research program will emphasize areas of high interest to current and possible future DOE nuclear physics facilities, including ATLAS and FRIB (nuclear structure and reactions, and nuclear astrophysics), TJNAF (neutron distributions in nuclei, few body systems, and electroweak processes), NIF (thermonuclear reactions), MAJORANA and FNPB (neutrino-less double-beta decay and physics beyond the Standard Model), and LANSCE (fission studies).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Ultrafast valley polarization in bilayer graphene

We study theoretically the interaction of a bilayer graphene with a circularly polarized ultrafast optical pulse of a single oscillation at an oblique incidence. The normal component of the pulse breaks the inversion symmetry of the system and opens up a dynamical bandgap due to which a valley-selective population of the conduction band becomes sensitive to the angle of incident of the pulse. We show that the magnitude of the valley polarization can be controlled by the angle of incidence, the amplitude, and the angle of in-plane polarization of the chiral optical pulse. Subsequently, a sequence of a circularly polarized pulse followed by a linearly polarized femtosecond-long pulse can be used to control and probe the valley polarization created by the preceding pulse. Our protocol provides a favorable platform to design ultrafast all-optical valleytronic information processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

From Optimization to Sampling Through Gradient Flows

Optimization and sampling algorithms play a central role in science and engineering as they enable finding optimal predictions, policies, and recommendations, as well as expected and equilibrium states of complex systems. The notion of “optimality” is formalized by the choice of an objective function, while the notion of an “expected” state is specified by a probabilistic model for the distribution of states. Optimizing rugged objective functions and sampling multimodal distributions is computationally challenging, especially in high-dimensional problems. Here, for this reason, many optimization and sampling methods have been developed by researchers working in disparate fields such as Bayesian statistics, molecular dynamics, genetics, quantum chemistry, machine learning, weather forecasting, econometrics, and medical imaging.

Trillos, N. García↗

Motion Planning Algorithms for Safety and Quantum Computing Efficiency

Motion planning remains a fundamental problem in robotics. Sampling-based algorithms use randomization to allow efficient solutions to this complex problem. As mobile robots and autonomous vehicles become more prevalent in everyday life, motion planning must be applied to increasingly challenging scenarios. Safety has become a paramount concern in motion planning for ensuring robotic applications enrich human lives. To date, many motion planning techniques to increase safety in the face of uncertain and dynamic environments have been developed. This dissertation first addresses distributional safety of Rapidly-Exploring Random Trees (RRT) through our algorithm W-Safe RRT. To acknowledge distributional uncertainty and poor modeling, W-Safe RRT uses the Wasserstein metric to provide a probabilistic bound on the distributional distance between a robot and obstacles. Human-interpretable environmental agent classification allows online safety margin adaptation. We propose and analyze an integrating region method for online classification that increases actor labeling accuracy based on behavioral feature values when compared to state of the art methods. The method performs class assignments based on local maximum likelihood in a created behavioral feature-space, allowing a notion of classification uncertainty. Model-based methods with safety guarantees can quickly become computationally in tractable, especially with multiple agents, higher dimensions, and plentiful unknowns. Sampling based algorithms have been parallelized for computation with multi-core computers and GPUs. We consider the use of quantum algorithms and computers for sampling-based motion planning for the first time. Quantum computing performs operations on superpositions of states and can solve certain problems much more efficiently than classical computers, but introduces previously unseen challenges. With Quantum-RRT, we recast the motion planning problem into a database-search structure and use Quantum Amplitude Amplification to find reachable states in the database with a quadratic performance increase over classical methods. We address two error sources with this method: quantum measurement and quantum oracle errors. We then extend this method to Parallel Quantum-RRT, which uses a manager-worker architecture with multiple parallel quantum workers to increase database search efficiency. We compare algorithm architectures and characterize probabilities of multiple workers finding solutions. Lastly, we test in simulation the quantum algorithms against classical versions in a wide variety of scenarios, concluding that a similar parallelization improvement is to be found in the quantum case as was found in the parallelization of classical RRT.

97 MATHEMATICS AND COMPUTING↗

Super-transient scaling in time-delay autonomous Boolean network motifs

Autonomous Boolean networks are commonly used to model the dynamics of gene regulatory networks and allow for the prediction of stable dynamical attractors. However, most models do not account for time delays along the network links and noise, which are crucial features of real biological systems. Concentrating on two paradigmatic motifs, the toggle switch and the repressilator, we develop an experimental testbed that explicitly includes both inter-node time delays and noise using digital logic elements on field-programmable gate arrays. We observe transients that last millions to billions of characteristic time scales and scale exponentially with the amount of time delays between nodes, a phenomenon known as super-transient scaling. We develop a hybrid model that includes time delays along network links and allows for stochastic variation in the delays. Using this model, we explain the observed super-transient scaling of both motifs and recreate the experimentally measured transient distributions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Equation of State Optimization and Uncertainty Quantization: Implementation in the LANL EOS Production Code OpenSesame

We detail the approaches of particle swarm optimization and Bayesian inference through Markov chain Monte Carlo for equation of state development. This work includes formulation of the modeling for the equation of state, numeric optimization of the parametric models via particle swarm optimization, and generation of probability distributions of equations of state from Markov chain Monte Carlo.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data center thermal management

Historical high-spatial-resolution temperature data and dynamic temperature sensor measurement data may be used to predict temperature. A first formulation may be derived based on the historical high-spatial-resolution temperature data for determining a temperature at any point in 3-dimensional space. The dynamic temperature sensor measurement data may be calibrated based on the historical high-spatial-resolution temperature data at a corresponding historical time. Sensor temperature data at a plurality of sensor locations may be predicted for a future time based on the calibrated dynamic temperature sensor measurement data. A three-dimensional temperature spatial distribution associated with the future time may be generated based on the forecasted sensor temperature data and the first formulation. The three-dimensional temperature spatial distribution associated with the future time may be projected to a two-dimensional temperature distribution, and temperature in the future time for a selected space location may be forecasted dynamically based on said two-dimensional temperature distribution.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Nuclear Computational Low Energy Initiative (NUCLEI)

This is the Final Report for Ohio State University for the NUCLEI SciDAC­3 project. In addition to the local OSU summary given here, we have attached a global NUCLEI summary and a list of papers and talks by the full collaboration, with OSU contributions marked in red. The NUCLEI project, as defined by the scope of work, developed, implemented and ran codes for large­scale computations of many topics in low­energy nuclear physics. Physics studied included the properties of nuclei and nuclear decays, nuclear structure and reactions, and the properties of nuclear matter. The computational techniques used included Quantum Monte Carlo, Configuration Interaction, Coupled Cluster, In­Medium SRG, and Density Functional methods. The research program emphasized areas of high interest to current and possible future DOE nuclear physics facilities, including ATLAS and FRIB (nuclear structure and reactions, and nuclear astrophysics), TJNAF (neutron distributions in nuclei, few body systems, and electroweak processes), NIF (thermonuclear reactions), MAJORANA and FNPB (neutrinoless double­beta decay and physics beyond the Standard Model), and LANSCE (fission studies). Research at Ohio State University played an integral role in NUCLEI by providing input microscopic interactions and operators needed for ab initio structure and reaction calculations including uncertainty quantification, independent ab initio calculations using the in­medium similarity renormalization group (IM­SRG), and developing microscopic constraints for the next­generation energy density functionals (EDF). Much of the theoretical work at OSU was closely coordinated with the theory team at Michigan State University. Although the OSU group did not usually directly develop codes for the highest performance computing components of NUCLEI, we provided needed inputs for much of the effort. In particular, our work contributes to the “Validated Nuclear Interactions” task as well as to both of the “Structure and Reactions” tasks.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Deep learning of electrochemical CO 2 conversion literature reveals research trends and directions

Large-scale and openly available material science databases are mainly composed of computer simulation results rather than experimental data. Some examples include the Materials Project, Open Quantum Materials Database, and Open Catalyst 2022. Unfortunately, building large-scale experimental databases remains challenging due to the difficulties in consolidating locally distributed datasets. In this work, focusing on the catalysis literature of CO 2 reduction reactions (CO 2 RRs), we present a machine learning (ML)-based protocol for selecting highly relevant papers and extracting important experimental data. First, we report a document embedding method (Doc2Vec) for collecting papers of greatest relevance to the specific target domain, which yielded 3154 CO 2 RR-related papers from six publishers. Next, we developed named entity recognition (NER) models to extract twelve entities related to material names (catalyst, electrolyte, etc.) and catalytic performance (Faradaic efficiency, current density, etc.). Further, among several tested models, the MatBERT-based approach achieved the highest accuracy, with an average F1-score of 90.4% and an F1-score of 95.2% in a boundary relaxation evaluation scheme. The accurate and accelerated NER-based data extraction from a large volume of catalysis literature enables temporal trend analyses of the CO 2 RR catalysts, products, and performances, revealing the potentially effective material space in CO 2 RRs. While this work demonstrates the effectiveness of our ML-based text mining methods for specifically CO 2 RR literature, the methods and approach are applicable to and may be used to accelerate the development of other catalytic chemical reactions.

36 MATERIALS SCIENCE↗

Transverse-momentum-dependent pion structures from lattice QCD: Collins-Soper kernel, soft factor, TMDWF, and TMDPDF

We present the first lattice quantum chromodynamics (QCD) calculation of the pion valence-quark transverse-momentum-dependent parton distribution function (TMDPDF) within the framework of large-momentum effective theory (LaMET). Using correlators fixed in the Coulomb gauge (CG), we computed the quasi-TMD beam function for a pion with a mass of 300 MeV, a fine lattice spacing of 𝑎 =0.06 fm, and multiple large momenta up to 3 GeV. The intrinsic soft functions in the CG approach are extracted from form factors with large momentum transfer, and as a byproduct, we also obtain the corresponding Collins-Soper (CS) kernel. Our determinations of both the soft function and the CS kernel agree with perturbation theory at small transverse separations (𝑏 ⊥ ) between the quarks. At larger 𝑏 ⊥ , the CS kernel remains consistent with recent results obtained using both CG and gauge-invariant TMD correlators in the literature. By combining next-to-leading logarithmic factorization of the quasi-TMD beam function and the soft function, we obtain an 𝑥-dependent pion valence-quark TMDPDF for transverse separations 𝑏 ⊥ ≳1 fm. Interestingly, we find that the 𝑏 ⊥ dependence of the phenomenological parametrizations of TMDPDF for moderate values of 𝑥 are in reasonable agreement with our QCD determinations. In addition, we present results for the transverse-momentum-dependent wave function for a heavier pion with 670 MeV mass.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A simple data-driven level finding method of many-electron atoms and heavy nuclei based on statistical outlier detection

Here, we report a simple and pure data-driven method to find new energy levels of quantum many-body systems only from observed line wavelengths. In our method, all the possible combinations are computed from known energy levels and wavelengths of unidentified lines. As each excited state exhibits many transition lines to different lower levels, the true levels should be reconstructed coincidentally from many level-line combinations, while the wrong combinations distribute randomly. Such a coincidence can be easily detected statistically. We demonstrate this statistical method by finding new levels for various atomic and nuclear systems from unidentified line lists available online.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discrete velocity computations with stochastic variance reduction of the Boltzmann equation for gas mixtures

We extend a variance reduced discrete velocity method developed at UT Austin [1, 2] to gas mixtures with large mass ratios and flows with trace species. The mixture is stored as a collection of independent velocity distribution functions, each with a unique grid in velocity space. Different collision types (A-A, A-B, B-B, etc.) are treated independently, and the variance reduction scheme is formulated with different equilibrium functions for each separate collision type. The individual treatment of species enables increased focus on species important to the physics of the flow, even if the important species are present in trace amounts. The method is verified through comparisons to Direct Simulation Monte Carlo computations and the computational workload per time step is investigated for the variance reduced method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Systematic Uncertainties from Gribov Copies in Lattice Calculation of Parton Distributions in the Coulomb Gauge

Recently, a new method has been proposed to compute parton distributions using boosted correlators fixed in the Coulomb gauge (CG) within the framework of large-momentum effective theory. This approach, which does not involve Wilson lines, could greatly improve the efficiency and precision of lattice quantum chromodynamics calculations. However, concerns remain regarding whether systematic uncertainties from Gribov copies, which correspond to ambiguities in lattice gauge-fixing, are adequately controlled. This work assesses the effects of Gribov copies on Coulomb-gauge-fixed quark correlators. We utilize different strategies for Coulomb-gauge fixing, selecting two different groups of Gribov copies based on lattice gauge configurations. We examine the differences in the resulting spatial quark correlators in both vacuum and pion states. Our findings indicate that the statistical errors of the matrix elements from both Gribov copies, regardless of the correlation range, decrease proportionally to the square root of the number of gauge configurations. The difference between the strategies does not show statistical significance compared to the gauge noise, demonstrating that the effect of the Gribov copies can be neglected in practical lattice calculations of quark parton distributions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

We provide a polynomial-time classical algorithm for noisy quantum circuits. The algorithm computes the expectation value of any observable for any circuit, with a small average error over input states drawn from an ensemble (e.g., the computational basis). Our approach is based upon the intuition that noise exponentially damps nonlocal correlations relative to local correlations. This enables one to classically simulate a noisy quantum circuit by keeping track of only the dynamics of local quantum information. Our algorithm also enables sampling from the output distribution of a circuit in quasipolynomial time, so long as the distribution anticoncentrates. A number of implications are discussed, including a fundamental limit on the efficacy of noise mitigation strategies: For constant noise rates, any quantum circuit for which error mitigation succeeds in polynomial-time on most input states can also be classically simulated in polynomial-time on most input states. Our algorithms scale exponentially in the inverse noise rate, which is fundamental and makes them impractical for current quantum devices.

decoherence↗