SEARCH · Engineering Papers

Results for “Circuits”

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 415 records · Page 23

All sources NASA NTRS DOE OSTI

DOE OSTI2024

Equivalent-Circuit Models of Grid-Forming IBRs for Electromagnetic-Transient Simulations: Preprint

We derive equivalent-circuit models of control- and physical-layer subsystems of grid-forming (GFM) inverter-based resources (IBRs) for electromagnetic-transient (EMT) simulations. Three different primary controllers are considered: droop, virtual synchronous machine (VSM), and dispatchable virtual oscillator control (dVOC). In addition, the models include cascaded voltage- and current-control loops, and LCL output filters. Simulations for a single-inverter setup and for a network of five inverters in a modified IEEE 14-bus topology are presented. The equivalent-circuit models simulated with analog electronic circuit-simulator software (in our case, LTspice) offer the same accuracy with up to 150x lower computational burden compared to block-diagram-based implementations in commercial off-the-shelf EMT software (in our case, MATLAB-Simulink).

circuit-equivalent model↗

DOE OSTI2021

Progress and Challenges for Memtransistors in Neuromorphic Circuits and Systems

Due to the increasing importance of artificial intelligence (AI), significant recent effort has been devoted to the development of neuromorphic circuits that seek to emulate the energy-efficient information processing of the brain. While non-volatile memory (NVM) based on resistive switches, phase-change memory, and magnetic tunnel junctions has shown potential for implementing neural networks, additional multi-terminal device concepts are required for more sophisticated bio-realistic functions. Of particular interest are memtransistors based on low-dimensional nanomaterials, which are capable of electrostatically tuning memory and learning behavior at the device level. Herein, a conceptual overview of the memtransistor is provided in the context of neuromorphic circuits. Recent progress is surveyed for memtransistors and related multi-terminal NVM devices including dual-gated floating-gate memories, dual-gated ferroelectric transistors, and dual-gated van der Waals heterojunctions. Further, the different materials systems and device architectures are classified based on the degree of control and relative tunability of synaptic behavior, with an emphasis on device concepts that harness the reduced dimensionality, weak electrostatic screening, and phase-changes properties of nanomaterials. Finally, strategies for achieving wafer-scale integration of memtransistors and multi-terminal NVM devices are delineated, with specific attention given to the materials challenges for practical neuromorphic circuits.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Quantum‐Classical Simulation of Quantum Field Theory by Quantum Circuit Learning

Abstract Quantum circuit learning is employed to simulate quantum field theories (QFTs). Typically, when simulating QFTs with quantum computers, significant challenges are encountered due to the technical limitations of quantum devices when implementing the Hamiltonian using Pauli spin matrices. To address this challenge, quantum circuit learning is leveraged, employing a compact configuration of qubits and low‐depth quantum circuits to predict real‐time dynamics in quantum field theories. The key advantage of this approach is that a single‐qubit measurement can accurately forecast various physical parameters, including fully‐connected operators. To demonstrate the effectiveness of this method, it is used to predict quench dynamics, chiral dynamics and jet production in a 1+1‐dimensional model of quantum electrodynamics. It is found that our predictions closely align with the results of rigorous classical calculations, exhibiting a high degree of accuracy. This hybrid quantum‐classical approach illustrates the feasibility of efficiently simulating large‐scale QFTs on cutting‐edge quantum devices.

Ikeda, Kazuki [Department of Physics University of↗

DOE OSTI2022

Collisions of localized shocks and quantum circuits

We study collisions between localized shockwaves inside a black hole interior. We give a holographic boundary description of this process in terms of the overlap of two growing perturbations in a shared quantum circuit. The perturbations grow both exponentially as well as ballistically. Due to a competition between different physical effects, the circuit analysis shows dependence on the transverse locations and exhibits four regimes of qualitatively different behaviors. On the gravity side we study properties of the post-collision geometry, using exact calculations in simple setups and estimations in more general circumstances. We show that the circuit analysis offers intuitive and surprisingly accurate predictions about gravity computations involving non-linear features of general relativity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2020

Error-mitigated data-driven circuit learning on noisy quantum hardware

Application-level benchmarks measure how well a quantum device performs meaningful calculations. In the case of parameterized circuit training, the computational task is the preparation of a target quantum state via optimization over a loss landscape. This is complicated by various sources of noise, fixed hardware connectivity, and generative modeling, the choice of target distribution. Gradient-based training has become a useful benchmarking task for noisy intermediate-scale quantum computers because of the additional requirement that the optimization step uses the quantum device to estimate the loss function gradient. In this work, we use gradient-based data-driven circuit learning to qualitatively evaluate the performance of several superconducting platform devices and present results that show how error mitigation can improve the training of quantum circuit Born machines with 28 tunable parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Printed circuit primary heat exchanger for power conversion in heat pipe microreactor applications

Here, in the present study, a model was developed for a recuperated air Brayton cycle for heat pipe microreactors, and the effect of the primary heat exchanger type assessed. An annular flow heat exchanger and a printed circuit heat exchanger (PCHE) were evaluated. A sub-sized diffusion bonded, PCHE test specimen was manufactured and tested with nitrogen as the working fluid to validate and improve the PCHE model. A comparison of the thermal cycle efficiency for the Brayton cycle coupled to a heat pipe microreactor using each of the two primary heat exchangers showed competitive performance for both options, with achievable cycle efficiencies of 34 % and 35 % for the annular and printed circuit heat exchangers, respectively. The impact of heat pipe length and additional reheating stages on cycle efficiency was studied. Increasing the heat pipe condenser length from 0.8 to 2.0 m resulted in an increase in cycle efficiency of 3.5 % and 3.2 % for the annular and printed circuit heat exchangers, respectively. The use of additional reheating stages showed a reduction in cycle efficiency since the heat pipe surface area limits the primary heat exchanger size and effectiveness. These results highlight the importance of the primary heat exchanger on the performance of a heat pipe microreactor. Overall, the cycle model, testing, and heat exchanger model showed the potential for the PCHE to improve the economics of a heat pipe microreactor relative to the annular flow heat exchanger, which also opens the possibility to use different heat transfer fluids such as supercritical CO 2 .

PCHE↗

DOE OSTI2020

Solution-processable integrated CMOS circuits based on colloidal CuInSe2 quantum dots

Abstract The emerging technology of colloidal quantum dot electronics provides an opportunity for combining the advantages of well-understood inorganic semiconductors with the chemical processability of molecular systems. So far, most research on quantum dot electronic devices has focused on materials based on Pb- and Cd chalcogenides. In addition to environmental concerns associated with the presence of toxic metals, these quantum dots are not well suited for applications in CMOS circuits due to difficulties in integrating complementary n - and p -channel transistors in a common quantum dot active layer. Here, we demonstrate that by using heavy-metal-free CuInSe 2 quantum dots, we can address the problem of toxicity and simultaneously achieve straightforward integration of complimentary devices to prepare functional CMOS circuits. Specifically, utilizing the same spin-coated layer of CuInSe 2 quantum dots, we realize both p - and n -channel transistors and demonstrate well-behaved integrated logic circuits with low switching voltages compatible with standard CMOS electronics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Interactive cryptographic proofs of quantumness using mid-circuit measurements

The ability to perform measurements in the middle of a quantum circuit is a powerful resource. It underlies a wide range of applications, from remote state preparation to quantum error correction. Here we apply mid-circuit measurements for a particular task: demonstrating quantum computational advantage. The goal of such a demonstration is for a quantum device to perform a computational task that is infeasible for a classical device with comparable resources. In contrast to existing demonstrations, the distinguishing feature of our approach is that the classical verification process is efficient, both in asymptotic complexity and in practice. Furthermore, the classical hardness of performing the task is based upon well-established cryptographic assumptions. Protocols with these features are known as cryptographic proofs of quantumness. Using a trapped-ion quantum computer, we perform mid-circuit measurements by spatially isolating portions of the ion chain via shuttling. This enables us to implement two interactive cryptographic proofs of quantumness, which when suitably scaled to larger systems, promise the efficient verification of quantum computational advantage. In conclusion, our methods can be applied to a range of interactive quantum protocols.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Probe measurements of electric field and electron density fluctuations at megahertz frequencies using in-shaft miniature circuits

In this work, a four-tip electrostatic probe is constructed to measure high-frequency (0.1–10 MHz) fluctuations in both the electric field (one component) and electron density in a laboratory plasma. This probe also provides data for the local electron temperature and density. Circuits for high-frequency measurements are fabricated on two miniature boards, which are embedded in the probe shaft, near the tips to minimize the pickup of common-mode signals. The amplitude and phase response of two circuits to sinusoidal test signals are measured and compared with results from modeling. For both circuits, the phase shift between input and output signals is relatively small (<30°). The performance of the probe is verified in a high-density (~10 13 cm –3 ) and low-temperature (≲10 eV) plasma. The probe successfully measures high-frequency (~2 MHz) fluctuations in the electric field and density, which are associated with lower hybrid drift waves. This probe can provide information on the wave-associated anomalous drag, which can be compared with the classical resistivity.

47 OTHER INSTRUMENTATION↗

DOE OSTI2025

Surrogate optimization of variational quantum circuits

Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the need for optimization in the presence of noise. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE or more broad applications of hybrid methods in which optimization is required. To this goal, we look to use modern approaches developed in circuit simulations and stochastic classical optimization, which can be combined to form a surrogate optimization approach to quantum circuits. Using an approximate (classical CPU/GPU) state vector simulator as a surrogate model, we efficiently calculate an approximate Hessian, passed as an input for a quantum processing unit or exact circuit simulator. This method will lend itself well to parallelization across quantum processing units. We demonstrate the capabilities of such an approach with and without sampling noise and a proof-of-principle demonstration on a quantum processing unit utilizing 40 qubits.

Gustafson, Erik J. [RIACS, Mtn. View] (ORCID:00000↗

DOE OSTI2020

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Surrogate-constructed scalable-circuits adaptive variational quantum eigensolver in the Schwinger model

Inspired by recent advancements in simulating periodic systems on quantum computers, we develop an approach to further advance the simulation of these systems, named (SC) 2 -ADAPT-VQE. Our approach extends the scalable-circuits ADAPT-VQE framework, which builds an ansatz from a pool of coordinate-invariant operators defined for arbitrarily large, though not arbitrarily small, volumes. Our method uses a classically tractable “surrogate constructed” method to remove irrelevant operators from the pool, reducing the minimum size for which the scalable circuits are defined. Bringing together the scalable circuits and the surrogate constructed approaches forms the core of the (SC) 2 methodology. Our approach allows for a wider set of classical computations on small volumes, which can be used for a more robust extrapolation protocol. While developed in the context of lattice models, the surrogate construction portion is applicable to a wide variety of problems where information about the relative importance of operators in the pool is available. As an example, we use it to compute the properties of the Schwinger model—quantum electrodynamics for a single, massive fermion in 1 +1 dimensions—and show that our method can be used to accurately extrapolate to the continuum limit.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2022

Integrable nonunitary quantum circuits

Here we show that the integrable Lindblad superoperators found recently can be used to build integrable nonunitary quantum circuits with two-site gates by demonstrating that the R(SIC) matrices are completely positive and trace preserving. Using the bond-site transformation, we obtain the corresponding integrable nonunitary quantum circuits with three-site gates. When restricted to the diagonals of the density matrix, these quantum models reduce to integrable classical cellular automata. This approach may pave the way for a systematic construction of circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

Entanglement phases in large- N hybrid Brownian circuits with long-range couplings

Here, we develop solvable models of large-N hybrid quantum circuits on qubits and fermions with tunable long-range power-law interactions and continuous local monitoring. These models provide analytical access to the entanglement phase diagram and error-correcting properties of many-body entangled nonequilibrium states generated by such dynamics. In one dimension, the long-range couplings are irrelevant for α > 3/2, where α is the power-law exponent, and the models exhibit a conventional measurement-induced phase transition between volume- and area-law entangled phases. For 1/2 < α < 3/2, the long-range couplings become relevant, leading to a nontrivial dynamical exponent at the measurement-induced phase transition. More interestingly, for α < 1, the entanglement pattern receives a subvolume correction for both area-law and volume-law phases, indicating that the phase realizes a quantum error correcting code whose code distance scales as L 2–2α . While the entanglement phase diagram is the same for both the interacting qubit and fermionic hybrid Brownian circuits, we find that long-range free-fermionic circuits exhibit a distinct phase diagram with two different fractal entangled phases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

TETRIS-ADAPT-VQE: An adaptive algorithm that yields shallower, denser circuit Ansätze

Adaptive quantum variational algorithms are particularly promising for simulating strongly correlated systems on near-term quantum hardware, but they are not yet viable due, in large part, to the severe coherence time limitations on current devices. In this paper, we introduce an algorithm called TETRIS-ADAPT-VQE (tiling efficient trial circuits with rotations implemented simultaneously adaptive derivative-assembled problem-tailored variational quantum eigensolver), which iteratively builds up variational a few operators at a time in a way dictated by the problem being simulated. This algorithm is a modified version of the ADAPT-VQE algorithm, in which the one-operator-at-a-time rule is lifted to allow for the addition of multiple operators with disjoint supports in each iteration. TETRIS-ADAPT-VQE results in denser but significantly shallower circuits, without increasing the number of controlled- gates or variational parameters. Its advantage over the original algorithm in terms of circuit depths increases with the system size. Moreover, the expensive step of measuring the energy gradient with respect to each candidate unitary at each iteration is performed only a fraction of the time compared with ADAPT-VQE. These improvements bring us closer to the goal of demonstrating a practical quantum advantage on quantum hardware. Published by the American Physical Society 2024

Anastasiou, Panagiotis G. (ORCID:0000000256601791)↗

DOE OSTI2024

Low-depth Clifford circuits approximately solve MaxCut

We introduce a quantum-inspired approximation algorithm for MaxCut based on low-depth Clifford circuits. We start by showing that the solution unitaries found by the adaptive quantum approximation optimization algorithm (ADAPT-QAOA) for the MaxCut problem on weighted fully connected graphs are (almost) Clifford circuits. Motivated by this observation, we devise an approximation algorithm for MaxCut, ADAPT-Clifford, that searches through the Clifford manifold by combining a minimal set of generating elements of the Clifford group. Our algorithm finds an approximate solution of MaxCut on an N -vertex graph by building a depth O ( N ) Clifford circuit. The algorithm has runtime complexity O ( N 2 ) and O ( N 3 ) for sparse and dense graphs, respectively, and space complexity O ( N 2 ) , with improved solution quality achieved at the expense of more demanding runtimes. We implement ADAPT-Clifford and characterize its performance on graphs with positive and signed weights. The case of signed weights is illustrated with the paradigmatic Sherrington-Kirkpatrick model, for which our algorithm finds solutions with ground-state mean energy density corresponding to ∼ 94 % of the Parisi value in the thermodynamic limit. The case of positive weights is investigated by comparing the cut found by ADAPT-Clifford with the cut found with the Goemans-Williamson (GW) algorithm. For both sparse and dense instances we provide copious evidence that, up to hundreds of nodes, ADAPT-Clifford finds cuts of lower energy than GW. Published by the American Physical Society 2024

Muñoz-Arias, Manuel H. (ORCID:000000025711029X)↗

DOE OSTI2024

Random coordinate descent: A simple alternative for optimizing parameterized quantum circuits

Variational quantum algorithms rely on the optimization of parameterized quantum circuits in noisy settings. The commonly used back-propagation procedure in classical machine learning is not directly applicable in this setting due to the collapse of quantum states after measurements. Thus, gradient estimations constitute a significant overhead in a gradient-based optimization of such quantum circuits. This paper introduces a random coordinate descent algorithm as a practical and easy-to-implement alternative to the full gradient descent algorithm. This algorithm only requires one partial derivative at each iteration. Motivated by the behavior of measurement noise in the practical optimization of parameterized quantum circuits, this paper presents an optimization problem setting that is amenable to analysis. Under this setting, the random coordinate descent algorithm exhibits the same level of stochastic stability as the full gradient approach, making it as resilient to noise. The complexity of the random coordinate descent method is generally no worse than that of the gradient descent and can be much better for various quantum optimization problems with anisotropic Lipschitz constants. Theoretical analysis and extensive numerical experiments validate our findings. Published by the American Physical Society 2024

Ding, Zhiyan (ORCID:000000018863403X)↗

DOE OSTI2024

Building Krylov complexity from circuit complexity

Krylov complexity has emerged as a probe of operator growth in a wide range of nonequilibrium quantum dynamics. However, a fundamental issue remains in such studies: the definition of the distance between basis states in Krylov space is ambiguous. Here we show that Krylov complexity can be rigorously established from circuit complexity when dynamical symmetries exist. Whereas circuit complexity characterizes the geodesic distance in a multidimensional operator space, Krylov complexity measures the height of the final operator in a particular direction. The geometric representation of circuit complexity thus unambiguously designates the distance between basis states in Krylov space. This geometric approach also applies to time-dependent Liouvillian superoperators, where a single Krylov complexity is no longer sufficient. Multiple Krylov complexity may be exploited jointly to fully describe operator dynamics. Published by the American Physical Society 2024

Lv, Chenwei (ORCID:0000000250952582)↗