Search NASA⌕ Search

SEARCH · Search NASA

Results for “circuit theory”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2026

Gas-driven short disconnection mitigates thermal runaway in Li-ion batteries under mechanical abuse

Mechanical abuse poses a critical safety risk to Li-ion batteries by inducing internal short circuits that initiate thermal runaway. Remarkably, voltage recovery frequently emerges during thermal runaway initiation, a phenomenon that conventional theories fail to explain. Here, our study develops a new multiphysics mechanism to explain voltage recovery, termed gas-driven short disconnection, whereby internal gas pressure mechanically disengages short-circuit contacts and causes the cell voltage to rebound. This mechanism incorporates gas generation and its structural impact on the short circuit. Real-time optical and thermal imaging and X-ray computed tomography reveal fluid-structure interaction between internal gas flow and adjacent shorting contacts. We establish a mechanistic framework linking gas-driven short disconnection to cell-level voltage and temperature responses, elucidating the extension–truncation pattern of voltage recovery. Furthermore, thermal regime maps show that a voltage recovery duration exceeding 5 s correlates with limited temperature rise below 150 °C, indicating that sustained short-circuit disconnection suppresses Joule heating. Additionally, a dimensionless criterion is deduced from scaling analysis for physical plausibility of gas-driven short disconnection in mechanically abused cells. This finding inspires smart venting control, which regulates gas release to maintain the internal pressure while dissipating gas enthalpy, thereby providing a device-level strategy for thermal runaway mitigation.

Gas-driven short disconnection↗
DOE OSTI2024

Compiling Quantum Circuits for Dynamically Field-Programmable Neutral Atoms Array Processors

Dynamically field-programmable qubit arrays (DPQA) have recently emerged as a promising platform for quantum information processing. In DPQA, atomic qubits are selectively loaded into arrays of optical traps that can be reconfigured during the computation itself. Leveraging qubit transport and parallel, entangling quantum operations, different pairs of qubits, even those initially far away, can be entangled at different stages of the quantum program execution. Such reconfigurability and non-local connectivity present new challenges for compilation, especially in the layout synthesis step which places and routes the qubits and schedules the gates. In this paper, we consider a DPQA architecture that contains multiple arrays and supports 2D array movements, representing cutting-edge experimental platforms. Within this architecture, we discretize the state space and formulate layout synthesis as a satisfiability modulo theories problem, which can be solved by existing solvers optimally in terms of circuit depth. For a set of benchmark circuits generated by random graphs with complex connectivities, our compiler OLSQ-DPQA reduces the number of two-qubit entangling gates on small problem instances by 1.7x compared to optimal compilation results on a fixed planar architecture. To further improve scalability and practicality of the method, we introduce a greedy heuristic inspired by the iterative peeling approach in classical integrated circuit routing. Using a hybrid approach that combined the greedy and optimal methods, we demonstrate that our DPQA-based compiled circuits feature reduced scaling overhead compared to a grid fixed architecture, resulting in 5.1X less two-qubit gates for 90 qubit quantum circuits. These methods enable programmable, complex quantum circuits with neutral atom quantum computers, as well as informing both future compilers and future hardware choices.

Physics↗
DOE OSTI2025

Classical and quantum simulations of 1+1-dimensional ${\mathbb{Z}}_{2}$ gauge theory at finite temperature and density

Simulating strongly coupled gauge theories at finite temperature and density is a longstanding challenge in nuclear and high-energy physics with fundamental implications for condensed matter physics. Here, we simulate such systems using minimally entangled typical thermal state (METTS) approaches, which combine classical random sampling with imaginary-time evolution, implementable on either classical or quantum computers, to estimate thermal averages of observables. We study 1+1-dimensional ${\mathbb{Z}}_{2}$ gauge theory coupled to spinless fermionic matter, which maps onto a local quantum spin chain. We benchmark both a classical matrix-product-state implementation of METTS and a recently proposed adaptive variational approach for near-term quantum devices, focusing on the equation of state and measures of fermion confinement. Of particular importance is the choice of basis for METTS sampling, which impacts both the sampling overhead and quantum circuit complexity. Our work sets the stage for future studies of strongly coupled gauge theories using classical and quantum hardware.

Chen, I-Chi [Iowa State Univ., Ames, IA (United St↗
DOE OSTI2023

Preparations for quantum simulations of quantum chromodynamics in 1+1 dimensions. I. Axial gauge

Here, tools necessary for quantum simulations of 1+1 dimensional quantum chromodynamics are developed. When formulated in axial gauge and with two flavors of quarks, this system requires 12 qubits per spatial site with the gauge fields included via nonlocal interactions. Classical computations and D-wave’s quantum annealer advantage are used to determine the hadronic spectrum, enabling a decomposition of the masses and a study of quark entanglement. Color “edge” states confined within a screening length of the end of the lattice are found. IBM’s seven-qubit quantum computers, ibmq_jakarta and ibm_perth, are used to compute dynamics from the trivial vacuum in one-flavor QCD with one spatial site. More generally, the Hamiltonian and quantum circuits for time evolution of 1+1 dimensional SU(N c ) gauge theory with Nf flavors of quarks are developed, and the resource requirements for large-scale quantum simulations are estimated.

1+1 dimensions↗
DOE OSTI2021

High efficiency compact microwave sources using electrostatic potential depression

In this article, we report theoretical and design studies on the application of an electrostatic potential depression (EPD) on two types of traditional microwave sources, the klystron and the inductive output tube (IOT), both operating in the UHF band. Additionally, the EPD is implemented by a section of the metallic beam pipe on which a direct current (dc) negative high voltage is applied. Inside the EPD section, the modulated electron beam develops into bunches over a very short longitudinal distance, indicating a possible design approach for a compact device. With the application of an EPD, the peak value of the first harmonic current in a microwave tube can be further increased compared to that in a conventional design, suggesting higher circuit efficiency. As the electron beam leaves the EPD section, the reacceleration of the beam provides a longitudinal cooling effect. With the addition of an EPD, circuit power extraction efficiency above 80% is achieved in both the modified design of the IOT and the novel conceptual circuit design of the klystron.

42 ENGINEERING↗
DOE OSTI2022

Entanglement perspective on the quantum approximate optimization algorithm

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which aims to solve quadratic unconstrained binary optimization problems. Hence, the expected final state for these algorithms is either a product state or a low-entangled superposition involving a few bitstrings. What happens in between the initial N -qubit product state | 0 〉 ⊗ N and the final one regarding entanglement? Here, we consider the QAOA algorithm for solving the paradigmatic MaxCut problem on different types of graphs. We study the entanglement growth and spread resulting from randomized and optimized QAOA circuits and find that there is a volume-law entanglement barrier between the initial and final states. We also investigate the entanglement spectrum in connection with random matrix theory. In addition, we compare the entanglement production with a quantum annealing protocol aiming to solve the same MaxCut problems. Finally, we discuss the implications of our results for the simulation of QAOA circuits with tensor network-based methods relying on low-entanglement for efficiency, such as matrix product states.

Dupont, Maxime↗
DOE OSTI2025

Structure of the Majorana Clifford group

In quantum information science, Clifford operators and stabilizer codes play a central role for systems of qubits (or qudits). In this study, we study their analogs for systems composed of Majorana fermions. In this case, a crucial role is played by fermion parity symmetry, which is an unbreakable symmetry present in any system with fundamentally fermionic degrees of freedom. We prove that the subgroup of parity-preserving Majorana Cliffords can be represented by the orthogonal group over the binary field 𝔽 2 , and we show how it can be generated by braiding operators and used to construct any (even-parity) Majorana stabilizer code. We also analyze the frame potential for this so-called p-Clifford group when acting on a fixed-parity sector of the Hilbert space, proving that it is equivalent to the frame potential of the ordinary Clifford group acting on the same sector.

Computational complexity↗
DOE OSTI2021

Inelastic Scattering of a Photon by a Quantum Phase Slip

Spontaneous decay of a single photon is a notoriously inefficient process in nature irrespective of the frequency range. We report that a quantum phase-slip fluctuation in high-impedance superconducting waveguides can split a single incident microwave photon into a large number of lower-energy photons with a near unit probability. The underlying inelastic photon-photon interaction has no analogs in non-linear optics. Instead, the measured decay rates are explained without adjustable parameters in the framework of a new model of a quantum impurity in a Luttinger liquid. Our result connects circuit quantum electrodynamics to critical phenomena in two-dimensional boundary quantum field theories, important in the physics of strongly-correlated systems. Here, the photon lifetime data represents a rare example of verified and useful quantum many-body simulation.

1-dimensional systems↗
DOE OSTI2024

Nearly optimal state preparation for quantum simulations of lattice gauge theories

Here, we present several improvements to the recently developed ground-state preparation algorithm based on the quantum eigenvalue transformation for unitary matrices (QETU), apply this algorithm to a lattice formulation of U(1) gauge theory in (2+1) dimensions, as well as propose an alternative application of QETU, a highly efficient preparation of Gaussian distributions. The QETU technique was originally proposed as an algorithm for nearly optimal ground-state preparation and ground-state energy estimation on early fault-tolerant devices. It uses the time-evolution input model, which can potentially overcome the large overall prefactor in the asymptotic gate cost arising in similar algorithms based on the Hamiltonian input model. We present modifications to the original QETU algorithm that significantly reduce the cost for the cases of both exact and Trotterized implementation of the time evolution circuit. We use QETU to prepare the ground state of a U(1) lattice gauge theory in two spatial dimensions, explore the dependence of computational resources on the desired precision and system parameters, and discuss the applicability of our results to general lattice gauge theories. We also demonstrate how the QETU technique can be utilized for preparing Gaussian distributions and wave packets in a way which outperforms existing algorithms for as little as n q ≳ 2–5 qubits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Using Hyperoptimized Tensor Networks and First-Principles Electronic Structure to Simulate the Experimental Properties of the Giant {Mn 84 } Torus

The single-molecule magnet {Mn 84 } is a challenge to theory because of its high nuclearity. Here, we directly compute two experimentally accessible observables, the field-dependent magnetization up to 75 T and the temperature-dependent heat capacity, using parameter-free theory. In particular, we use first-principles calculations to derive short- and long-range exchange interactions and compute the exact partition function of the resulting classical Potts and Ising spin models for all 84 Mn S = 2 spins to obtain observables. The latter computation is made possible by using hyperoptimized tensor network contractions, a technique developed to simulate quantum supremacy circuits. We also synthesize the magnet and measure its heat capacity and magnetization, observing qualitative agreement between theory and experiment and identifying an unusual bump in the heat capacity and a plateau in the magnetization. Our work also identifies some limitations of current theoretical modeling in large magnets, such as sensitivity to small, long-range exchange couplings.

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

Quantum simulations of SO(5) many-fermion systems using qudits

The structure and dynamics of many-body systems are the result of a delicate interplay between underlying interactions. Fermionic pairing, for example, plays a central role in various physical systems, ranging from condensed matter to nuclear systems, where it can lead to collective phenomena such as superconductivity and superfluidity. In atomic nuclei, the interplay between pairing and particle-hole interactions leads to a high degree of complexity and intricate entanglement structures. Despite this apparent complexity, symmetries emerge and manifest themselves in observable regular patterns. These symmetries and their breakings have long been used to determine relevant degrees of freedom and simplify classical descriptions of many-body systems. Here, this work explores the potential utility of quantum computers with arrays of qudits in simulating interacting fermionic systems, when the qudits can naturally map the relevant degrees of freedom determined by an underlying symmetry group. The Agassi model of fermions interacting via particle-hole and pairing interactions is based on an underlying so(5) algebra. Such systems can intuitively be partitioned into pairs of modes with five basis states, which thus naturally map to arrays of d = 5 qudits (qu5its). Classical noiseless simulations of the time evolution of systems with up to twelve qu5its are performed, by implementing quantum circuits that are developed herein, using PYTHON codes invoking Google's CIRQ software. The resource requirements of the qu5it circuits are analyzed and compared with two different mappings to qubit systems: a physics-aware Jordan-Wigner mapping requiring four qubits per mode pair and a state-to-state mapping requiring three qubits per mode pair. While the dimensionality of Hilbert spaces in mappings to qu5it systems are less than those for the corresponding qubit systems, the number of entangling operations, depending on the available hardware, can either be greater or smaller than for the physics-aware Jordan-Wigner mapping. The state-to-state mapping, while having a smaller Hilbert space than Jordan-Wigner mappings, appears to be the least efficient in gate counts. Further, a previously unknown sign problem has been identified from Trotterization errors in time evolving high-energy excitations. There appear to be advantages in employing quantum computers with arrays of qudits to perform simulations of many-body dynamics that exploit the role of underlying symmetries, specifically in lowering the required quantum resources and in reducing anticipated errors that take the simulation out of the physical space. If the necessary entangling gates are not directly supported by the hardware, physics-aware mappings to qubits may, however, be advantageous for other aspects.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Even spheres as joint spectra of matrix models

The Clifford spectrum is a form of joint spectrum for noncommuting matrices. This theory has been applied in photonics, condensed matter and string theory. In applications, the Clifford spectrum can be efficiently approximated using numerical methods, but this only is possible in low dimensional example. In this paper we examine the higher-dimensional spheres that can arise from theoretical examples. We also describe a constructive method to generate five real symmetric almost commuting matrices that have a K-theoretical obstruction to being close to commuting matrices. For this, we look to matrix models of topological electric circuits.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Theory of quasiparticle generation by microwave drives in superconducting qubits

Microwave drives play a central role in the control of superconducting quantum circuits, enabling qubit gates, readout, and parametric interactions. As the drive frequencies are typically an order of magnitude smaller than (twice) the superconducting gap, it is generally assumed that such drives do not disturb the BCS ground state. However, sufficiently strong drives can activate multiphoton pair-breaking processes that generate quasiparticles (QPs) and result in qubit errors. In this work, we present a theoretical framework for calculating the rates of multiphoton-assisted pair-breaking transitions induced by charge- or flux-coupled microwave drives. Through illustrative examples, we show that photon-assisted QP generation may affect novel high-frequency dispersive readout architectures, as well as Floquet-engineered superconducting circuits operating under strong driving.

circuit quantum electrodynamics↗
DOE OSTI2024

Quantum error mitigation by layerwise Richardson extrapolation

A widely used method for mitigating errors in noisy quantum computers is Richardson extrapolation, a technique in which the overall effect of noise on the estimation of quantum expectation values is captured by a single parameter that, after being scaled to larger values, is eventually extrapolated to the zero-noise limit. We generalize this approach by introducing layerwise Richardson extrapolation (LRE), an error mitigation protocol in which the noise of different individual layers (or larger chunks of the circuit) is amplified and the associated expectation values are linearly combined to estimate the zero-noise limit. The coefficients of the linear combination are analytically obtained from the theory of multivariate Lagrange interpolation. LRE leverages the flexible configurational space of layerwise unitary folding, allowing for a more nuanced mitigation of errors by treating the noise level of each layer of the quantum circuit as an independent variable. Furthermore, we provide numerical simulations demonstrating scenarios where LRE achieves superior performance compared to traditional (single-variable) Richardson extrapolation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Fully Scalable Randomized Benchmarking Without Motion Reversal

We introduce , a protocol that streamlines traditional RB by using circuits consisting almost entirely of independent identically distributed (IID) layers of gates. BiRB reliably and efficiently extracts the average error rate of a Clifford gate set by sending tensor-product eigenstates of random Pauli operators through random circuits with IID layers. Unlike existing RB methods, BiRB does not use motion reversal circuits—i.e., circuits that implement the identity (or a Pauli) operator—which simplifies both the method and the theory proving its reliability. Furthermore, this simplicity enables scaling BiRB to many more qubits than the most widely used RB methods. Published by the American Physical Society 2024

Hines, Jordan (ORCID:0000000151267256)↗
DOE OSTI2025

Dynamic, symmetry-preserving, and hardware-adaptable circuits for quantum computing many-body states and correlators of the Anderson impurity model

We present a hardware-reconfigurable ansatz on N q -qubits for the variational preparation of many-body states of the Anderson impurity model (AIM) with N imp + N bath = N q /2 sites, which conserves total charge and spin z component within each variational search subspace. The many-body ground state of the AIM is determined as the minimum over all minima of O(N$^2_ q$) distinct charge-spin sectors. Hamiltonian expectation values are shown to require ω(N q ) < N meas. $\leqslant$ O(N imp N bath ) symmetry-preserving, parallelizable measurement circuits, each amenable to postselection. To obtain the one-particle impurity Green’s function we show how initial Krylov vectors can be computed via midcircuit measurement and how Lanczos iterations can be computed using the symmetry-preserving ansatz. For a single-impurity Anderson model with a number of bath sites increasing from one to seven, we show using numerical emulation that the ease of variational ground-state preparation is suggestive of linear scaling in circuit depth and subquartic scaling in optimizer complexity. We therefore expect that, combined with time-dependent methods for Green’s function computation, our ansatz provides a useful tool to account for electronic correlations on early fault-tolerant processors. Finally, with a view towards computing real materials properties of interest like magnetic susceptibilities and electron-hole propagators, we provide a straightforward method to compute many-body, time-dependent correlation functions using a combination of time evolution, midcircuit measurement-conditioned operations, and the Hadamard test.

36 MATERIALS SCIENCE↗
DOE OSTI2022

Primitive quantum gates for dihedral gauge theories

We describe the simulation of dihedral gauge theories on digital quantum computers. The nonabelian discrete gauge group $D_N$-- the dihedral group -- serves as an approximation to $U(1)\times\mathbb{Z}_2$ lattice gauge theory. In order to carry out such a lattice simulation, we detail the construction of efficient quantum circuits to realize basic primitives including the nonabelian Fourier transform over $D_N$, the trace operation, and the group multiplication and inversion operations. For each case the required quantum resources scale linearly or as low-degree polynomials in $n=\log N$. We experimentally benchmark our gates on the Rigetti Aspen-9 quantum processor for the case of $D_4$. The fidelity of all $D_4$ gates was found to exceed $80\%$.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗