Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum distributed 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.

50 records · Page 3

Fokker-Planck Equation Governing the Distribution of Walkers in Auxiliary-Field Quantum Monte Carlo

Auxiliary-field quantum Monte Carlo (AFQMC) is typically formulated as an open-ended random walk in an overcomplete space of Slater determinants, implemented through a Langevin equation. However, the explicit form of the underlying Fokker-Planck equation governing the walker population distribution has remained unknown. Here, in this Letter, we derive the Fokker-Planck equation for AFQMC and propose a novel numerical scheme to solve it. The solution of the Fokker-Planck equation reveals the wave function actually sampled by the AFQMC algorithm. Interestingly, we find that even when the exact ground state is used as a guiding wave function in constrained path AFQMC, contrary to the common assumption, the wave function sampled by AFQMC is not exact. Beyond clarifying several fundamental aspects of AFQMC, the availability of a Fokker-Planck equation formulation opens new avenues for systematically improving its accuracy, which we outline in this Letter.

Monte Carlo methods↗

Identifiability and characterization of transmon qutrits through Bayesian experimental design

Robust control of a quantum system is essential to utilize the current noisy quantum hardware to its full potential, such as quantum algorithms. To achieve such a goal, a systematic search for an optimal control for any given experiment is essential. The design of optimal control pulses requires accurate numerical models and, therefore, accurate characterization of the system parameters. We present an online Bayesian approach for quantum characterization of qutrit systems, which automatically and systematically identifies optimal experiments that provide maximum information on the system parameters, thereby greatly reducing the number of experiments that need to be performed on the quantum testbed. Unlike most characterization protocols that provide point-estimates of the parameters, the proposed approach is able to estimate their probability distribution. The applicability of the Bayesian experimental design technique was demonstrated on test problems, where each experiment was defined by a parameterized control pulse. In addition to this, we also present an approach for iterative pulse extension, which is robust under uncertainties in transition frequencies and coherence times, and shot noise, despite being initialized with wide uninformative priors. Furthermore, we provide a mathematical proof of the theoretical identifiability of the model parameters and present conditions on the quantum state under which the parameters are identifiable. The proof and conditions for identifiability are presented for both closed and open quantum systems using the Schrödinger equation and the Lindblad master equation, respectively.

97 MATHEMATICS AND COMPUTING↗

Jet fragmentation function and groomed substructure of bottom quark jets in proton-proton collisions at 5.02 TeV

A measurement of the substructure of bottom quark jets (b jets) in proton-proton (pp) collisions is presented. The measurement uses data collected in pp collisions at $\sqrt{s}=5.02$ TeV, with a low number of simultaneous interactions per bunch crossing, recorded by the CMS experiment in 2017, corresponding to an integrated luminosity of 301 pb −1 . An algorithm to identify and cluster the charged decay daughters of b hadrons is developed for this analysis, which facilitates the exposure of the gluon radiation pattern of b jets using iterative Cambridge-Aachen declustering. The soft-drop-groomed jet radius, R g , and momentum balance, z g , of b quark jets are presented. These observables can be used to test perturbative quantum chromodynamics predictions that account for mass effects. Because the b hadron is partially reconstructed from its charged decay daughters, only charged particles are used for the jet substructure studies. In addition, a jet fragmentation function, z b,ch , is measured, which is defined as the distribution of the ratio of the transverse momentum (p T ) of the partially reconstructed b hadron with respect to the charged-particle component of the jet p T . The substructure variable distributions are unfolded to the charged-particle level. The b jet substructure is compared to the substructure of jets in an inclusive jet sample that is dominated by light-quark and gluon jets in order to assess the role of the b quark mass. A strong suppression of emissions at small R g values is observed for b jets when compared to inclusive jets, consistent with the dead-cone effect. The measurement is also compared with theoretical predictions from Monte Carlo event generators. This is the first substructure measurement of b jets that clusters together the b hadron decay daughters independent of the b hadron species and decay channel.

boosted jets↗

Measurement of multidifferential cross sections for dijet production in proton–proton collisions at $\sqrt{s}$ = 13 TeV

A measurement of the dijet production cross section is reported based on proton–proton collision data collected in 2016 at $\sqrt{s}$ = 13 TeV by the CMS experiment at the CERN LHC, corresponding to an integrated luminosity of up to 36.3 fb –1 . Jets are reconstructed with the anti-$k$ T algorithm for distance parameters of R = 0.4 and 0.8. Cross sections are measured double-differentially (2D) as a function of the largest absolute rapidity |y| max of the two jets with the highest transverse momenta $p$ T and their invariant mass $m$ 1,2 , and triple-differentially (3D) as a function of the rapidity separation $y$*, the total boost $y$ b , and either $m$ 1,2 or the average $p$ T of the two jets. The cross sections are unfolded to correct for detector effects and are compared with fixed-order calculations derived at next-to-next-to-leading order in perturbative quantum chromodynamics. The impact of the measurements on the parton distribution functions and the strong coupling constant at the mass of the Z boson is investigated, yielding a value of $α$ S ($m$ Z ) = 0.1179 ± 0.0019.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient quantum simulation of QCD jets on the light front

Quark and gluon jets provide one of the best ways to probe the matter produced in ultrarelativistic high-energy collisions, from cold nuclear matter to hot quark-gluon plasma. In this work, we propose a unified framework for efficient quantum simulation of many-body dynamics using the ( 3 + 1 )-dimensional QCD Hamiltonian on the light front, particularly suited for studying the scattering of quark and gluon jets on nuclear matter in heavy-ion collisions. We describe scalable methods for mapping physical degrees of freedom onto qubits and for simulating in-medium jet evolution. We then validate our framework by implementing an algorithm that directly maps second-quantized Fock states onto qubits and uses Trotterized simulation for simulating time dynamics. Using a classical emulator, we investigate the evolution of quark and gluon jets with up to three particles in Fock states, extending prior studies. These calculations enable the study of key observables, including jet momentum broadening, particle production, and parton distribution functions. Published by the American Physical Society 2025

Qian, Wenyang (ORCID:0000000155250996)↗

Scaling whole-chip QAOA for higher-order ising spin glass models on heavy-hex graphs

Abstract We show that the quantum approximate optimization algorithm (QAOA) for higher-order, random coefficient, heavy-hex compatible spin glass Ising models has strong parameter concentration across problem sizes from 16 up to 127 qubits for p = 1 up to p = 5, which allows for computationally efficient parameter transfer of QAOA angles. Matrix product state (MPS) simulation is used to compute noise-free QAOA performance. Hardware-compatible short-depth QAOA circuits are executed on ensembles of 100 higher-order Ising models on noisy IBM quantum superconducting processors with 16, 27, and 127 qubits using QAOA angles learned from a single 16-qubit instance using the JuliQAOA tool. We show that the best quantum processors find lower energy solutions up to p = 2 or p = 3, and find mean energies that are about a factor of two off from the noise-free distribution. We show that p = 1 QAOA energy landscapes remain very similar as the problem size increases using NISQ hardware gridsearches with up to a 414 qubit processor.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spinor representations for fields with any spin: Lorentz tensor basis for operators and covariant multipole decomposition

This paper discusses a framework to parametrize and decompose operator matrix elements for particles with higher spin (j > 1/2) using chiral representations of the Lorentz group, i.e. the (j, 0) and (0, j) representations and their parity-invariant direct sum. Unlike traditional approaches that require imposing constraints to eliminate spurious degrees of freedom, these chiral representations contain exactly the 2j + 1 components needed to describe a spin-j particle. The central objects in the construction are the t-tensors, which are generalizations of the Pauli four-vector σ μ for higher spin. For the generalized spinors of these representations, we demonstrate how the algebra of the t-tensors allows to formulate a generalization of the Dirac matrix basis for any spin. For on-shell bilinears, we show that a set consisting exclusively of covariant multipoles of order 0 ≤ m ≤ 2j forms a complete basis. We provide explicit expressions for all bilinears of the generalized Dirac matrix basis, which are valid for any spin value. As a byproduct of our derivations we present an efficient algorithm to compute the t-tensor matrix elements. The formalism presented here paves the way to use a more unified approach to analyze the non-perturbative QCD structure of hadrons and nuclei across different spin values, with clear physical interpretation of the resulting distributions as covariant multipoles.

Angular momentum of light↗

Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System

Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum computing technologies are progressing towards a fault tolerant era, however they all face a diverse set of challenges in scalability and control. Recent efforts have focused on multi-node quantum systems that connect multiple smaller quantum devices to execute larger circuits. Future demonstrations hope to use quantum channels to couple systems, however current demonstrations can leverage classical communication with circuit cutting techniques. This involves cutting large circuits into smaller subcircuits and reconstructing them post-execution. However, existing cutting methods are hindered by lengthy search times as the number of qubits and gates increases. Additionally, they often fail to effectively utilize the resources of various worker configurations in a multi-node system. To address these challenges, we introduce FitCut, a novel approach that transforms quantum circuits into weighted graphs and utilizes a community-based, bottom-up approach to cut circuits according to resource constraints, e.g., qubit counts, on each worker. FitCut also includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms the Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 3.88 times on the worker side, achieving a system-wide improvement of 2.86 times.

Kan, Shuwen [Fordham University]↗

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Measurement of jet substructure in boosted $t\overline{t}$ events with the ATLAS detector using 140 fb -1 of 13 TeV $pp$ collisions

Measurements of the substructure of top-quark jets are presented, using 140 fb -1 of 13 TeV pp collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-k t algorithm with a radius parameter R = 1.0 are selected in top-quark pair ($t\overline{t}$) events where one top quark decays semileptonically and the other hadronically, or where both top quarks decay hadronically. The top-quark jets are required to have transverse momentum p T > 350 GeV, yielding large samples of data events with jet p T values between 350 and 600 GeV. One- and two-dimensional differential cross sections for eight substructure variables, defined using only the charged components of the jets, are measured in a particle-level phase space by correcting for the smearing and acceptance effects induced by the detector. The differential cross sections are compared with the predictions of several Monte Carlo simulations in which top-quark pair-production quantum chromodynamic matrix-element calculations at next-to-leading-order precision in the strong coupling constant α S are passed to leading-order parton shower and hadronization generators. The Monte Carlo predictions for measures of the broadness, and also the two-body structure, of the top-quark jets are found to be in good agreement with the measurements, while variables sensitive to the three-body structure of the top-quark jets exhibit some tension with the measured distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Universal energy-speed-accuracy trade-offs in driven nonequilibrium systems

The connection between measure theoretic optimal transport and dissipative nonequilibrium dynamics provides a language for quantifying nonequilibrium control costs, leading to a collection of thermodynamic speed limits, which rely on the assumption that the target probability distribution is perfectly realized. This is almost never the case in experiments or numerical simulations, so here we address the situation in which the external controller is imperfect. We obtain a lower bound for the dissipated work in generic nonequilibrium control problems that (1) is asymptotically tight and (2) matches the thermodynamic speed limit in the case of optimal driving. Along with analytically solvable examples, we refine this imperfect driving notion to systems in which the controlled degrees of freedom are slow relative to the nonequilibrium relaxation rate, and identify independent energy contributions from fast and slow degrees of freedom. Furthermore, we develop a strategy for optimizing minimally dissipative protocols based on optimal transport flow matching, a generative machine learning technique. Furthermore, this latter approach ensures the scalability of both the theoretical and computational framework we put forth. Crucially, we demonstrate that we can compute the terms in our bound numerically using efficient algorithms from the computational optimal transport literature and that the protocols we learn saturate the bound.

59 BASIC BIOLOGICAL SCIENCES↗

Mixed stochastic-deterministic density functional theoretic decomposition of Kubo–Greenwood conductivities in the projector augmented wave formalism

Pairing the accuracy of the Kohn–Sham density-functional framework with the efficiency of a stochastic algorithmic approach, mixed stochastic-deterministic density functional theory (mDFT) achieves a favorable computational scaling with system sizes and electronic temperatures. We employ the recently developed mDFT formalism to investigate the dynamic charge-transport properties of systems in the warm dense matter regime. The optical conductivity spectra are computed for single- and multi- component mixtures of carbon, hydrogen, and beryllium using two complementary approaches: Kubo–Greenwood in the mDFT picture and real-time time-dependent mDFT. We further devise a decomposition of the Onsager coefficients leading up to the Kubo–Greenwood spectra to exhibit contributions from the deterministic, stochastic, and mixed electronic state transitions at different incident photon energies.

36 MATERIALS SCIENCE↗

Shadow molecular dynamics for flexible multipole models

Shadow molecular dynamics provide an efficient and stable atomistic simulation framework for flexible charge models with long-range electrostatic interactions. Shadow molecular dynamics simulations are driven by approximate “shadow” Born–Oppenheimer potentials for which the exact charges and forces are directly accessible without relying on costly (and approximate) iterative solvers. While previous implementations have been limited to atomic monopole charge distributions, we extend this approach to flexible multipole models. We derive detailed expressions for the shadow energy functions, potentials, and force terms, explicitly incorporating monopole–monopole, dipole–monopole, and dipole–dipole interactions. In our formulation, both atomic monopoles and atomic dipoles are treated as extended dynamical variables alongside the propagation of the nuclear degrees of freedom. We demonstrate that introducing the additional dipole degrees of freedom preserves the stability and accuracy previously seen in monopole-only shadow molecular dynamics simulations. In addition, we present a shadow molecular dynamics scheme where the monopole charges are held fixed while the dipoles remain flexible. Our extended shadow dynamics provide a framework for stable, computationally efficient, and versatile molecular dynamics simulations involving long-range interactions between flexible multipoles. This is of particular current interest in combination with machine-learned interatomic potentials, including long-range electrostatic interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

HydraGNN_Predictive_GFM_2024 - Ensemble of predictive graph foundation models for ground state atomistic materials modeling

We provide the ensemble of fifteen pre-trained graph foundation models (GFMs) for atomistic materials modeling applications. Each one of the fifteen GFMs has been trained on five open-source datasets that (once aggregated) amount to over 154 million atomistic structures, which cover over two-thirds of the natural elements of the periodic table and that comprises a broad set of organic and inorganic compounds. This vast set of atomistic structures comprises ground state configurations that are dynamically stable (i.e., equilibrated structures with atomic forces approximately close to zero values) as well as dynamically unstable structures (i.e., non-equilibrium structures with non-negligible non-zero values of atomic forces). The ensemble of datasets aggregated does NOT include excited states. The datasets have been curated to remove atomistic structures with spectral norm of the force tensor above 100 eV/angstrom. Moreover, a linear term of the energy was computed for each dataset using a linear regression model that uses the chemical concentration of each natural element as regressor. The linear term predicted by the linear regression model has been subtracted from each original energy value to perform a re-alignment of the energy values across different electronic structures approximation theories performed to generate the diverse multi-source, multi-fidelity datasets. The folder "ADIOS_files" contains the set of pre-processed datasets in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used for the development and training of GFMs in this work. The "ADIOS_files" directory contains 6 sub-directories named as follows: - ANI1x-v3.bp - MPTrj-v3.bp - OC2020-20M-v3.bp - OC2020-v3.bp - OC2022-v3.bp - qm7x-v3.bp Each sub-directory contains the pre-processed datasets converted in Adaptable I/O System (ADIOS) format (https://www.exascaleproject.org/research-project/adios/) that have been used to the development, training, and performance testing of the ensemble go predictive graph foundation models. Each GFM was developed using HydraGNN (https://github.com/ORNL/HydraGNN) as underlying graph neural network (GNN) architecture. The multi-task learning (MTL) capability of HydraGNN was used to simultaneously train the GFMs on labeled values for direct predictions of energy (a total system property of an atomistic structure that measures the chemical stability) and atomic forces (an atomic level property of an atomistic structure that measures the dynamical stability). The hyper parameters of the GFM have been tuned using scalable hyperparameter optimization (HPO) algorithms implemented in the software DeepHyper (https://github.com/deephyper/deephyper). The pre-training of each HPO trial was performed using distributed data parallelism (DDP) to scale the training across 128 compute nodes of the exascale OLCF supercomputer Frontier. Each HPO trial was trained only for 10 epochs and an early stopping was performed to avoid wasting significant computational resources on GNN architectures that were clearly underperforming. For each HPO trial, the 'omnistat' tool developed by (AMD Research - Advanced Micro Device) was used to measure the total energy consumption in kWh. The ensemble of GFMs was obtained by selecting the fifteen best performing HPO trials. Four models have been selected for their clear advantage in accuracy, and these are the GFMs with IDs 229, 156, 147, 260. Additional eleven models have been selected based on judicious balance between accuracy and energy consumption needed for training, and these are the GFMs with IDs 165, 78, 137, 1, 175, 171, 181, 67, 179, 167, 351. Each selected GFM of the ensemble was continued to cumulate a total of at most 30 epochs. In some cases, the total number of epochs actually performed was les than 30 due to two combined factors: (1) the size of the GFM (i.e., the number of model parameters to train) and (2) the total wall-clock time for which the computational resources could be allocated on OLCF-Frontier. The "Ensemble_of_models" directory contains 15 sub-directories named as follows: - gfm_0.229 - gfm_0.156 - gfm_0.147 - gfm_0.260 - gfm_0.165 - gfm_0.78 - gfm_0.137 - gfm_0.1 - gfm_0.175 - gfm_0.171 - gfm_0.181 - gfm_0.67 - gfm_0.179 - gfm_0.167 - gfm_0.351 Each one of these sub-directories refers to one of the fifteen HPO trials that have been selected to continue the pre-training with at most 30 epochs. With each sub-directory associated with a specific HPO trial, the following files can be found: - config.json: file for argument parsing to develop and train an HydraGNN architecture - gfm_0.ID_epoch_N.pk: file with model parameters for HPO ID trial after N epochs of training The ensemble of fifteen GFM architectures was used for (1) ensemble averaging to stabilize the predictions of energy and atomic forces after pre-training for post-processing analysis and (2) ensemble uncertainty quantification (UQ). The code used to develop, pre-train, and load the pre-trained models for post-processing analysis is available on the ORNL-GitHub at the following link: https://github.com/ORNL/HydraGNN/tree/Predictive_GFM_2024

36 MATERIALS SCIENCE↗