Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 451 records · Page 25

Large gradients via correlation in random parameterized quantum circuits

Scaling of variational quantum algorithms to large problem sizes requires efficient optimization of random parameterized quantum circuits. For such circuits with uncorrelated parameters, the presence of exponentially vanishing gradients in cost function landscapes is an obstacle to optimization by gradient descent methods. In this work, we prove that reducing the dimensionality of the parameter space by utilizing circuit modules containing spatially or temporally correlated gate layers can allow one to circumvent the vanishing gradient phenomenon. Here, examples are drawn from random separable circuits and asymptotically optimal variational versions of Grover's algorithm based on the quantum alternating operator ansatz. In the latter scenario, our bounds on cost function variation imply a transition between vanishing gradients and efficient trainability as the number of layers is increased toward $\mathcal{O}\left({2}^{n/2}\right)$, the optimal oracle complexity of quantum unstructured search.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗

Fast decay of classification error in variational quantum circuits

Variational quantum circuits (VQCs) have shown great potential in near-term applications. However, the discriminative power of a VQC, in connection to its circuit architecture and depth, is not understood. To unleash the genuine discriminative power of a VQC, we propose a VQC system with the optimal classical post-processing—maximum-likelihood estimation on measuring all VQC output qubits. Via extensive numerical simulations, we find that the error of VQC quantum data classification typically decays exponentially with the circuit depth, when the VQC architecture is extensive—the number of gates does not shrink with the circuit depth. This fast error suppression ends at the saturation towards the ultimate Helstrom limit of quantum state discrimination. On the other hand, non-extensive VQCs such as quantum convolutional neural networks are sub-optimal and fail to achieve the Helstrom limit, demonstrating a trade-off between ansatz complexity and classification performance in general. To achieve the best performance for a given VQC, the optimal classical post-processing is crucial even for a binary classification problem. To simplify VQCs for near-term implementations, we find that utilizing the symmetry of the input properly can improve the performance, while oversimplification can lead to degradation.

Zhang, Bingzhi↗

Building spatial symmetries into parameterized quantum circuits for faster training

Abstract Practical success of quantum learning models hinges on having a suitable structure for the parameterized quantum circuit. Such structure is defined both by the types of gates employed and by the correlations of their parameters. While much research has been devoted to devising adequate gate-sets, typically respecting some symmetries of the problem, very little is known about how their parameters should be structured. In this work, we show that an ideal parameter structure naturally emerges when carefully considering spatial symmetries (i.e. the symmetries that are permutations of parts of the system under study). Namely, we consider the automorphism group of the problem Hamiltonian, leading us to develop a circuit construction that is equivariant under this symmetry group. The benefits of our novel circuitstructure, called ORB, are numerically probed in several ground-state problems. We find a consistent improvement (in terms of circuit depth, number of parameters required, and gradient magnitudes) compared to literature circuit constructions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Prolonging genetic circuit stability through adaptive evolution of overlapping genes

Abstract The development of synthetic biological circuits that maintain functionality over application-relevant time scales remains a significant challenge. Here, we employed synthetic overlapping sequences in which one gene is encoded or ‘entangled’ entirely within an alternative reading frame of another gene. In this design, the toxin-encoding relE was entangled within ilvA, which encodes threonine deaminase, an enzyme essential for isoleucine biosynthesis. A functional entanglement construct was obtained upon modification of the ribosome-binding site of the internal relE gene. Using this optimized design, we found that the selection pressure to maintain functional IlvA stabilized the production of burdensome RelE for >130 generations, which compares favorably with the most stable kill-switch circuits developed to date. This stabilizing effect was achieved through a complete alteration of the allowable landscape of mutations such that mutations inactivating the entangled genes were disfavored. Instead, the majority of lineages accumulated mutations within the regulatory region of ilvA. By reducing baseline relE expression, these more ‘benign’ mutations lowered circuit burden, which suppressed the accumulation of relE-inactivating mutations, thereby prolonging kill-switch function. Overall, this work demonstrates the utility of sequence entanglement paired with an adaptive laboratory evolution campaign to increase the evolutionary stability of burdensome synthetic circuits.

59 BASIC BIOLOGICAL SCIENCES↗

Logical error rates for the surface code under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions

With fault-tolerant quantum computing (FTQC) on the horizon, it is critical to understand sources of logical errors in plausible hardware implementations of quantum error-correcting codes. Detailed error modeling of computational instructions on particular FTQC architectures will enable the better prediction of error propagation in FT-encoded quantum circuits while revealing where greater attention is needed in hardware design. In this work, we consider logical error rates for the surface code implemented on a hypothetical grid-based trapped-ion quantum charge-coupled device architecture. Specifically, we construct logical channels for the idling surface code and examine its diamond error under a mixed coherent and stochastic circuit-level noise model inspired by trapped ions. We include the coherent dephasing noise that is known to accumulate during physical qubit idling and transport in these systems, determining idling and transport durations using the time-resolved output of an open-source trapped-ion surface code compiler. To estimate expectation values of logical Pauli observables following hardware circuits containing non-Clifford sources of noise, we utilize a Monte Carlo technique to sample from an underlying quasiprobability distribution of Clifford circuits that we independently simulate in a phase-sensitive fashion. We verify error suppression up to code distance 𝑑 = 11 at coherent dephasing rates near and below those of current-generation trapped-ion quantum computers and find that logical error rates align with those of analogous fully stochastic simulations in this regime. Exploring higher dephasing rates at 𝑑 = 3−5, we find evidence for growing coherent rotations about all three logical Pauli axes, increased diagonal logical error process matrix elements relative to those of stochastic simulations, and a reduced dephasing rate threshold. Overall, our work paves a way toward realistic hardware emulation of small fault-tolerant quantum processes, e.g., members of an FTQC instruction set.

Quantum benchmarking↗

Optimized low-depth quantum circuits for molecular electronic structure using a separable-pair approximation

We present a classically tractable model that leads to optimized low-depth quantum circuits leveraging separable-pair approximations. The obtained circuits are well suited as a baseline circuit for emerging quantum hardware and can, in the long term, provide significantly improved initial states for quantum algorithms. The associated wave functions can be represented with linear memory requirement, which allows classical optimization of the circuits and naturally defines a minimum benchmark for quantum algorithms. In this work we employ directly determined pair-natural orbitals within a basis-set-free approach. This leads to accurate representation of the one- and many-body parts for weakly correlated systems and we explicitly illustrate how the model can be integrated into other quantum algorithms for stronger correlated systems.

74 ATOMIC AND MOLECULAR PHYSICS↗

Benchmarking characterization methods for noisy quantum circuits

Effective methods for characterizing the noise in quantum computing devices are essential for programming and debugging circuit performance. Existing approaches vary in the information obtained as well as the amount of quantum and classical resources required, with more information generally requiring more resources. Here we benchmark the characterization methods of gate set tomography, Pauli channel noise reconstruction, and empirical direct characterization for developing models that describe noisy quantum circuit performance on a 27-qubit superconducting transmon device. We evaluate these models by comparing the accuracy of noisy circuit simulations with the corresponding experimental observations. Here, we find that the agreement of noise model to experiment does not correlate with the information gained by characterization and that the underlying circuit strongly influences the best choice of characterization approach. Empirical direct characterization scales best of the methods we tested and produced the most accurate characterizations across our benchmarks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Contraction of fermionic operator circuits and the simulation of strongly correlated fermions

A fermionic operator circuit is a product of fermionic operators of usually different and partially overlapping support. Further elements of fermionic operator circuits (FOCs) are partial traces and partial projections. The presented framework allows for the introduction of fermionic versions of known qudit operator circuits (QUOC), important for the simulation of strongly correlated d-dimensional systems: the multiscale entanglement renormalization ansaetze (MERA), tree tensor networks (TTN), projected entangled pair states (PEPS), or their infinite-size versions (iPEPS etc.). After the definition of a FOC, we present a method to contract it with the same computation and memory requirements as a corresponding QUOC, for which all fermionic operators are replaced by qudit operators of identical dimension. A given scheme for contracting the QUOC relates to an analogous scheme for the corresponding fermionic circuit, where additional marginal computational costs arise only from reordering of modes for operators occurring in intermediate stages of the contraction. Our result hence generalizes efficient schemes for the simulation of d-dimensional spin systems, as MERA, TTN, or PEPS to the fermionic case.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Locality of interactions for planar memristive circuits

The dynamics of purely memristive circuits has been shown to depend on a projection operator which expresses the Kirchhoff constraints, is naturally non-local in nature, and does represent the interaction between memristors. In the present paper we show that for the case of planar circuits, for which a meaningful Hamming distance can be defined, the elements of such projector can be bounded by exponentially decreasing functions of the distance. We provide a geometrical interpretation of the projector elements in terms of determinants of Dirichlet Laplacian of the dual circuit. For the case of linearized dynamics of the circuit for which a solution is known, this can be shown to provide a light cone bound for the interaction between memristors. Furthermore, this result establishes a finite speed of propagation of signals across the network, despite the non-local nature of the system.

30 DIRECT ENERGY CONVERSION↗

ADMX SLIC: Results from a Superconducting $\textit{LC}$ Circuit Investigating Cold Axions

Axions are a promising cold dark matter candidate. Haloscopes, which use the conversion of axions to photons in the presence of a magnetic field to detect axions, are the basis of microwave cavity searches such as the Axion Dark Matter eXperiment (ADMX). To search for lighter, low frequency axions in the sub-2 × 10 –7 eV (50 MHz) range, a tunable lumped-element $\textit{LC}$ circuit has been proposed. For the first time, through ADMX SLIC (Superconducting $\textit{LC}$ Circuit Investigating Cold Axions), a resonant $\textit{LC}$ circuit was used to probe this region of axion mass-coupling space. The detector used a superconducting $\textit{LC}$ circuit with piezoelectric driven capacitive tuning. The axion mass and corresponding frequency ranges 1.7498–1.7519 × 10 –7 eV (42.31–42.36 MHz), 1.7734–1.7738 × 10 –7 eV (42.88–42.89 MHz), and 1.8007–1.8015 × 10 –7 eV (43.54–43.56 MHz) were covered at magnetic fields of 4.5 T, 5.0 T, and 7.0 T, respectively. Exclusion results from the search data, for coupling below 10 –12 GeV –1 , are presented.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Mitigating Depolarizing Noise on Quantum Computers with Noise-Estimation Circuits

A significant problem for current quantum computers is noise. While there are many distinct noise channels, the depolarizing noise model often appropriately describes average noise for large circuits involving many qubits and gates. We present a method to mitigate the depolarizing noise by first estimating its rate with a noise-estimation circuit and then correcting the output of the target circuit using the estimated rate. The method is experimentally validated on the simulation of the Heisenberg model. We find that our approach in combination with readout-error correction, randomized compiling, and zero-noise extrapolation produces results close to exact results even for circuits containing hundreds of CNOT gates.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Acceptor-Induced Bulk Dielectric Loss in Superconducting Circuits on Silicon

The performance of superconducting quantum circuits is primarily limited by dielectric loss due to interactions with two-level systems (TLSs). State-of-the-art circuits with engineered material interfaces are approaching a limit where dielectric loss from bulk substrates plays an important role. However, a microscopic understanding of dielectric loss in crystalline substrates is still lacking. In this work, we show that boron acceptors in silicon constitute a TLS bath that leads to an energy dissipation channel for superconducting circuits. We discuss how the electronic structure of boron acceptors leads to an effective TLS response in silicon. We sweep the boron concentration in silicon and demonstrate the bulk dielectric loss limit from boron acceptors. We show that boron-induced dielectric loss can be reduced in a magnetic field due to the spin-orbit structure of boron. This work provides the first detailed microscopic description of a TLS bath for superconducting circuits and demonstrates the need for ultrahigh-purity substrates for next-generation superconducting quantum processors.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Localization in Fractonic Random Circuits

We study the spreading of initially local operators under unitary time evolution in a one-dimensional random quantum circuit model that is constrained to conserve a U ( 1 ) charge and also the dipole moment of this charge. These constraints are motivated by the quantum dynamics of fracton phases. We discover that the charge remains localized at its initial position, providing a crisp example of a nonergodic dynamical phase of random circuit dynamics. This localization can be understood as a consequence of the return properties of low-dimensional random walks, through a mechanism reminiscent of weak localization, but insensitive to dephasing. The charge dynamics is well described by a system of coupled hydrodynamic equations, which makes several nontrivial predictions that are all in good agreement with numerics in one dimension. Importantly, these equations also predict localization in two-dimensional fractonic random circuits. We further find that the immobile fractonic charge emits nonconserved operators, whose spreading is governed by exponents that are distinct from those observed in nonfractonic circuits. These nonstandard exponents are also explained by our coupled hydrodynamic equations. Where entanglement properties are concerned, we find that fractonic operators exhibit a short time linear growth of observable entanglement with saturation to an area law, as well as a subthermal volume law for operator entanglement. The entanglement spectrum is found to follow semi-Poisson statistics, similar to eigenstates of many-body localized systems. The nonergodic phenomenology is found to persist to initial conditions containing nonzero density of dipolar or fractonic charge, including states near the sector of maximal charge. Our work implies that low-dimensional fracton systems should preserve forever a memory of their initial conditions in local observables under noisy quantum dynamics, thereby constituting ideal memories. It also implies that one- and two-dimensional fracton systems should realize true many-body localization (MBL) under Hamiltonian dynamics, even in the absence of disorder, with the obstructions to MBL in translation-invariant systems and in spatial dimensions greater than one being evaded by the nature of the mechanism responsible for localization. We also suggest a possible route to new nonergodic phases in high dimensions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Fast-Response High-Accuracy Overvoltage Protection Circuit for Soft-Switching Current-Source Converters

Although voltage-source converters (VSCs) have been a focus of research for decades and are widely applied in numerous applications, they face great challenges in short-circuit failures, high dv/dt and electromagnetic interference (EMI), especially using wide bandgap devices. Instead, current-source converters (CSCs) are attracting increasing attention in recent years owing to their friendliness to short-circuit faults, improved EMI, etc. For CSCs, overvoltage is the most catastrophic failure since the semiconductor devices can hardly withstand an overvoltage for a short pulse. In this paper, a fast-response high-accuracy overvoltage protection (OVP) circuit is proposed to protect CSCs from overvoltage damage. It also features a small form factor, good noise-immunity, friendly retrofit capability, and no need for active switches. In this paper, the operating principle and design guideline of the proposed OVP circuit is introduced. Its effectiveness is validated in soft-switching solid-state transformer (S4T) at 500 V. In experiments, the voltage detection error of less than 5% and a propagation delay of fewer than 400 ns have been achieved.

30 DIRECT ENERGY CONVERSION↗

Grid Forming Inverter With Increased Short-Circuit Contribution to Address Inverter-Based Microgrid Protection Challenges

Substantial differences in fault levels between grid-tied and islanded modes is one of the primary challenges of microgrid protection. During grid-tied mode, the bulk grid provides significant short-circuit, while during islanded operation the short-circuit magnitude is small due to inverter-based resources limiting their current output close to nominal ratings. Consequently, conventional distribution protection strategies based on overcurrent cannot reliably protect microgrids when operating in islanded mode. Fuses and circuit breakers are particularly affected because of their inverse characteristics. Presently, the absence of affordable solutions for protecting microgrids in islanded mode leads to microgrids shutting down during electrical faults. The contribution of this article is two-fold. The first innovation proposes specific hardware modifications to grid-forming inverters to increase their short-circuit current during electrical faults. The second innovation introduces a novel control strategy designed to preserve control stability margins even when the grid-filter saturates, ensuring sinusoidal output currents under normal and fault conditions. Through experimental results, the inverter with the proposed modifications can provide more than three-times its nominal current during electrical faults. For the prototype testbed, this was sufficient to enable the use of traditional legacy overcurrent protection, achieving the fuse-to-relay and relay-to-relay minimum coordination time for the line-to-ground, line-to-line to ground, and three-phase electrical faults.

42 ENGINEERING↗

Superconducting Hyperdimensional Associative Memory Circuit for Scalable Machine Learning

Here we propose a generalized architecture for the first rapid-single-flux-quantum (RSFQ) associative memory circuit. The circuit employs hyperdimensional computing (HDC), a machine learning (ML) paradigm utilizing vectors with dimensionality in the thousands to represent information. HDC designs have small memory footprints, simple computations, and simple training algorithms compared to superconducting neural network accelerators (SNNAs), making them a better option for scalable SFQ machine learning (ML) solutions. The proposed superconducting HDC (SHDC) circuit uses entirely on-chip RSFQ memory which is tightly integrated with logic, operates at 33.3 GHz, is applicable to general ML tasks, and is manufacturable at practically useful scales given current SFQ fabrication limits. Tailored to a language recognition task, SHDC consists of ~ 2-20 M Josephson junctions (JJs) and consumes up to three times less power than an analogous CMOS HDC circuit while achieving 78-84% higher throughput. SHDC is capable of outperforming the state of the art RSFQ SNNA, SuperNPU, by 48-99% for all benchmark NN architectures tested while occupying up to 90% less area and consuming up to nine times less power. To the best of the authors' knowledge, SHDC is currently the only superconducting ML approach feasible at practically useful scales for real-world ML tasks and capable of online learning.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

SU-E-E-08: Applications of the Quantization of Coupled Circuits in Radiation Physics (design of Klystron, Bremsstrahlung, Synchrotron)

Purpose: During the past decade the quantization of coupled/forced electromagnetic circuits with or without Ohm’s resistance has gained the subject of some fundamental studies, since even problems of quantum electrodynamics can be solved in an elegant manner, e.g. the creation of quantized electromagnetic fields. In this communication, we shall use these principles to describe optimization procedures in the design of klystrons, synchrotron irradiation and high energy bremsstrahlung. Methods: The base is the Hamiltonian of an electromagnetic circuit and the extension to coupled circuits, which allow the study of symmetries and perturbed symmetries in a very apparent way (SU2, SU3, SU4). The introduction resistance and forced oscillators for the emission and absorption in such coupled systems provides characteristic resonance conditions, and atomic orbitals can be described by that. The extension to virtual orbitals leads to creation of bremsstrahlung, if the incident electron (velocity v nearly c) is described by a current, which is associated with its inductivitance and the virtual orbital to the charge distribution (capacitance). Coupled systems with forced oscillators can be used to amplify drastically the resonance frequencies to describe klystrons and synchrotron radiation. Results: The cross-section formula for bremsstrahlung given by the propagator method of Feynman can readily be derived. The design of klystrons and synchrotrons inclusive the radiation outcome can be described and optimized by the determination of the mutual magnetic couplings between the oscillators induced by the currents. Conclusions: The presented methods of quantization of circuits inclusive resistance provide rather a straightforward way to understand complex technical processes such as creation of bremsstrahlung or creation of radiation by klystrons and synchrotrons. They can either be used for optimization procedures and, last but not least, for pedagogical purposes with regard to a qualified understanding of radiation physics for students.

43 PARTICLE ACCELERATORS↗