Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum Benchmarking”

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 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

Quantum-Compatible Variational Segmentation for Image-to-Image Wildfire Detection Using Satellite Data

Wildfire occurrences have been increasing for the past decade, leaving devastating traces across the world. In the recent efforts, remote sensing and airborne missions have been utilized to better understand and manage wildfires. This has resulted in an exponential increase in volume of remote sensing data, which has pushed the need for intelligent automation of data extraction for wildfire studies. Machine learning offers accurate automation in detecting such natural anomalies and enable decision-makers to take actions in a timely manner. Recent advances in machine learning algorithms, namely probabilistic generative methods, allow researchers and decisionmakers to step beyond detection and study “what-if” scenarios for wildfire occurrences. Additionally, they offer better imitations to the stochastic behavior of nature, and wildfire events. However, optimizing the performance of these probabilistic generative models is a computationally expensive process, specially using digital computers. On the other hand, quantum computers have recently shown a promise to reduce computationally costly training of such models and provide performance improvements. There is a body of research investigating the potential for improved machine learning methods in which key operations are performed on a quantum computer. In this study, we propose a probabilistic image-toimage segmentation approach combining a very well-known segmentation method, U-NET, with a Conditional Variational Auto-Encoder (CVAE) to not only detect wildfires but also describe the stochasticity of the phenomenon and be capable of running “what-if” scenarios. Our proposed model is compatible with training on quantum computers, which results in a quantum-assisted image-to-image segmentation approach and can be used to benchmark the potential benefit of quantum computing over the classical one.

quantum↗
DOE OSTI2023

Q-BEEP: Quantum Bayesian Error Mitigation Employing Poisson Modeling over the Hamming Spectrum

Quantum computing technology has grown rapidly in recent years, with new technologies being explored, error rates being reduced, and quantum processor’s qubit capacity growing. However, near-term quantum algorithms are still unable to be induced without compounding consequential levels of noise, leading to non-trivial erroneous results. Quantum Error Correction (in-situ error mitigation) and Quantum Error Mitigation (post-induction error mitigation) are promising fields of research within the quantum algorithm scene, aiming to alleviate quantum errors, increasing the overall fidelity and hence the overall quality of circuit induction. Earlier this year, a pioneering work, namely HAMMER, published in ASPLOS-22 demonstrated the existence of a latent structure regarding post-circuit induction errors when mapping to the Hamming spectrum. However, they intuitively assumed that errors occur in local clusters, and that at higher average Hamming distances this structure falls away. In this work, we show that such a correlation structure is not only local but extends certain non-local clustering patterns which can be precisely described by a Poisson distribution model taking the input circuit, the device run time status (i.e., calibration statistics) and qubit topology into consideration. Using this quantum error characterizing model, we developed an iterative algorithm over the generated Bayesian network state-graph for post-induction error mitigation. Thanks to more precise modeling of the error distribution latent structure and the new iterative method, our Q-Beep approach provides state of the art performance and can boost circuit execution fidelity by up to 234.6% on Bernstein-Vazirani circuits and on average 71.0% on QAOA solution quality, using 16 practical IBMQ quantum processors. For other benchmarks such as those in QASMBench, the fidelity improvement is up to 17.8%. Q-Beep is a light-weight post-processing technique that can be performed offline and remotely, making it a useful tool for quantum vendors to integrate and provide more reliable circuit induction results.

Stein, Samuel A.↗
DOE OSTI2021

Challenges for density functional theory: calculation of CO adsorption on electrocatalytically relevant metals

Density Functional Theory (DFT) is currently the most tractable choice of theoretical model used to understand the mechanistic pathways for electrocatalytic processes such as CO 2 or CO reduction. In this work, we assess the performance of two DFT functionals designed specifically to describe surface interactions, RTPSS and RPBE, as well as two popular meta-GGA functionals, SCAN and B97M-rV, that have not been a priori optimized for better interfacial properties. We assess all four functionals against available experimental data for prediction of bulk and bare surface properties on four electrocatalytically relevant metals, Au, Ag, Cu, and Pt, and for binding CO to surfaces of these metals. To partially mitigate issues such as thermal and anharmonic corrections associated with comparing computations with experiments, molecular benchmarks against high level quantum chemistry are reported for CO complexes with Au, Ag, Cu and Pt atoms, as well as the CO–water complex and the water dimer. Overall, we find that the surface modified RPBE functional performs reliably for many of the benchmarks examined here, and the meta-GGA functionals also show promising results. Specifically B97M-rV predicts the correct site preference for CO binding on Ag and Au (the only functional tested here to do so), while RTPSS performs well for surface relaxations and binding of CO on Pt and Cu.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗
DOE OSTI2024

Accurate numerical simulations of open quantum systems using spectral tensor trains

Decoherence between qubits is a major bottleneck in quantum computations. Decoherence results from intrinsic quantum and thermal fluctuations as well as noise in the external fields that perform the measurement and preparation processes. With prescribed colored noise spectra for intrinsic and extrinsic noise, we present a numerical method, Quantum Accelerated Stochastic Propagator Evaluation (Q-ASPEN), to solve the time-dependent noise-averaged reduced density matrix in the presence of intrinsic and extrinsic noise. Q-ASPEN is arbitrarily accurate and can be applied to provide estimates for the resources needed to error-correct quantum computations. We employ spectral tensor trains, which combine the advantages of tensor networks and pseudospectral methods, as a variational ansatz to the quantum relaxation problem and optimize the ansatz using methods typically used to train neural networks. Here, the spectral tensor trains in Q-ASPEN make accurate calculations with tens of quantum levels feasible. We present benchmarks for Q-ASPEN on the spin-boson model in the presence of intrinsic noise and on a quantum chain of up to 32 sites in the presence of extrinsic noise. In our benchmark, the memory cost of Q-ASPEN scales as a low-order polynomial in the size of the system once the number of system states surpasses the number of basis functions used in the spectral expansion.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum search on noisy intermediate-scale quantum devices

Abstract Quantum search algorithm (also known as Grover's algorithm) lays the foundation for many other quantum algorithms. Although it is very simple, its implementation is limited on noisy intermediate-scale quantum (NISQ) processors. Grover's algorithm was designed without considering the physical resources, such as depth, in the real implementations. Therefore, Grover's algorithm can be improved for NISQ devices. In this paper, we demonstrate how to implement quantum search algorithms better on NISQ devices. We present detailed benchmarks of the five-qubit quantum search algorithm on different quantum processors, including IBMQ, IonQ, and Honeywell quantum devices. We report the highest success probability of the five-qubit search algorithm compared to previous works. Our results show that designing the error-aware quantum search algorithms is possible, which can maximally harness the power of NISQ computers.

Physics↗
DOE OSTI2026

Commuting embeddings for parallel strategies in non-local games

Non-local games provide a versatile framework for probing quantum correlations and for benchmarking the power of entanglement. In finite dimensions, the standard method for playing several games in parallel requires a tensor product of the local Hilbert spaces, which scales additively in the number of qubits. In this work, we show that this additive cost can be reduced by exploiting algebraic embeddings. We introduce two forms of compressions. First, when a referee selects one game from a finite collection of games at random, the game quantum strategy can be implemented using a maximally entangled state of dimension equal to the largest individual game, thereby eliminating the need for repeated state preparations. Second, we establish conditions under which several games can be played simultaneously in parallel on fewer qubits than the tensor product baseline. These conditions are expressed in terms of commuting embeddings of the game algebras. Moreover, we provide a constructive framework for building such embeddings. Using tools from Lie theory, we show that aligning the various game algebras into a common Cartan decomposition enables such a qubit reduction. Beyond the theoretical contribution, our framework casts NLGs as algebraic primitives for distributed and resource-constrained quantum computations and suggested NLGs as a comparable device-independent dimension witness.

Commuting embeddings↗
DOE OSTI2021

Trailhead for quantum simulation of SU(3) Yang-Mills lattice gauge theory in the local multiplet basis

Maintaining local interactions in the quantum simulation of gauge field theories relegates most states in the Hilbert space to be unphysical—theoretically benign, but experimentally difficult to avoid. Reformulations of the gauge fields can modify the ratio of physical to gauge-variant states often through classically preprocessing the Hilbert space and modifying the representation of the field on qubit degrees of freedom. This paper considers the implications of representing SU(3) Yang-Mills gauge theory on a lattice of irreducible representations in both a global basis of projected global quantum numbers and a local basis in which controlled-plaquette operators support efficient time evolution. Classically integrating over the internal gauge space at each vertex (e.g., color isospin and color hypercharge) significantly reduces both the qubit requirements and the dimensionality of the unphysical Hilbert space. Initiating tuning procedures that may inform future calculations at scale, the time evolution of one and two plaquettes are implemented on one of IBM’s superconducting quantum devices, and early benchmark quantities are identified. The potential advantages of qudit environments, with either constrained two-dimensional hexagonal or one dimensional nearest-neighbor internal state connectivity, are discussed for future large-scale calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

The Localized Active Space Method with Unitary Selective Coupled Cluster

Here, we introduce a hybrid quantum-classical algorithm, the localized active space unitary selective coupled cluster singles and doubles (LAS-USCCSD) method. Derived from the localized active space unitary coupled cluster (LAS-UCCSD) method, LAS-USCCSD first performs a classical LASSCF calculation, then selectively identifies the most important parameters (cluster amplitudes used to build the multireference UCC ansatz) for restoring interfragment interaction energy using this reduced set of parameters with the variational quantum eigensolver method. We benchmark LAS-USCCSD against LAS-UCCSD by calculating the total energies of (H 2 ) 2 , (H 2 ) 4 , and trans-butadiene, and the magnetic coupling constant for a bimetallic compound [Cr 2 (OH) 3 (NH 3 ) 6 ] 3+ . For these systems, we find that LAS-USCCSD reduces the number of required parameters and thus the circuit depth by at least 1 order of magnitude, an aspect which is important for the practical implementation of multireference hybrid quantum-classical algorithms like LAS-UCCSD on near-term quantum computers.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Simultaneous Optimization of Nuclear–Electronic Orbitals

Accurate modeling of important nuclear quantum effects, such as nuclear delocalization, zero-point energy, and tunneling, as well as non-Born-Oppenheimer effects, requires treatment of both nuclei and electrons quantum mechanically. The nuclear–electronic orbital (NEO) method provides an elegant framework to treat specified nuclei, typically protons, on the same level as the electrons. In conventional electronic structure theory, finding a converged ground state can be a computationally demanding task; converging NEO wavefunctions, due to their coupled electronic and nuclear nature, is even more demanding. Herein, we present an efficient simultaneous optimization method that uses the direct inversion in the iterative subspace method to simultaneously converge wavefunctions for both the electrons and quantum nuclei. In conclusion, benchmark studies show that the simultaneous optimization method can significantly reduce the computational cost compared to the conventional stepwise method for optimizing NEO wavefunctions for multicomponent systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2021

A phaseless auxiliary-field quantum Monte Carlo perspective on the uniform electron gas at finite temperatures: Issues, observations, and benchmark study

We investigate the viability of the phaseless finite-temperature auxiliary-field quantum Monte Carlo (ph-FT-AFQMC) method for ab initio systems using the uniform electron gas as a model. Through comparisons with exact results and FT coupled cluster theory, we find that ph-FT-AFQMC is sufficiently accurate at high to intermediate electronic densities. We show, both analytically and numerically, that the phaseless constraint at FT is fundamentally different from its zero-temperature counterpart (i.e., ph-ZT-AFQMC), and generally, one should not expect ph-FT-AFQMC to agree with ph-ZT-AFQMC in the low-temperature limit. With an efficient implementation, we are able to compare exchange-correlation energies to the existing results in the thermodynamic limit and find that the existing parameterizations are highly accurate. In particular, we found that ph-FT-AFQMC exchange-correlation energies are in better agreement with a known parameterization than is restricted path-integral MC in the regime of Θ ≤ 0.5 and rs ≤ 2, which highlights the strength of ph-FT-AFQMC.

Lee, Joonho (ORCID:0000000296671081)↗
DOE OSTI2026

Path integral molecular dynamics: A high-fidelity approach to quantum dynamics of electrons

We investigate electron transport in the uniform electron gas using ring-polymer molecular dynamics (RPMD). Working in the weakly coupled, non-degenerate regime, we use RPMD to probe how the onset of quantum diffraction effects at high temperature reshapes electron–electron collisions and leads to a classical-to-quantum crossover in macroscopic transport properties. Static thermodynamics obtained with RPMD are consistent with the weak-coupling equation of state, confirming correct quantum Boltzmann sampling. Real-time transport extracted from mean square displacements exhibits the expected ballistic-to-diffusive transition and a systematic reduction of the electronic self-diffusivity as quantum effects strengthen, due to quantum diffraction modifying electron–electron collisions. Direct ring-polymer scattering simulations reveal diffractive “softening” of binary deflections, providing a micro-to-macro link between collision physics and diffusion. The present study establishes RPMD as a quantitative, trajectory-based tool for electron transport across the classical–quantum crossover and furnishes benchmarks for improving Coulomb-log interpolation models. We outline extensions to multi-component plasmas and a path to incorporate Fermi–Dirac statistics within path-integral dynamics.

Electronic transport↗
DOE OSTI2024

Accessing metal-specific orbital interactions in C–H activation with resonant inelastic X-ray scattering

Photochemically prepared transition-metal complexes are known to be effective at cleaving the strong C–H bonds of organic molecules in room temperature solutions. There is also ample theoretical evidence that the two-way, metal to ligand (MLCT) and ligand to metal (LMCT), charge-transfer between an incoming alkane C–H group and the transition metal is the decisive interaction in the C–H activation reaction. What is missing, however, are experimental methods to directly probe these interactions in order to reveal what determines reactivity of intermediates and the rate of the reaction. Here, using quantum chemical simulations we predict and propose future time-resolved valence-to-core resonant inelastic X-ray scattering (VtC-RIXS) experiments at the transition metal L-edge as a method to provide a full account of the evolution of metal–alkane interactions during transition-metal mediated C–H activation reactions. For the model system cyclopentadienyl rhodium dicarbonyl (CpRh(CO) 2 ), we demonstrate, by simulating the VtC-RIXS signatures of key intermediates in the C–H activation pathway, how the Rh-centered valence-excited states accessible through VtC-RIXS directly reflect changes in donation and back-donation between the alkane C–H group and the transition metal as the reaction proceeds via those intermediates. We benchmark and validate our quantum chemical simulations against experimental steady-state measurements of CpRh(CO) 2 and Rh(acac)(CO)2 (where acac is acetylacetonate). Our study constitutes the first step towards establishing VtC-RIXS as a new experimental observable for probing reactivity of C–H activation reactions. More generally, the study further motivates the use of time-resolved VtC-RIXS to follow the valence electronic structure evolution along photochemical, photoinitiated and photocatalytic reactions with transition metal complexes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
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 OSTI2021

Empirical performance bounds for quantum approximate optimization

The quantum approximate optimization algorithm (QAOA) has been put forth as a method for near-term quantum computers to solve optimization problems. However, assessments of QAOA performance have mostly focused on small structured problem instances while performance on more general instances is less clear. Here, we numerically simulate QAOA pure state dynamics for every instance of MaxCut on non-isomorphic unweighted graphs with nine or fewer vertices with depth parameters p ≤ 3. We find the approximation ratios and optimized circuit parameters concentrate across graphs of a given size and empirically show increases in concentration as graph size increases. The parameter concentration leads to two median-angle heuristics that overcome difficulties in QAOA parameter optimization and obtain mean approximation ratios within 3% and 0.2% of the optimal. We also analyze the probability to measure an optimal solution and find increasing variations between graphs as depth increases, in stark contrast to the approximation ratios which concentrate as depth increases. Furthermore, the resulting benchmark data set gives empirical bounds for on-going experimental realizations and lays groundwork for theoretical extensions to greater problem sizes and depths where QAOA may prove important for practically relevant problems.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2026

QPatLib v1.0 — Measurement-based quantum simulation Pauli string unitary pattern collections

This Zenodo record accompanies the paper “Scalable Measurement-Based Quantum Simulation Patterns for Benchmarking” arXiv.2605.12502 and provides QPatLib v1.0 measurement-pattern datasets in human-readable JSONL together with a ZIP archive of OpenQASM 3.0 circuits used for validation and reproducibility. The patterns and circuits implement Pauli string unitaries for benchmark cases. Cases include all possible string combinations for less than 6 qubits and strings used in Hamiltonians for certain diatomic molecules for 6 or more qubits. Format: Each pattern_*.jsonl file is containins measurement patterns for all subsets for a given model/instance and subset strategy: it begins with a preamble containing model metadata, subset definitions, provenance, and (when feasible) full-pattern test results, followed by one pattern entry per subset. Each subset entry includes a required pattern_ascii field storing the measurement pattern in the measurement-calculus/Graphix standard with signal shifting, written left-to-right in the canonical order nodes → edges → measurements (with signal dependencies) → byproduct corrections (X/Z). The circuits are included as circuit_files.zip. Patterns in this record were validated against the corresponding circuits and checked for causal flow. Codes for generating these patterns can be found at QPatLib repository on Github

Graphix↗
DOE OSTI2024

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗