Search NASA⌕ Search

SEARCH · Search NASA

Results for “classical”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

XACC: a system-level software infrastructure for heterogeneous quantum–classical computing

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. In this work, we present XACC, a system-level software infrastructure for quantum–classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. Additionally, we detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum–classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows

Quantum algorithms exploiting real-time evolution under a target Hamiltonian have demonstrated remarkable efficiency in extracting key spectral information. However, the broader potential of these methods, particularly beyond ground-state calculations, is underexplored. In this work, we introduce the framework of multiobservable dynamic mode decomposition (MODMD), which combines the observable dynamic mode decomposition (DMD), a measurement-driven eigensolver tailored for near-term implementation, with classical shadow tomography. MODMD leverages random scrambling in the classical shadow technique to construct, with exponentially reduced resource requirements, a signal subspace that encodes rich spectral information. Notably, we replace typical Hadamard-test circuits with a protocol designed to predict low-rank observables, thereby broadening the use of classical shadow tomography for predicting many low-rank observables. We establish theoretical guarantees on the spectral approximation from MODMD, taking into account distinct sources of error. In the ideal case, we prove that the spectral error scales as exp (−Δ⁢𝐸⁢𝑡 max ), where Δ⁢𝐸 is the Hamiltonian spectral gap and 𝑡 max is the maximal simulation time. This analysis provides a rigorous justification of the rapid convergence observed across simulations. To demonstrate the utility of our framework, we consider its application to fundamental tasks, such as determining the low-lying, i.e., ground or excited, energies of representative many-body systems. Our work paves the path for efficient designs of measurement-driven algorithms on near-term and early fault-tolerant quantum devices.

quantum algorithms & computation↗
DOE OSTI2023

Numerical evidence against advantage with quantum fidelity kernels on classical data

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential “flattening” of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

Quantum Information, Science & Technology↗
DOE OSTI2024

Procrustean entanglement concentration in quantum-classical networking

The success of a future quantum internet will rest in part on the ability of quantum and classical signals to coexist in the same optical fiber infrastructure, a challenging endeavor given the orders of magnitude differences in flux of single-photon-level quantum fields and bright classical traffic. Here, we theoretically describe and experimentally implement Procrustean entanglement concentration for polarization-entangled states contaminated with classical light, showing significant mitigation of crosstalk noise in dense wavelength-division multiplexing. Our approach leverages a pair of polarization-dependent loss emulators to attenuate highly polarized crosstalk that results from imperfect isolation of conventional signals copropagating on shared fiber links. We demonstrate our technique both on the tabletop and over a deployed quantum local area network, finding a substantial improvement of two-qubit entangled state fidelity from approximately 75% to over 92%. This local filtering technique could be used as a preliminary step to reduce asymmetric errors, potentially improving the overall efficiency when combined with more complex error-mitigation techniques in future quantum repeater networks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Geometric integration of classical spin dynamics via a mean-field Schrödinger equation

The Landau-Lifshitz equation describes the time evolution of magnetic dipoles and can be derived by taking the classical limit of a quantum mechanical spin Hamiltonian. To take this limit, one constrains the many-body quantum state to a tensor product of coherent states, thereby neglecting entanglement between sites. Expectation values of the quantum spin operators produce the usual classical spin dipoles. One may also consider expectation values of polynomials of the spin operators, leading to quadrupole and higher-order spin moments, which satisfy a dynamical equation of motion that generalizes the Landau-Lifshitz dynamics [Zhang and Batista, Phys. Rev. B 104, 104409 (2021)]. Here we reformulate the dynamics of these N 2 –1 generalized spin components as a mean-field Schrödinger equation on the N-dimensional coherent state. Furthermore, this viewpoint suggests efficient integration methods that respect the local symplectic structure of the classical spin dynamics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Quantum-to-classical crossover in generalized spin systems: Temperature-dependent spin dynamics of FeI 2

Simulating quantum spin systems at finite temperatures is an open challenge in many-body physics. This work studies the temperature-dependent spin dynamics of a pivotal compound, FeI 2 , to determine if universal quantum effects can be accounted for by a phenomenological renormalization of the dynamical spin structure factor $S$(q, $ω$) measured by inelastic neutron scattering. Renormalization schemes based on the quantum-to-classical correspondence principle are commonly applied at low temperatures to the harmonic oscillators describing normal modes. However, it is not clear how to extend this renormalization to arbitrarily high temperatures. Here we introduce a temperature-dependent normalization of the classical moments, whose magnitude is determined by imposing the quantum sum rule, e.g., $∫$ $dωd$q$S$ ($q, ω$) = $N$ $S$ $S$ ($S$ + 1)for $N$ $S$ dipolar magnetic moments. We show that this simple renormalization scheme significantly improves the agreement between the calculated and measured $S$(q, $ω$) for FeI 2 at all temperatures. In conclusion, due to the coupled dynamics of dipolar and quadrupolar moments in that material, this renormalization procedure is extended to classical theories based on SU(3) coherent states, and by extension, to any SU($N$) coherent state representation of local multipolar moments.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Classical dynamics of the antiferromagnetic Heisenberg spin ladder

We employ a classical limit grounded in SU(4) coherent states to investigate the temperature-dependent dynamical spin structure factor of the S = 1/2 ladder consisting of weakly coupled dimers. By comparing the outcomes of this classical approximation with density matrix renormalization group and exact diagonalization calculations in finite size ladders, we demonstrate that the classical dynamics offers an accurate approximation across the entire temperature range when the interdimer coupling is weak and a good approximation in the high temperature regime even when the interdimer coupling is strong. This agreement is achieved after appropriately rescaling the temperature axis and renormalizing expectation values to satisfy a quantum sum rule. Here, we anticipate the method will be particularly effective when applied to 2D and 3D lattices composed of weakly-coupled dimers, situations that remain challenging for alternative numerical methods.

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 OSTI2020

Investigating the use of field solvers for simulating classical systems

We explore the use of field solvers as approximations of classical Vlasov-Poisson systems. This correspondence is investigated in both electrostatic and gravitational contexts. We demonstrate the ability of field solvers to be excellent approximations of problems with cold initial condition into the nonlinear regime. We also investigate extensions of the Schrödinger-Poisson system that employ multiple stacked cold streams, and the von Neumann–Poisson equation as methods that can successfully reproduce the classical evolution of warm initial conditions. We then discuss how appropriate simulation parameters need to be chosen to avoid interference terms, aliasing, and wave behavior in the field solver solutions. Finally, we present a series of criteria clarifying how parameters need to be chosen in order to effectively approximate classical solutions.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2019

Revealing the Emergence of Classicality Using Nitrogen-Vacancy Centers

The origin of classical reality in our quantum world is a long-standing mystery. Here, we examine a nitrogen-vacancy center in diamond evolving in the presence of its magnetic nuclear spin environment which is formed by the natural appearance of carbon 13 C atoms in the diamond lattice, to study quantum Darwinism—the proliferation of information about preferred quantum states throughout the world via the environment. This redundantly imprinted information accounts for the perception of objective reality, as it is independently accessible by many without perturbing the system of interest. To observe this process, we implement a novel dynamical decoupling scheme that enables the measurement and control of several nuclear spins (the environment $\mathcal{E}$) interacting with a nitrogen vacancy (the system $\mathcal{S}$). Our experiment demonstrates that, in the course of the decoherence of $\mathcal{S}$, redundant information is indeed imprinted onto $\mathcal{E}$, giving rise to incipient classical objectivity—a consensus recorded in redundant copies, and available from the fragments of the nuclear spin environment E, about the state of $\mathcal{S}$. This provides the first laboratory verification of the process responsible for the emergence of the objective classical world from the underlying quantum substrate.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Classical shadows for quantum process tomography on near-term quantum computers

Quantum process tomography is a powerful tool for understanding quantum channels and characterizing the properties of quantum devices. Inspired by recent advances using classical shadows in quantum state tomography [H.-Y. Huang, R. Kueng, and J. Preskill, .], we have developed ShadowQPT, a classical shadow method for quantum process tomography. We introduce two related formulations with and without ancilla qubits. ShadowQPT stochastically reconstructs the Choi matrix of the device allowing for an classical evaluation of the device on arbitrary inputs with respect to arbitrary outputs. Using shadows, we then show how to compute overlaps, generate all k -weight reduced processes, and perform reconstruction via Hamiltonian learning. These latter two tasks are efficient for large systems as the number of quantum measurements needed scales only logarithmically with the number of qubits. A number of additional approximations and improvements are developed, including the use of a pair-factorized Clifford shadow and a series of postprocessing techniques that significantly enhance the accuracy for recovering the quantum channel. We have implemented ShadowQPT using both Pauli and Clifford measurements on the IonQ trapped ion quantum computer for quantum processes up to n = 4 qubits, and we achieved good performance. Published by the American Physical Society 2024

Levy, Ryan (ORCID:0000000349527156)↗
DOE OSTI2024

Quantum and classical spin dynamics across temperature scales in the S = 1 / 2 Heisenberg antiferromagnet

Using the framework of semiclassical Landau-Lifshitz dynamics (LLD), we conduct a systematic investigation of the temperature-dependent spin dynamics in the S = 1 / 2 Heisenberg square-lattice antiferromagnet (SAFM). By performing inelastic neutron scattering measurements on Zn 2 VO ( PO 4 ) 2 (ZVPO) and corresponding finite-temperature spin dynamics simulations based on LLD, we present a comprehensive analysis that bridges quantum and classical spin dynamics over a broad temperature range. First, remarkable agreement between experimental data and LLD simulations is found in the paramagnetic phase of ZVPO, demonstrating the capability of LLD in accurately determining the spin Hamiltonian of S = 1 / 2 systems and capturing the quantum-to-classical crossover of their spin dynamics. Second, by analyzing the discrepancies between the experimental data and the LLD simulations at lower temperatures, we determine the experimental temperature dependence of the quantum effects in the excitation spectrum of the S = 1 / 2 SAFM: the quantum renormalization factor for the magnon energies and the quantum continuum above the one-magnon bands. Notably, the emergence of each quantum effect is found to correlate with the formation of three-dimensional long-range order. This work demonstrates the utility of LLD in gaining experimental insights into the temperature-induced modifications of quantum spin dynamics and their convergence towards classical expectations at higher temperatures. This motivates further applications to more challenging quantum antiferromagnets dominated by stronger quantum fluctuations. Published by the American Physical Society 2024

36 MATERIALS SCIENCE↗
DOE OSTI2025

Renormalized classical theory of quantum magnets

Here, we derive a renormalized classical spin (RCS) theory for 𝑆 >1/2 quantum magnets by constraining a generalized classical theory that includes all multipolar fluctuations to a reduced CP 1 phase space of dipolar SU(2) coherent states. When the spin Hamiltonian $\hat{ℋ}$(𝑆) is linear in the spin operators $\hat{𝑺}$ 𝑗 for each lattice site 𝑗, the RCS Hamiltonian $\tilde{ℋ}$ cl coincides with the usual classical model ℋ cl = lim 𝑆→∞⁡ $\hat{ℋ}$(𝑆). In the presence of nonlinear terms, however, the RCS theory is more accurate than ℋ cl . For the many materials modeled by spin Hamiltonians with (nonlinear) single-ion anisotropy terms, the use of the RCS theory is essential to accurately model phase diagrams and to extract the correct Hamiltonian parameters from neutron-scattering data.

magnetic anisotropy↗
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

Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance

A recent quantum simulation of observables of the kicked Ising model on 127 qubits implemented circuits that exceed the capabilities of exact classical simulation. We show that several approximate classical methods, based on sparse Pauli dynamics and tensor network algorithms, can simulate these observables orders of magnitude faster than the quantum experiment and can also be systematically converged beyond the experimental accuracy. Our most accurate technique combines a mixed Schrödinger and Heisenberg tensor network representation with the Bethe free entropy relation of belief propagation to compute expectation values with an effective wave function–operator sandwich bond dimension >16,000,000, achieving an absolute accuracy, without extrapolation, in the observables of <0.01, which is converged for many practical purposes. We thereby identify inaccuracies in the experimental extrapolations and suggest how future experiments can be implemented to increase the classical hardness.

Science & Technology - Other Topics↗
DOE OSTI2023

A Backend-agnostic, Quantum-classical Framework for Simulations of Chemistry in C ++

As quantum computing hardware systems continue to advance, the research and development of performant, scalable, and extensible software architectures, languages, models, and compilers is equally as important to bring this novel coprocessing capability to a diverse group of domain computational scientists. For the field of quantum chemistry, applications and frameworks exist for modeling and simulation tasks that scale on heterogeneous classical architectures, and we envision the need for similar frameworks on heterogeneous quantum-classical platforms. Furthermore, we present the XACC system-level quantum computing framework as a platform for prototyping, developing, and deploying quantum-classical software that specifically targets chemistry applications. We review the fundamental design features in XACC, with special attention to its extensibility and modularity for key quantum programming workflow interfaces and provide an overview of the interfaces most relevant to simulations of chemistry. A series of examples demonstrating some of the state-of-the-art chemistry algorithms currently implemented in XACC are presented, while also illustrating the various APIs that would enable the community to extend, modify, and devise new algorithms and applications in the realm of chemistry.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2026

Q-IRIS: The Evolution of the IRIS Task-Based Runtime to Enable Classical-Quantum Workflows

Extreme heterogeneity in emerging HPC systems are starting to include quantum accelerators, motivating runtimes that can coordinate between classical and quantum workloads. We present a proof-of-concept hybrid execution framework integrating the IRIS asynchronous task-based runtime with the XACC quantum programming framework via the Quantum Intermediate Representation Execution Engine (QIR-EE). IRIS orchestrates multiple programs written in the quantum intermediate representation (QIR) across heterogeneous backends (including multiple quantum simulators), enabling concurrent execution of classical and quantum tasks. Although not a performance study, we report measurable outcomes through the successful asynchronous scheduling and execution of multiple quantum workloads. To illustrate practical runtime implications, we decompose a four-qubit circuit into smaller subcircuits through a process known as quantum circuit cutting, reducing per-task quantum simulation load and demonstrating how task granularity can improve simulator throughput and reduce queueing behavior -- effects directly relevant to early quantum hardware environments. We conclude by outlining key challenges for scaling hybrid runtimes, including coordinated scheduling, classical-quantum interaction management, and support for diverse backend resources in heterogeneous systems.

Miniskar, Narasinga Rao [ORNL] (ORCID:000000018259↗
DOE OSTI2024

Quantum-classical tradeoffs and multi-controlled quantum gate decompositions in variational algorithms

The computational capabilities of near-term quantum computers are limited by the noisy execution of gate operations and a limited number of physical qubits. Hybrid variational algorithms are well-suited to near-term quantum devices because they allow for a wide range of tradeoffs between the amount of quantum and classical resources used to solve a problem. This paper investigates tradeoffs available at both the algorithmic and hardware levels by studying a specific case – applying the Quantum Approximate Optimization Algorithm (QAOA) to instances of the Maximum Independent Set (MIS) problem. We consider three variants of the QAOA which offer different tradeoffs at the algorithmic level in terms of their required number of classical parameters, quantum gates, and iterations of classical optimization needed. Since MIS is a constrained combinatorial optimization problem, the QAOA must respect the problem constraints. This can be accomplished by using many multi-controlled gate operations which must be decomposed into gates executable by the target hardware. We study the tradeoffs available at this hardware level, combining the gate fidelities and decomposition efficiencies of different native gate sets into a single metric called the gate decomposition cost .

Tomesh, Teague↗