SEARCH · Engineering Papers

Results for “Circuit depth”

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.

SourceResearch connectionFrom yearThrough year

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

At least 199 records · Page 11

All sources NASA NTRS DOE OSTI

DOE OSTI2020

A non-orthogonal variational quantum eigensolver

Variational algorithms for strongly correlated chemical and materials systems are one of the most promising applications of near-term quantum computers. We present an extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states. This allows for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity. To minimize the circuit complexity of this approach, we propose a strategy for efficiently measuring the Hamiltonian and overlap matrix elements between states parametrized by circuits that commute with the total particle number operator. This strategy doubles the size of the state preparation circuits but not their depth, while adding a small number of additional two-qubit gates relative to standard variational quantum eigensolver. We also propose a classical Monte Carlo scheme to estimate the uncertainty in the ground state energy caused by a finite number of measurements of the matrix elements. We explain how this Monte Carlo procedure can be extended to adaptively schedule the required measurements, reducing the number of circuit executions necessary for a given accuracy. We apply these ideas to two model strongly correlated systems, a square configuration of H4 and the π-system of hexatriene (C6H8).

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Quantum Simulators and Applications on Quantum Framework

Simulating quantum circuits is essential for validating quantum algorithms. However, no single simulator consistently performs best - efficiency depends on circuit structure, entanglement, and depth. In this work, we integrate Qiskit-Aer (state-vector and matrix product state) and QTensor, a tree-tensor-network based simulator, into the Quantum Framework (QFw), a modular platform that supports multiple quantum backends via a unified interface. We also enable distributed quantum approximate optimization algorithm (DQAOA) application compatibility with QFw, allowing sub-problems to be solved in parallel at scale. We then benchmark DQAOA and TFIM (transverse field Ising model) circuits across supported simulators, showing how performance varies significantly with problem type. All simulations are deployed on the Frontier supercomputer using QFw's MPI-based orchestration for distributed, multinode execution. These results underscore the need for simulatoragnostic infrastructure to enable systematic evaluation and highperformance scaling of quantum workloads. QFw provides a practical and extensible path toward reproducible quantum algorithm development across diverse application domains.

Chundury, Srikar [ORNL] (ORCID:0009000183359259)↗

DOE OSTI2020

Using Reinforcement Learning to Optimize Quantum Circuits in thePresence of Noise

Many quantum computing frameworks currently use noise aware algorithms for implementing quantum circuits which do not scale efficiently as the size of the hardware architecture increases. As we move towards devices which utilize more qubits, it becomes increasing more important to map quantum circuits in a way that uses resources efficiently as well as maximizes the reliability of the results of that circuit. However, as the hardware increases to the point where Quantum supremacy is attainable, it will infeasible for a brute-force algorithm to find the most optimal circuit layout for circuits of medium to large depth sizes. To this end, we will to rely on reinforcement learning (RL) as a method of building quantum circuits based on observations of the noise characteristics in its environment. In this work, we create a working reinforcement learning environment in which an agent is able to make action which will build the class of circuits which creates the GHZ state. In addition to this, we also get preliminary results of the performance of a Deep Q Neural Network, which initially does not perform as well as we believe it can. In the future, we want to improve the performance of the agent and potentially generalize this environment to more classes of circuits.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Saturation and Recurrence of Quantum Complexity in Random Local Quantum Dynamics

Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing—in studying the dynamics of quantum many-body systems and the long-time properties of anti–de Sitter black holes. In this context, Brown and Susskind [] conjectured that the complexity of a chaotic quantum system grows linearly in time up to times exponential in the system size, saturating at a maximal value, and remaining maximally complex until undergoing recurrences at doubly exponential times. In this work, we prove the saturation and recurrence of complexity in two models of chaotic time evolutions based on (i) random local quantum circuits and (ii) stochastic local Hamiltonian evolution. Our results advance an understanding of the long-time behavior of chaotic quantum systems and could shed light on the physics of black-hole interiors. From a technical perspective, our results are based on establishing new quantitative connections between the Haar measure and high-degree approximate designs, as well as the fact that random quantum circuits of sufficiently high depth converge to approximate designs. Published by the American Physical Society 2024

Oszmaniec, Michał (ORCID:0000000249466835)↗

DOE OSTI2024

Quantum Tensor-Product Decomposition from Choi-State Tomography

The Schmidt decomposition is the go-to tool for measuring bipartite entanglement of pure quantum states. Similarly, it is possible to study the entangling features of a quantum operation using its operator-Schmidt or tensor-product decomposition. While quantum technological implementations of the former are thoroughly studied, entangling properties on the operator level are harder to extract in the quantum computational framework because of the exponential nature of sample complexity. Here, we present an algorithm for unbalanced partitions into a small subsystem and a large one (the environment) to compute the tensor-product decomposition of a unitary the effect of which on the small subsystem is captured in classical memory, while the effect on the environment is accessible as a quantum resource. This quantum algorithm may be used to make predictions about operator nonlocality and effective open quantum dynamics on a subsystem, as well as for finding low-rank approximations and low-depth compilations of quantum circuit unitaries. We demonstrate the method and its applications on a time-evolution unitary of an isotropic Heisenberg model in two dimensions. Published by the American Physical Society 2024

Mansuroglu, Refik (ORCID:000000017352513X)↗

DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

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 OSTI2024

Approximate 𝑡-Designs in Generic Circuit Architectures

Unitary 𝑡-designs are distributions on the unitary group whose first 𝑡 moments appear maximally random. Previous work has established several upper bounds on the depths at which certain specific random quantum circuit ensembles approximate 𝑡-designs. Here we show that these bounds can be extended to any fixed architecture of Haar-random two-site gates. This is accomplished by relating the spectral gaps of such architectures to those of one-dimensional brickwork architectures. Our bound depends on the details of the architecture only via the typical number of layers needed for a block of the circuit to form a connected graph over the sites. When this quantity is bounded, the circuit forms an approximate 𝑡-design in at most linear depth. We give numerical evidence for a stronger bound that depends only on the number of connected blocks into which the architecture can be divided. We also give an implicit bound for nondeterministic architectures in terms of properties of the corresponding distribution over fixed architectures.

information scrambling↗

DOE OSTI2024

Quantum subspace expansion in the presence of hardware noise

Finding ground state energies on current quantum processing units (QPUs) using algorithms such as the variational quantum eigensolver (VQE) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parameterized quantum circuits, limiting them to shallow depths in practice. Here, we demonstrate that both issues can be addressed by synergistically integrating VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs. We perform a systematic benchmark analysis of the iterative quantum-assisted eigensolver in the presence of hardware noise. We determine ground state energies of 1D and 2D mixed-field Ising spin models on noisy simulators and the IBM QPUs ibmq_quito (5 qubits) and ibmq_guadalupe (16 qubits). To maximize accuracy, we propose a suitable criterion to select the subspace basis vectors according to the trace of the noisy overlap matrix. Finally, we show how to systematically approach the exact solution by performing controlled quantum error mitigation based on probabilistic error reduction on the noisy backend fake_guadalupe.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2025

Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations

We introduce the Sequency Hierarchy Truncation (SeqHT) scheme for reducing the resources required for state preparation and time evolution in quantum simulations, based upon a truncation in sequency. For the λϕ 4 interaction in scalar field theory, or any interaction with a polynomial expansion, upper bounds on the contributions of operators of a given sequency are derived. For the systems we have examined, observables computed in sequency-truncated wavefunctions, including quantum correlations as measured by magic, are found to step-wise converge to their exact values with increasing cutoff sequency. The utility of SeqHT is demonstrated in the adiabatic state preparation of the λϕ 4 anharmonic oscillator ground state using IBM's quantum computer ibm_sherbrooke. Using SeqHT, the depth of the required quantum circuits is reduced by ∼ 30 % , leading to significantly improved determinations of observables in the quantum simulations. More generally, SeqHT is expected to lead to a reduction in required resources for quantum simulations of systems with a hierarchy of length scales.

Li, Zhiyao [Univ. of Washington, Seattle, WA (Unit↗

NASA NTRS1991

Characterization of NbN films and tunnel junctions

Properties of NbN films and NbN/MgO/NbN tunnel junctions are discussed. NbN junctions are being developed for use in high-frequency, SIS quasiparticle mixers. To properly design mixer circuits, junction and film properties need to be characterized. The specific capacitance of NbN/MgO/NbN junctions has been measured as a function of the product of the normal-state resistance and the junction area (RnA), and it is found to vary by more than a factor of two (35-85 fF/sq microns) over the range of RnA measured (1000-50 ohm sq microns). This variation is important because the specific capacitance determines the RC speed of the tunnel junction at a given RnA value. The magnetic penetration depth of NbN films deposited under different conditions is also measured. The magnetic penetration depth affects the design of microstrip line used in RF tuning circuits. Control of the magnetic penetration depth is necessary to fabricate reproducible tuning circuits. Additionally, the critical current uniformity for arrays of 100 junctions has been measured. Junction uniformity will affect the design of focal-plane arrays of SIS mixers. Finally, the relevance of these measurements to the design of Josephson electronics is discussed.

Stern, J. A.↗

NASA NTRS1978

Short circuit current changes in electron irradiated GaAlAs/GaAs solar cells

Heteroface p-GaAlAs/p-GaAs/n-GaAs solar cells with junction depths of 0.8, 1.5, and 4 microns were irradiated with 1 MeV electrons. The short-circuit current for the 4 micron junction depth cells is significantly reduced by the electron irradiation. Reduction of the junction depth to 1.5 microns improves the electron radiation resistance of the cells while further reduction of the junction depth to 0.8 microns improves the stability of the cells even more. Primary degradation is in the blue region of the spectrum. Considerable recovery of lost response is obtained by annealing the cells at 200 C. Computer modeling shows that the degradation is caused primarily by a reduction in the minority carrier diffusion length in the p-GaAs.

Walker, G. H.↗

NASA NTRS1982

Study of the photovoltaic effect in thin film barium titanate

The basic mechanism associated with the photovoltaic phenomena observed in the R.F. sputtered BaTiO3/silicon system is presented. Series of measurements of short circuit photocurrents and open circuit photovoltage were made. The composition depth profiles and the interface characteristics of the BaTiO3/silicon system were investigated for a better understanding of the electronic properties. A Scanning Auger Microprobe combined with ion in depth profiling were used.

Grannemann, W. W.↗

NASA NTRS1994

A high-performance constant-temperature hot-wire anemometer

A high-performance constant-temperature hot-wire anemometer has been designed based on a system theory analysis that can be extended to arbitrary order. A motivating factor behind the design was to achieve the highest possible frequency response while ensuring overall system stability. Based on these considerations, the design of the circuit and the selection of components is discussed in depth. Basic operating instructions are included in an operator's guide. The analysis is used to identify operating modes, observed in all anemometers, that are misleading in the sense that the operator can be deceived by interpreting an erroneous frequency response. Unlike other anemometers, this instrument provides front panel access to all the circuit parameters which affect system stability and frequency response. Instructions are given on how to identify and avoid these rather subtle and undesirable operating modes by appropriate adjustment of the controls. Details, such as fabrication drawings and a parts list, are provided to enable others to construct the instrument.

Watmuff, Jonathan H.↗

NASA NTRS1992

Control Circuit For Reed-Solomon Encoder

Control circuit designed for use with commercially available AHA4610 Reed-Solomon encoder. Needed to select depth of interleaving and to synchronize input and output blocks of data and parity bits with suitable clock signals. Circuit provides synchronizing and control signals for Reed-Solomon encoder. Encoder can operate with asynchronous input and output data streams at rates up to 80 Mb/s. Interleaving depth selectable, and accommodation to input data rate automatic.

Ross, Douglas↗

NASA NTRS1990

Alpha-particle sensitive test SRAMs

A bench-level test is being developed to evaluate memory-cell upsets in a test SRAM designed with a cell offset voltage. This offset voltage controls the critical charge needed to upset the cell. The effect is demonstrated using a specially designed 2-micron n-well CMOS 4-kb test SRAM and a Po-208 5.1-MeV 0.61-LET alpha-particle source. This test SRAM has been made sensitive to alpha particles through the use of a cell offset voltage, and this has allowed a bench-level characterization in a laboratory setting. The experimental data are linked to a alpha-particle interaction physics and to SPICE circuit simulations through the alpha-particle collection depth. The collection depth is determined by two methods and found to be about 7 micron. In addition, alpha particles that struck outside the bloated drain were able to flip the SRAM cells. This lateral charge collection was observed to be more than 6 micron.

Buehler, M. G.↗

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 OSTI2023

Molecular Symmetry in VQE: A Dual Approach for Trapped-Ion Simulations of Benzene

Understanding complex chemical systems—such as biomolecules, catalysts, and novel materials—is a central goal of quantum simulations. Near-term strategies hinge on the use of variational quantum eigensolver (VQE) algorithms combined with a suitable ansatz. However, straightforward application of many chemically-inspired ansatze yields prohibitively deep circuits. In this work, we employ several circuit optimization methods tailored for trapped-ion quantum devices to enhance the feasibility of intricate chemical simulations. The techniques aim to lessen the depth of the unitary coupled cluster with singles and doubles (uCCSD) ansatz's circuit compilation, a considerable challenge on current noisy quantum devices. Furthermore, we use symmetry-inspired classical post-selection methods to further refine the outcomes and minimize errors in energy measurements, without adding quantum overhead. Our strategies encompass optimal mapping from orbital to qubit, term reordering to minimize entangling gates, and the exploitation of molecular spin and point group symmetry to eliminate redundant parameters. The inclusion of error mitigation via post-selection based on known molecular symmetries improves the results to near milli-Hartree accuracy. These methods, when applied to a benzene molecule simulation, enabled the construction of an 8-qubit circuit with 69 two-qubit entangling operations, pushing the limits for variational quantum eigensolver (VQE) circuits executed on quantum hardware to date. 1 1 This manuscript has been authored in part by UT-Battelle, LLC, under contract DE-AC05-000R22725 with the US Department of Energy (DOE). The publisher acknowledges the US government license to provide public access under the DOE Public Access Plan(https://energy.gov/doe-public-access-plan).

Goings, Joshua↗