Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “circuit optimization”

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 145 records · Page 8

Short-depth QAOA circuits and quantum annealing on higher-order ising models

Abstract We present a direct comparison between QAOA (Quantum Alternating Operator Ansatz), and QA (Quantum Annealing) on 127 qubit problem instances. QAOA with p = 1, 2 rounds is executed on the 127 qubit heavy-hex graph gate-model quantum computer ibm_washington, using on-device grid-searches for angle finding, and QA is executed on two Pegasus-chip D-Wave quantum annealers. The problems are random Ising models whose connectivity matches heavy-hex graphs and the Pegasus graph connectivity, and optionally include hardware-compatible cubic terms ( Z Z Z terms). The QAOA circuits are heavily optimized and of extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of the heavy-hex lattice. QAOA and QA are both compared against simulated annealing and the optimal solutions are computed exactly using CPLEX. The noiseless mean QAOA expectation values for p = 1, 2 are computed using classical light-cone based simulations. We find QA outperforms QAOA on the evaluated devices.

127 qubits↗

Intermediate-temperature topological Uhlmann phase on IBM quantum computers

A spin-1 system can exhibit an intermediate-temperature topological regime with a quantized Uhlmann phase sandwiched by topologically trivial low- and high-temperature regimes. We present a quantum circuit consisting of system and ancilla qubits plus a probe qubit which prepares an initial state corresponding to the purified state of a spin-1 system at finite temperature, evolves the system according to the Uhlmann process, and measures the Uhlmann phase via expectation values of the probe qubit. Although classical simulations suggest the quantized Uhlmann phase is observable on International Business Machines (IBM’s) noisy intermediate-scale quantum (NISQ) computers, an implementation of the circuit without any optimization exceeds the gate count for the error budget and results in unresolved signals. Through a series of optimization with Qiskit and BQSKit, the gate count can be substantially reduced, making the jumps of the Uhlmann phase more visible. A recent hardware upgrade of IBM quantum computers further improves the signals and leads to a clearer demonstration of interesting finite-temperature topological phenomena on NISQ hardware.

Mastandrea, Christopher [Univ. of California, Merc↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Generating stationary entangled states in superconducting qubits

When a two-qubit system is initially maximally entangled, two independent decoherence channels, one per qubit, would greatly reduce the entanglement of the two-qubit system when it reaches its stationary state. We propose a method on how to minimize such a loss of entanglement in open quantum systems. We find that the quantum entanglement of general two-qubit systems with controllable parameters can be controlled by tuning both the single-qubit parameters and the two-qubit coupling strengths. Indeed, the maximum fidelity F{sub max} between the stationary entangled state, {rho}{sub {infinity}}, and the maximally entangled state, {rho}{sub m}, can be about 2/3{approx_equal}max(tr({rho}{sub {infinity}}{rho}{sub m}))=F{sub max}, corresponding to a maximum stationary concurrence, C{sub max}, of about 1/3{approx_equal}C({rho}{sub {infinity}})=C{sub max}. This is significant because the quantum entanglement of the two-qubit system can be produced and kept, even for a long time. We apply our proposal to several types of two-qubit superconducting circuits and show how the entanglement of these two-qubit circuits can be optimized by varying experimentally controllable parameters.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Trapped-ion quantum simulation of collective neutrino oscillations

It is well known that the neutrino flavor in extreme astrophysical environments changes under the effect of three contributions: the vacuum oscillation, the interaction with the surrounding matter, and the collective oscillations due to interactions between different neutrinos. The latter adds a nonlinear contribution to the equations of motion, making the description of their dynamics complex. In this work we study various strategies to simulate the coherent collective oscillations of a system of N neutrinos in the two-flavor approximation using quantum computation. This was achieved by using a pair-neutrino decomposition designed to account for the fact that the flavor Hamiltonian, in the presence of the neutrino-neutrino term, presents an all-to-all interaction that makes the implementation of the evolution dependent on the qubit topology. We analyze the Trotter error caused by the decomposition demonstrating that the complexity of the implementation of time evolution scales polynomially with the number of neutrinos and that the noise from near-term quantum device simulation can be reduced by optimizing the quantum circuit decomposition and exploiting a full-qubit connectivity. We find that the gate complexity using second order Trotter-Suzuki formulas scales better with system size than with other decomposition methods such as quantum signal processing. In conclusion, we finally present the application and the results of our algorithm on a real quantum device based on trapped-ion qubits.

79 ASTRONOMY AND ASTROPHYSICS↗

Reductive quantum phase estimation

Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and molecular physics and quantum phase estimation (QPE) in quantum computing. We demonstrate that these canonical examples are instances of a larger class of phase estimation protocols, which we call reductive quantum phase estimation (RQPE) circuits. Here, we present an explicit algorithm that allows one to create an RQPE circuit. This circuit distinguishes an arbitrary set of phases with a smaller number of qubits and unitary applications, thereby solving a general class of quantum hypothesis testing to which RI and QPE belong. We further demonstrate a tradeoff between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application. Published by the American Physical Society 2024

Papadopoulos, Nicholas J. C. (ORCID:00000002635700↗

A Game-Theoretic Quantum Algorithm for Solving Magic Squares

Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game’s parity and consistency constraints, then optimize parameterize quantum circuits to minimize this cost. Our approach build on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure an interpretability. We validate our method through numerical experiments and outline generalizations to larger games.

Chehade, Sarah [ORNL]↗

Computational Modeling of Fluctuations in Energy and Metabolic Pathways of Methanogenic Archaea

The methanogenic archaea, anaerobic microbes that convert CO2 and H2 and/or other small organic fermentation products into methane, play an unusually large role in the global carbon cycle. As they perform the final step in the anaerobic breakdown of biomass, methanogens are a biogenic source of an estimated one billion tons methane each year. Depending on the location, produced methane can be considered as either a greenhouse gas (agricultural byproduct), sequestered carbon storage (methane hydrate deposits), or a potential energy source (organic wastewater treatment). These microbes therefore represent an important target for biotechnology applications. Computational models of methanogens with predictive power are useful aids in the adaptation of methanogenic systems, but need to connect processes of wide-ranging time and length scales. In this project, we developed several computational methodologies for modeling the dynamic behavior of entire cells that connects stochastic reaction-diffusion dynamics of individual biochemical pathways with genome-scale modeling of metabolic networks. While each of these techniques were in the realm of well-defined computational methods, here we integrated them to develop several entirely new approaches to systems biology. The first scientific aim of the project was to model how noise in a biochemical pathway propagates into cellular phenotypes. Genetic circuits have been optimized by evolution to regulate molecular processes despite stochastic noise, but the effect of such noise on a cellular biochemical networks is currently unknown. An integrated stochastic/systems model of Escherichia coli species was created to analyze how noise in protein expression gives—and therefore noise in metabolic fluxes—gives rise to multiple cellular phenotype in isogenic population. After the initial work developing and validating methods that allow characterization of the heterogeneity in the model organism E. coli, the project shifted toward investigations of the methanogen Methanosarcina acetivorans. By integrating an unprecedented transcriptomics dataset for growth of the methanogen on many substrates with an in silico model, heterogeneity in metabolic pathway usage and methane production were examined. This lent insight into the physiological requirements of the organism under different environmental conditions and uncovered the unique regulatory role that mRNA half-life has in shaping metabolic flux distributions in this organism.

59 BASIC BIOLOGICAL SCIENCES↗

A Model Predictive Control to Improve Grid Resilience

The following article details a model predictive control (MPC) to improve grid resilience when faced with variable generation resources. This topic is of significant interest to utility power systems where distributed intermittent energy sources will increase significantly and be relied on for electric grid ancillary services. Previous work on MPCs has focused on narrowly targeted control applications such as improving electric vehicle (EV) charging infrastructure or reducing the cost of integrating Energy Storage Systems (ESSs) into the grid. In contrast, this article develops a comprehensive treatment of the construction of an MPC tailored to electric grids and then applies it integration of intermittent energy resources. To accomplish this, the following article includes a description of a reduced order model (ROM) of an electric power grid based on a circuit model, an optimization formulation that describes the MPC, a collocation method for solving linear time-dependent differential algebraic equations (DAEs) that result from the ROM, and an overall strategy for iteratively refining the behavior of the MPC. Next, the algorithm is validated using two separate numerical experiments. First, the algorithm is compared to an existing MPC code and the results are verified by a numerically precise simulation. It is shown that this algorithm produces a control comparable to existing algorithms and the behavior of the control carefully respects the bounds specified. Second, the MPC is applied to a small nine bus system that contains a mix of turbine-spinning-machine-based and intermittent generation in order to demonstrate the algorithm’s utility for resource planning and control of intermittent resources. This study demonstrates how the MPC can be tuned to change the behavior of the control, which can then assist with the integration of intermittent resources into the grid. The emphasis throughout the paper is to provide systematic treatment of the topic and produce a novel nonlinear control compatible design framework applicable to electric grids and the control of variable resources. This differs from the more targeted application-based focus in most presentations.

microgrid↗

Advanced Power Electronics for LED Drivers: Advanced Technologies for integrated Power Electronics

ADEPT Project: MIT is teaming with Georgia Institute of Technology, Dartmouth College, and the University of Pennsylvania (UPenn) to create more efficient power circuits for energy-efficient light-emitting diodes (LEDs) through advances in 3 related areas. First, the team is using semiconductors made of high-performing gallium nitride grown on a low-cost silicon base (GaN-on-Si). These GaN-on-Si semiconductors conduct electricity more efficiently than traditional silicon semiconductors. Second, the team is developing new magnetic materials and structures to reduce the size and increase the efficiency of an important LED power component, the inductor. This advancement is important because magnetics are the largest and most expensive part of a circuit. Finally, the team is creating an entirely new circuit design to optimize the performance of the new semiconductors and magnetic devices it is using.

ADEPT↗

Modeling a Water-Cooled Printed Circuit Heat Exchanger Condensing CO2 for use in SCO2 Cycle System Optimization Studies

This work describes a one-dimensional model of a water-cooled printed circuit heat exchanger (PCHE) condensing supercritical CO2. The model is developed for use in cycle optimization studies (e.g., minimizing levelized cost of electricity) as either the main heat rejection cooler and/or a compressor intercooler for recompression closed Brayton supercritical CO2 power cycles. Sensitivity and case studies are used to illustrate the impact of important model parameters, and this includes allowing for independent variation of zig-zag channel wave angles on the CO2 and water side. Results show that for a given CO2 design pressure (and thus saturation temperature), the PCHE design inlet water temperature has a significant impact on the PCHE size. Results also demonstrate that if wave angles are the same on the CO2 and water side, the water side pressure drop will have more influence on determining the optimum PCHE mass than the CO2 side pressure drop. Reducing the water side wave angle to near straight channel flow offers a more compact design for a similar water side pressure drop (and pump power requirement). Cases are also shown for further increasing the compactness and how the PCHE mass is affected along with water pump power.

Liese, Eric↗

Analytical Model-Based Design Optimization of a Transverse Flux Machine

This paper proposes an analytical machine design tool using magnetic equivalent circuit (MEC)-based particle swarm optimization (PSO) for a double-sided, flux-concentrating transverse flux machine (TFM). The magnetic equivalent circuit method is applied to analytically establish the relationship between the design objective and the input variables of prospective TFM designs. This is computationally less intensive and more time efficient than finite element solvers. A PSO algorithm is then used to design a machine with the highest torque density within the specified power range along with some geometric design constraints. The stator pole length, magnet length, and rotor thickness are the variables that define the optimization search space. Finite element analysis (FEA) was carried out to verify the performance of the MEC-PSO optimized machine. The proposed analytical design tool helps save computation time by at least 50% when compared to commercial FEA-based optimization programs, with results found to be in agreement with less than 5% error.

24 POWER TRANSMISSION AND DISTRIBUTION↗

High-Fidelity Adiabatic Passage by Composite Sequences of Chirped Pulses

We present a method for optimization of the technique of adiabatic passage between two quantum states by composite sequences of frequency-chirped pulses with specific relative phases: composite adiabatic passage (CAP). By choosing the composite phases appropriately the nonadiabatic losses can be canceled to any desired order with sufficiently long sequences, regardless of the nonadiabatic coupling. The values of the composite phases are universal for they do not depend on the pulse shapes and the chirp. The accuracy of the CAP technique and its robustness against parameter variations make CAP suitable for high-fidelity quantum information processing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced-order modeling on a near-term quantum computer

Quantum computing is an advancing area of research in which computer hardware and algorithms are developed to take advantage of quantum mechanical phenomena. In recent studies, quantum algorithms have shown promise in solving linear systems of equations as well as systems of linear ordinary differential equations (ODEs) and partial differential equations (PDEs). Reducedorder modeling (ROM) algorithms for studying fluid dynamics have shown success in identifying linear operators that can describe flowfields, where dynamic mode decomposition (DMD) is a particularly useful method in which a linear operator is identified from data. In this work, DMD is reformulated as an optimization problem to propagate the state of the linearized dynamical system on a quantum computer. This reformulation was chosen as a means of facilitating implementation on a near-term quantum computer. Quadratic unconstrained binary optimization (QUBO), a technique for optimizing quadratic polynomials in binary variables, allows for quantum annealing algorithms to be applied. A quantum circuit model (quantum approximation optimization algorithm, QAOA) is utilized to obtain predictions of the state trajectories. Results are shown for the quantum-ROM predictions for flow over a 2D cylinder at Re = 220 and flow over a NACA0009 airfoil at Re = 500 and α = 15°. The quantum-ROM predictions are found to depend on the number of bits utilized for a fixed point representation and the truncation level of the DMD model. Comparisons with DMD predictions from a classical computer algorithm are made, as well as an analysis of the computational complexity and prospects for future, more fault-tolerant quantum computers.

97 MATHEMATICS AND COMPUTING↗

Dynamics of qudit gates and effects of spectator modes on optimal control pulses

Qudit gates for high-dimensional quantum computing can be synthesized with high precision using numerical quantum optimal control techniques. Large circuits are broken down into modules and the tailored pulses for each module can be used as primitives for a qudit compiler. Application of the pulses of each module in the presence of extra modes may decrease their effectiveness due to crosstalk. In this paper, we address this problem by simulating qudit dynamics for circuit quantum electrodynamics systems. As a test case, we take pulses for single-qudit swap gates optimized in isolation and then apply them in the presence of spectator modes each of which are in Fock states. We provide an experimentally relevant scaling formula that can be used as a bound on the fidelity decay. Our results show that frequency shift from spectator mode populations has to be ≲ 0.1 % of the qudit's nonlinearity in order for high-fidelity single-qudit gates to be useful in the presence of occupied spectator modes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗