Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Circuit simulation”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Thermodynamic analysis and optimization of supercritical carbon dioxide Brayton cycles for use with low-grade geothermal heat sources

The transcritical carbon dioxide Rankine cycle has emerged as an alternative for power generation in low-grade heat applications. However, the low heat rejection temperatures required for condensing the carbon dioxide is almost prohibitive for many locations. A simple solution is the adoption of a supercritical carbon dioxide Brayton cycle which does not need such low temperature heat sinks. This power cycle has been poorly studied previously in low-grade heat applications. Therefore, with the aim of determining the performance and feasibility of the supercritical carbon dioxide Brayton cycle from thermodynamic viewpoint, using a low-grade geothermal heat source, this paper presents a comparative thermodynamic analysis between four different supercritical carbon dioxide Brayton cycles. For this purpose, detailed models were developed and solved by coupling the thermodynamic model with the thermal-hydraulic model of a Printed Circuit Heat Exchanger. Subsequently, simulations of a base case, a parametric analysis, and an optimization using Genetic Algorithms, were carried out. Results show that there is a combination of operating conditions that maximizes the electrical output of the system. Besides, some values of the minimum pressure of the cycles can increase substantially the precooler cooling water pumping power. At the optimum design point, using a 20 kg/s geothermal brine stream at 150 °C as heat source with a minimum allowable reinjection temperature of 70 °C, the Intercooled Recuperated Brayton Cycle achieved the highest electric power output, energy and exergy efficiencies, obtaining values of 779.99 kW, 11.51%, and 52.49%, respectively. The other feasible alternatives were the Recuperated Brayton Cycle, the Simple Brayton Cycle and the Intercooled Brayton Cycle, ranked, in that order.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2020

PERC silicon PV infrared to ultraviolet optical model

Here, optical modeling of aluminum back surface field (Al-BSF) and passivated emitter and rear contact (PERC) silicon wafer solar cells are extended into the infrared wavelength range (300–2500 nm). The model incorporates ray tracing to account for pyramidal texture of the front silicon surface, free carrier absorption in the front emitter; bulk silicon wafer, BSF; and Lambertian scattering at the silicon back contact. Total reflectance of pyramidal textured cells with different contact geometries with and without encapsulation are simulated. Simulated reflectance and short circuit current density match well with experimental values. These physics-based optical models serve as input for evaluating optical and thermal management strategies for silicon wafer solar cells.

14 SOLAR ENERGY↗
DOE OSTI2022

Investigating the Role of Copper in Arsenic Doped Cd(Se,Te) Photovoltaics

The open circuit voltage (VOC) deficit in Cd(Se,Te)-based photovoltaics remains a critical obstacle for pushing the technology closer to theoretical performance limits. Arsenic doping has become a dominant and promising route to achieve the higher p-type carrier concentrations necessary for higher VOC, but challenges associated with this alternate defect chemistry and higher doping density have hindered progress. Here we show that while arsenic doping enables high carrier concentrations (>1016 cm-3), co-doping with copper can provide a boost to VOC without a significant change to carrier concentration. A large data set is initially used to explore current-voltage and capacitance-voltage trends associated with arsenic doped devices with and without copper. A smaller subset is then used to probe these trends using a wide variety of characterization techniques. Copper is found to facilitate reduced interface recombination and potentially improved bulk absorber characteristics, though the mechanisms for these improvements are not yet clear. Despite the improved performance of co-doped devices, VOC is still far below its potential especially for highly doped devices. Low emitter doping in conjunction with high absorber doping seems to be a plausible cause for this significant deficit, though other device properties may exacerbate this problem.

CdSeTe↗
DOE OSTI2025

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↗
DOE OSTI2023

Cross Entropy Benchmark for Measurement-Induced Phase Transitions

Here, we investigate prospects of employing the linear cross entropy to experimentally access measurement-induced phase transitions without requiring any postselection of quantum trajectories. For two random circuits that are identical in the bulk but with different initial states, the linear cross entropy χ between the bulk measurement outcome distributions in the two circuits acts as an order parameter, and can be used to distinguish the volume law from area law phases. In the volume law phase (and in the thermodynamic limit) the bulk measurements cannot distinguish between the two different initial states, and χ = 1. In the area law phase χ < 1. For circuits with Clifford gates, we provide numerical evidence that χ can be sampled to accuracy ϵ from O⁢(1/ϵ 2 ) trajectories, by running the first circuit on a quantum simulator without postselection, aided by a classical simulation of the second. We also find that for weak depolarizing noise the signature of the measurement-induced phase transitions is still present for intermediate system sizes. In our protocol we have the freedom of choosing initial states such that the “classical” side can be simulated efficiently, while simulating the “quantum” side is still classically hard.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Robustness and Eventual Slow Decay of Bound States of Interacting Microwave Photons in the Google Quantum AI Experiment

Integrable models are characterized by the existence of stable excitations that can propagate indefinitely without decaying. This includes multimagnon bound states in the celebrated 𝑋⁢𝑋⁢𝑍 spin-chain model and its integrable Floquet counterpart. A recent Google Quantum AI experiment [A. Morvan et al., Nature 612, 240 (2022)] realizing the Floquet model has demonstrated the persistence of such collective excitations even when the integrability is broken: this observation is at odds with the expectation of ergodic dynamics in generic nonintegrable systems. Here, we study the spectrum of the model realized in the experiment using exact diagonalization and physical arguments. We find that isolated bands corresponding to the descendants of the exact bound states of the integrable model are clearly observable in the spectrum for a large range of system sizes. However, our numerical analysis of the localization properties of the eigenstates suggests that the bound states become unstable in the thermodynamic limit. A perturbative estimate of the decay rate agrees with the prediction of an eventual instability for large system sizes.

Exact diagonalization↗
DOE OSTI2022

Quancorde: Boosting fidelity with Quantum Canary Ordered Diverse Ensembles

On today's noisy imperfect quantum devices, execution fidelity tends to collapse dramatically for most applications beyond a handful of qubits. It is therefore imperative to employ novel techniques that can boost quantum fidelity in new ways. Here, this paper aims to boost quantum fidelity with Clifford canary circuits by proposing Quancorde: Quantum Canary Ordered Diverse Ensembles, a fundamentally newapproach to identifying the correct outcomes of extremely low-fidelity quantum applications. It is based on the key idea of diversity in quantum devices - variations in noise sources, make each (portion of a) device unique, and therefore, their impact on an application's fidelity, also unique. Quancorde utilizes Clifford canary circuits (which are classically simulable, but also resemble the target application structure and thus suffer similar structural noise impact) to order a diverse ensemble of devices or qubits/mappings approximately along the direction of increasing fidelity of the target application. Quancorde then estimates the correlation of the ensemble-wide probabilities of each output string of the application, with the canary ensemble ordering, and uses this correlation to weight the application's noisy probability distribution. The correct application outcomes are expected to have higher correlation with the canary ensemble order, and thus their probabilities are boosted in this process. Doing so, Quancorde improves the fidelity of evaluated quantum applications by a mean of 8.9x/4.2x (wrt. different baselines) and up to a maximum of 34x.

clifford↗
DOE OSTI2021

Quantum cluster algorithm for data classification

Abstract We present a quantum algorithm for data classification based on the nearest-neighbor learning algorithm. The classification algorithm is divided into two steps: Firstly, data in the same class is divided into smaller groups with sublabels assisting building boundaries between data with different labels. Secondly we construct a quantum circuit for classification that contains multi control gates. The algorithm is easy to implement and efficient in predicting the labels of test data. To illustrate the power and efficiency of this approach, we construct the phase transition diagram for the metal-insulator transition of VO 2 , using limited trained experimental data, where VO 2 is a typical strongly correlated electron materials, and the metallic-insulating phase transition has drawn much attention in condensed matter physics. Moreover, we demonstrate our algorithm on the classification of randomly generated data and the classification of entanglement for various Werner states, where the training sets can not be divided by a single curve, instead, more than one curves are required to separate them apart perfectly. Our preliminary result shows considerable potential for various classification problems, particularly for constructing different phases in materials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Circuit QED Pulse Control Interface

The Circuit Quantum Electrodynamics (Circuit QED) Pulse Control Interface provides a robust platform for designing and testing control signals in transmon-cavity systems. Utilizing a PyQt5-based drag-and-drop GUI, this tool facilitates the implementation of two key protocols: Selective Number-dependent Arbitrary Phase (SNAP)-Displacement and Echoed Conditional Displacement (ECD). It offers real-time pulse visualization and supports CSV exports and imports for integrating custom signals, thereby enhancing circuit QED experimental workflows. Simulations performed using QuTiP confirm the high fidelity of quantum state preparations and the effectiveness of the implemented controls. Future developments will focus on interfacing the tool with hardware and enhancing signal generation accuracy.

Lin, Yuqing↗
DOE OSTI2026

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↗
DOE OSTI2026

Rewarding Grid-Friendly Behavior: Estimating the Potential Bill Reduction and Load Shifting Benefits of Dynamic Prices

Shifting electric load from times of peak demand can be a key strategy to slow price growth as reducing peak demand avoids the cost of upgrading generation, transmission and distribution infrastructure. Utilities are releasing time-varying prices, such as time of use rates or dynamic prices, to incentivize grid-friendly load shifting. New dynamic price programs provide insight into the true cost of operating electricity grids and the potential economic benefits of load shifting. Program developers and device manufacturers need to understand the economic opportunities in terms of 1) the variation in prices across hours, days, and seasons; 2) the change in utility bills for customers who don’t shift load; and 3) the potential load shifted and economic value of different technologies if manufacturers or aggregators deploy price-responsive controls. This paper estimates possible impacts of dynamic price adoption and load shifting controls if customers paid the dynamic rate from one pilot program. Statistical analysis of historical prices identified annual and seasonal metrics as well as representative price curves for each circuit in the pilot. Simulations for residential technologies with price-responsive controls including unitary heat pump water heaters, central multifamily heat pump water heaters, heating & cooling + storage systems, and pool pumps estimated the potential impacts of highly dynamic prices both with and without load shifting controls. Results showed the potential to reduce electricity costs on representative days by 42-94% and reduce consumption during times of high electricity prices by 63-100% compared to baseline operation for those flex-friendly devices.

Grant, Peter↗
DOE OSTI2024

Qutrit circuits and algebraic relations: A pathway to efficient spin-1 Hamiltonian simulation

Quantum information processing has witnessed significant advancements through the application of qubit-based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d -dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation

Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Variational quantum simulation of the critical Ising model with symmetry averaging

Here we investigate the use of deep multiscale entanglement renormalization ansatz (DMERA) circuits as a variational ansatz. We use the exactly solvable one-dimensional critical transverse-field Ising model as a test bed. Numerically exact simulation of the quantum circuit ansatz can in this case be carried out to hundreds of qubits by exploiting efficient classical algorithms for simulating matchgate circuits. We find that, for this system, the DMERA strongly outperforms a standard quantum approximate optimization algorithm (QAOA)–style ansatz, and that a major source of systematic error in correlation functions approximated using the DMERA is the breaking of the translational and Kramers-Wannier symmetries of the transverse-field Ising model. We are able to reduce this error by up to four orders of magnitude by symmetry averaging, without incurring additional cost in qubits or circuit depth. Here, we propose that this technique for mitigating systematic error could be applied to noisy intermediate-scale quantum (NISQ) simulations of physical systems with other symmetries.

1-dimensional spin chains↗
DOE OSTI2023

Quantum error mitigation by Pauli check sandwiching

Abstract We describe and analyze an error mitigation technique that uses multiple pairs of parity checks to detect the presence of errors. Each pair of checks uses one ancilla qubit to detect a component of the error operator and represents one layer of the technique. We build on the results on extended flag gadgets and put it on a firm theoretical foundation. We prove that this technique can recover the noiseless state under the assumption of noise not affecting the checks. The method does not incur any encoding overhead and instead chooses the checks based on the input circuit. We provide an algorithm for obtaining such checks for an arbitrary target circuit. Since the method applies to any circuit and input state, it can be easily combined with other error mitigation techniques. We evaluate the performance of the proposed methods using extensive numerical simulations on 1850 random input circuits composed of Clifford gates and non-Clifford single-qubit rotations, a class of circuits encompassing most commonly considered variational algorithm circuits. We observe average improvements in fidelity of 34 percentage points with six layers of checks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Porting Classical Approaches for Quantum Simulations to Quantum Computers

Simulating quantum many-body systems is one of the most promising problems in which we might anticipate that quantum computers should show quantum advantage. Unfortunately, there is still a gap between this promise and actual practice. New quantum algorithms need to be developed and the current quantum algorithms have various difficulties - e.g efficient state preparation - which must be overcome and improved upon. In many cases, classical approaches need to be ported over to quantum devices. In this project we have developed a suite of new quantum algorithms which makes progress in this regard. We developed a new optimization scheme for variational quantum eigensolvers, UBOS, which mitigates problems with local minimas and barren plateaus while improving convergence to the ground state by an order of magnitude. We developed a new way to utilize qubitization to find ground states of nearly frustration-free Hamiltonians faster than all previous methods. We developed a series of state preparation techniques which helps initialize parameterized quantum circuits into reasonable starting points on which quantum algorithms are then applied. In addition to the development of novel algorithms, it is critical to have classical simulation techniques for approximately simulating quantum circuits which can be used to benchmark and understand quantum algorithms. Toward that end, we developed a novel POVM formalism to simulate quantum circuits as well as exemplify the massive parallelization of tensor network methodologies. Finally, we developed physical understanding of entanglement phase transitions such as many-body localization and random tensor networks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗