Search NASA⌕ Search

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.

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

At least 217 records · Page 12

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)↗

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)↗

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)↗

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)↗

Tight Bounds on the Convergence of Noisy Random Circuits to the Uniform Distribution

We study the properties of output distributions of noisy random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the “useless” uniform distribution. These bounds are tight with respect to the dependence on circuit depth. Our proof techniques also allow us to make statements about the presence or absence of anticoncentration for both noisy and noiseless circuits. We uncover a number of interesting consequences for hardness proofs of sampling schemes that aim to show a quantum computational advantage over classical computation. Specifically, we discuss recent barrier results for depth-agnostic and/or noise-agnostic proof techniques. We show that in certain depth regimes, noise-agnostic proof techniques might still work in order to prove an often-conjectured claim in the literature on quantum computational advantage, contrary to what has been thought prior to this work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectroscopic Measurements and Models of Energy Deposition in the Substrate of Quantum Circuits by Natural Ionizing Radiation

Naturally occurring background radiation is a potential source of correlated decoherence events in superconducting qubits that will challenge error-correction schemes. In order to characterize the radiation environment in an unshielded laboratory representative of superconducting qubits’ environments, we performed broadband, spectroscopic measurements of background radiation events inside a millikelvin refrigerator. The spectrometer was designed to mimic the size and composition of a quantum circuit. Specifically, we measured the background radiation spectra in silicon substrates of two thicknesses, 500 and 1500 µm, and one area, 25 mm 2 . The observed spectra span energies from a few kilo-electron-volts up to nearly 10 MeV, are nearly featureless, and decrease in intensity by a factor of 40 000 between 100 keV and 3 MeV for the 500-µm substrate. We integrate the spectra to obtain the average event rates and deposited power levels. These quantities correspond to a rate of 0.023 events per second and a power of 4.9 keV s -1 , when counting events that deposit at least 40 keV for the 500-µm-thick substrate. We find that the cryogenic measurements are in good agreement with predictions based on simple measurements of the terrestrial gamma-ray flux outside the refrigerator, published models of cosmic-ray fluxes, a crude model of the cryostat, and radiation-transport simulations. This model requires no free parameters to predict the background radiation spectra in the silicon substrates. The agreement between measurements and predictions demonstrates that the model we present can be used to assess the relative contributions of terrestrial and cosmic-ray sources to background radiation interactions in silicon substrates of varying thickness. These spectroscopic measurements are performed with a novel combination of superconducting microresonators located on micromachined silicon islands that define the interaction volume with background radiation. The resonators transduce deposited energy to a readily detectable electrical signal. Microresonator readout closely resembles dispersive superconducting qubit readout, so similar devices—with or without micromachined islands—are suitable for integration with superconducting quantum circuits as detectors for background radiation events. For our specific laboratory conditions, we find that gamma-ray emissions from radioisotopes are responsible for the majority of events that deposit E < 1 ⁢Me⁢V. We present results demonstrating that the background radiation spectrum contains relevant contributions from cosmic-ray particles other than muons, particularly a tail of multi-mega-electron-volt events due to protons and neutrons. These observations suggest several paths to reducing the impact of background radiation on quantum circuits, supported by an empirically validated model for generating reliable predictions of radiation interactions with silicon substrates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.

Fang, Bo↗

Design of Auxiliary Circuit Elements for Achieving Zero Voltage Switching in a Wireless Power Transfer System

The auxiliary resonant commutated pole (ARCP) is being used to achieve zero voltage switching (ZVS) of power switches for improved efficiency and/or to reduce dv/dt at the switch node for better electromagnetic interference (EMI) performance and overall system reliability. This paper shows how an ARCP circuit can be used in a wireless power transfer system to achieve ZVS. Detailed analysis of ARCP circuit operation is presented to determine the requirements for achieving ZVS in the main switches of a wireless electric vehicle charging system. Based on this analysis, a design algorithm is developed to optimize the design of the ZVS assisting circuit components. The designed ARCP achieves soft switching of the MOSFETs in the primary inverter of an 85 kHz, 10 kW series-series compensated, stationary wireless power transfer system.

Saha, Tarak↗

SCR-based Medium Voltage DC Solid-State Circuit Breaker

This paper describes a medium voltage solid-state circuit breaker (SSCB) based on SCR technology, featuring short fault-interruption time and a minimal turn-off auxiliary circuit. The SSCB design incorporates a specialized SCR and a commutation circuit designed with an objective to reduce the required SCR hold-off/turn-off time, tq, which primarily determines the fault interruption duration. To validate the design, simulation analysis is presented, and a 1.5 kV 300 A SSCB prototype has been built and tested. The results confirm the effectiveness of the proposed design philosophy demonstrating the SSCB's ability to interrupt a 200 A load current in less than 50 μs. The proposed SCR-based SSCB has been developed for DC applications but is equally applicable to AC applications.

Kandula, Prasad [ORNL] (ORCID:0000000174017284)↗

A Dual-Active-Bridge Converter Employing a Variable Inductor Without an Auxiliary Circuit

This paper proposes a dual active bridge (DAB) converter employing a variable inductor (VI) without an auxiliary circuit. Unlike conventional VI-based designs that require an external DC bias circuit, the proposed DAB utilizes the input DC current itself as the bias source, enabling automatic inductance variation with load conditions. The inductance naturally increases at low power and decreases at high power, effectively extending the zero voltage switching (ZVS) range and reducing circulating current, respectively. The VI was experimentally implemented and characterized to obtain its inductance-current profile, which was then integrated into a PLECS model of the DAB converter for circuit and thermal simulations. Simulation results confirm that the proposed auxiliary-free VI-DAB converter achieves a wider ZVS range and lower circulating current compared with a conventional fixed-inductor DAB converter. By realizing a variable inductor without any auxiliary bias circuitry, the proposed approach maintains soft switching and reduces reactive current losses across a wide load range, leading to improved efficiency and simplified implementation.

Jo, Cheolhui [ORNL] (ORCID:0000000322692434)↗

Inverter Design with High Short-Circuit Fault Current Contribution to Enable Legacy Overcurrent Protection for Islanded Microgrids

The resiliency offered by a microgrid may be lost if the microgrid is not properly protected during short-circuit faults inside its boundaries. Many studies conclude that protecting microgrids in islanded mode is very challenging due to the limited short-circuit capability of distributed energy resources (DERs). The limited short-circuit capability of DERs typically inhibits the use of reliable and affordable overcurrent protective devices in microgrids. Although extensive research on microgrid protection is available in the literature, to date this research has not led to a cost-effective, commercially available relay that effectively tackles the challenges of microgrid protection. This work proposes hardware modifications to enhance the current contribution of an energy storage inverter with the objective of enabling the use of legacy overcurrent protection for islanded microgrids. This paper demonstrates through experimental results that few modifications are required in the inverter to significantly enhance its current contribution. In this study, a three-phase energy storage inverter was modified to provide three times its rated current during three-phase faults, which proved sufficient current for enough time to enable fuse-relay, and relay-to-relay coordination. The proposed modifications effectively increase the current contribution of the inverter, which is a promising advancement to allow the adoption of overcurrent protective devices for protecting microgrids.

Ferrari Maglia, Max↗

Numerical Simulations of Noisy Variational Quantum Eigensolver Ansatz Circuits

This is a case study of the variational quantum eigensolver (VQE) method using numerical simulations to test the influence of noise on the accuracy of the underlying circuit ansatz. We investigate a computational chemistry application of VQE to calculate the electronic ground state and its energy for Sodium Hydride (NaH), a prototypical two-electron problem. Using a one-parameter ansatz derived from unitary coupled cluster (UCC) theory, we simulate the effects of noise on the energy expectation value and variance with respect to the ansatz parameter. These numerical simulations provide insights into the accuracy of the prepared quantum state and the efficiency of the classical optimizer that iteratively refines the ansatz. We conduct a comparative study between analytical results derived for the UCC ansatz in the absence of noise and the noisy numerical simulation results obtained using an isotropic depolarizing noise model for each gate. We also compare the relative increase in noise on logically equivalent UCC ansatz circuits generated by randomized compiling. Notably, we observe that the intrinsic variance in the energy due to the simplicity of the ansatz itself compares with the noise induced by the bare circuit.

Gowrishankar, Meenambika↗

Adaptive stabilization of quantum circuits executed on unstable devices

Conventional computers have evolved to device components that demonstrate failure rates of 10 −17 or less, while current quantum computing devices typically exhibit error rates of 10 −2 or greater. This raises concerns about the reliability and reproducibility of the results obtained from quantum computers. The problem is highlighted by experimental observation that today’s NISQ devices are inherently unstable. Remote quantum cloud servers typically do not provide users with an ability to calibrate the device themselves. Using inaccurate characterization data for error mitigation can have devastating impact on reproducibility. In this study, we investigate if one can infer the critical channel parameters dynamically from the noisy binary output of the executed quantum circuit and use it to improve program stability. An open question however is how well does this methodology scale. We discuss the efficacy and efficiency of our adaptive algorithm using canonical quantum circuits such as the uniform superposition circuit. Our metric of performance is the Hellinger distance between the post-stabilization observations and the reference (ideal) distribution.

Dasgupta, Samudra↗

Algebraic Compression of Free Fermionic Quantum Circuits: Particle Creation, Arbitrary Lattices and Controlled Evolution

In this work [1], we extend our recently introduced algebraic circuit compression algorithms [2], [3] that can compress time evolution circuits of free fermionic Hamiltonians on an n-site 1D chain, equation H(t)=∑i=1n-1 (hi(t)cici+1+pi(t)cici+1)+h.c., 1 equation in three significant ways: (1) we allow for compression of free fermionic Hamiltonians on arbitrary lattices, (2) we incorporate particle creation/annihilation operators into the compression schemes, and (3) we extend the compression scheme to controlled time-evolution operators. We illustrate the effectiveness of our approach by simulating the dynamics of a fermion on a 4× 4 2D square lattice on ibmq_washington, both in the presence and absence of disorder. Our quantum simulations show a remarkably high fidelity which is enabled through the compressed circuits.

Kökcü, Efekan↗

QuYBE - An Algebraic Compiler for Quantum Circuit Compression

QuYBE is an open-source algebraic compiler for the compression of quantum circuits. It has been applied for the efficient simulation of the Heisenberg Hamiltonian on quantum computers. Currently, it can simulate the time dynamics of one-dimensional chains. It includes modules to generate the quantum circuits for the above as well as produce the compressed circuits, which are independent of the time step. It utilizes the Yang-Baxter equation (YBE) to perform the compression. QuYBE enables users to seamlessly design, execute, and analyze the time dynamics of the Heisenberg Hamiltonian on quantum computers. QuYBE is the first step toward making the YBE technique available to a broader community of scientists from multiple domains. The QuYBE compiler is available at https://github.com/ZichangHe/QuYBE.

Gulania, Sahil↗

Circuit Modelling of the Mechanical-Motion-Rectifier for Electrical Simulation of Ocean Wave Power Take-off

As is the case with several other mechanical power takeoffs (PTOs), the mechanical-motion-rectifier (MMR) based PTO consists of components such as one-way clutches, gears, a ball screw, mechanical couplings, and a generator. Equivalent circuit models have been created in this paper to describe the dry frictions, viscous damping, and mechanical compliances in these components, so the non-ideal efficiency and nonlinear force of the PTO can be predicted in electrical simulations by integrating these sub-circuit models. The circuit model is simplified, and its parameters are categorized as dc and ac unknowns. The dc and ac tests on the PTO are performed sequentially to extract two sets of parameters through linear regression or nonlinear curve fitting. Then, the model is validated through its prediction capability over 25 test conditions on input forces, output voltages, and efficiencies, with correlation coefficients of 0.9, 0.98, and 0.981, respectively.

42 ENGINEERING↗

Design and Analysis of the Staggered Double Grating Slow Wave Circuit for 263 GHz Sheet Beam TWT

The complete design process of a high-frequency circuit for a 263 GHz staggered double grating, sheet beam traveling wave tube is presented in this article. Here, this device, for use in a pulsed electron paramagnetic resonance spectrometer instrument, requires >30 dB gain and a 20 GHz bandwidth centered at 263 GHz. In addition to the standard Pierce gain analysis and point by point particle in cell (PIC) simulation, a novel fast pulse response analysis technique was utilized to determine the accurate synchronization voltage and test the ``hot” feature of the high-frequency circuit. Since this new method can evaluate the entire bandwidth in a single simulation, it can significantly reduce the computational resources normally required for the conventional PIC analysis while also illustrating the potential instabilities near the band edge. Good agreement between the fast pulse response and PIC simulation results validate the accuracy of this novel method. According to the analysis results and given the manufacturing limits of nano/micro-computer numerical control (CNC) machining, an appropriate SWS, coupler, and sever designs were chosen to complement the simulated design. Finally, a prototype circuit was manufactured and cold tested to verify the design and inspect the machining tolerances.

42 ENGINEERING↗

Super-resolution within a one-dimensional phononic crystal of resonators using time reversal in an equivalent circuit model

An equivalent circuit model has been developed to model a one-dimensional waveguide with many side-branch Helmholtz resonators. This waveguide constitutes a phononic crystal that has been shown to have decreased phase speed below the resonance frequency of an individual resonator. This decreased phase speed can be exploited to achieve super-resolution using broadband time reversal focusing techniques. It is shown that the equivalent circuit model is capable of quantifying this change in phase speed of the crystal and also the small-scale wave-resonator interactions within the crystal. The equivalent circuit model enables the parameterization of the physical variables and the optimization of the focusing bandwidth by balancing the combination of increasing resolution and decreasing amplitude near the resonance frequency. It is shown that the quality factor—in this case, the quality factor determined by the geometric shape of each resonator—controls the range of frequencies that are strongly affected by the Helmholtz resonators.

Kingsley, Adam D.↗