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.

At least 199 records · Page 11

Mueller-matrix mapping of biological tissues in differential diagnosis of optical anisotropy mechanisms of protein networks

We report a model of Mueller-matrix description of optical anisotropy of protein networks in biological tissues with allowance for the linear birefringence and dichroism. The model is used to construct the reconstruction algorithms of coordinate distributions of phase shifts and the linear dichroism coefficient. In the statistical analysis of such distributions, we have found the objective criteria of differentiation between benign and malignant tissues of the female reproductive system. From the standpoint of evidence-based medicine, we have determined the operating characteristics (sensitivity, specificity and accuracy) of the Mueller-matrix reconstruction method of optical anisotropy parameters and demonstrated its effectiveness in the differentiation of benign and malignant tumours. (laser applications and other topics in quantum electronics)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

CLARA: A Contemporary Approach to Physics Data Processing

In traditional physics data processing (PDP) systems, data location is static and is accessed by analysis applications. In comparison, CLARA (CLAS12 Reconstruction and Analysis framework) is an environment where data processing algorithms filter continuously flowing data. In CLARA's domain of loosely coupled services, data is not stored, but rather flows from one service to another, mutating constantly along the way. Agents, performing event processing, can then subscribe to particular data/events at any stage of the data transformation, and make intricate decisions (e.g. particle ID) by correlating events from multiple, parallel data streams and/or services. This paper presents a PDP application development framework based on service oriented and event driven architectures. This system allows users to design (Java, C++, and Python languages are supported) and deploy data processing services, as well as dynamically compose PDP applications using available services. The PDP service bus provides a layer on top of a distributed pub-sub middleware implementation, which allows complex service composition and integration without writing code. Examples of service creation and deployment, along with the CLAS12 track reconstruction application design will be presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Theoretical Insights for Improving the Schottky-Barrier Height at the Ga2O3/Pt Interface

In this work, we study the Schottky-barrier height (SBH) at the junction between ..beta..-Ga2O3 and platinum, a system of great importance for the next generation of high-power and high-temperature electronic devices. Specifically, we obtain interfacial atomic structures at different orientations using our structure-matching algorithm and compute their SBH using electronic structure calculations based on hybrid density-functional theory.

CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS,P↗

Effects of the plasma profiles on photon and pair production in ultrahigh intensity laser solid interaction

The model of photon and pair production in strong field quantum electrodynamics is implemented into our 1D3V particle-in-cell code with Monte Carlo algorithm. Using this code, the evolution of the particles in ultrahigh intensity laser (∼10{sup 23} W/cm{sup 2}) interaction with aluminum foil target is observed. Four different initial plasma profiles are considered in the simulations. The effects of initial plasma profiles on photon and pair production, energy spectra, and energy evolution are analyzed. The results imply that one can set an optimal initial plasma profile to obtain the desired photon distributions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Polarized and unpolarized gluon PDFs: Generative machine learning applications for lattice QCD matrix elements at short distance and large momentum

Lattice quantum chromodynamics (QCD) calculations share a defining challenge by requiring a small finite range of spatial separation z between quark/gluon bilinears for controllable power corrections in the perturbative QCD factorization, and a large hadron boost p z for a successful determination of collinear parton distribution functions (PDFs). However, these two requirements make the determination of PDFs from lattice data very challenging. We present the application of generative machine learning algorithms to estimate the polarized and unpolarized gluon correlation functions utilizing short-distance data and extending the correlation up to z p z ≲ 14 , surpassing the current capabilities of lattice QCD calculations. We train physics-informed machine learning algorithms to learn from the short-distance correlation at z ≲ 0.36 fm and take the limit, p z → ∞ , thereby minimizing possible contamination from the higher-twist effects for a successful reconstruction of the polarized gluon PDF. We also expose the bias and problems with underestimating uncertainties associated with the use of model-dependent and overly constrained functional forms, such as x α ( 1 − x ) β and its variants to extract PDFs from the lattice data. We propose the use of generative machine learning algorithms to mitigate these issues and present our determination of the polarized and unpolarized gluon PDFs in the nucleon. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A mesh partitioning algorithm for preserving spatial locality in arbitrary geometries

Highlights: •An algorithm for partitioning computational meshes is proposed. •The Morton order space-filling curve is modified to achieve improved locality. •A spatial locality metric is defined to compare results with existing approaches. •Results indicate improved performance of the algorithm in complex geometries. -- Abstract: A space-filling curve (SFC) is a proximity preserving linear mapping of any multi-dimensional space and is widely used as a clustering tool. Equi-sized partitioning of an SFC ignores the loss in clustering quality that occurs due to inaccuracies in the mapping. Often, this results in poor locality within partitions, especially for the conceptually simple, Morton order curves. We present a heuristic that improves partition locality in arbitrary geometries by slicing a Morton order curve at points where spatial locality is sacrificed. In addition, we develop algorithms that evenly distribute points to the extent possible while maintaining spatial locality. A metric is defined to estimate relative inter-partition contact as an indicator of communication in parallel computing architectures. Domain partitioning tests have been conducted on geometries relevant to turbulent reactive flow simulations. The results obtained highlight the performance of our method as an unsupervised and computationally inexpensive domain partitioning tool.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Two-temperature warm dense hydrogen as a test of quantum protons driven by orbital-free density functional theory electronic forces

We consider a steady-state (but transient) situation in which a warm dense aggregate is a two-temperature system with equilibrium electrons at temperature Te, ions at Ti, and Te ≠ Ti. Such states are achievable by pump–probe experiments. For warm dense hydrogen in such a two-temperature situation, we investigate nuclear quantum effects (NQEs) on structure and thermodynamic properties, thereby delineating the limitations of ordinary ab initio molecular dynamics. We use path integral molecular dynamics (PIMD) simulations driven by orbital-free density functional theory (OFDFT) calculations with state-of-the-art noninteracting free-energy and exchange-correlation functionals for the explicit temperature dependence. We calibrate the OFDFT calculations against conventional (explicit orbitals) Kohn–Sham DFT. We find that when the ratio of the ionic thermal de Broglie wavelength to the mean interionic distance is larger than about 0.30, the ionic radial distribution function is meaningfully affected by the inclusion of NQEs. Moreover, NQEs induce a substantial increase in both the ionic and electronic pressures. This confirms the importance of NQEs for highly accurate equation-of-state data on highly driven hydrogen. For Te > 20 kK, increasing Te in the warm dense hydrogen has slight effects on the ionic radial distribution function and equation of state in the range of densities considered. In addition, we confirm that compared with thermostatted ring-polymer molecular dynamics, the primitive PIMD algorithm overestimates electronic pressures, a consequence of the overly localized ionic description from the primitive scheme.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A second-order distributed memory parallel fast sweeping method for the Eikonal equation

The Eikonal equation is used to calculate wave propagation and distance fields, and due to its complexity requires numerical treatment for its solution. In this work, we present a second-order distributed memory parallel fast sweeping method. The second-order solution switches on a two-point stencil when two upwind points are available, and reverts to first-order otherwise. In all examples, the second-order method improves the solution over the first-order, allowing for significant savings in memory while achieving the same accuracy. Parallelization over distributed memory saw good weak scaling with optimal convergence. The computational time for second-order was approximately 2.5 times slower than first-order, where the largest amount of mesh points ran on 144 cores (512 GB) was ≈20 billion. The savings in memory from the second-order method combined with the distributed memory algorithm result in the ability to solve problems much larger than are possible with the serial first-order method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

The Differential Algebra Based Multiple Level Fast Multipole Algorithm for 3D Space Charge Field Calculation and Photoemission Simulation

Coulomb interaction between charged particles inside a bunch is one of the most importance collective effects in beam dynamics, becoming even more significant as the energy of the particle beam is lowered to accommodate analytical and low-Z material imaging purposes such as in the time resolved Ultrafast Electron Microscope (UEM) development currently underway at Michigan State University. In addition, space charge effects are the key limiting factor in the development of ultrafast atomic resolution electron imaging and diffraction technologies and are also correlated with an irreversible growth in rms beam emittance due to fluctuating components of the nonlinear electron dynamics. In the short pulse regime used in the UEM, space charge effects also lead to virtual cathode formation in which the negative charge of the electrons emitted at earlier times, combined with the attractive surface field, hinders further emission of particles and causes a degradation of the pulse properties. Space charge and virtual cathode effects and their remediation are core issues for the development of the next generation of high-brightness UEMs. Since the analytical models are only applicable for special cases, numerical simulations, in addition to experiments, are usually necessary to accurately understand the space charge effect. In this paper we will introduce a grid-free differential algebra based multiple level fast multipole algorithm, which calculates the 3D space charge field for n charged particles in arbitrary distribution with an efficiency of O(n), and the implementation of the algorithm to a simulation code for space charge dominated photoemission processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Inferring the Dynamics of the State Evolution During Quantum Annealing

To solve an optimization problem using a commercial quantum annealer, one has to represent the problem of interest as an Ising or a quadratic unconstrained binary optimization (QUBO) problem and submit its coefficients to the annealer, which then returns a user-specified number of low-energy solutions. It would be useful to know what happens in the quantum processor during the anneal process so that one could design better algorithms or suggest improvements to the hardware. However, existing quantum annealers are not able to directly extract such information from the processor. Hence, in this work we propose to use advanced features of D-Wave 2000Q to indirectly infer information about the dynamics of the state evolution during the anneal process. Specifically, D-Wave 2000Q allows the user to customize the anneal schedule, that is, the schedule with which the anneal fraction is changed from the start to the end of the anneal. Furthermore, using this feature, we design a set of modified anneal schedules whose outputs can be used to generate information about the states of the system at user-defined time points during a standard anneal. With this process, called "slicing", we obtain approximate distributions of lowest-energy anneal solutions as the anneal time evolves. We use our technique to obtain a variety of insights into the annealer, such as the state evolution during annealing, when individual bits in an evolving solution flip during the anneal process and when they stabilize, and we introduce a technique to estimate the freeze-out point of both the system as well as of individual qubits.

42 ENGINEERING↗

Shape of magnetic domain walls formed by coupling to mobile charges

Magnetic domain walls, which are crucially important in both fundamental physics and technical applications, often have a preference in their form due to many different origins, such as the crystalline shape, lattice symmetry, and magnetic anisotropy. Here we theoretically investigate yet another origin stemming from the coupling to mobile charges in itinerant magnets. Performing a large-scale numerical simulation in a minimal model for itinerant magnets, i.e., the Kondo lattice model with classical localized spins, we show that the shape of magnetic domain walls depends on the electronic band structure and electron filling. While Néel and 120° antiferromagnetic states do not show a strong preference in the shape of domain walls, noncoplanar spin states with scalar chiral ordering have distinct directional preferences of the domain walls depending on the electron filling. We find that the directional preference is rationalized by the wave-number dependence of the effective magnetic interactions induced by the mobile charges, which are set by the band structure and electron filling. Finally, we also observe that, in the noncoplanar chiral states, an electric current is induced along the domain walls owing to the spin Berry phase mechanism, with different spatial distributions depending on whether the bulk state is metallic or insulating.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum transport of bosonic cold atoms in double-well optical lattices

We numerically investigate, using the time evolving block decimation algorithm, the quantum transport of ultracold bosonic atoms in a double-well optical lattice through slow and periodic modulation of the lattice parameters (intra- and inter-well tunneling, chemical potential, etc.). The transport of atoms does not depend on the rate of change of the parameters (as along as the change is slow) and can distribute atoms in optical lattices at the quantized level without involving external forces. The transport of atoms depends on the atom filling in each double well and the interaction between atoms. In the strongly interacting region, the bosonic atoms share the same transport properties as noninteracting fermions with quantized transport at the half filling and no atom transport at the integer filling. In the weakly interacting region, the number of the transported atoms is proportional to the atom filling. We show the signature of the quantum transport from the momentum distribution of atoms that can be measured in the time-of-flight image. A semiclassical transport model is developed to explain the numerically observed transport of bosonic atoms in the noninteracting and strongly interacting limits. The scheme may serve as an quantized battery for atomtronics applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Materials genome innovation for computational software (magics) center

Functional layered material (LM) architectures will dominate nanomaterials science in this century. We have developed theory, modeling, simulation, and software and data tools that enhance understanding and AI guide synthesis, enable characterization of complex structures, and improve capabilities in the predictive design and growth of LMs. Research at the Center has focused on: Computational synthesis and characterization: AI guided synthesis and experimental synthesis of stacked LMs with tailored properties via optimized chemical vapor deposition (CVD) growth and liquid-phase exfoliation; study defects, edges, grain boundaries, wrinkling of atomic layers and their effects on chemical, mechanical, electrical, and optical properties. Far-from-equilibrium processes: Joint experimental and simulation based probe of electronic processes with NAQMD and ultrafast X-ray free-electron laser (XFEL) and ultrafast electron diffraction (UED) facilities at Stanford. Experimentally validate NAQMD by ultrafast electron diffraction and X-ray spectroscopy studies of structural and excited state dynamics, shape fluctuations, and phonon dynamics. Scalable software: Simulation engines for desktop-to-exascale platforms using low-overhead, linear-scaling QMD algorithms; divide-conquer-recombine NAQMD with electronic excitations; extended-Lagrangian reactive molecular dynamics (RMD), machine learning (ML) based neural-network quantum molecular dynamics (NNQMD), and super-state accelerated molecular dynamics (AMD) and kinetic Monte Carlo codes; thermal and electrical transport software; and design 3D architectures of LMs with desired functionality using scalable software. Distribution of software and data, and training: Software and simulation-experimental data generated within the Center are distributed to the materials science community via Berkeley Materials Project (MP) framework. We have also organized three workshops for software distribution and training at USC (Nov. 2017, Mar. 2018) and Gaithersburg, MD (Nov. 2018) to train researchers, with the last one in focused on underrepresented groups, in collaboration with Howard University which is one of the largest HBCUs. The Center supported a total of 46 personnel and 6 undergraduate students. These include 14 faculty, 11 postdoctoral research associates, 20 graduate research assistants, and mentored 6 undergraduate students. This resulted in the publications of 63 research papers that include 46 publications on Reactive and Quantum Dynamics Simulations, 13 publications on Machine Learning for Quantum Materials, and 4 publications on Quantum Computing.

2D Materials↗

Self-learning Monte Carlo method: Continuous-time algorithm

The recently introduced self-learning Monte Carlo method is a general-purpose numerical method that speeds up Monte Carlo simulations by training an effective model to propose uncorrelated configurations in the Markov chain. We implement this method in the framework of a continuous-time Monte Carlo method with an auxiliary field in quantum impurity models. We introduce and train a diagram generating function (DGF) to model the probability distribution of auxiliary field configurations in continuous imaginary time, at all orders of diagrammatic expansion. Furthermore, by using DGF to propose global moves in configuration space, we show that the self-learning continuous-time Monte Carlo method can significantly reduce the computational complexity of the simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extending quantum key distribution through proxy re-encryption

Modern quantum key distribution (QKD) network designs are based on sending photons from one node to another and require free-space or dedicated fiber optic cables between nodes. The purpose of this is to co-generate secret key material on both sides of the quantum channel. In addition to this quantum link, there are several insecure classical channels that allow QKD algorithms to exchange book-keeping information and send symmetrically encrypted data. The attenuation of photons transmitted through fiber becomes too high to practically generate key material over fiber at distances of more than 100 km. Free-space transmission through the atmosphere or the vacuum of space can reduce attenuation, but at the cost of system complexity and sensitivity to other impairments, such as weather. To extend the effective range of QKD networks, we present a method that combines QKD algorithms with post-quantum, homomorphic key-switching to allow multiple parties to effectively share secret key material over longer distances through semi-trusted relay nodes. We define how such a system should work for arbitrary network topologies and provide proofs that our scheme is both correct and secure. We assess the feasibility of this solution by building and evaluating two implementations based on lattice-based cryptography: learning with errors.

97 MATHEMATICS AND COMPUTING↗

Perturbative readout-error mitigation for near-term quantum computers

Readout errors on near-term quantum computers can introduce significant error to the empirical probability distribution sampled from the output of a quantum circuit. These errors can be mitigated by classical postprocessing given the access of an experimental response matrix that describes the error associated with the measurement of each computational basis state. However, the resources required to characterize a complete response matrix and to compute the corrected probability distribution scale exponentially with the number of qubits, n . In this work, we modify standard matrix inversion techniques using perturbative approximations with significantly reduced complexity and bounded error when the likelihood of high-order bit-flip events is strongly suppressed. Given a characteristic error rate q , we discuss a method to recover the probability of the all-zeros bit string p 0 by sampling only a small subspace of the response matrix before inverting readout error, resulting in a relative speedup of poly [ 2 n / ( n w ) ] , which we motivate using a simplified error model for which the approximation incurs only O ( q w ) error for some integer w . We then provide a generalized technique to efficiently recover full output distributions with O ( q w ) error in the perturbative limit. These approximate techniques for readout-error correction may greatly accelerate near-term quantum computing applications.

97 MATHEMATICS AND COMPUTING↗

WIDE-FIELD WIDE-BAND INTERFEROMETRIC IMAGING: THE WB A-PROJECTION AND HYBRID ALGORITHMS

Variations of the antenna primary beam (PB) pattern as a function of time, frequency, and polarization form one of the dominant direction-dependent effects at most radio frequency bands. These gains may also vary from antenna to antenna. The A-Projection algorithm, published earlier, accounts for the effects of the narrow-band antenna PB in full polarization. In this paper, we present the wide-band A-Projection algorithm (WB A-Projection) to include the effects of wide bandwidth in the A-term itself and show that the resulting algorithm simultaneously corrects for the time, frequency, and polarization dependence of the PB. We discuss the combination of the WB A-Projection and the multi-term multi-frequency synthesis (MT-MFS) algorithm for simultaneous mapping of the sky brightness distribution and the spectral index distribution across a wide field of view. We also discuss the use of the narrow-band A-Projection algorithm in hybrid imaging schemes that account for the frequency dependence of the PB in the image domain.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗