Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “processors”

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

XACC: a system-level software infrastructure for heterogeneous quantum–classical computing

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. In this work, we present XACC, a system-level software infrastructure for quantum–classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. Additionally, we detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum–classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Adaptive pruning-based optimization of parameterized quantum circuits

Abstract Variational hybrid quantum–classical algorithms are powerful tools to maximize the use of noisy intermediate-scale quantum devices. While past studies have developed powerful and expressive ansatze, their near-term applications have been limited by the difficulty of optimizing in the vast parameter space. In this work, we propose a heuristic optimization strategy for such ansatze used in variational quantum algorithms, which we call ‘parameter-efficient circuit training (PECT)’. Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms, in which each iteration of the algorithm activates and optimizes a subset of the total parameter set. To update the parameter subset between iterations, we adapt the Dynamic Sparse Reparameterization scheme which was originally proposed for training deep convolutional neural networks. We demonstrate PECT for the Variational Quantum Eigensolver, in which we benchmark unitary coupled-cluster ansatze including UCCSD and k -UpCCGSD, as well as the Low-Depth Circuit Ansatz (LDCA), to estimate ground state energies of molecular systems. We additionally use a layerwise variant of PECT to optimize a hardware-efficient circuit for the Sycamore processor to estimate the ground state energy densities of the one-dimensional Fermi-Hubbard model. From our numerical data, we find that PECT can enable optimizations of certain ansatze that were previously difficult to converge and more generally can improve the performance of variational algorithms by reducing the optimization runtime and/or the depth of circuits that encode the solution candidate(s).

Physics↗
DOE OSTI2022

Quantum error mitigation by hidden inverses protocol in superconducting quantum devices

We present a method to improve the convergence of variational algorithms based on hidden inverses (HIs) to mitigate coherent errors. In the context of error mitigation, this means replacing the hardware implementation of certain Hermitian gates with their inverses. Doing so results in noise cancellation and a more resilient quantum circuit. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm to find the H 2 ground-state energy. When implemented on superconducting hardware we find that the mitigation scheme effectively reduces the energy fluctuations in the parameter learning path in VQE, reducing the number of iterations for a converged value. We also provide a detailed numerical simulation of VQE performance under different noise models and explore how HIs and randomized compiling affect the underlying loss landscape of the learning problem. These simulations help explain our experimental hardware outcomes, helping to connect lower-level gate performance to application-specific behavior in contrast to metrics like fidelity which often do not provide an intuitive insight into observed high level performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2024

Reducing measurement costs by recycling the Hessian in adaptive variational quantum algorithms

Abstract Adaptive protocols enable the construction of more efficient state preparation circuits in variational quantum algorithms (VQAs) by utilizing data obtained from the quantum processor during the execution of the algorithm. This idea originated with Adaptive Derivative-Assembled Problem-Tailored variational quantum eigensolver (ADAPT-VQE), an algorithm that iteratively grows the state preparation circuit operator by operator, with each new operator accompanied by a new variational parameter, and where all parameters acquired thus far are optimized in each iteration. In ADAPT-VQE and other adaptive VQAs that followed it, it has been shown that initializing parameters to their optimal values from the previous iteration speeds up convergence and avoids shallow local traps in the parameter landscape. However, no other data from the optimization performed at one iteration is carried over to the next. In this work, we propose an improved quasi-Newton optimization protocol specifically tailored to adaptive VQAs. The distinctive feature in our proposal is that approximate second derivatives of the cost function are recycled across iterations in addition to optimal parameter values. We implement a quasi-Newton optimizer where an approximation to the inverse Hessian matrix is continuously built and grown across the iterations of an adaptive VQA. The resulting algorithm has the flavor of a continuous optimization where the dimension of the search space is augmented when the gradient norm falls below a given threshold. We show that this inter-optimization exchange of second-order information leads the approximate Hessian in the state of the optimizer to be consistently closer to the exact Hessian. As a result, our method achieves a superlinear convergence rate even in situations where the typical implementation of a quasi-Newton optimizer converges only linearly. Our protocol decreases the measurement costs in implementing adaptive VQAs on quantum hardware as well as the runtime of their classical simulation.

Ramôa, Mafalda (ORCID:0000000302187801)↗
DOE OSTI2021

GPU coprocessors as a service for deep learning inference in high energy physics

In the next decade, the demands for computing in large scientific experiments are expected to grow tremendously. During the same time period, CPU performance increases will be limited. At the CERN Large Hadron Collider (LHC), these two issues will confront one another as the collider is upgraded for high luminosity running. Alternative processors such as graphics processing units (GPUs) can resolve this confrontation provided that algorithms can be sufficiently accelerated. In many cases, algorithmic speedups are found to be largest through the adoption of deep learning algorithms. We present a comprehensive exploration of the use of GPU-based hardware acceleration for deep learning inference within the data reconstruction workflow of high energy physics. We present several realistic examples and discuss a strategy for the seamless integration of coprocessors so that the LHC can maintain, if not exceed, its current performance throughout its running.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2024

Reinforcement learning pulses for transmon qubit entangling gates

The utility of a quantum computer is highly dependent on the ability to reliably perform accurate quantum logic operations. For finding optimal control solutions, it is of particular interest to explore model-free approaches, since their quality is not constrained by the limited accuracy of theoretical models for the quantum processor—in contrast to many established gate implementation strategies. In this work, we utilize a continuous control reinforcement learning algorithm to design entangling two-qubit gates for superconducting qubits; specifically, our agent constructs cross-resonance and CNOT gates without any prior information about the physical system. Using a simulated environment of fixed-frequency fixed-coupling transmon qubits, we demonstrate the capability to generate novel pulse sequences that outperform the standard cross-resonance gates in both fidelity and gate duration, while maintaining a comparable susceptibility to stochastic unitary noise. We further showcase an augmentation in training and input information that allows our agent to adapt its pulse design abilities to drifting hardware characteristics, importantly, with little to no additional optimization. Our results exhibit clearly the advantages of unbiased adaptive-feedback learning-based optimization methods for transmon gate design.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2021

The ABACUS cosmological N -body code

We present abacus, a fast and accurate cosmological N-body code based on a new method for calculating the gravitational potential from a static multipole mesh. The method analytically separates the near- and far-field forces, reducing the former to direct 1/r 2 summation and the latter to a discrete convolution over multipoles. The method achieves 70 million particle updates per second per node of the Summit supercomputer, while maintaining a median fractional force error of 10 -5 . We express the simulation time-step as an event-driven ‘pipeline’, incorporating asynchronous events such as completion of co-processor work, input/output, and network communication. abacus has been used to produce the largest suite of N-body simulations to date, the abacussummit suite of 60 trillion particles, incorporating on-the-fly halo finding. abacus enables the production of mock catalogues of the volume and resolution required by the coming generation of cosmological surveys.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

The short ionizing photon mean free path at z = 6 in Cosmic Dawn III, a new fully coupled radiation-hydrodynamical simulation of the Epoch of Reionization

ABSTRACT Recent determinations of the mean free path of ionizing photons (mfp) in the intergalactic medium (IGM) at z = 6 are lower than many theoretical predictions. In order to gain insight, we investigate the evolution of the mfp in our new massive fully coupled radiation-hydrodynamics cosmological simulation of reionization: Cosmic Dawn III (CoDa III). CoDa III’s scale ($\rm 94^3 \, cMpc^3$) and resolution ($\rm 8192^3$ grid) make it particularly suitable to study the IGM during reionization. The simulation was performed with ramses-cudaton on Summit, and used 13 1072 processors coupled to 24 576 GPUs, making it the largest reionization simulation, and largest ever ramses simulation. A superior agreement with global constraints on reionization is obtained in CoDa III over Cosmic Dawn II (CoDa II), especially for the evolution of the neutral hydrogen fraction and the cosmic photoionization rate, thanks to an improved calibration, later end of reionization (z = 5.6), and higher spatial resolution. Analysing the mfp, we find that CoDa III reproduces the most recent observations very well, from z = 6 to z = 4.6. We show that the distribution of the mfp in CoDa III is bimodal, with short (neutral) and long (ionized) mfp modes, due to the patchiness of reionization and the coexistence of neutral versus ionized regions during reionization. The neutral mode peaks at sub-kpc to kpc scales of mfp, while the ionized mode peak evolves from 0.1 Mpc h−1 at z = 7 to ∼10 Mpc h−1 at z = 5.2. Computing the mfp as the average of the ionized mode provides the best match to the recent observational determinations. The distribution reduces to a single neutral (ionized) mode at z > 13 (z < 5).

Lewis, Joseph S. W. (ORCID:0000000179178474)↗
DOE OSTI2025

Niobium coaxial cavities with internal quality factors exceeding 1.4 × 10 9 for circuit quantum electrodynamics

Group-V materials such as niobium and tantalum have become popular choices for extending the performance of circuit quantum electrodynamics (cQED) platforms, allowing for quantum processors and memories with reduced error rates and more modes. The complex surface chemistry of niobium, however, makes identifying the main modes of decoherence difficult at millikelvin temperatures and single-photon powers. We use niobium coaxial quarter-wave cavities to study the impact of etch chemistry, prolonged atmospheric exposure, and the significance of cavity conditions prior to and during cooldown—in particular, niobium hydride evolution—on single-photon coherence. We demonstrate cavities with quality factors Q int ≳ 1.4 × 10 9 in the single-photon regime, a 15-fold improvement over aluminum cavities of the same geometry. We rigorously quantify the sensitivity of our fabrication process to various loss mechanisms and demonstrate a two- to fourfold reduction in the two-level system loss tangent and a three- to fivefold improvement in the residual resistance over traditional buffered chemical polishing etching techniques. Finally, we demonstrate transmon integration and coherent cavity control while maintaining a cavity coherence of 11.3 ms. The accessibility of our method, which can be easily replicated in academic laboratory settings, together with the demonstration of its performance, mark an advancement in three-dimensional cQED.

Oriani, Andrew E. [Chicago U., EFI; Chicago U.] (O↗
DOE OSTI2025

On-chip pulse shaping of entangled photons

The miniaturization of optical systems via integrated photonics is critical to the ultimate scalability and performance of photonic quantum processors, yet many longstanding optical signal processing capabilities—such as Fourier-transform pulse shaping—remain unrealized on chip. In this work, we demonstrate on-chip spectral shaping of entangled photons using a multichannel microring-resonator-based silicon photonic pulse shaper. Achieving line-by-line phase control on a 3 GHz grid for two frequency-bin-entangled qudits, the pulse shaper's fine spectral resolution enables control of nanosecond-scale temporal features, which are observed by direct coincidence detection of biphoton correlation functions that show excellent agreement with theory. This work marks a demonstration of biphoton pulse shaping using an integrated spectral shaper and holds significant promise for applications in photonic quantum information processing.

Entanglement manipulation↗
DOE OSTI2026

Sparse non-Markovian Noise Modeling of Transmon-Based Multi-Qubit Operations

The influence of noise on quantum dynamics is one of the main factors preventing current quantum processors from performing accurate quantum computations. Sufficient noise characterization and modeling can provide key insights into the effect of noise on quantum algorithms and inform the design of targeted error protection protocols. However, constructing effective noise models that are sparse in model parameters, yet predictive can be challenging. In this work, we present an approach for effective noise modeling of multi-qubit operations on transmon-based devices. Through a comprehensive characterization of seven devices offered by the IBM Quantum Platform, we show that the model can capture and predict a wide range of single- and two-qubit behaviors, including non-Markovian effects resulting from spatiotemporally correlated noise sources. The model’s predictive power is further highlighted through multi-qubit dynamical decoupling demonstrations and an implementation of the variational quantum eigensolver. As a training proxy for the hardware, we show that the model can predict expectation values within a relative error of 0.5%; this is a sevenfold improvement over default hardware noise models. Through these demonstrations, we highlight key error sources in superconducting qubits and illustrate the utility of reduced noise models for predicting hardware dynamics.

open quantum systems & decoherence↗
DOE OSTI2020

Quantum algorithms for disordered physics

We show how a quantum computer may efficiently simulate a disordered Hamiltonian, by incorporating a pseudo-random number generator directly into the time evolution circuit. This technique is applied to quantum simulation of few-body disordered systems in the large volume limit; in particular, Anderson localization. The method requires a number of (error corrected) qubits proportional to the logarithm of the volume of the system, and each time evolution step requires a number of gates polylogarithmic in the volume. We simulate the method to observe the metal-insulator transition on a three-dimensional lattice. Additionally, we demonstrate the algorithm on a one-dimensional lattice, using physical quantum processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Simulating non-native cubic interactions on noisy quantum machines

As a milestone for general-purpose computing machines, we demonstrate that quantum processors can be programed to efficiently simulate dynamics that are not native to the hardware. Moreover, on noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates instead of a restricted set of standard gates. We demonstrate the general methodology by solving a cubic interaction problem, which appears in nonlinear optics, gauge theories, as well as plasma and fluid dynamics. To encode the non-native Hamiltonian evolution, we decompose the Hilbert space into a direct sum of invariant subspaces in which the nonlinear problem is mapped to a finite-dimensional Hamiltonian simulation problem. Furthermore, in a three-states example, the resultant unitary evolution is realized by a product of approximately 20 standard gates, using which approximately ten simulation steps can be carried out on state-of-the-art quantum hardware before results are corrupted by decoherence. In comparison, the simulation depth is improved by more than an order of magnitude when the unitary evolution is realized as a single cubic gate, which is compiled directly using optimal control. Alternatively, parametric gates may also be compiled by interpolating control pulses. Modular gates thus obtained provide high-fidelity building blocks for quantum Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum state preparation by adiabatic evolution with custom gates

Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These implementation times can be significantly reduced by realizing these circuits with custom gates. Using classical computing, we model the output of a realistic two-qubit processor implementing the adiabatic evolution of a two-spin system by means of custom gates. This modeled output is then compared with the results of quantum simulations solving the same problem on IBM Quantum (IBMQ) systems. Additionally, when used to emulate the behavior of the IBMQ quantum circuit, our realistic model yields state fidelities ranging from 65% to 85%, similar to the actual performance of a diverse set of IBMQ devices. When we reduced the implementation time by using custom gates, however, the loss of fidelity was reduced by at least a factor of 4, allowing us to accurately extract the energy of the target state. This improvement is enough to render adiabatic evolution useful for quantum state preparation for small systems or as a preconditioner for other state preparation methods.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2022

Parametrized process characterization with reduced resource requirements

Quantum process tomography (QPT) is a powerful tool to characterize quantum operations, but it requires considerable resources, making it impractical for more than two-qubit systems. This study proposes an alternative approach that requires significantly fewer resources for unitary process characterization with a built-in method for state preparation and measurement error mitigation. By measuring the quantum process as rotated through the X and Y axes on the Bloch sphere, we can acquire enough information to reconstruct the quantum process matrix χ and measure its fidelity. We test the algorithm's performance against standard QPT using simulated and physical experiments on several IBM quantum processors and compare the resulting process matrices. We demonstrate with numerical experiments that the method can improve gate fidelity via a noise reduction in the imaginary part of the process matrix, along with a stark decrease in the number of experiments needed to perform the characterization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Wavelength conversion for single-photon polarization qubits through continuous-variable quantum teleportation

A quantum internet connects remote quantum processors that need to interact and exchange quantum signals over a long distance through photonic channels. However, these quantum nodes operate at the wavelength ranges unsuitable for long-distance transmission. Therefore, quantum wavelength conversion to telecom bands is crucial for long-distance quantum networks based on optical fiber. Here, we propose wavelength conversion devices for single-photon polarization qubits using continuous-variable quantum teleportation that can efficiently convert qubits between near-infrared (780–795 nm suitable for interacting with atomic quantum nodes) and telecom wavelength (1300–1500 nm suitable for long-distance transmission). The teleportation uses entangled photon fields (i.e., nondegenerate two-mode squeezed state) that can be generated by four-wave mixing in a rubidium atomic gas using a diamond configuration of atomic transitions. The entangled fields can be emitted in two orthogonal polarizations with locked relative phase, making them especially suitable for interfacing with single- photon polarization qubits. Furthermore, our work may pave the way for the realization of long-distance quantum networks.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2022

Quantum simulation of quantum phase transitions using the convex geometry of reduced density matrices

Transitions of many-particle quantum systems between distinct phases at absolute-zero temperature, known as quantum phase transitions, require an exacting treatment of particle correlations. Here in this work, we present a general quantum-computing approach to quantum phase transitions that exploits the geometric structure of reduced density matrices. While typical approaches to quantum phase transitions examine discontinuities in the order parameters, the origin of phase transitions—their order parameters and symmetry breaking—can be understood geometrically in terms of the set of two-particle reduced density matrices (2-RDMs). The convex set of 2-RDMs provides a comprehensive map of the quantum system including its distinct phases as well as the transitions connecting these phases. Because 2-RDMs can potentially be computed on quantum computers at nonexponential cost, even when the quantum system is strongly correlated, they are ideally suited for a quantum-computing approach to quantum phase transitions. We compute the convex set of 2-RDMs for a Lipkin-Meshkov-Glick spin model on IBM superconducting-qubit quantum processors. Even though computations are limited to few-particle models due to device noise, comparisons with a classically solvable 1000-particle model reveal that the finite-particle quantum solutions capture the key features of the phase transitions including the strong correlation and the symmetry breaking.

74 ATOMIC AND MOLECULAR PHYSICS↗