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 235 records · Page 13

Characterization and Optimization of the Fitting of Quantum Correlation Functions

This case study presents a characterization and optimization of an application code for extracting parton distribution functions from high energy electron-proton scattering data. Profiling this application code reveals that the phase-space density computation accounts for 93% of the overall execution time for a single iteration on a single core. When executing multiple iterations in parallel on a multicore system, the application spends 78% of its overall execution time idling due to load imbalance. We address these issues by first transforming the application code from Python to C++ and then tackling the application load imbalance via a hybrid scheduling strategy that combines dynamic and static scheduling. These techniques result in a 62% reduction in CPU idle time and a 2.46x speedup in overall execution time per node. In addition, the typically enabled power-management mechanisms in supercomputers (e.g., AMD Turbo Core, Intel Turbo Boost, and RAPL) can significantly impact intra-node scalability when more than 50% of the CPU cores are used. This finding underscores the importance of understanding system interactions with power management, as they can adversely impact application performance, and highlights the necessity of intra-node scaling tests to identify performance degradation that inter-node scaling tests might otherwise overlook.

Chuang, Pi-Yueh [Virginia Tech,Dept. of Computer S↗

Continuous Variable Cluster State Generation over the Optical Spatial Mode Comb

One way quantum computing uses single qubit projective measurements performed on a cluster state (a highly entangled state of multiple qubits) in order to enact quantum gates. The model is promising due to its potential scalability; the cluster state may be produced at the beginning of the computation and operated on over time. Continuous variables (CV) offer another potential benefit in the form of deterministic entanglement generation. This determinism can lead to robust cluster states and scalable quantum computation. Recent demonstrations of CV cluster states have made great strides on the path to scalability utilizing either time or frequency multiplexing in optical parametric oscillators (OPO) both above and below threshold. The techniques relied on a combination of entangling operators and beam splitter transformations. Here we show that an analogous transformation exists for amplifiers with Gaussian inputs states operating on multiple spatial modes. By judicious selection of local oscillators (LOs), the spatial mode distribution is analogous to the optical frequency comb consisting of axial modes in an OPO cavity. We outline an experimental system that generates cluster states across the spatial frequency comb which can also scale the amount of quantum noise reduction to potentially larger than in other systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural Networks and Graph Algorithms with Next-Generation Processors

The use of graphical processors for distributed computation revolutionized the field of high performance scientific computing. As the Moore's Law era of computing draws to a close, the development of non-Von Neumann systems: neuromorphic processing units, and quantum annealers; again are redefining new territory for computational methods. While these technologies are still in their nascent stages, we discuss their potential to advance computing in two domains: machine learning, and solving constraint satisfaction problems. Each of these processors utilize fundamentally different theoretical models of computation. This raises questions about how to best use them in the design and implementation of applications. While many processors are being developed with a specific domain target, the ubiquity of spin-glass models and neural networks provides an avenue for multi-functional applications. This provides hints at the future infrastructure needed to integrate many next-generation processing units into conventional high-performance computing systems.

Hamilton, Kathleen↗

Optimization of SiV Defect Yield in Diamond Substrates

Color centers (defect complexes such as SiV) in diamond have shown potential in fields ranging from metrology, cybersecurity to quantum computation. Demonstrations in these fields have pushed the envelope of state-of-the-art operations – for example, single photon sources (SPS) making use of SiV centers in diamond for quantum key distribution have demonstrated all the requirements for SPS operation including: (1) stable operation with second correlation function <<1, (2) electrically driven single photon emission and (3) compatibility with frequenc y conversion to telecommunication frequencies. To-date, however, all these demonstrations have been on lab-scale one-off devices. The key question behind how to deterministically fabricate these devices, namely activation yield has been overlooked. For context, Si based semiconductor devices are hugely successful because we have a high activation yield for implanted dopants. This is not yet true for diamond color centers. As currently understood, the color center yield is dominated by a lack of vacancies in the immediate area of the implantation. We propose to optimize the activation yield of color center using a combination of (1) focused single ion implantation with in-situ detection to count the number of implanted Si ions and (2) localized point defect (vacancy) creation using a focused Li ion beam to improve the yield. These experiments build on the unique capabilities of the SNL nanoImplanter (nI) to produce focused ion beam with spatial resolution of < 10 nm of both Si and Li ions. This work will also leverage our world-leading single ion implantation and detection capabilities.

36 MATERIALS SCIENCE↗

Quantitative single-particle digital autoradiography with α-particle emitters for targeted radionuclide therapy using the iQID camera

Purpose: Alpha-emitting radionuclides exhibit a potential advantage for cancer treatments because they release large amounts of ionizing energy over a few cell diameters (50–80 μm), causing localized, irreparable double-strand DNA breaks that lead to cell death. Radioimmunotherapy (RIT) approaches using monoclonal antibodies labeled with α emitters may thus inactivate targeted cells with minimal radiation damage to surrounding tissues. Tools are needed to visualize and quantify the radioactivity distribution and absorbed doses to targeted and nontargeted cells for accurate dosimetry of all treatment regimens utilizing α particles, including RIT and others (e.g., Ra-223), especially for organs and tumors with heterogeneous radionuclide distributions. The aim of this study was to evaluate and characterize a novel single-particle digital autoradiography imager, the ionizing-radiation quantum imaging detector (iQID) camera, for use in α-RIT experiments. Methods: The iQID camera is a scintillator-based radiation detection system that images and identifies charged-particle and gamma-ray/x-ray emissions spatially and temporally on an event-by-event basis. It employs CCD-CMOS cameras and high-performance computing hardware for real-time imaging and activity quantification of tissue sections, approaching cellular resolutions. In this work, the authors evaluated its characteristics for α-particle imaging, including measurements of intrinsic detector spatial resolutions and background count rates at various detector configurations and quantification of activity distributions. The technique was assessed for quantitative imaging of astatine-211 ({sup 211}At) activity distributions in cryosections of murine and canine tissue samples. Results: The highest spatial resolution was measured at ∼20 μm full width at half maximum and the α-particle background was measured at a rate as low as (2.6 ± 0.5) × 10{sup −4} cpm/cm{sup 2} (40 mm diameter detector area). Simultaneous imaging of multiple tissue sections was performed using a large-area iQID configuration (ø 11.5 cm). Estimation of the {sup 211}At activity distribution was demonstrated at mBq/μg-levels. Conclusions: Single-particle digital autoradiography of α emitters has advantages over traditional film-based autoradiographic techniques that use phosphor screens, in terms of spatial resolution, sensitivity, and activity quantification capability. The system features and characterization results presented in this study show that the iQID is a promising technology for microdosimetry, because it provides necessary information for interpreting alpha-RIT outcomes and for predicting the therapeutic efficacy of cell-targeted approaches using α emitters.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Logical error rates for the surface code under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions

With fault-tolerant quantum computing (FTQC) on the horizon, it is critical to understand sources of logical errors in plausible hardware implementations of quantum error-correcting codes. Detailed error modeling of computational instructions on particular FTQC architectures will enable the better prediction of error propagation in FT-encoded quantum circuits while revealing where greater attention is needed in hardware design. In this work, we consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device architecture. Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions. We include the coherent dephasing noise that is known to accumulate during physical qubit idling and transport in these systems, determining idling and transport durations using the time-resolved output of an open-source trapped-ion surface code compiler. To estimate expectation values of logical Pauli observables following hardware circuits containing non-Clifford sources of noise, we utilize a Monte Carlo technique to sample from an underlying quasiprobability distribution of Clifford circuits that we independently simulate in a phase-sensitive fashion. We verify error suppression up to code distance 𝑑 = 11 at coherent dephasing rates near and below those of current-generation trapped-ion quantum computers and find that logical error rates align with those of analogous fully stochastic simulations in this regime. Exploring higher dephasing rates at 𝑑 = 3−5, we find evidence for growing coherent rotations about all three logical Pauli axes, increased diagonal logical error process matrix elements relative to those of stochastic simulations, and a reduced dephasing rate threshold. Overall, our work paves a way toward realistic hardware emulation of small fault-tolerant quantum processes, e.g., members of an FTQC instruction set.

Quantum benchmarking↗

Application of Gauss's law space-charge limited emission model in iterative particle tracking method

The particle tracking method with a so-called gun iteration for modeling the space charge is discussed in the following paper. We suggest to apply the emission model based on the Gauss's law for the calculation of the space charge limited current density distribution using considered method. Based on the presented emission model we have developed a numerical algorithm for this calculations. This approach allows us to perform accurate and low time consumpting numerical simulations for different vacuum sources with the curved emitting surfaces and also in the presence of additional physical effects such as bipolar flows and backscattered electrons. The results of the simulations of the cylindrical diode and diode with elliptical emitter with the use of axysimmetric coordinates are presented. The high efficiency and accuracy of the suggested approach are confirmed by the obtained results and comparisons with the analytical solutions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Defect Structure in Quantum-Cutting Yb3+-Doped CsPbCl3 Perovskites Probed by X-Ray Absorption and Atomic Pair Distribution Function Analysis

Ytterbium-doping in all-inorganic lead-halide perovskites (CsPb(Cl1-xBrx)3) generates novel properties including quantum cutting and narrow line emission, making these materials attractive spectral down-converters for solar photovoltaics. The relationship between this optical efficiency and the defect structure(s) associated with Yb3+ dopants within perovskites is not well understood. Various charge-neutral doping motifs have previously been proposed and studied computationally, including clusters involving two substitutional Yb3+ ions charge-compensated by a single local Pb2+ vacancy. Near-band-edge defect states associated with such motifs are believed to play an important mechanistic role in quantum cutting itself. Here, we report the results of X-ray absorption and X-ray total-scattering measurements on ytterbium-doped CsPbCl3. XANES shows that the dopant oxidation state is exclusively Yb3+, and a combination of Yb L3 and Pb L3 EXAFS shows that this Yb3+ substitutes exclusively at Pb2+ sites, where it adopts a pseudo-octahedral [YbCl6]3- coordination environment. Shell-by-shell fits to the data show a short Yb-Cl bond distance of 2.58 Å compared to the Pb-Cl bond distance of 2.83 Å. We confirm this finding by X-ray pair distribution function analysis, which also shows evidence of additional Pb2+ vacancy formation induced by Yb3+ doping. We evaluate whether this is the primary mechanism of charge compensation using simulated EXAFS and pair distribution function data for several computed defect structures. Together, these results resolve the local dopant structures and charge-compensation mechanisms in lanthanide-doped all-inorganic lead-halide perovskites, and, as such, significantly advance the understanding of structure-function relationships in this important class of materials.

Kluherz, Kyle (ORCID:0000000279865167)↗

Single T gate in a Clifford circuit drives transition to universal entanglement spectrum statistics

Clifford circuits are insufficient for universal quantum computation or creating t t -designs with t\ge 4 t ≥ 4 . While the entanglement entropy is not a telltale of this insufficiency, the entanglement spectrum of a time evolved random product state is: the entanglement levels are Poisson-distributed for circuits restricted to the Clifford gate-set, while the levels follow Wigner-Dyson statistics when universal gates are used. In this paper we show, using finite-size scaling analysis of different measures of level spacing statistics, that in the thermodynamic limit, inserting a single T (\pi/8) ( π / 8 ) gate in the middle of a random Clifford circuit is sufficient to alter the entanglement spectrum from a Poisson to a Wigner-Dyson distribution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Training a Quantum Annealing Based Restricted Boltzmann Machine on Cybersecurity Data

A restricted Boltzmann machine (RBM) is a generative model that could be used in effectively balancing a cybersecurity dataset because the synthetic data a RBM generates follows the probability distribution of the training data. RBM training can be performed using contrastive divergence (CD) and quantum annealing (QA). QA-based RBM training is fundamentally different from CD and requires samples from a quantum computer. We present a real-world application that uses a quantum computer. Specifically, we train a RBM using QA for cybersecurity applications. The D-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data, which is a benchmark dataset for cybersecurity. For comparison, RBMs are also trained using CD. CD is a commonly used method for RBM training. Our analysis of the ISCX data shows that the dataset is imbalanced. We present two different schemes to balance the training dataset before feeding it to a classifier. The first scheme is based on the undersampling of benign instances. The imbalanced training dataset is divided into five sub-datasets that are trained separately. A majority voting is then performed to get the result. Our results show the majority vote increases the classification accuracy up from 90.24% to 95.68%, in the case of CD. For the case of QA, the classification accuracy increases from 74.14% to 80.04%. In the second scheme, a RBM is used to generate synthetic data to balance the training dataset. We show that both QA and CD-trained RBM can be used to generate useful synthetic data. Balanced training data is used to evaluate several classifiers. Among the classifiers investigated, K-Nearest Neighbor (KNN) and Neural Network (NN) perform better than other classifiers. They both show an accuracy of 93%. Our results show a proof-of-concept that a QA-based RBM can be trained on a 64-bit binary dataset. The illustrative example suggests the possibility to migrate many practical classification problems to QA-based techniques. Further, we show that synthetic data generated from a RBM can be used to balance the original dataset.

97 MATHEMATICS AND COMPUTING↗

O(N) Quantum Molecular Dynamics (QMD) Algorithms, Code Requirements, Release Notes, and Library Deployment

The Exascale Computing Project (ECP) Co-design Center for Particle Applications (CoPA) is addressing the challenges for particle applications to run on upcoming exascale computing architectures. This includes short- and long-range molecular dynamics (MD), particle-in-cell (PIC), and quantum molecular dynamics (QMD). This document addresses $\mathcal{O}(N)$ QMD. The goal of this CoPA team is to develop $\mathcal{O}(N)$ linear scaling methods for QMD optimized for new and next generation architectures. This will provide the capability to simulate larger systems and run for longer timeframes than is possible today. Focus is initially on the density matrix construction. This requires efficient matrix formats and linear algebra operations for distributed architectures. A significant reduction in the wallclock time for an MD timestep is necessary to achieve practical large scale QMD. Equally challenging is to develop scalable distributed implementations. This requires the exploration of efficient data formats (dense, sparse, etc.), data decomposition and distribution across compute nodes using block- and graph-based methods. Traditional programming models such as MPI/OpenMP, hybrid MPI/OpenMP/Accelerator, as well as asynchronous task-based models will be explored to achieve maximum parallelism. Parallelism at the level of a matrix operation, solver, and/or application needs to be explored to gain the most benefit on new and emerging architectures. This report serves as a “living document” of the additions and enhancements throughout the ECP CoPA project for $\mathcal{O}(N)$ QMD. The following sections address the applications we are working with, the quantum chemistry libraries (BML and PROGRESS), and our co-design exploration through the use of a proxy application.

36 MATERIALS SCIENCE↗

The Quest for Accurate Liquid Water Properties from First Principles

Developing accurate ab initio molecular dynamics (AIMD) models that capture both electronic reorganization and nuclear quantum effects associated with hydrogen bonding is key to quantitative understanding of bulk water and its anomalies, as well as its role as a universal solvent. For condensed phase simulations, AIMD has typically relied on the generalized gradient approximation (GGA) of Density Functional Theory (DFT) as the underlying model chemistry for the potential energy surface, with nuclear quantum effects (NQEs) sometimes modeled by performing classical molecular dynamics simulations at elevated temperatures. Here we show that the properties of liquid water obtained from the meta-GGA B97M-rV functional, when evaluated using accelerated path integral molecular dynamics simulations, displays accuracy comparable to a computationally expensive dispersion corrected hybrid functional, revPBE0-D 3 . We show that the meta-GGA DFT reproduces bulk water properties including radial distribution functions, self-diffusion coefficients, and infrared (IR) spectra with comparable accuracy of a much more expensive hybrid functional. In conclusion, this work demonstrates that the underlying quality of a good DFT functional requires evaluation with quantum nuclei, and that high temperature simulations are a poor proxy for properly treating nuclear quantum effects.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Contributions to the NUCLEI Project for Years 1-5(6)

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 (neutrinoless double-beta decay and physics beyond the Standard Model), and LANSCE (fission studies).

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Scalable training of graph convolutional neural networks for fast and accurate predictions of HOMO-LUMO gap in molecules

Abstract Graph Convolutional Neural Network (GCNN) is a popular class of deep learning (DL) models in material science to predict material properties from the graph representation of molecular structures. Training an accurate and comprehensive GCNN surrogate for molecular design requires large-scale graph datasets and is usually a time-consuming process. Recent advances in GPUs and distributed computing open a path to reduce the computational cost for GCNN training effectively. However, efficient utilization of high performance computing (HPC) resources for training requires simultaneously optimizing large-scale data management and scalable stochastic batched optimization techniques. In this work, we focus on building GCNN models on HPC systems to predict material properties of millions of molecules. We use HydraGNN, our in-house library for large-scale GCNN training, leveraging distributed data parallelism in PyTorch. We use ADIOS, a high-performance data management framework for efficient storage and reading of large molecular graph data. We perform parallel training on two open-source large-scale graph datasets to build a GCNN predictor for an important quantum property known as the HOMO-LUMO gap. We measure the scalability, accuracy, and convergence of our approach on two DOE supercomputers: the Summit supercomputer at the Oak Ridge Leadership Computing Facility (OLCF) and the Perlmutter system at the National Energy Research Scientific Computing Center (NERSC). We present our experimental results with HydraGNN showing (i) reduction of data loading time up to 4.2 times compared with a conventional method and (ii) linear scaling performance for training up to 1024 GPUs on both Summit and Perlmutter.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

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↗