Search NASA⌕ Search

SEARCH · Search NASA

Results for “circuit theory”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

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

At least 37 records · Page 2

Realization of a Quantum Slide Rule for 1+1 Dimensional Quantum Field Theories Using Josephson Superconducting Circuits

We have built a special type of electronic circuit—a “superconducting quantum simulator”—that allows us to mimic the behavior of complex quantum systems that are impossible to compute with ordinary computers. Our device is a long transmission line made of thousands of tiny superconducting junctions, acting as a one-dimensional “vacuum” for microwave photons. By terminating this line with a tunable, weak Josephson junction, we can control how strongly photons interact with each other.

74 ATOMIC AND MOLECULAR PHYSICS↗

Theory of the phase transition in random unitary circuits with measurements

Here, we present a theory of the entanglement transition tuned by measurement strength in qudit chains evolved by random unitary circuits and subject to either weak or random projective measurements. The transition can be understood as a nonanalytic change in the amount of information extracted by the measurements about the initial state of the system, quantified by the Fisher information. To compute the von Neumann entanglement entropy $\textit{S}$ and the Fisher information $\mathcal{F}$, we apply a replica method based on a sequence of quantities $\tilde{S}^{(n)}$ and $\mathcal{F}^{(n)}$ that depend on the $\textit{n}$th moments of density matrices and reduce to $\textit{S}$ and $\mathcal{F}$ in the limit $\textit{n}$ → 1. These quantities with $\textit{n}$ ≥ 2 are mapped to free energies of a classical spin model with $\textit{n}$! internal states in two dimensions with specific boundary conditions. In particular, $\tilde{S}^{(n)}$ is the excess free energy of a domain wall terminating on the top boundary, and $\mathcal{F}^{(n)}$ is related to the magnetization on the bottom boundary. Phase transitions occur as the spin models undergo ordering transitions in the bulk. Taking the limit of large local Hilbert space dimension $\textit{q}$ followed by the replica limit $\textit{n}$ → 1, we obtain the critical measurement probability $p_c$ = 1/2 and identify the transition as a bond percolation in the 2D square lattice in this limit. Finally, we show there is no phase transition if the measurements are allowed in an arbitrary nonlocal basis, thereby highlighting the relation between the phase transition and information scrambling. We establish an explicit connection between the entanglement phase transition and the purification dynamics of a mixed state evolution and discuss implications of our results to experimental observations of the transition and simulability of quantum dynamics.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum simulation of $\phi^4$ theories in qudit systems

We discuss the implementation of quantum algorithms for lattice $\Phi^4$ theory on circuit quantum electrodynamics (cQED) system. The field is represented on qudits in a discretized field amplitude basis. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates. Considering the set of universal gates formed by the single-qudit phase gate and the displacement gate, we address initial state preparation and single-qudit gate synthesis with variational methods.

Kurkcuoglu, Doga Murat↗

Physics-based compact modeling of electro-thermal memristors: Negative differential resistance, local activity, and non-local dynamical bifurcations

Leon Chua's Local Activity theory quantitatively relates the compact model of an isolated nonlinear circuit element, such as a memristor, to its potential for desired dynamical behaviors when externally coupled to passive elements in a circuit. However, the theory's use has often been limited to potentially unphysical toy models and analyses of small-signal linear circuits containing pseudo-elements (resistors, capacitors, and inductors), which provide little insight into required physical, material, and device properties. Furthermore, the Local Activity concept relies on a local analysis and must be complemented by examining dynamical behavior far away from the steady-states of a circuit. In this work, we review and study a class of generic and extended one-dimensional electro-thermal memristors (i.e., temperature is the sole state variable), re-framing the analysis in terms of physically motivated definitions and visualizations to derive intuitive compact models and simulate their dynamical behavior in terms of experimentally measurable properties, such as electrical and thermal conductance and capacitance and their derivatives with respect to voltage and temperature. Within this unified framework, we connect steady-state phenomena, such as negative differential resistance, and dynamical behaviors, such as instability, oscillations, and bifurcations, through a set of dimensionless nonlinearity parameters. In particular, we reveal that the reactance associated with electro-thermal memristors is the result of a phase shift between oscillating current and voltage induced by the dynamical delay and coupling between the electrical and thermal variables. We thus, demonstrate both the utility and limitations of local analyses to understand non-local dynamical behavior. Critically for future experimentation, the analyses show that external coupling of a memristor to impedances within modern sourcing and measurement instruments can dominate the response of the total circuit, making it impossible to characterize the response of an uncoupled circuit element for which a compact model is desired. However, these effects can be minimized by proper understanding of the Local Activity theory to design and utilize purpose-built instruments.

Brown, Timothy D. (ORCID:0000000347068355)↗

Mean Field Theory of Self‐Organizing Memristive Connectomes

Abstract Biological neuronal networks are characterized by nonlinear interactions and complex connectivity. Given the growing impetus to build neuromorphic computers, understanding physical devices that exhibit structures and functionalities similar to biological neural networks is an important step toward this goal. Self‐organizing circuits of nanodevices are at the forefront of the research in neuromorphic computing, as their behavior mimics synaptic plasticity features of biological neuronal circuits. However, an effective theory to describe their behavior is lacking. This study provides for the first time an effective mean field theory for the emergent voltage‐induced polymorphism of circuits of a nanowire connectome, showing that the behavior of these circuits can be explained by a low‐dimensional dynamical equation. The equation can be derived from the microscopic dynamics of a single memristive junction in analytical form. The effective model is tested on experiments of nanowire networks and show that it fits both the potentiation and depression of these synapse‐mimicking circuits. It is shown that this theory applies beyond the case of nanowire networks by formulating a general mean‐field theory of conductance transitions in self‐organizing memristive connectomes.

Caravelli, Francesco↗

A Lie algebraic theory of barren plateaus for deep parameterized quantum circuits

Variational quantum computing schemes train a loss function by sending an initial state through a parametrized quantum circuit, and measuring the expectation value of some operator. Despite their promise, the trainability of these algorithms is hindered by barren plateaus (BPs) induced by the expressiveness of the circuit, the entanglement of the input data, the locality of the observable, or the presence of noise. Up to this point, these sources of BPs have been regarded as independent. In this work, we present a general Lie algebraic theory that provides an exact expression for the variance of the loss function of sufficiently deep parametrized quantum circuits, even in the presence of certain noise models. Our results allow us to understand under one framework all aforementioned sources of BPs. This theoretical leap resolves a standing conjecture about a connection between loss concentration and the dimension of the Lie algebra of the circuit’s generators.

97 MATHEMATICS AND COMPUTING↗

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A method for automated modeling of plasma shape control response in tokamaks

Here, a simple method commonly used in modeling of tokamak conductor and plasma response for plasma control has been extended to allow more general modeling of tokamak PF conductor circuits. This extension combines a previously existing method for integrating plasma response and tokamak circuits with a more capable circuit modeling technique derived from the theory that underlies present-day automatic circuit simulation codes. This combined method can incorporate any combination of inductors (e.g., coils), resistors, capacitors, voltage sources, and current sources, while retaining the same model structure and ease of interpretation as the simple method. For many tokamaks, use of this extended method would not be the preferred approach, but for certain devices or for specialized models of a device, it is useful and occasionally essential. For example, the method has enabled fast and automated modeling of the complicated and daily-changing circuit topology used in the DIII-D tokamak. This automated modeling is essential to the support of controller design for the frequently changing requirements for DIII-D plasmas. It is likely to also find application in the workflows for new device designs.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

String breaking in the heavy quark limit with scalable circuits

Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with matter in the heavy quark limit is developed. This truncation is applied to SU(2) lattice gauge theory in 1+1D to map the theory efficiently onto a quantum computer. Scalable variational circuits are found to prepare the vacuum and single meson states. It is also shown how these state preparation circuits can be used to perform measurements of the number of mesons produced during the system’s time evolution. A state with a single qq¯ pair is prepared on quantum hardware and the inelastic production of qq¯ pairs is observed using 104 qubits on IBM’s Heron quantum computer ibm_torino.

Ciavarella, Anthony N↗

Bounding entanglement entropy with Clifford double cosets

Following on our previous work studying the orbits of quantum states under Clifford circuits via reachability graphs, we introduce contracted graphs whose vertices represent classes of quantum states with the same entropy vector. These contracted graphs represent the double cosets of the Clifford group, where the left cosets are built from the stabilizer subgroup of the starting state and the right cosets are built from the entropy-preserving operators. We study contracted graphs for stabilizer states, as well as 𝑊 states and Dicke states, discussing how the diameter of a state's contracted graph constrains the entropic diversity of its two-qubit Clifford orbit. We derive an upper bound on the number of entropy vectors that can be generated using any 𝑛-qubit Clifford circuit, for any quantum state. Here, we speculate on the holographic implications for the relative proximity of gravitational duals of states within the same Clifford orbit. Although we concentrate on how entropy evolves under the Clifford group, our double-coset formalism, and thus the contracted graph picture, is extendable to generic gate sets and generic state properties.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A multilayer multi-configurational approach to efficiently simulate large-scale circuit-based quantum computers on classical machines

Here, a multilayer multi-configurational theory framework is adapted to simulate circuit-based quantum computers. Quantum addition of superpositions of an exponential number of summands is performed in polynomial time with high accuracy. We demonstrate numerically accurate calculations including up to one million qubits for entangling benchmarks. Simulation cost can be assessed by entropy-based entanglement measures. For the considered systems, we show that the entanglement only grows weakly with the system size. The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.

97 MATHEMATICS AND COMPUTING↗

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↗

Primitive quantum gates for an S U ( 2 ) discrete subgroup: Binary octahedral

We construct a primitive gate set for the digital quantum simulation of the 48-element binary octahedral ( BO ) group. This non-Abelian discrete group better approximates S U ( 2 ) lattice gauge theory than previous work on the binary tetrahedral group at the cost of one additional qubit—for a total of six—per gauge link. The necessary primitives are the inversion gate, the group multiplication gate, the trace gate, and the BO Fourier transform. Published by the American Physical Society 2024

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Primitive quantum gates for an S U ( 3 ) discrete subgroup: Σ ( 36 × 3 )

We construct the primitive gate set for the digital quantum simulation of the 108-element Σ ( 36 × 3 ) group. This is the first time a non-Abelian crystal-like subgroup of S U ( 3 ) has been constructed for quantum simulation. The gauge link registers and necessary primitives—the inversion gate, the group multiplication gate, the trace gate, and the Σ ( 36 × 3 ) Fourier transform—are presented for both an eight-qubit encoding and a heterogeneous three-qutrit plus two-qubit register. For the latter, a specialized compiler was developed for decomposing arbitrary unitaries onto this architecture. Published by the American Physical Society 2024

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimizing the tuning range of the Fermilab Recycler 53MHz RF cavities by exploiting the avoided crossing of the tuner and cavity modes

The electromagnetic eigenmodes of the Fermilab Recycler RF cavities were simulated with ACE3P running on NERSC's 'Perlmutter' supercomputer in an attempt to optimize their tuning range to comfortably support slip-stacking. A theory, based on coupled circuits and avoided crossings, was developed to explain the origins of the tuning range for tuner-cavity waveguide systems. This provided a logical, rigorous method to carry out this optimization, although engineering problems due to high voltages in the tuner and the operational $\mu$ range of the garnet had to be carefully implemented. It was shown that the desired goal of 10kHz of tuning was not attainable with the current cavity specifications. The maximum tuning range obtained was 5.59kHz for a single tuner with a coaxial line of length 63in. A double tuner cavity was also studied using the simulation software, although with little improvement in the tuning range. A promising technique to improve the tuning range involving the desynchronization of the garnets' magnetic permeabilities is proposed.

43 PARTICLE ACCELERATORS↗

Quantum complexity in gravity, quantum field theory, and quantum information science

Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. Here, we seek to bridge the approaches of these fields, which define and study complexity using different frameworks and tools. We describe several definitions of complexity, along with their key properties. In quantum information theory, we focus on complexity growth in random quantum circuits. In quantum many-body systems and quantum field theory (QFT), we discuss a geometric definition of complexity in terms of geodesics on the unitary group. In dynamical systems, we explore a definition of complexity in terms of state or operator spreading, as well as concepts from tensor-networks. We also outline applications to simple quantum systems, quantum many-body models, and QFTs including conformal field theories (CFTs). Finally, we explain the proposed relationship between complexity and gravitational observables within the holographic anti-de Sitter (AdS)/CFT correspondence.

Baiguera, Stefano [Istituto Nazionale di Fisica Nu↗