Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “circuit complexity”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Fock-Space Schrieffer–Wolff Transformation: Classically-Assisted Rank-Reduced Quantum Phase Estimation Algorithm

We present an extension of many-body downfolding methods to reduce the resources required in the quantum phase estimation (QPE) algorithm. In this paper, we focus on the Schrieffer–Wolff (SW) transformation of the electronic Hamiltonians for molecular systems that provides significant simplifications of quantum circuits for simulations of quantum dynamics. We demonstrate that by employing Fock-space variants of the SW transformation (or rank-reducing similarity transformations (RRST)) one can significantly increase the locality of the qubit-mapped similarity-transformed Hamiltonians. The practical utilization of the SW-RRST formalism is associated with a series of approximations discussed in the manuscript. In particular, amplitudes that define RRST can be evaluated using conventional computers and then encoded on quantum computers. The SW-RRST QPE quantum algorithms can also be viewed as an extension of the standard state-specific coupled-cluster downfolding methods to provide a robust alternative to the traditional QPE algorithms to identify the ground and excited states for systems with various numbers of electrons using the same Fock-space representations of the downfolded Hamiltonian. The RRST formalism serves as a design principle for developing new classes of approximate schemes that reduce the complexity of quantum circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum computational phase transition in combinatorial problems

Quantum Approximate Optimization algorithm (QAOA) aims to search for approximate solutions to discrete optimization problems with near-term quantum computers. As there are no algorithmic guarantee possible for QAOA to outperform classical computers, without a proof that bounded-error quantum polynomial time (BQP) ≠ nondeterministic polynomial time (NP), it is necessary to investigate the empirical advantages of QAOA. We identify a computational phase transition of QAOA when solving hard problems such as SAT—random instances are most difficult to train at a critical problem density. We connect the transition to the controllability and the complexity of QAOA circuits. Moreover, we find that the critical problem density in general deviates from the SAT-UNSAT phase transition, where the hardest instances for classical algorithms lies. Then, we show that the high problem density region, which limits QAOA’s performance in hard optimization problems (reachability deficits), is actually a good place to utilize QAOA: its approximation ratio has a much slower decay with the problem density, compared to classical approximate algorithms. Indeed, it is exactly in this region that quantum advantages of QAOA over classical approximate algorithms can be identified.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Distributed quantum approximate optimization algorithm on a quantum-centric supercomputing architecture

Quantum approximate optimization algorithm (QAOA) has shown promise in solving combinatorial optimization problems by providing quantum speedup on near-term gate-based quantum computing systems. However, QAOA faces challenges for high-dimensional problems due to the large number of qubits required and the complexity of deep circuits, limiting its scalability for real-world applications. In this study, we present a distributed QAOA (DQAOA), which leverages distributed computing strategies to decompose a large computational workload into smaller tasks that require fewer qubits and shallower circuits than are necessary to solve the original problem. These sub-problems are processed using a combination of high-performance and quantum computing resources. The global solution is iteratively updated by aggregating sub-solutions, allowing convergence toward the optimal solution. We demonstrate that DQAOA can handle considerably large-scale optimization problems (e.g., 1000-bit problem), achieving a high solution quality and short time-to-solution, outperforming existing strategies. Furthermore, we realize DQAOA on a quantum-centric supercomputing architecture, paving the way for practical applications of gate-based quantum computers in real-world optimization tasks. To extend DQAOA’s applicability to materials science, we further develop an active learning algorithm integrated with our DQAOA (AL-DQAOA), which involves machine learning, DQAOA, and active data production in an iterative loop. We successfully optimize photonic structures using AL-DQAOA, indicating that solving real-world optimization problems using gate-based quantum computing is feasible. We expect the proposed DQAOA to be applicable to a wide range of optimization problems and AL-DQAOA to find broader applications in material design.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2023

Integration of Ag-CBRAM crossbars and Mott ReLU neurons for efficient implementation of deep neural networks in hardware

In-memory computing with emerging non-volatile memory devices (eNVMs) has shown promising results in accelerating matrix-vector multiplications. However, activation function calculations are still being implemented with general processors or large and complex neuron peripheral circuits. Here, we present the integration of Ag-based conductive bridge random access memory (Ag-CBRAM) crossbar arrays with Mott rectified linear unit (ReLU) activation neurons for scalable, energy and area-efficient hardware (HW) implementation of deep neural networks. We develop Ag-CBRAM devices that can achieve a high ON/OFF ratio and multi-level programmability. Compact and energy-efficient Mott ReLU neuron devices implementing ReLU activation function are directly connected to the columns of Ag-CBRAM crossbars to compute the output from the weighted sum current. We implement convolution filters and activations for VGG-16 using our integrated HW and demonstrate the successful generation of feature maps for CIFAR-10 images in HW. Our approach paves a new way toward building a highly compact and energy-efficient eNVMs-based in-memory computing system.

Mott insulators↗
DOE OSTI2022

Investigating the Influence of Ni, ZrO 2 , and Y 2 O 3 from SOFC Anodes on Siloxane Deposition

Siloxanes, as a type of impurity in biogas, can poison the Ni-YSZ anode of SOFCs. However, the influence of individual components of the anode, such as Ni, ZrO 2 , and Y 2 O 3 , on the siloxane deposition process has not been investigated extensively. In this study, Ni, ZrO 2 , and Y 2 O 3 pellets were exposed to H 2 + N 2 + H 2 O + D4 (octamethylcyclotetrasiloxane, 2.5 ppmv) and H 2 + N 2 + D4 (2.5 ppmv siloxane) gas mixtures at 750 °C to investigate their affinity and tolerance for siloxane degradation. Surface morphology analysis and electrochemical analysis including electrochemical impedance spectroscopy (EIS), related distribution of relaxation times (DRT) analysis and equivalent circuit modeling with complex nonlinear least square (CNLS) fitting were conducted. Here, a microstructure parameter—tortuosity factor to porosity ratio $\tau /\varepsilon $ calculated by diffusion polarization resistance was utilized for siloxane deposition evaluation. After comparing pellets surface morphology changes before and after experiments and $\tau /\varepsilon $ change following the contamination, Ni is considered as a major factor in siloxane deposition reactions in Ni-YSZ anode.

25 ENERGY STORAGE↗
DOE OSTI2020

Integrated dispersion compensated mode-locked quantum dot laser

Quantum dot lasers are excellent on-chip light sources, offering high defect tolerance, low threshold, low temperature variation, and high feedback insensitivity. Yet a monolithic integration technique combining epitaxial quantum dot lasers with passive waveguides has not been demonstrated and is needed for complex photonic integrated circuits. We present here, for the first time to our knowledge, a monolithc offset quantum dot integration platform that permits formation of a laser cavity utilizing both the robust quantum dot active region and the versatility of passive GaAs waveguide structures. This platform is substrate agnostic and therefore compatible with the quantum dot lasers directly grown on Si. As an illustration of the potential of this platform, we designed and fabricated a 20 GHz mode-locked laser with a dispersion-engineered on-chip waveguide mirror. Due to the dispersion compensation effect of the waveguide mirror, the pulse width of the mode-locked laser is reduced by a factor of 2.8.

Zhang, Zeyu (ORCID:0000000271576272)↗
DOE OSTI2022

Node Monitoring as a Fault Detection Countermeasure against Information Leakage within a RISC-V Microprocessor

Advanced, superscalar microprocessors (μP) are highly susceptible to wear-out failures because of their highly complex, densely packed circuit structure and extreme operational frequencies. Although many types of fault detection and mitigation strategies have been proposed, none have addressed the specific problem of detecting faults that lead to information leakage events on I/O channels of the μP. Information leakage can be defined very generally as any type of output that the executing program did not intend to produce. In this work, we restrict this definition to output that represents a security concern, and in particular, to the leakage of plaintext or encryption keys, and propose a counter-based countermeasure to detect faults that cause this type of leakage event. Fault injection (FI) experiments are carried out on two RISC-V microprocessors emulated as soft cores on a Xilinx multi-processor System-on-chip (MPSoC) FPGA. The μP designs are instrumented with a set of counters that records the number of transitions that occur on internal nodes. The transition counts are collected from all internal nodes under both fault-free and faulty conditions, and are analyzed to determine which counters provide the highest fault coverage and lowest latency for detecting leakage faults. We show that complete coverage of all leakage faults is possible using only a single counter strategically placed within the branch compare logic of the μPs.

42 ENGINEERING↗
DOE OSTI2025

A sensing material-free and simple readout MEMS sensor for detecting Helium

Abstract In this work, we report a method that enables a standard electrostatic MEMS device to perform complex sensing functionalities, such as detecting the presence of helium without a sensing material or a conditioning circuit. Helium is a noble, odorless, non-reactive gas that is very challenging to detect. It is used in critical applications such as storing nuclear fuel waste inside a dry cask. In these applications, its leakage from the dry cask may indicate the cask's safe operation's degradation. A departure from the common practice of exciting the MEMS around its mechanical resonance, the method is based on exciting the MEMS around its electrical resonance circuit. This method shows that the tiny difference between the air dielectric constant (1.00059) and helium (1.000067) corresponding to only a few Femtofarad level capacitances produces a 25 mV difference without a conditioning circuit. Simulation results confirmed those findings and explored the sensor response at different operation conditions. This method eliminates the need for a heated microstructure and the need for absorption material. This method is not limited to gas sensing. It can be applied to other sensing mechanisms, such as acceleration and pressure measurements, and eliminate the complex circuit to read small capacitance in these applications.

Mohaidat, Sulaiman↗
DOE OSTI2022

Estimating the randomness of quantum circuit ensembles up to 50 qubits

Random quantum circuits have been utilized in the contexts of quantum supremacy demonstrations, variational quantum algorithms for chemistry and machine learning, and blackhole information. The ability of random circuits to approximate any random unitaries has consequences on their complexity, expressibility, and trainability. To study this property of random circuits, we develop numerical protocols for estimating the frame potential, the distance between a given ensemble and the exact randomness. Our tensor-network-based algorithm has polynomial complexity for shallow circuits and is high-performing using CPU and GPU parallelism. We study 1. local and parallel random circuits to verify the linear growth in complexity as stated by the Brown–Susskind conjecture, and; 2. hardware-efficient ansätze to shed light on its expressibility and the barren plateau problem in the context of variational algorithms. Our work shows that large-scale tensor network simulations could provide important hints toward open problems in quantum information science.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Approximate quantum circuit synthesis using block encodings

One of the challenges in quantum computing is the synthesis of unitary operators into quantum circuits with polylogarithmic gate complexity. Exact synthesis of generic unitaries requires an exponential number of gates in general. We propose a novel approximate quantum circuit synthesis technique by relaxing the unitary constraints and interchanging them for ancilla qubits via block encodings. This approach combines smaller block encodings, which are easier to synthesize, into quantum circuits for larger operators. Due to the use of block encodings, our technique is not limited to unitary operators and can be applied for the synthesis of arbitrary operators. Overall, we show that operators which can be approximated by a canonical polyadic expression with a polylogarithmic number of terms can be synthesized with polylogarithmic gate complexity with respect to the matrix dimension.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Effect of Nonunital Noise on Random-Circuit Sampling

In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical nonunital noise sources with constant noise rates. We show that even in the presence of unital sources such as the depolarizing channel, the distribution, under the combined noise channel, never resembles a maximally entropic distribution at any depth. To show this, we prove that the output distribution of such circuits never anticoncentrates—meaning that it is never too “flat”—regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths. As a consequence, our results shows that the complexity of random-circuit sampling under realistic noise is still an open question, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results. Published by the American Physical Society 2024

Physics↗
DOE OSTI2025

Complex-Valued Intermolecular Coupling Enables Directional Exciton Transport in Excitonic Circuits

Molecular systems capable of directing the flow of excitons are key to the development and optimization of optoelectronic materials. The transport of excitons across multiple molecules is governed by an intermolecular electronic coupling network. In this article, we consider the effects of complex-valued intermolecular electronic coupling on exciton transport. Here, we present a molecular motif capable of generating complex-valued coupling under excitation with circularly polarized light. We use theoretical modeling and simulation to illustrate how complex coupling can be leveraged to drive the rotational flux of excitons in cyclic molecular networks and direct the exciton population in branched molecular networks.

chromophores↗
DOE OSTI2025

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

Understanding the Phase of Responsivity and Noise Sources in Frequency-Domain Multiplexed Readout of Transition Edge Sensor Bolometers

Abstract Cosmic microwave background (CMB) experiments have deployed focal planes with $$\mathcal {O}(10^{4})$$ O ( 10 4 ) transition edge sensor (TES) bolometers cooled to sub-Kelvin temperatures by multiplexing the readout of many TES channels onto a single pair of wires. Digital Frequency-domain Multiplexing (DfMux) is a multiplexing technique used in many CMB polarization experiments, such as the Simons Array, SPT-3 G, and EBEX. The DfMux system studied here uses LC filters with resonant frequencies ranging from 1.5 to 4.5 MHz connected to an array of TESs. Each detector has an amplitude-modulated carrier tone at the resonant frequency of its accompanying LC resonator. The signal is recovered via quadrature demodulation where the in-phase (I) component of the demodulated current is in phase with the complex admittance of the circuit and the quadrature (Q) component is orthogonal to I. Observed excess current noise in the Q component is consistent with fluctuations in the resonant frequency. This noise has been shown to be non-orthogonal to the phase of the detector’s responsivity. We present a detailed analysis of the phase of responsivity of the TES and noise sources in our DfMux readout system. Further, we investigate how modifications to the TES operating resistance and bias frequency can affect the phase of noise relative to the phase of the detector responsivity, using data from Simons Array to evaluate our predictions. We find that both the phase of responsivity and phase of noise are functions of the two tuning parameters, which can be purposefully selected to maximize signal-to-noise (SNR) ratio.

47 OTHER INSTRUMENTATION↗
DOE OSTI2024

Tunnel junction-enabled monolithically integrated GaN micro-light emitting transistor

GaN/InGaN microLEDs are a very promising technology for next-generation displays. Switching control transistors and their integration are key components in achieving high-performance, efficient displays. Monolithic integration of microLEDs with GaN switching devices provides an opportunity to control microLED output power with capacitive (voltage)-controlled rather than current-controlled schemes. This approach can greatly reduce system complexity for the driver circuit arrays while maintaining device opto-electronic performance. In this work, we demonstrate a 3-terminal GaN micro-light emitting transistor that combines a GaN/InGaN blue tunneling-based microLED with a GaN n-channel FET. Further, the integrated device exhibits excellent gate control, drain current control, and optical emission control. This work provides a promising pathway for future monolithic integration of GaN FETs with microLED to enable fast switching, high-efficiency microLED display and communication systems.

42 ENGINEERING↗
DOE OSTI2024

Energy Systems Integration Facility (ESIF): World-Class Systems Integration Capabilities and Research

The Energy Systems Integration Facility (ESIF), located at the National Renewable Energy Laboratory (NREL) South Table Mountain campus, is a world-renowned user facility for research and development of modern, advanced, and clean energy technologies. ESIF is distinguished by its continuously evolving, highly integrated systems that span throughout the building, connecting research capabilities across multiple laboratories and test areas. The primary ESIF research systems include: [1] data, cyber, and control networks, [2] research electrical distribution buses (REDB), [3] thermal integration infrastructure, and [4] hydrogen systems. The data, cyber, and control networks provide monitoring, control, communication, automation, visualization, and time series data storage and tagging capabilities for research projects and ESIF systems, including facility safety functions. The REDB system consists of four dedicated AC and DC electrical power networks that can connect devices located across the facility through versatile, automatic circuit configuration to support complex power electronics experiments up to the megawatt-scale. The thermal integration infrastructure consists of three temperature-conditioned water loops that provide heating and cooling interfaces and capabilities for thermal energy research. The hydrogen systems provide megawatt-scale hydrogen production, drying, compression, high-pressure storage, and delivery to laboratory end uses, including hydrogen fuel cell vehicle fueling. The ESIF research systems interconnect and extend throughout the various lab areas of the facility to create elaborate networks composed of diverse technologies for cutting-edge research. The ESIF capabilities are operated and stewarded by the ESIF Research Operations group, who also actively upgrade and advance the systems to ensure they remain ahead of anticipated research - enabling the success of many pioneering energy integration projects. The poster, created by members of the ESIF Research Operations team, highlights and summarizes the four core integrated systems at ESIF. The poster was first presented at the internal NREL Energize Forum on May 13th, 2024, and received the "Best Poster" award.

capabilities↗
DOE OSTI2021

Quantum Divide and Compute: Exploring the Effect of Different Noise Sources

Abstract Our recent work (Ayral et al. in Proceedings of IEEE computer society annual symposium on VLSI, ISVLSI, pp 138–140, 2020. 10.1109/ISVLSI49217.2020.00034 ) showed the first implementation of the Quantum Divide and Compute (QDC) method, which allows to break quantum circuits into smaller fragments with fewer qubits and shallower depth. This accommodates the limited number of qubits and short coherence times of quantum processors. This article investigates the impact of different noise sources—readout error, gate error and decoherence—on the success probability of the QDC procedure. We perform detailed noise modeling on the Atos Quantum Learning Machine, allowing us to understand tradeoffs and formulate recommendations about which hardware noise sources should be preferentially optimized. We also describe in detail the noise models we used to reproduce experimental runs on IBM’s Johannesburg processor. This article also includes a detailed derivation of the equations used in the QDC procedure to compute the output distribution of the original quantum circuit from the output distribution of its fragments. Finally, we analyze the computational complexity of the QDC method for the circuit under study via tensor-network considerations, and elaborate on the relation the QDC method with tensor-network simulation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

An efficient quantum circuit for block encoding a pairing Hamiltonian

We present an efficient quantum circuit for block encoding a pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and representing the Hamiltonian as a linear combination of unitaries. Instead, we show how to encode the Hamiltonian directly using controlled swap operations. We analyze the gate complexity of the block encoding circuit and show that it scales polynomially with respect to the number of qubits required to represent a quantum state associated with the pairing Hamiltonian. We also show how the block encoding circuit can be combined with the quantum singular value transformation to construct an efficient quantum circuit for approximating the density of states of a pairing Hamiltonian. The techniques presented can be extended to encode more general second-quantized Hamiltonians.

97 MATHEMATICS AND COMPUTING↗