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
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)↗
DOE OSTI2020

Establishing the quantum supremacy frontier with a 281 Pflop/s simulation

Noisy intermediate-scale quantum (NISQ) computers are entering an era in which they can perform computational tasks beyond the capabilities of the most powerful classical computers, thereby achieving 'quantum supremacy', a major milestone in quantum computing. NISQ supremacy requires comparison with a state-of-the-art classical simulator. In this paper, we report HPC simulations of hard random quantum circuits (RQC), which have been recently used as a benchmark for the first experimental demonstration of quantum supremacy, sustaining an average performance of 281 Pflop/s (true single precision) on Summit, currently the fastest supercomputer in the world. These simulations were carried out using qFlex, a tensor-network-based classical high-performance simulator of RQCs. Our results show an advantage of many orders of magnitude in energy consumption of NISQ devices over classical supercomputers. In addition, we propose a standard benchmark for NISQ computers based on qFlex.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Tough Errors Are no Match (TEAM): Optimizing the quantum compiler for noise resilience

This report summarizes Unitary Fund’s contributions to the Department of Energy’s TEAM project (DE-SC0020266) under Thrust 2: Quantum Programming and Compilation. The central outcomes of this work have been the development of Mitiq, an open-source Python toolkit for applying quantum error mitigation (QEM) techniques to noisy quantum programs, and the invention, benchmarking and theoretical investigation of novel QEM techniques. Additional outcomes include the development of other open source software packages for the usage, simulation and control of quantum computers.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Nanoscale electrostatic control in ultraclean van der Waals heterostructures by local anodic oxidation of graphite gates

In an all-van der Waals heterostructure, the active layer, gate dielectrics and gate electrodes are assembled from two-dimensional crystals that have a low density of atomic defects. This design allows two-dimensional electron systems with very low disorder to be created, particularly in heterostructures where the active layer also has intrinsically low disorder, such as crystalline graphene layers or metal dichalcogenide heterobilayers. A key missing ingredient has been nanoscale electrostatic control, with existing methods for fabricated local gates typically introducing unwanted contamination. Here we describe a resist-free local anodic oxidation process for patterning sub-100 nm features in graphite gates, and their subsequent integration into an all-van der Waals heterostructure. We define a quantum point contact in the fractional quantum Hall regime as a benchmark device and observe signatures of chiral Luttinger liquid behaviour, indicating an absence of extrinsic scattering centres in the vicinity of the point contact. In the integer quantum Hall regime, we demonstrate in situ control of the edge confinement potential, a key requirement for the precision control of chiral edge states. In conclusion, this technique may enable the fabrication of devices capable of single anyon control and coherent edge-state interferometry in the fractional quantum Hall regime.

36 MATERIALS SCIENCE↗
DOE OSTI2020

Quantum adiabatic machine learning by zooming into a region of the energy surface

Recent work has shown that quantum annealing for machine learning, referred to as QAML, can perform comparably to state-of-the-art machine learning methods with a specific application to Higgs boson classification. Here, we propose QAML-Z, an algorithm that iteratively zooms in on a region of the energy surface by mapping the problem to a continuous space and sequentially applying quantum annealing to an augmented set of weak classifiers. Results on a programmable quantum annealer show that QAML-Z matches classical deep neural network performance at small training set sizes and reduces the performance margin between QAML and classical deep neural networks by almost 50% at large training set sizes, as measured by area under the receiver operating characteristic curve. The significant improvement of quantum annealing algorithms for machine learning and the use of a discrete quantum algorithm on a continuous optimization problem both opens a class of problems that can be solved by quantum annealers and suggests the approach in performance of near-term quantum machine learning towards classical benchmarks.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum capacities of transducers

Abstract High-performance quantum transducers, which faithfully convert quantum information between disparate physical carriers, are essential in quantum science and technology. Different figures of merit, including efficiency, bandwidth, and added noise, are typically used to characterize the transducers’ ability to transfer quantum information. Here we utilize quantum capacity, the highest achievable qubit communication rate through a channel, to define a single metric that unifies various criteria of a desirable transducer. Using the continuous-time quantum capacities of bosonic pure-loss channels as benchmarks, we investigate the optimal designs of generic quantum transduction schemes implemented by transmitting external signals through a coupled bosonic chain. With physical constraints on the maximal coupling rate $${g}_{\max }$$ g max , the highest continuous-time quantum capacity $${Q}^{\max }\approx 31.4{g}_{\max }$$ Q max ≈ 31.4 g max is achieved by transducers with a maximally flat conversion frequency response, analogous to Butterworth electric filters. We further investigate the effect of thermal noise on the performance of transducers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Quantum-classical embedding via ghost Gutzwiller approximation for enhanced simulations of correlated electron systems

Simulating correlated materials on present-day quantum hardware remains challenging due to limited quantum resources. Quantum embedding methods offer a promising route by reducing computational complexity through the mapping of bulk systems onto effective impurity models, allowing more feasible simulations on pre- and early-fault-tolerant quantum devices. Here, this work develops a quantum-classical embedding framework based on the ghost Gutzwiller approximation to enable quantum-enhanced simulations of ground-state properties and spectral functions of correlated electron systems. Circuit complexity is analyzed using an adaptive variational quantum algorithm on a statevector simulator, applied to the infinite-dimensional Hubbard model with increasing ghost mode numbers from 3 to 5, resulting in circuit depths growing from 16 to 104. Noise effects are examined using a realistic error model, revealing significant impact on the spectral weight of the Hubbard bands. To mitigate these effects, the Iceberg quantum error detection code is employed, achieving up to 40% error reduction in simulations. Finally, the accuracy of the density matrix estimation and the derived spectral function is benchmarked on IBM and Quantinuum quantum hardware, featuring distinct qubit-connectivity and employing multiple levels of error mitigation techniques.

Chen, I-Chi [Ames Laboratory (AMES), Ames, IA (Uni↗
DOE OSTI2025

Quantum Advantage in Trading: A Game-Theoretic Approach

Quantum games, like quantum algorithms, exploit quantum entanglement to establish strong correlations between strategic player actions. This paper introduces quantum game-theoretic models applied to trading and demonstrates their implementation on an ion-trap quantum computer. The results showcase a quantum advantage, previously known only theoretically, realized as higher-paying market Nash equilibria. This advantage could help uncover alpha in trading strategies, defined as excess returns compared to established benchmarks. These findings suggest that quantum computing could significantly influence the development of financial strategies.

Khan, Faisal Shah [Taqtics LLC, USA, Rethinc. Labs↗
DOE OSTI2023

On the Approximability of Random-Hypergraph MAX-3-XORSAT Problems with Quantum Algorithms

Constraint satisfaction problems are an important area of computer science. Many of these problems are in the complexity class NP which is exponentially hard for all known methods, both for worst cases and often typical. Fundamentally, the lack of any guided local minimum escape method ensures the hardness of both exact and approximate optimization classically, but the intuitive mechanism for approximation hardness in quantum algorithms based on Hamiltonian time evolution is poorly understood. We explore this question using the prototypically hard MAX-3-XORSAT problem class. We conclude that the mechanisms for quantum exact and approximation hardness are fundamentally distinct. We qualitatively identify why traditional methods such as quantum adiabatic optimization are not good approximation algorithms. We propose a new spectral folding optimization method that does not suffer from these issues and study it analytically and numerically. We consider random rank-3 hypergraphs including extremal planted solution instances, where the ground state satisfies an anomalously high fraction of constraints compared to truly random problems. We show that, if we define the energy to be $E = N_{unsat}-N_{sat}$, then spectrally folded quantum optimization will return states with energy $E \leq A E_{GS}$ (where $E_{GS}$ is the ground state energy) in polynomial time, where conservatively, $A \simeq 0.6$. We thoroughly benchmark variations of spectrally folded quantum optimization for random classically approximation-hard (planted solution) instances in simulation, and find performance consistent with this prediction. We do not claim that this approximation guarantee holds for all possible hypergraphs, though our algorithm's mechanism can likely generalize widely. These results suggest that quantum computers are more powerful for approximate optimization than had been previously assumed.

Kapit, Eliot↗
DOE OSTI2022

Dual-map framework for noise characterization of quantum computers

In order to understand the capabilities and limitations of quantum computers, it is necessary to develop methods that efficiently characterize and benchmark error channels present on these devices. In this paper, we present a method that faithfully reconstructs a marginal (local) approximation of the effective noise (MATEN) channel, that acts as a single layer at the end of the circuit. We first introduce a dual-map framework that allows us to analytically derive expectation values of observables with respect to noisy circuits. These findings are supported by numerical simulations of the quantum approximate optimization algorithm (QAOA) that also justify the MATEN, even in the presence of nonlocal errors that occur during a circuit. Finally, we demonstrate the performance of the method on Rigetti's Aspen-11 quantum computer for QAOA circuits up to six qubits, successfully predicting the observed measurements on a majority of the qubits.

Sud, James↗