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
All sourcesNASA NTRSDOE OSTI
NASA NTRS1980

State-of-the-art Space Telescope Digicon performance data

The Digicon has been chosen as the detector for the High Resolution Spectrograph and the Faint Object Spectrograph of the Space Telescope. Both tubes are 512 channel, parallel-output devices and feature CsTe photocathodes on MgF2 faceplates. Using a computer-assisted test facility, the tubes have been characterized with respect to diode array performance, photocathode response (1100-9000 A), and imaging capability. Data are presented on diode dark current and capacitance distributions, pulse height resolution, photocathode quantum efficiency, uniformity and blemishes, dark count rate, distortion, resolution, and crosstalk.

Ginaven, R. O.↗
NASA NTRS2004

Chemistry Modeling for Aerothermodynamics and TPS

Recent advances in supercomputers and highly scalable quantum chemistry software render computational chemistry methods a viable means of providing chemistry data for aerothermal analysis at a specific level of confidence. Four examples of first principles quantum chemistry calculations will be presented. The study of the highly nonequilibrium rotational distribution of nitrogen molecule from the exchange reaction N + N2 illustrates how chemical reactions can influence the rotational distribution. The reaction C2H + H2 is one example of a radical reaction that occurs during hypersonic entry into a methane containing atmosphere. A study of the etching of Si surface illustrates our approach to surface reactions. A recently developed web accessible database and software tool (DDD) that provides the radiation profile of diatomic molecules is also described.

Wang, Dun-You↗
DOE OSTI2023

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

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

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

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

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

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

A Polynomial-Time Classical Algorithm for Noisy Quantum Circuits

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

decoherence↗
DOE OSTI2024

Light-front puzzles

Abstract Light-front formulations of quantum field theories have many advantages for computing electroweak matrix elements of strongly interacting systems and other quantities that are used to study hadronic structure. The theory can be formulated in Hamiltonian form so non-perturbative calculations of the strongly interacting initial and final states are in principle reduced to linear algebra. These states are needed for calculating parton distribution functions and other types of distribution amplitudes that are used to understand the structure of hadrons. Light-front boosts are kinematic transformations so the strongly interacting states can be computed in any frame. This is useful for computing current matrix elements involving electroweak probes where the initial and final hadronic states are in different frames related by the momentum transferred by the probe. Finally in many calculations the vacuum is trivial so the calculations can be formulated in Fock space. The advantages of light front-field theory would not be interesting if the light-front formulation was not equivalent to the covariant or canonical formulations of quantum field theory. Many of the distinguishing properties of light-front quantum field theory are difficult to reconcile with canonical or covariant formulations of quantum field theory. This paper discusses the resolution of some of the apparent inconsistencies in canonical, covariant and light-front formulations of quantum field theory. The puzzles that will be discussed are (1) the problem of inequivalent representations (2) the problem of the trivial vacuum (3) the problem of ill-posed initial value problems (4) the problem of rotational covariance (5) the problem of zero modes and (6) the problem of spontaneously broken symmetries.

Physics↗
DOE OSTI2024

Empowering a qudit-based quantum processor by traversing the dual bosonic ladder

Abstract High-dimensional quantum information processing has emerged as a promising avenue to transcend hardware limitations and advance the frontiers of quantum technologies. Harnessing the untapped potential of the so-called qudits necessitates the development of quantum protocols beyond the established qubit methodologies. Here, we present a robust, hardware-efficient, and scalable approach for operating multidimensional solid-state systems using Raman-assisted two-photon interactions. We then utilize them to construct extensible multi-qubit operations, realize highly entangled multidimensional states including atomic squeezed states and Schrödinger cat states, and implement programmable entanglement distribution along a qudit array. Our work illuminates the quantum electrodynamics of strongly driven multi-qudit systems and provides the experimental foundation for the future development of high-dimensional quantum applications such as quantum sensing and fault-tolerant quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Multi-modality deep learning for pulse prediction in homogeneous nonlinear systems via parametric conversion

In this Letter, we introduce FusionNet, a multi-modality deep learning framework designed to predict and analyze output pulses in high-power rare-earth-doped laser systems driving parametric conversion in homogeneous guided nonlinear media. FusionNet integrates temporal, spectral, and physical experimental conditions to model ultrafast nonlinear phenomena, including parametric nonlinear frequency conversion, self-phase modulation, and cross-phase modulation in homogeneous guided systems such as gas-filled hollow-core fibers. These systems bridge physical models with experimental data, advancing our understanding of light-guiding principles and nonlinear interactions while expediting the design and optimization of on-demand high-power, high-brightness systems. Our results demonstrate a 73% reduction in prediction error and an 83% improvement in computational efficiency compared to conventional neural networks. This work establishes a new paradigm for accelerating parametric simulations and optimizing experimental designs in high-power laser systems, with further implications for high-precision spectroscopy, quantum information science, and distributed entangled interconnects.

47 OTHER INSTRUMENTATION↗
DOE OSTI2023

Single-Photon Detector & Counter for Transduction

Over the recent years, quantum computers have procured the attention of the public, largely due to their fast factoring capabilities and potential for efficient simulation of quantum dynamics \cite{RevModPhys.79.135}. This interest, coupled with advances in quantum transduction, could lead to the realization of a quantum distributed network, effectively linking dilution fridges across vast distances. Presently, there are several qubit systems developed for encoding quantum information. They primarily fall into two categories: those exploiting optical frequencies for excitation, and those operating at microwave frequencies. Optical frequency qubit systems include trapped ions, neutral atoms, quantum dots, and solid-state defects. Microwave frequency qubit system encompass superconducting qubits (transmon) and spins in crystals. Among these, transmons are particularly intriguing due to their low-loss of photons at microwave frequencies. The Josephson effect within a superconducting circuit enables high-fidelity quantum operations \cite{Microwave-optical_quantum_frequency_conversion}. Thus, it is non-trivial to develop an apparatus for efficiently bridging microwave and optical frequency regimes.

Bautista-Cortezano, Pablo↗
DOE OSTI2022

Distributed deep learning training using silicon photonic switched architectures

The scaling trends of deep learning models and distributed training workloads are challenging network capacities in today’s datacenters and high-performance computing (HPC) systems. We propose a system architecture that leverages silicon photonic (SiP) switch-enabled server regrouping using bandwidth steering to tackle the challenges and accelerate distributed deep learning training. In addition, our proposed system architecture utilizes a highly integrated operating system-based SiP switch control scheme to reduce implementation complexity. To demonstrate the feasibility of our proposal, we built an experimental testbed with a SiP switch-enabled reconfigurable fat tree topology and evaluated the network performance of distributed ring all-reduce and parameter server workloads. The experimental results show up to 3.6× improvements over the static non-reconfigurable fat tree. Our large-scale simulation results show that server regrouping can deliver up to 2.3× flow throughput improvement for a 2× tapered fat tree and a further 11% improvement when higher-layer bandwidth steering is employed. The collective results show the potential of integrating SiP switches into datacenters and HPC systems to accelerate distributed deep learning training.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Visualizing heterogeneous dipole fields by terahertz light coupling in individual nano-junctions

The challenge underlying superconducting quantum computing is to remove materials bottleneck for highly coherent quantum devices. The nonuniformity and complex structural components in the underlying quantum circuits often lead to local electric field concentration, charge scattering, dissipation and ultimately decoherence. Here we visualize interface dipole heterogeneous distribution of individual Al/AlO$_{x}$/Al junctions employed in transmon qubits by broadband terahertz scanning near-field microscopy that enables the non-destructive and contactless identification of defective boundaries in nano-junctions at an extremely precise nanoscale level. Our THz nano-imaging tool reveals an asymmetry across the junction in electromagnetic wave-junction coupling response that manifests as hot (high intensity) vs cold (low intensity) spots in the spatial electrical field structures and correlates with defected boundaries from the multi-angle deposition processes in Josephson junction fabrication inside qubit devices. The demonstrated local electromagnetic scattering method offers high sensitivity, allowing for reliable device defect detection in the pursuit of improved quantum circuit fabrication for ultimately optimizing coherence times.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Bipartite mutual information in classical many-body dynamics

Information theoretic measures have helped to sharpen our understanding of many-body quantum states. As perhaps the most well-known example, the entanglement entropy (or more generally, the bipartite mutual information) has become a powerful tool for characterizing the dynamical growth of quantum correlations. By contrast, although computable, the bipartite mutual information (MI) is almost never explored in classical many particle systems; this owes in part to the fact that computing the MI requires keeping track of the evolution of the full probability distribution, a feat which is rarely done (or thought to be needed) in classical many-body simulations. Here, we utilize the MI to analyze the spreading of information in 1D elementary cellular automata (CA). Broadly speaking, we find that the behavior of the MI in these dynamical systems exhibits a few different types of scaling that roughly correspond to known CA universality classes. Of particular note is that we observe a set of automata for which the MI converges parametrically slowly to its thermodynamic value. We develop a microscopic understanding of this behavior by analyzing a two-species model of annihilating particles moving in opposite directions. Furthermore, our work suggests the possibility that information theoretic tools such as the MI might enable a more fine-grained characterization of classical many-body states and dynamics.

Cellular automata↗
DOE OSTI2018

Electron-Phonon Systems on a Universal Quantum Computer

We present an algorithm that extends existing quantum algorithms for simulating fermion systems in quantum chemistry and condensed matter physics to include bosons in general and phonons in particular. We introduce a qubit representation for the low-energy subspace of phonons which allows an efficient simulation of the evolution operator of the electron-phonon systems. As a consequence of the Nyquist-Shannon sampling theorem, the phonons are represented with exponential accuracy on a discretized Hilbert space with a size that increases linearly with the cutoff of the maximum phonon number. The additional number of qubits required by the presence of phonons scales linearly with the size of the system. The additional circuit depth is constant for systems with finite-range electron-phonon and phonon-phonon interactions and linear for long-range electron-phonon interactions. Our algorithm for a Holstein polaron problem was implemented on an Atos quantum learning machine quantum simulator employing the quantum phase estimation method. The energy and the phonon number distribution of the polaron state agree with exact diagonalization results for weak, intermediate, and strong electron-phonon coupling regimes.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

DCA++: A software framework to solve correlated electron problems with modern quantum cluster methods

We present the first open release of the DCA++ project, a high-performance research software framework to solve quantum many-body problems with cutting edge quantum cluster algorithms. DCA++ implements the dynamical cluster approximation (DCA) and its DCA extension with a continuous self-energy. The algorithms capture nonlocal correlations in strongly correlated electron systems, thereby giving insight into high-$T_c$ superconductivity. The code’s scalability allows efficient usage of systems at all scales, from workstations to leadership computers. With regard to the increasing heterogeneity of modern computing machines, DCA++ provides portable performance on conventional and emerging new architectures, such as hybrid CPU–GPU, sustaining multiple petaflops on ORNL’s Titan and CSCS’ Piz Daint supercomputers. Moreover, we show how sustainable and scalable development of the code base has been achieved by adopting standard techniques of the software industry. These include employing a distributed version control system, applying test-driven development and following continuous integration.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Low-overhead transversal fault tolerance for universal quantum computation

Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, we can achieve low logical error rates. However, for many practical quantum error correction codes such as the surface code, owing to syndrome measurement errors, standard constructions require multiple extraction rounds—of the order of the code distance d—for fault-tolerant computation, particularly considering fault-tolerant state preparation. Here we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of quantum error correction codes, including the surface code with magic state inputs and feedforward, to achieve ‘transversal algorithmic fault tolerance’. Through the combination of transversal operations7 and new strategies for correlated decoding, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword because of measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Furthermore, our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space–time cost of practical fault-tolerant quantum computation by over an order of magnitude.

Zhou, Hengyun [QuEra Computing, Boston, MA (United↗
DOE OSTI2024

Neutrino fast flavor oscillations with moments: Linear stability analysis and application to neutron star mergers

Providing an accurate modeling of neutrino physics in dense astrophysical environments such as binary neutron star mergers presents a challenge for hydrodynamic simulations. Nevertheless, understanding how flavor transformation can occur and affect the dynamics, the mass ejection, and the nucleosynthesis will need to be achieved in the future. Computationally expensive, large-scale simulations frequently evolve the first classical angular moments of the neutrino distributions. By promoting these quantities to matrices in flavor space, we develop a linear stability analysis of fast flavor oscillations using only the first two “quantum” moments, which notably requires generalizing the classical closure relations that appropriately truncate the hierarchy of moment equations in order to treat quantum flavor coherence. After showing the efficiency of this method on a well-understood test situation, we perform a systematic search of the occurrence of fast flavor instabilities in a neutron star merger simulation. Here, we discuss the successes and shortcomings of moment linear stability analysis, as this framework provides a time-efficient way to design and study better closure prescriptions in the future.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2018

Validating quantum-classical programming models with tensor network simulations

The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractability, validation and benchmarking are critical to understanding the utility of the hybrid computational model. In this paper, we demonstrate a newly developed quantum circuit simulator based on tensor network theory that enables intermediate-scale verification and validation of hybrid quantum-classical computing frameworks and programming models. We present our tensor-network quantum virtual machine (TNQVM) simulator which stores a multi-qubit wavefunction in a compressed (factorized) form as a matrix product state, thus enabling single-node simulations of larger qubit registers, as compared to brute-force statevector simulators. Our simulator is designed to be extensible in both the tensor network form and the classical hardware used to run the simulation (multicore, GPU, distributed). The extensibility of the TNQVM simulator with respect to the simulation hardware type is achieved via a pluggable interface for different numerical backends (e.g., ITensor and ExaTENSOR numerical libraries). We demonstrate the utility of our TNQVM quantum circuit simulator through the verification of randomized quantum circuits and the variational quantum eigensolver algorithm, both expressed within the eXtreme-scale ACCelerator (XACC) programming model.

97 MATHEMATICS AND COMPUTING↗