Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Classic”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows

Solving the electronic structure problem of molecules and solids to high accuracy is a major challenge in quantum chemistry and condensed matter physics. The rapid emergence and development of quantum computers offer a promising route to systematically tackle this problem. Recent work by [Huggins et al ., Nature (London) 603 , 416 (2022)] proposed a hybrid quantum-classical quantum Monte Carlo (QC-QMC) algorithm using Clifford shadows to determine the ground state of a Fermionic Hamiltonian. This approach displayed inherent noise resilience and the potential for improved accuracy compared to its purely classical counterpart. Nevertheless, the use of Clifford shadows introduces an exponentially scaling postprocessing cost. In this work, we investigate an improved QC-QMC scheme utilizing the recently developed Matchgate shadows technique [Commun. Math. Phys. 404 , 629 (2023)], which removes the aforementioned exponential bottleneck. We observe from experiments on quantum hardware that the use of Matchgate shadows in QC-QMC is inherently noise robust. We show that this noise resilience has a more subtle origin than in the case of Clifford shadows. Nevertheless, we find that classical postprocessing, while asymptotically efficient, requires hours of runtime on thousands of classical CPUs for even the smallest chemical systems, presenting a major challenge to the scalability of the algorithm.

Monte Carlo methods↗
DOE OSTI2024

VOTCA: multiscale frameworks for quantum and classical simulations in soft matter

Many physical phenomena in liquids and soft matter are multiscale by nature and can involve processes with quantum and classical degrees of freedom occurring over a vast range of length- and timescales. Examples range from structure formation processes of complex polymers or even polymer blends (Svaneborg & Everaers, 2023) on the classical side to charge and energy transport and conversion processes (Lee et al., 2019) involving explicit electronic and, therefore, quantum information. The Versatile Object-oriented Toolkit for Coarse-graining Applications (VOTCA) provides multiscale frameworks built on a comprehensive set of methods for the development of classical coarse-grained potentials (VOTCA-CSG) as well as state-of-the art excited state electronic structure methods based on density-functional and many-body Green’s function theories, coupled in mixed quantum-classical models and used in kinetic network models (VOTCA-XTP).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Real classical shadows

Efficiently learning expectation values of a quantum state using classical shadow tomography has become a fundamental task in quantum information theory. In a classical shadows protocol, one measures a state in a chosen basis $\mathcal{W}$ after it has evolved under a unitary transformation randomly sampled from a chosen distribution $\mathcal{U}$. In this work we study the case where $\mathcal{U}$ corresponds to either local or global orthogonal Clifford gates, and $\mathcal{W}$ consists of real-valued vectors. Our results show that for various situations of interest, this ‘real’ classical shadow protocol improves the sample complexity over the standard scheme based on general Clifford unitaries. For example, when one is interested in estimating the expectation values of arbitrary real-valued observables, global orthogonal Cliffords typically decrease the required number of samples by a factor of two. More dramatically, for k-local observables composed only of real-valued Pauli operators, sampling local orthogonal Cliffords leads to a reduction by an exponential-in-k factor in the sample complexity over local unitary Cliffords. Finally, we show that by measuring in a basis containing complex-valued vectors, orthogonal shadows can, in the limit of large system size, exactly reproduce the original unitary shadows protocol.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Quantum Simulation of Molecular Dynamics Processes─A Benchmark Study Using a Classical Simulator and Present-Day Quantum Hardware

Here, we explore how the fundamental problems in quantum molecular dynamics can be modeled using classical simulators (emulators) of quantum computers and the actual quantum hardware available to us today. The list of problems we tackle includes propagation of a free wave packet, vibration of a harmonic oscillator, and tunneling through a barrier. Each of these problems starts with the initial wave packet setup. Although Qiskit provides a general method for initializing wave functions, in most cases it generates deep quantum circuits. While these circuits perform well on noiseless simulators, they suffer from excessive noise on quantum hardware. To overcome this issue, we designed a shallower quantum circuit for preparing a Gaussian-like initial wave packet, which improves the performance of real hardware. Next, quantum circuits are implemented to apply the kinetic and potential energy operators for the evolution of a wave function over time. The results of our modeling on classical emulators of quantum hardware agree perfectly with the results obtained using the traditional (classical) methods. This serves as a benchmark and demonstrates that the quantum algorithms and Qiskit codes we developed are accurate. However, the results obtained on the actual quantum hardware available today, such as IBM’s superconducting qubits and IonQ’s trapped ions, indicate large discrepancies due to hardware limitations. This work highlights both the potential and challenges of using quantum computers to solve fundamental quantum molecular dynamics problems.

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

Quantum Circuit Cutting for Classical Shadows

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be executed more robustly using fewer quantum resources. We introduce a divide-and-conquer circuit cutting method for estimating the expectation values of observables using classical shadows. We derive a general formula for making predictions using the classical shadows of circuit fragments from arbitrarily cut circuits and provide the sample complexity analysis for the case when observables factorize across fragments. Then, we numerically show that our divide-and-conquer method outperforms traditional uncut shadow tomography when estimating high-weight observables that act non-trivially on many qubits and discuss the mechanisms for this advantage.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Quantum teleportation coexisting with classical communications in optical fiber

The ability for quantum and conventional networks to operate in the same optical fibers would aid the deployment of quantum network technology on a large scale. Quantum teleportation is a fundamental operation in quantum networking, but has yet to be demonstrated in fibers populated with high-power conventional optical signals. Here we report, to the best of our knowledge, the first demonstration of quantum teleportation over fibers carrying conventional telecommunications traffic. Quantum state transfer is achieved over a 30.2-km fiber carrying 400-Gbps C-band classical traffic with a Bell state measurement performed at the fiber’s midpoint. To protect quantum fidelity from spontaneous Raman scattering noise, we use optimal O-band quantum channels, narrow spectro-temporal filtering, and multi-photon coincidence detection. Fidelity is shown to be well maintained with an elevated C-band launch power of 18.7 dBm for the single-channel 400-Gbps signal, which we project could support multiple classical channels totaling many terabits/s aggregate data rates. These results show the feasibility of advanced quantum and classical network applications operating within a unified fiber infrastructure.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

The classical equations of motion of quantized gauge theories, Part 2: Electromagnetism

In this and companion papers, we show that quantum field theories with gauge symmetries permit a broader class of classical dynamics than typically assumed. In this article, we show that the quantization of electromagnetism permits the existence of classical electric field states that do not obey Gauss’s law. These states are gauge invariant and their time evolution can be consistently described using the Schrödinger equation. The time evolution of these states is such that at the classical level, the full set of Maxwell’s equations would appear to hold, with the physical effects of these states being attributable to an auxiliary, static “shadow” charge density with no internal degrees of freedom. This density could affect the dynamics of charged particles in our universe and it may thus be of observational interest.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2025

Structure of Novel Phosphonium-Based Ionic Liquids with S and O Substitutions from Experiments and a Mixed Quantum-Classical Approach

This article presents experimental characterization information and synchrotron X-ray scattering measurements on a set of novel O- and S-substituted phosphonium-based ionic liquids (ILs) all coupled with the bis(fluorosulfonyl)imide (FSI-) anion. The ILs include the ethoxyethyltriethylphosphonium (P 222(2O2) + ) and triethyl[2-(ethylthio)ethyl]phosphonium (P 222(2S2) + ) cations, and we contrast results on these with those for unsubstituted triethylpentylphosphonium (P 2225 + ). The article also introduces a physics-based protocol that combines classical force field studies on larger simulation boxes with classical and first-principles studies on smaller boxes. The method produces significantly improved S(q) functions in the regime which in prior publications we have associated with inter- and intraionic adjacency correlations. By understanding which shorter-range structural changes improve S(q) in the q-regime of interest, we are also able to pinpoint specific deficiencies in the classical force field model. The approach we take should be quite general and could help study other complex liquids on different length scales.

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

An on-chip phased array for non-classical light

Abstract Quantum science and technology can offer fundamental enhancements in sensing, communications and computing. The expansion from wired to wireless links is an exciting prospect for quantum technologies. For classical technologies, the advent of phased arrays enabled directional and adaptive wireless links by manipulating electromagnetic waves over free space. Here we demonstrate a phased array system on a chip that can receive, image and manipulate non-classical light over free space. We use an integrated photonic-electronic system with more than 1000 functional components on-chip to detect squeezed light. By integrating an array of 32 sub-wavelength engineered metamaterial antennas, we demonstrate a direct free-space-to-chip interface for reconfigurable quantum links. On the same chip, we implement a large-scale array of quantum-limited coherent receivers that can resolve non-classical signals simultaneously across 32 channels. With coherent readout and manipulation of these signals, we demonstrate 32-pixel imaging and spatially configurable reception of squeezed light over free space. Our work advances wireless quantum technologies that could enable practical applications in quantum communications and sensing.

Science & Technology - Other Topics↗
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 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 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 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↗
DOE OSTI2026

Classical-Quantum Algorithm for Solving Stochastic Programs

Stochastic programming provides a rigorous mathematical framework for making decisions under uncertainty in a risk-aware manner. Two-stage stochastic programming is, perhaps, the simplest form of this framework. Here the first-stage variables represent decisions that must be made "here and now" in the face of uncertainty, while the second-stage variables are decisions made after uncertain events. However, the broad adoption of stochastic programming has been hindered by computational challenges caused by the two-stage stochastic programming formulation which requires solving an ensemble of optimization problems. Using quantum amplitude estimation (QAE), quantum computers have shown the theoretic ability to compute expectations with Monte-Carlo methods with quadratically fewer samples than classical methods. In this work, we present a quantum algorithm for computing the expectation term using QAE for given first-stage decisions. Further, we detail methods of computing gradient information from the quantum calculation enabling the application of classical gradient-based optimization techniques. The result is a classical-quantum hybrid method of solving two-stage stochastic programs. These techniques are demonstrated with computational experiments based an engineering optimization problem.

97 MATHEMATICS AND COMPUTING↗