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 145 records · Page 8

Massless and massive photons within basis light-front quantization

We compute the structure function, transverse momentum dependent parton distributions (TMDs), and generalized parton distributions (GPDs) for the photon from the light-front quantum electrodynamics (QED) Hamiltonian, determined for its constituent bare photon and electron-positron Fock components within the basis light-front quantization framework. While the structure function and GPDs align well with expectations, some oscillatory behavior in the TMDs emerges as a finite-basis artifact. We also compute the GPD and the corresponding structure function for the longitudinal polarization mode of the massive photon. We further study the photon mass dependence of the calculated observables. After performing nonperturbative renormalization, we obtain a good quality description of the perturbative QED properties of the photon, as well as good agreement with the experimental data for the massless photon’s structure function.

Ab initio calculations↗

Dimension Reduction and Redundancy Removal through Successive Schmidt Decompositions

Quantum computers are believed to have the ability to process huge data sizes, which can be seen in machine learning applications. In these applications, the data, in general, are classical. Therefore, to process them on a quantum computer, there is a need for efficient methods that can be used to map classical data on quantum states in a concise manner. On the other hand, to verify the results of quantum computers and study quantum algorithms, we need to be able to approximate quantum operations into forms that are easier to simulate on classical computers with some errors. Motivated by these needs, in this paper, we study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions. We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms, which can be easily mapped onto quantum circuits. The examples include random data with different distributions, the Gram matrices of iris flower, handwritten digits, 20newsgroup, and labeled faces in the wild. Similarly, some quantum operations, such as quantum Fourier transform and variational quantum circuits with a small depth, may also be approximated with a few terms that are easier to simulate on classical computers. Furthermore, we show how the method can be used to simplify quantum Hamiltonians: In particular, we show the application to randomly generated transverse field Ising model Hamiltonians. The reduced Hamiltonians can be mapped into quantum circuits easily and, therefore, can be simulated more efficiently.

97 MATHEMATICS AND COMPUTING↗

Demonstration of machine-learning-enhanced Bayesian quantum state estimation

Machine learning (ML) has found broad applicability in quantum information science in topics as diverse as experimental design, state classification, and even studies on quantum foundations. Here, we experimentally realize an approach for defining custom prior distributions that are automatically tuned using ML for Bayesian quantum state estimation methods that generally better conform to the physical properties of the underlying system than standard fixed prior distributions. Previously, researchers have looked to Bayesian quantum state tomography for advantages like uncertainty quantification, the return of reliable estimates under any measurement condition, and minimal mean-squared error. However, practical challenges related to long computation times and conceptual issues concerning how to incorporate prior knowledge most suitably can overshadow these benefits. Using both simulated and experimental measurement results, we demonstrate that ML-defined prior distributions reduce net convergence times and provide a natural way to incorporate both implicit and explicit information directly into the prior distribution. These results constitute a promising path toward practical implementations of Bayesian quantum state tomography.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Estimation of distributions via multilevel Monte Carlo with stratified sampling

We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the joint cumulative distribution function (CDF) of a vector-valued quantity of interest in problems with random input parameters and initial conditions. Our approach combines MLMC with stratified sampling of the input sample space by replacing standard Monte Carlo at each level with stratified Monte Carlo initialized with proportionally allocated samples. We show that the resulting stratified MLMC (sMLMC) algorithm is more efficient than its standard MLMC counterpart due to the additional variance reduction provided by the stratification of the random parameter's domain, especially at the coarsest levels. Additional computational cost savings are obtained by smoothing the indicator function with a Gaussian kernel, which proves to be an efficient and robust alternative to recently developed polynomial-based techniques.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Entanglement features of random neural network quantum states

Restricted Boltzmann machines (RBMs) are a class of neural networks that have been successfully employed as a variational ansatz for quantum many-body wave functions. Here, we develop an analytic method to study quantum many-body spin states encoded by random RBMs with independent and identically distributed complex Gaussian weights. By mapping the computation of ensemble-averaged quantities to statistical mechanics models, we are able to investigate the parameter space of the RBM ensemble in the thermodynamic limit. We discover qualitatively distinct wave functions by varying RBM parameters, which correspond to distinct phases in the equivalent statistical mechanics model. Notably, there is a regime in which the typical RBM states have near-maximal entanglement entropy in the thermodynamic limit, similar to that of Haar-random states. However, these states generically exhibit nonergodic behavior in the Ising basis, and do not form quantum state designs, making them distinguishable from Haar-random states.

36 MATERIALS SCIENCE↗

The phase diagram of quantum chromodynamics in one dimension on a quantum computer

The quantum chromodynamics (QCD) phase diagram, which reveals the state of strongly interacting matter at different temperatures and densities, is key to answering open questions in physics, ranging from the behaviour of particles in neutron stars to the conditions of the early universe. However, classical simulations of QCD face significant computational barriers, such as the sign problem at finite matter densities. Quantum computing offers a promising solution to overcome these challenges. Here, we take an important step toward exploring the QCD phase diagram with quantum devices by preparing thermal states in one-dimensional non-Abelian gauge theories. We experimentally simulate the thermal states of SU(2) and SU(3) gauge theories at finite densities on a trapped-ion quantum computer using a variational method. This is achieved by introducing two features: Firstly, we add motional ancillae to the existing qubit register to efficiently prepare thermal probability distributions. Secondly, we introduce charge-singlet measurements to enforce colour-neutrality constraints. This work pioneers the quantum simulation of QCD at finite density and temperature for two and three colours, laying the foundation to explore QCD phenomena on quantum platforms.

Quantum information↗

Quantum-Assisted Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

The quantum computing community has been searching for suitable applications to demonstrate the potential of near-term quantum devices. Quantum machine learning is a potential candidate, particularly using models that cannot be efficiently simulated with classical computers [1, 2]. This work focuses on a transition phase of quantum computers where the quantum machine learning model is still simulable classically but projected not to be simulable as the size of the model grows. Ultimately quantum computers may have advantages for high-dimensional real-world problems. Due to the limited number of qubits in current noisy intermediate-scale quantum (NISQ) devices, the direct application of quantum computers in high dimensional data is not feasible. To remedy this problem, an encoder-decoder architecture can be utilized. The encoder model would transform the high-dimensional data into a compact representation, to a level that small quantum computers can be used today (or in the near future), and the decoder would take the quantum processed outputs back to the high-dimensional space. Addressing the two challenges of quantum machine learning, this work investigates a hybrid supervised generative model with a quantum Ising Born machine embedded as the latent distribution. The model contains four main parts (Figure 1.a.): (1) a U-NET architecture responsible for learning segmentation flow, (2) a Prior network responsible for learning an encoded latent distribution of the input data, (3) a Born machine which represents the latent distribution, and (4) a Posterior network in charge of learning the joint encoded latent distribution of inputs and target data. The initial model, proposed by [3], is optimized by (1) maximizing the overlap of the prior and posterior latent distributions, and (2) minimizing the segmentation loss. The proposed model is designed to be investigated in a simulation environment applied to the real-world application of wildfire segmentation. Specifically, the model is designed to solve the patchy wildfire segmentations of Moderate Resolution Imaging Spectroradiometer (MODIS) by taking the MODIS observations and using Visible Infrared Imaging Radiometer Suite’s (VIIRS) consistent wildfire product as the target. The model solves patchy wildfire segmentations and provides insight into the epistemic errors sourced from model variation. The model utilizes the Born machine as a QUBO solver to represent the latent space as a Bernoulli distribution. The proposed configuration allows the variational segmentation model to leverage the true quantum probabilistic nature and derive a more expressive latent configuration, increasing the model performance in describing wildfire segmentations. The quantum probabilistic information of the Born machine is directly incorporated in the Kullback-Leibler divergence loss in the prior and posterior distributions, forcing the Bernoulli latent distribution to maximize the overlap of input and joint input-target distributions. The proposed model is then trained and compared with a baseline only consisting of direct Bernoulli latent distribution with no Born machine representing the latent space. The models are evaluated based on the segmentation metrics, such as precision, recall, intersect of union, with uncertainty boundaries accounting for the stochastic nature of the model. Our findings show that even in low latent-dimensional space (due to the limit in computational power of the classical quantum simulator), we are able to effectively capture the latent representation and hence the model performs better than the baseline. The findings are a projection for scaling the model into higher dimensional latent space with the Born machine surpassing the baseline performance. Figure 1. Sub-figure (a) demonstrates the architecture for the training phase. The model consists of a Prior and Posterior network that encode inputs and joint input-target data into compact representations, respectively. The Born machine represents the latent distribution, and the U-NET branch learns the segmentation patterns of the data. The stochasticity is introduced to the U-NET through its last layer to create meaningful but stochastic segmentations. Sub-figure (b) represents the inference phase where the model takes the stochastic behavior from the prior network and injects that into the U-NET. Each attempt of inference will generate different but similar segmentations from the same distribution of the wildfire event. REFERENCES [1] Coyle, B., Mills, D., Danos, V., & Kashefi, E. (2020). The Born supremacy: quantum advantage and training of an Ising Born machine. npj Quantum Information, 6(1), 1-11. [2] Liu, J. G., & Wang, L. (2018). Differentiable learning of quantum circuit born machines. Physical Review A, 98(6), 062324. [3] Kohl, S., Romera-Paredes, B., Meyer, C., De Fauw, J., Ledsam, J. R., Maier-Hein, K., ... & Ronneberger, O. (2018). A probabilistic u-net for segmentation of ambiguous images. Advances in neural information processing systems, 31.

quantum machine learning↗

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A parallel, distributed memory implementation of the adaptive sampling configuration interaction method

The many-body simulation of quantum systems is an active field of research that involves several different methods targeting various computing platforms. Many methods commonly employed, particularly coupled cluster methods, have been adapted to leverage the latest advances in modern high-performance computing. Selected configuration interaction (sCI) methods have seen extensive usage and development in recent years. However, the development of sCI methods targeting massively parallel resources has been explored only in a few research works. Here, we present a parallel, distributed memory implementation of the adaptive sampling configuration interaction approach (ASCI) for sCI. In particular, we will address the key concerns pertaining to the parallelization of the determinant search and selection, Hamiltonian formation, and the variational eigenvalue calculation for the ASCI method. Load balancing in the search step is achieved through the application of memory-efficient determinant constraints originally developed for the ASCI-PT2 method. The presented benchmarks demonstrate near optimal speedup for ASCI calculations of Cr 2 (24e, 30o) with 10 6 , 10 7 , and 3 × 10 8 variational determinants on up to 16 384 CPUs. Importantly, to the best of the authors’ knowledge, this is the largest variational ASCI calculation to date.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Basis light-front quantization approach to photon

We solve for the light-front wave functions (LFWFs) of the physical photon from the eigenvectors of the light-front quantum electrodynamics (QED) Hamiltonian with the aim to determine its bare photon and electron-positron Fock components. We then employ the resulting LFWFs to compute the transverse momentum dependent parton distributions (TMDs) and the generalized parton distributions (GPDs) at zero skewness of the photon. The TMDs are found to be in excellent agreement with the lowest-order perturbative results calculated using the electron-positron quantum fluctuation of the photon. The GPDs are also consistent with the perturbative calculations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Direct observation of the momentum distribution and renormalization factor in lithium

We have measured the momentum distribution and renormalization factor $Z_{k_F}$ in liquid and solid lithium by high-resolution Compton scattering. High-resolution data over a wide momentum range exhibit a clear feature of the renormalization and a sharp drop of momentum densities at the Fermi momentum $k_F$. In this work, these results are compared with those computed by quantum Monte Carlo simulation performed both on a disordered crystal and a liquid exhibiting very good agreement. Asymptotic behavior of the experimental and theoretical momentum distributions are examined to estimate $Z_{k_F}$. The experimentally obtained $Z_{k_F} = 0.43^{+0.11}_{–0.01}$ for liquid Li and $0.54^{+0.11}_{–0.02}$ for solid Li are in good agreement with theoretical results of 0.54 ± 0.01 and 0.64 ± 0.01, respectively.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

The MolSSI QCArchive project: An open-source platform to compute, organize, and share quantum chemistry data

The Molecular Sciences Software Institute's (MolSSI) Quantum Chemistry Archive (QCArchive) project is an umbrella name that covers both a central server hosted by MolSSI for community data and the Python-based software infrastructure that powers automated computation and storage of quantum chemistry (QC) results. The MolSSI-hosted central server provides the computational molecular sciences community a location to freely access tens of millions of QC computations for machine learning, methodology assessment, force-field fitting, and more through a Python interface. Facile, user-friendly mining of the centrally archived quantum chemical data also can be achieved through web applications found at the website. The software infrastructure can be used as a standalone platform to compute, structure, and distribute hundreds of millions of QC computations for individuals or groups of researchers at any scale. The QCArchiveInfrastructure is open-source (BSD-3C), code repositories can be found at github, and releases can be downloaded via PyPI and Conda. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry Data Science > Computer Algorithms and Programming

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

There and Back Again: Reimagining Cryogenic Cooling for Scalable Arrays of Dilution Refrigerators for future Quantum Datacenters

While pulse tube cryocoolers enabled the rapid expansion of dilution refrigerator technology over the past two decades, the transition to large-scale quantum systems is now driving a reassessment of the DR’s higher-temperature-stage cooling strategies and how these systems can be effectively scaled in a modular way. Quasi-wet architectures based on centralized cryoplants and forced-flow helium distribution offer compelling advantages in energy efficiency, operational cost, and scalability. With appropriate redundancy, standardized interfaces, and optimized distribution system designs, these architectures will provide a practical and robust path forward for the next generation of quantum computing infrastructure.

Hansen, B. [Fermilab]↗

Koopman–von Neumann approach to quantum simulation of nonlinear classical dynamics

Quantum computers can be used to simulate nonlinear non-Hamiltonian classical dynamics on phase space by using the generalized Koopman–von Neumann formulation of classical mechanics. The Koopman–von Neumann formulation implies that the conservation of the probability distribution function on phase space, as expressed by the Liouville equation, can be recast as an equivalent Schrödinger equation on Hilbert space with a Hermitian Hamiltonian operator and a unitary propagator. This Schrödinger equation is linear in the momenta because it derives from a constrained Hamiltonian system with twice the classical phase-space dimension. A quantum computer with finite resources can be used to simulate a finite-dimensional approximation of this unitary evolution operator. Quantum simulation of classical dynamics is exponentially more efficient than a deterministic Eulerian discretization of the Liouville equation if the Koopman–von Neumann Hamiltonian is sparse. Utilizing quantum walk techniques for state preparation and amplitude estimation for the calculation of observables leads to a quadratic improvement over classical probabilistic Monte Carlo algorithms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗

Testing the lepton content of the proton at HERA and EIC

Although protons are baryons with an overall vanishing lepton number, they possess a non-trivial leptonic content arising from quantum fluctuations which can be described by lepton parton distribution functions (PDFs) of the proton. These PDFs have been recently computed and can be used to define lepton-induced processes at high-energy colliders. In this article, we propose a novel way to test the computation of lepton PDFs of the proton by analyzing both non-resonant di-lepton and resonant Z gauge boson production processes induced by leptons within the proton at proton-electron colliders like HERA and EIC. Despite the fact that lepton PDFs of the proton are known to be small, this work demonstrates that both processes imply a measurable yield of events at HERA and EIC, which could be used to test these PDFs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗