SEARCH · Search NASA

Results for “Circuit”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 73 records · Page 4

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Computer-aided quantization and numerical analysis of superconducting circuits

The development of new superconducting circuits and the improvement of existing ones rely on the accurate modeling of spectral properties which are key to achieving the needed advances in qubit performance. Systematic circuit analysis at the lumped-element level, starting from a circuit network and culminating in a Hamiltonian appropriately describing the quantum properties of the circuit, is a well-established procedure, yet cumbersome to carry out manually for larger circuits. We present work utilizing symbolic computer algebra and numerical diagonalization routines versatile enough to tackle a variety of circuits. Results from this work are accessible through a newly released module of the scqubits package.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2021

Quantifying and modeling of stress-driven short-circuits in lithium-ion batteries in electrified vehicles

Despite the huge expansion of electric vehicle sales in the market, customers are discouraged by the possible catastrophic consequences brought by the safety issues of lithium-ion batteries, such as internal short circuits, especially in crash scenarios. Herein, we reveal the quantitative relationship between the deformations of the battery and the internal short circuit. By in situ and ex situ observations and post mortem characterization of the component materials, we quantify the stress-driven internal short circuit and failure behavior of the component material. With the aid of a validated numerical computational model as well as the in situ characterization of the global-field temperature, we successfully identify the minor and major short circuits of the cells upon various mechanical abusive loadings. Finally, we establish the internal short circuit criteria for typical formats of batteries. Furthermore, this discovery also provides a fundamental understanding of both internal and external stress-driven short circuits in a much broader context.

25 ENERGY STORAGE↗

DOE OSTI2025

Architectures and random properties of symplectic quantum circuits

Parametrized and random unitary (or orthogonal) n-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention. However, this is not the case, as $\mathbb{SP}(d/2)$—the group of d × d unitary symplectic matrices—has thus far been overlooked. In this work, we aim at starting to fill this gap. We begin by presenting a universal set of generators $\mathcal{G}$ for the symplectic algebra $\mathfrak{sp}(d/2)$, consisting of one- and two-qubit Pauli operators acting on neighboring sites in a one-dimensional lattice. Here, we uncover two critical differences between such set, and equivalent ones for unitary and orthogonal circuits. Namely, we find that the operators in $\mathcal{G}$ cannot generate arbitrary local symplectic unitaries and that they are not translationally invariant. We then review the Schur–Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements at the output of Haar random symplectic circuits can converge to Gaussian processes. As a by-product, such analysis provides us with concentration bounds for Pauli measurements in circuits that form t-designs over $\mathbb{SP}(d/2)$. To finish, we present tensor-network tools to analyze shallow random symplectic circuits, and we use these to numerically show that computational-basis measurements anti-concentrate at logarithmic depth.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Network analysis of memristive device circuits: dynamics, stability and correlations

Abstract Networks with memristive devices are a potential basis for the next generation of computing devices. They are also an important model system for basic science, from modeling nanoscale conductivity to providing insight into the information-processing of neurons. The resistance in a memristive device depends on the history of the applied bias and thus displays a type of memory. The interplay of this memory with the dynamic properties of the network can give rise to new behavior, offering many fascinating theoretical challenges. But methods to analyze general memristive circuits are not well described in the literature. In this paper we develop a general circuit analysis for networks that combine memristive devices alongside resistors, capacitors and inductors and under various types of control. We derive equations of motion for the memory parameters of these circuits and describe the conditions for which a network should display properties characteristic of a resonator system. For the case of a purely memresistive network, we derive Lyapunov functions, which can be used to study the stability of the network dynamics. Surprisingly, analysis of the Lyapunov functions show that these circuits do not always have a stable equilibrium in the case of nonlinear resistance and window functions. The Lyapunov function allows us to study circuit invariances, wherein different circuits give rise to similar equations of motion, which manifest through a gauge freedom and node permutations. Finally, we identify the relation between the graph Laplacian and the operators governing the dynamics of memristor networks operators, and we use these tools to study the correlations between distant memristive devices through the effective resistance.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Power-Law Entanglement and Hilbert Space Fragmentation in Nonreciprocal Quantum Circuits

Quantum circuits utilizing measurement to evolve a quantum wave function offer a new and rich playground to engineer unconventional entanglement dynamics. Here, in this work, we introduce a hybrid, nonreciprocal setup featuring a quantum circuit, whose updates are conditioned on the state of a classical dynamical agent. In our example the circuit is represented by a Majorana quantum chain controlled by a classical N-state Potts chain undergoing pair flips. The local orientation of the classical spins controls whether randomly drawn local measurements on the quantum chain are allowed or not. This imposes a dynamical kinetic constraint on the entanglement growth, described by the transfer matrix of an N-colored loop model. It yields an equivalent description of the circuit by an SU(N)-symmetric Temperley-Lieb Hamiltonian or by a kinetically constrained surface growth model for an N-component height field. For N = 2, we find a diffusive growth of the half-chain entanglement toward a stationary profile S(L) ~ L 1/2 for L sites. For N ≥ 3, the kinetic constraints impose Hilbert space fragmentation, yielding subdiffusive growth toward S(L) ~ L 0.57 . This showcases how the control by a classical dynamical agent can enrich the entanglement dynamics in quantum circuits, paving a route toward novel entanglement dynamics in nonreciprocal hybrid circuit architectures.

1-dimensional spin chains↗

DOE OSTI2021

Adaptive Circuit Learning for Quantum Metrology

Quantum sensing is an important application of emerging quantum technologies. We explore whether a hybrid system of quantum sensors and quantum circuits can surpass the classical limit of sensing. In particular, we use optimization techniques to search for encoder and decoder circuits that scalably improve sensitivity under given application and noise characteristics. Furthermore, our approach uses a variational algorithm that can learn a quantum sensing circuit based on platform-specific control capacity, noise, and signal distribution. The quantum circuit is composed of an encoder which prepares the optimal sensing state and a decoder which gives an output distribution containing information of the signal. We optimize the full circuit to maximize the Signal-to-Noise Ratio (SNR). Furthermore, this learning algorithm can be run on real hardware scalably by using the "parameter-shift" rule which enables gradient evaluation on noisy quantum circuits, avoiding the exponential cost of quantum system simulation. We demonstrate up to 13.12x SNR improvement over existing fixed protocol (GHZ), and 3.19x Classical Fisher Information (CFI) improvement over the classical limit on 15 qubits using IBM quantum computer. More notably, our algorithm overcomes the decreasing performance of existing entanglement-based protocols with increased system sizes.

42 ENGINEERING↗

DOE OSTI2022

Constant-depth circuits for dynamic simulations of materials on quantum computers

Abstract Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in depth with increasing simulation time, limiting feasible simulations to short-time dynamics. Here, we present a method for generating circuits that are constant in depth with increasing simulation time for a specific subset of one-dimensional (1D) materials Hamiltonians, thereby enabling simulations out to arbitrarily long times. Furthermore, by removing the effective limit on the number of feasibly simulatable time-steps, the constant-depth circuits enable Trotter error to be made negligibly small by allowing simulations to be broken into arbitrarily many time-steps. For an N -spin system, the constant-depth circuit contains only $\mathcal {O}(N^{2})$ O ( N 2 ) CNOT gates. Such compact circuits enable us to successfully execute long-time dynamic simulation of ubiquitous models, such as the transverse field Ising and XY models, on current quantum hardware for systems of up to 5 qubits without the need for complex error mitigation techniques. Aside from enabling long-time dynamic simulations with minimal Trotter error for a specific subset of 1D Hamiltonians, our constant-depth circuits can advance materials simulations on quantum computers more broadly in a number of indirect ways.

Materials simulation↗

DOE OSTI2023

Microgrid Tiered Circuits Effects for a Planned Housing Community in Puerto Rico

Puerto Rico faced a double strike from hurricanes Irma and Maria in 2017. The resulting damage required a comprehensive rebuild of electric infrastructure. There are plans and pilot projects to rebuild with microgrids to increase resilience. This paper provides a techno-economic analysis technique and case study of a potential future community in Puerto Rico that combines probabilistic microgrid design analysis with tiered circuits in building energy modeling. Tiered circuits in buildings allow electric load reduction via remote disconnection of non-critical circuits during an emergency. When coupled to a microgrid, tiered circuitry can reduce the chances of a microgrid's storage and generation resources being depleted. The analysis technique is applied to show 1) Approximate cost savings due to a tiered circuit structure and 2) Approximate cost savings gained by simultaneously considering resilience and sustainability constraints in the microgrid optimization. The analysis technique uses a resistive capacitive thermal model with load profiles for four tiers (tier 1-3 and non-critical loads). Three analyses were conducted using: 1) open-source software called Tiered Energy in Buildings and 2) the Microgrid Design Toolkit. For a fossil fuel based microgrid 30% of the total microgrid costs of 1.18 million USD were calculated where the non-tiered case keeps all loads 99.9% available and the tiered case keeps tier 1 at 99.9%, tier 2 at 95%, tier 3 at 80% availability, with no requirement on non-critical loads. The same comparison for a sustainable microgrid showed 8% cost savings on a 5.10 million USD microgrid due to tiered circuits. The results also showed 6-7% cost savings when our analysis technique optimizes sustainability and resilience simultaneously in comparison to doing microgrid resilience analysis and renewables net present value analysis independently. Though highly specific to our case study, similar assessments using our analysis technique can elucidate value of tiered circuits and simultaneous consideration of sustainability and resilience in other locations.

building energy modeling↗

DOE OSTI2023

Partitioning Quantum Chemistry Simulations with Clifford Circuits

Current quantum computing hardware is restricted by the availability of only few, noisy qubits which limits the investigation of larger, more complex molecules in quantum chemistry calculations on quantum computers in the near term. Here, in this work, we investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits and the variational quantum eigensolver. To this end, we consider naive and physically motivated, classically efficient product ansatz for the parametrized wavefunction adapting the separable-pair ansatz form. We combine it with post-treatment to account for interactions between subsystems originating from this ansatz. The classical treatment is given by another quantum circuit that has support between the enforced subsystems and is folded into the Hamiltonian. To avoid an exponential increase in the number of Hamiltonian terms, the entangling operations are constructed from purely Clifford or near-Clifford circuits. While Clifford circuits can be simulated efficiently classically, they are not universal. In order to account for missing expressibility, near-Clifford circuits with only few, selected non-Clifford gates are employed. The exact circuit structure to achieve this objective is molecule-dependent and is constructed using simulated annealing and genetic algorithms. We demonstrate our approach on a set of molecules of interest and investigate the extent of our methodology’s reach.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Genetic circuit design automation for yeast

Cells can be programmed to monitor and react to their environment using genetic circuits. Design automation software maps a desired circuit function to a DNA sequence, a process that requires units of gene regulation (gates) that are simple to connect and behave predictably. This poses a challenge for eukaryotes due to their complex mechanisms of transcription and translation. To this end, we have developed gates for yeast (Saccharomyces cerevisiae) that are connected using RNA polymerase flux as the signal carrier and are insulated from each other and host regulation. They are based on minimal constitutive promoters (~120 base pairs), for which rules are developed to insert operators for DNA-binding proteins. Using this approach, in this work we constructed nine NOT/NOR gates with nearly identical response functions and 400-fold dynamic range. In circuits, they are transcriptionally insulated from each other by placing ribozymes downstream of terminators to block nuclear export of messenger RNAs resulting from RNA polymerase readthrough. Based on these gates, Cello 2.0 was used to build circuits with up to 11 regulatory proteins. A simple dynamic model predicts the circuit response over days. Genetic circuit design automation for eukaryotes simplifies the construction of regulatory networks as part of cellular engineering projects, whether it be to stage processes during bioproduction, serve as environmental sentinels or guide living therapeutics.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it has been shown that the Affleck-Kennedy-Lieb-Tasaki state—a paradigmatic example of an MPS—can be exactly prepared with an adaptive quantum circuit of constant depth, an impossible feat with local unitary gates alone due to its nonzero correlation length [Smith , PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming theoretically optimal preparation with unitary circuits. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states. Published by the American Physical Society 2024

Smith, Kevin C. (ORCID:0000000223971518)↗

DOE OSTI2023

A Multi-Harmonic System Identification Method for Internal Circuit Element Monitoring

Many critical infrastructures depend on the reliability of electronic circuits, whose health depends on the values of internal circuit elements that degrade over time. It is therefore important to estimate the values of internal circuit elements from external measurements and monitor them for changes. The challenge to doing so is that, typically, the internal voltages and currents are not accessible for measurement. Prior work on internal circuit element monitoring uses data obtained from sensors placed inside the circuit or requires additional circuitry to be added to the given system, both of which are undesirable. We propose a new multi-harmonic frequency-domain based system identification method that is non-intrusive. It exploits the latent non-idealities already present in the system, specifically harmonics in the measured input and output signals. We show how sensitivity analysis can be used to both assess the accuracy of the method as well as to optimize the choice of harmonics to use. We use as a motivation and illustrative example the problem of determining the equivalent series resistance and capacitance in a class of dc-link capacitance circuits in Adjustable Speed Drives. We assess the performance of this method using simulations, and establish its validity by experimental results.

Deshpande, Ankit Vivek↗

DOE OSTI2024

Scalable Circuit Cutting and Scheduling in a Resource-constrained and Distributed Quantum System

Despite quantum computing's rapid development, current systems remain limited in practical applications due to their limited qubit count and quality. Various technologies, such as superconducting, trapped ions, and neutral atom quantum computing technologies are progressing towards a fault tolerant era, however they all face a diverse set of challenges in scalability and control. Recent efforts have focused on multi-node quantum systems that connect multiple smaller quantum devices to execute larger circuits. Future demonstrations hope to use quantum channels to couple systems, however current demonstrations can leverage classical communication with circuit cutting techniques. This involves cutting large circuits into smaller subcircuits and reconstructing them post-execution. However, existing cutting methods are hindered by lengthy search times as the number of qubits and gates increases. Additionally, they often fail to effectively utilize the resources of various worker configurations in a multi-node system. To address these challenges, we introduce FitCut, a novel approach that transforms quantum circuits into weighted graphs and utilizes a community-based, bottom-up approach to cut circuits according to resource constraints, e.g., qubit counts, on each worker. FitCut also includes a scheduling algorithm that optimizes resource utilization across workers. Implemented with Qiskit and evaluated extensively, FitCut significantly outperforms the Qiskit Circuit Knitting Toolbox, reducing time costs by factors ranging from 3 to 2000 and improving resource utilization rates by up to 3.88 times on the worker side, achieving a system-wide improvement of 2.86 times.

Kan, Shuwen [Fordham University]↗

DOE OSTI2023

A Mesorhizobium japonicum quorum sensing circuit that involves three linked genes and an unusual acyl-homoserine lactone signal

ABSTRACT Members of the genus Mesorhizobium, which are core components of the rhizosphere and specific symbionts of legume plants, possess genes for acyl-homoserine lactone (AHL) quorum sensing (QS). Here we show Mesorhizobium japonicum MAFF 303099 (formerly M. loti ) synthesizes and responds to N -[(2 E , 4 E )-2,4-dodecadienoyl] homoserine lactone (2 E, 4 E- C 12:2 -HSL). We show that the 2 E, 4 E- C 12:2 -HSL QS circuit involves one of four luxR-luxI -type genes found in the sequenced genome of MAFF 303099. We refer to this circuit, which appears to be conserved among Mesorhizobium species, as R1-I1. We show that two other Mesorhizobium strains also produce 2 E, 4 E- C 12:2 -HSL. The 2 E, 4 E- C 12:2 -HSL is unique among known AHLs in its arrangement of two trans double bonds. The R1 response to 2 E, 4 E- C 12:2 -HSL is extremely selective in comparison with other LuxR homologs, and the trans double bonds appear critical for R1 signal recognition. Most well-studied LuxI-like proteins use S -adenosylmethionine and an acyl-acyl carrier protein as substrates for synthesis of AHLs. Others that form a subgroup of LuxI-type proteins use acyl-coenzyme A substrates rather than acyl-acyl carrier proteins. I1 clusters with the acyl-coenzyme A-type AHL synthases. We show that a gene linked to the I1 AHL synthase is involved in the production of the QS signal. The discovery of the unique I1 product enforces the view that further study of acyl-coenzyme A-dependent LuxI homologs will expand our knowledge of AHL diversity. The involvement of an additional enzyme in AHL generation leads us to consider this system a three-component QS circuit. IMPORTANCE We report a Mesorhizobium japonicum quorum sensing (QS) system involving a novel acyl-homoserine lactone (AHL) signal. This system is known to be involved in root nodule symbiosis with host plants. The chemistry of the newly described QS signal indicated that there may be a dedicated cellular enzyme involved in its synthesis in addition to the types known for production of other AHLs. Indeed, we report that an additional gene is required for synthesis of the unique signal, and we propose that this is a three-component QS circuit as opposed to the canonical two-component AHL QS circuits. The signaling system is exquisitely selective. The selectivity may be important when this species resides in the complex microbial communities around host plants and may make this system useful in various synthetic biology applications of QS circuits.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Deep quantum circuit simulations of low-energy nuclear states

Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that place demanding memory and processing requirements on conventional simulation methods. Here, we present advances in high-performance numerical simulations of deep quantum circuits to efficiently verify the accuracy of low-energy nuclear physics applications. Our approach employs novel methods for accelerating the numerical simulation including management of simulated mid-circuit measurements to verify projection based state preparation circuits. In this study, we test these methods across a variety of high-performance computing systems and our results show that circuits up to 21 qubits and more than 115,000,000 gates can be efficiently simulated.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale

The numerical simulation of quantum circuits is an indispensable tool for development, verification, and validation of hybrid quantum-classical algorithms intended for near-term quantum co-processors. The emergence of exascale high-performance computing (HPC) platforms presents new opportunities for pushing the boundaries of quantum circuit simulation. Here, we present a modernized version of the Tensor Network Quantum Virtual Machine (TNQVM) that serves as the quantum circuit simulation backend in the eXtreme-scale ACCelerator (XACC) framework. The new version is based on the scalable tensor network processing library ExaTN (Exascale Tensor Networks). It provides multiple configurable quantum circuit simulators that perform either an exact quantum circuit simulation via the full tensor network contraction or an approximate simulation via a suitably chosen tensor factorization scheme. Upon necessity, stochastic noise modeling from real quantum processors is incorporated into the simulations by modeling quantum channels with Kraus tensors. By combining the portable XACC quantum programming frontend and the scalable ExaTN numerical processing backend, we introduce an end-to-end virtual quantum development environment that can scale from laptops to future exascale platforms. We report initial benchmarks of our framework, which include a demonstration of the distributed execution, incorporation of quantum decoherence models, and simulation of the random quantum circuits used for the certification of quantum supremacy on Google’s Sycamore superconducting architecture.

Nguyen, Thien↗

DOE OSTI2020

Quantum Fast Circuit Optimizer (qFactor) v1

Quantum programs are represented as circuits, or sequences of gates. A common problem during quantum compilation to find a circuit that implements a target program. This is an optimizer, it optimizes a circuit's distance to the target by solving for the best fit gates. It is not a standard optimizer, it only optimizes circuits. It is not a compiler or synthesizer, it cannot build circuits, but given a circuit structure, it will solve for the gates. Quantum compilers (qsearch, qfast) use standard numerical optimizers. This has advantages over those general-purpose optimizers since it is domain-specific.

Younis, Ed↗

DOE OSTI2023

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗