Search NASA⌕ Search

SEARCH · Search NASA

Results for “error mitigation”

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 163 records · Page 9
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Prepare Ground States of Highly Frustrated Magnetic Clusters on Quantum Computers

Solving challenging problems in physical, chemical, and materials sciences is one of the most promising applications of quantum utility that can be realized on current noisy hardware, considering (i) the direct map (encoding) from the quantum particles and their interactions to the qubits and their entangling gates and (ii) the rapidly improved quantum hardware and advanced error-mitigation techniques. Understanding quantum spin liquid in frustrated magnetic materials is a longstanding challenge in condensed matter physics and the nature of the ground-state phases is highly debated among researchers. Using IBM quantum computers with superconducting qubits, we implemented a variational quantum eigensolver (VQE) algorithm to prepare the ground states of two 12-site cluster approximations of these highly frustrated magnetic materials. The interaction graphs of the two corresponding Hamiltonians are (a) the six-pointed star graph (a unit cell of the kagome lattice) and (b) the cuboctahedral graph (the kagome on a sphere). These are also two instances of Quantum Max Cut problem. With the VQE based on the Hamiltonian variational ansatz acting on a valence bond solid initial trial state, we prepared the ground states and obtained the exact ground energy on simulator and high accuracy on noisy hardware. The deep ansatz necessary to reach the ground state of the cuboctahedral graph indicates that it is a hard instance of Quantum Max Cut.

Wang, Yan↗
DOE OSTI2021

Enabling Pulse-level Programming, Compilation, and Execution in XACC

Noisy gate-model quantum processing units (QPUs) are currently available from vendors over the cloud, and digital quantum programming approaches exist to run low-depth circuits on physical hardware. These digital representations are ultimately lowered to pulse-level instructions by vendor quantum control systems to affect unitary evolution representative of the submitted digital circuit. Vendors are beginning to open this pulse-level control system to the public via specified interfaces. Robust programming methodologies, software frameworks, and backend simulation technologies for this analog model of quantum computation will prove critical to advancing pulse-level control research and development. Prototypical use cases for this include error mitigation, optimal pulse control, and physics-inspired pulse construction. Here we present an extension to the XACC quantum-classical software framework that enables pulse-level programming for superconducting, gate-model quantum computers, and a novel, general, and extensible pulse-level simulation backend for XACC that scales on classical compute clusters via MPI. Our work enables custom backend Hamiltonian definitions and gate-level compilation to available pulses with a focus on performance and scalability. We end with a demonstration of this capability, and show how to use XACC for pertinent pulse-level programming tasks.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Description of reaction and vibrational energetics of CO 2 –NH 3 interaction using quantum computing algorithms

CO 2 capture is critical to solving global warming. Amine-based solvents are extensively used to chemically absorb CO 2 . Thus, it is crucial to study the chemical absorption of CO 2 by amine-based solvents to better understand and optimize CO 2 capture processes. Here, we use quantum computing algorithms to quantify molecular vibrational energies and reaction pathways between CO 2 and a simplified amine-based solvent model—NH 3 . Molecular vibrational properties are important to understanding kinetics of reactions. However, the molecule size correlates with the strength of anharmonicity effect on vibrational properties, which can be challenging to address using classical computing. Quantum computing can help enhance molecular vibrational calculations by including anharmonicity. We implement a variational quantum eigensolver (VQE) algorithm in a quantum simulator to calculate ground state vibrational energies of reactants and products of the CO 2 and NH 3 reaction. The VQE calculations yield ground vibrational energies of CO 2 and NH 3 with similar accuracy to classical computing. In the presence of hardware noise, Compact Heuristic for Chemistry (CHC) ansatz with shallower circuit depth performs better than Unitary Vibrational Coupled Cluster. The “Zero Noise Extrapolation” error-mitigation approach in combination with CHC ansatz improves the vibrational calculation accuracy. Excited vibrational states are accessed with quantum equation of motion method for CO 2 and NH 3 . Using quantum Hartree–Fock (HF) embedding algorithm to calculate electronic energies, the corresponding reaction profile compares favorably with Coupled Cluster Singles and Doubles while being more accurate than HF. Our research showcases quantum computing applications in the study of CO 2 capture reactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

Systematic evaluation of four-dimensional hybrid depth scanning for carbon-ion lung therapy

Purpose: Irradiation of a moving target with a scanning beam requires a comprehensive understanding of organ motion as well as a robust dose error mitigation technique. The authors studied the effects of intrafractional respiratory motion for carbon-ion pencil beam scanning with phase-controlled rescanning on dose distributions for lung tumors. To address density variations, they used 4DCT data. Methods: Dose distributions for various rescanning methods, such as simple layer rescanning (LR), volumetric rescanning, and phase-controlled rescanning (PCR), were calculated for a lung phantom and a lung patient studies. To ensure realism, they set the scanning parameters such as scanning velocity and energy variation time to be similar to those used at our institution. Evaluation metrics were determined with regard to clinical relevance, and consisted of (i) phase-controlled rescanning, (ii) sweep direction, (iii) target motion (direction and amplitude), (iv) respiratory cycle, and (v) prescribed dose. Spot weight maps were calculated by using a beam field-specific target volume, which takes account of range variations for respective respiratory phases. To emphasize the impact of intrafractional motion on the dose distribution, respiratory gating was not used. The accumulated dose was calculated by applying a B-spline-based deformable image registration, and the results for phase-controlled layered rescanning (PCR{sub L}) and phase-controlled volumetric rescanning (PCR{sub V}) were compared. Results: For the phantom study, simple LR was unable to improve the dose distributions for an increased number of rescannings. The phase-controlled technique without rescanning (1 Multiplication-Sign PCR{sub L} and 1 Multiplication-Sign PCR{sub V}) degraded dose conformity significantly due to a reduced scan velocity. In contrast, 4 Multiplication-Sign PCR{sub L} or more significantly and consistently improved dose distribution. PCR{sub V} showed interference effects, but in general also improved dose homogeneity with higher numbers of rescannings. Dose distributions with single PCR{sub L}/PCR{sub V} with a sweep direction perpendicular to motion direction showed large hot/cold spots; however, this effect vanished with higher numbers of rescannings for both methods. Similar observations were obtained for the other dose metrics, such as target motion (SI/AP), amplitude (6-22 mm peak-to-peak) and respiratory period (3.0-5.0 s). For four or more rescannings, both methods showed significantly better results, albeit that volumetric PCR was more affected by interference effects, which lead to severe degradation of a few dose distributions. The clinical example showed the same tendencies as the phantom study. Dose assessment metrics (D95, Dmax/Dmin, homogeneity index) were improved with an increasing number of PCR{sub L}/PCR{sub V}, but with PCR{sub L} being more robust. Conclusions: PCR{sub L} requires a longer treatment time than PCR{sub V} for high numbers of rescannings in the NIRS scanning system but is more robust. Although four or more rescans provided good dose homogeneity and conformity, the authors prefer to use more rescannings for clinical cases to further minimize dose degradation effects due to organ motion.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2015

Impact of CT attenuation correction method on quantitative respiratory-correlated (4D) PET/CT imaging

Purpose: Respiratory-correlated positron emission tomography (PET/CT) 4D PET/CT is used to mitigate errors from respiratory motion; however, the optimal CT attenuation correction (CTAC) method for 4D PET/CT is unknown. The authors performed a phantom study to evaluate the quantitative performance of CTAC methods for 4D PET/CT in the ground truth setting. Methods: A programmable respiratory motion phantom with a custom movable insert designed to emulate a lung lesion and lung tissue was used for this study. The insert was driven by one of five waveforms: two sinusoidal waveforms or three patient-specific respiratory waveforms. 3DPET and 4DPET images of the phantom under motion were acquired and reconstructed with six CTAC methods: helical breath-hold (3DHEL), helical free-breathing (3DMOT), 4D phase-averaged (4DAVG), 4D maximum intensity projection (4DMIP), 4D phase-matched (4DMATCH), and 4D end-exhale (4DEXH) CTAC. Recovery of SUV{sub max}, SUV{sub mean}, SUV{sub peak}, and segmented tumor volume was evaluated as RC{sub max}, RC{sub mean}, RC{sub peak}, and RC{sub vol}, representing percent difference relative to the static ground truth case. Paired Wilcoxon tests and Kruskal–Wallis ANOVA were used to test for significant differences. Results: For 4DPET imaging, the maximum intensity projection CTAC produced significantly more accurate recovery coefficients than all other CTAC methods (p < 0.0001 over all metrics). Over all motion waveforms, ratios of 4DMIP CTAC recovery were 0.2 ± 5.4, −1.8 ± 6.5, −3.2 ± 5.0, and 3.0 ± 5.9 for RC{sub max}, RC{sub peak}, RC{sub mean}, and RC{sub vol}. In comparison, recovery coefficients for phase-matched CTAC were −8.4 ± 5.3, −10.5 ± 6.2, −7.6 ± 5.0, and −13.0 ± 7.7 for RC{sub max}, RC{sub peak}, RC{sub mean}, and RC{sub vol}. When testing differences between phases over all CTAC methods and waveforms, end-exhale phases were significantly more accurate (p = 0.005). However, these differences were driven by the patient-specific respiratory waveforms; when testing patient and sinusoidal waveforms separately, patient waveforms were significantly different between phases (p < 0.0001) while the sinusoidal waveforms were not significantly different (p = 0.98). When considering only the subset of 4DMATCH images that corresponded to the end-exhale image phase, 4DEXH, mean and interquartile range were similar to 4DMATCH but variability was considerably reduced. Conclusions: Comparative advantages in accuracy and precision of SUV metrics and segmented volumes were demonstrated with the use of the maximum intensity projection and end-exhale CT attenuation correction. While respiratory phase-matched CTAC should in theory provide optimal corrections, image artifacts and differences in implementation of 4DCT and 4DPET sorting can degrade the benefit of this approach. These results may be useful to guide the implementation, analysis, and development of respiratory-correlated thoracic PET/CT in the radiation oncology and diagnostic settings.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Gleipnir: toward practical error analysis for Quantum programs

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the (ρ,δ)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state ρ and its distance δ to the ideal state ρ. This predicate (ρ,δ) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the (ρ,δ)-diamond norm metric. Furthermore, our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

Tao, Runzhou↗
DOE OSTI2023

Is Knowledge about Running Applications Helping Improve Runtime Prediction of HPC Jobs?

High-performance computing systems rely upon scheduling algorithms to achieve high utilization. These schedulers rely upon user estimates of job resource requirements, such as runtime, to determine optimal scheduling of incoming jobs. These user estimates, however, are prone to error. To mitigate this error, significant research has been directed at providing better estimates of job runtime, usually employing machine learning techniques. These techniques are dependent upon the input features selected. Among the possible features is the primary application used by the job. In a survey of more than 20 papers directed at improving runtime prediction, only four included primary application as an input feature. We focus this investigation specifically on the value of adding primary application as an input feature, and find that it does improve model performance, especially for jobs with longer runtimes, though this improvement varies based on the application used. We recommend further research to determine the cause of this variability as well as an optimal strategy for employing a mixture of models both including and not including primary application as a feature.

MATHEMATICS AND COMPUTING↗
DOE OSTI2025

CV4Quantum

CV4Quantum is a statistical technique for reducing the sampling overhead in probabilistic error cancellation, which is an error mitigation technique used in quantum computing. CV4Quantum is based on the control variates method, which is a Monte Carlo variance reduction technique. This repository contains the code and data associated with a demonstration of CV4Quantum using simulation experiments.

Shyamsundar, Prasanth [Fermi National Accelerator ↗
DOE OSTI2026

Universal Injector at LERF – Baseline Design

A new electron injector complex has been proposed within the Low Energy Recirculating Facility (LERF) vault, which would serve both the 22 GeV CEBAF and the positron programs, while being compatible with the electron source required to produce positrons for Ce+BAF. The baseline design of a 3-pass recirculator features a main linac configured with three cryomodules, five isochronous arcs and three straight sections, allowing electron beam acceleration up to 650 MeV. The injector offers the flexibility to extract 1-pass and 2-pass energy electrons, as needed for positron production, with final reconfiguration to a 3-pass 650 MeV injector for 22 GeV CEBAF. This paper provides an overview of the baseline design of the Universal injector complex, including the 8 MeV injector and the recirculator. A comprehensive suite of beam dynamics studies to validate our design is being launched, starting with start-to-end tracking with Elegant followed by the orbit correction and error mitigation.

Bogacz, A. [Thomas Jefferson National Accelerator ↗
DOE OSTI2021

Uncertainty Analysis and Software Verification

Uncertainty analyses are an important part of calibrations and testing. They allow researchers insight on how to reduce and mitigate errors in testing. Each device used in testing introduces error in a system, as well as other sources such as environmental conditions, electronics, analog to digital, and random errors. Each source is carefully examined to identify how much error it introduces to a system. These sources are then combined using various methods of uncertainty calculations. To verify and validate software, a manual calculation is required to ensure the software is performing as intended. Using Excel to verify the calculations, we can identify discrepancies within the software. The root of the sum of the squares uncertainty (RSS) is used to find the combined uncertainty of a device at one and two standard deviations of the mean. Calibrations on accelerometers are performed using a vibration system along with a back-toback reference accelerometer. The vibration system takes a reference point at 100Hz frequency at 10g amplitude. The sensitivities are collected at each dialed in frequency. The sensitivity of the device represents the electrical output of the UUT (mV, pC, etc.) per unit of acceleration (g). The full history of sensitivities of selected accelerometers are used to find the averaged, standard deviation, and uncertainty of the device at each frequency tested. The uncertainty calculations from excel and the software are then compared.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Theory and Simulations of Emergent Geometry in Quantum Gravity (Final Technical Report)

This is the final technical report for the QuantISED Award to PIs Hartman, Ginsparg, and McMahon at Cornell University, outlining the goals of the research project and summarizing its main technical achievements. These include the discovery of new non-perturbative effects in quantum gravity known as replica wormholes which play an important role in the black hole information paradox, new methods to study cosmological spacetimes using the tools of holographic duality, and new experimental results on error mitigation in quantum computing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Increased Reliability for Near-Term Quantum Computers via Low-Level Control (CRADA Final Report)

This project helped narrow the gap between near-term hardware and practical applications of quantum computing through the development and implementation of optimized compilation and error mitigation techniques. These advances were enabled by low-level control available on the Advanced Quantum Testbed, and led to methods that characterized and improved the platform’s performance on quantum algorithms. Results of this work were published in the scientific literature and used to inform internal software development of partner Super.tech.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Management and Operation of the Lawrence Livermore National Laboratory (Final Report)

Optimize existing characterization and control methods by developing methods for rapid synthesis of multi-qubit control for error mitigation and complex gate design using optimal control theory. The Subcontractor shall develop Hamiltonian learning methods that can be used for characterizing super-conducting quantum devices, in particular develop strategies for effective probing of such devices.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Tough Errors are no Match (TEAM): Optimizing the Quantum Compiler for Noise Resilience

This report summarizes our contributions to the Department of Energy’s Tough Errors are no Match (TEAM) project (DE-SC0020377) under Thrust 2: Quantum Programming and Compilation. The central outcomes of this work included a novel efficient quantum compiling algorithm which works without requiring the quantum computer to exactly invert its operations, answering a longstanding open problem in quantum compiling. Additional results include the implementation of zero-noise extrapolation error mitigation in collaboration with the Unitary Fund, as well as novel quantum algorithms for entanglement detection and pseudorandomness.

Bouland, Adam [Stanford Univ., CA (United States)]↗
DOE OSTI2026

Hardware Implementation of Grover's Search Algorithm

Grover's algorithm searches through an unstructured database, offering a quadratic speedup over classical search algorithms. We implement it, as well as two deterministic variants, on IBM (Kingston) and IQM (Garnet) hardware. Additionally, we test dynamical decoupling as an error mitigation technique. We compare our results to a classical, brute force approach to evaluate current hardware capabilities.

Pressman, Daniel [Fermilab]↗
DOE OSTI2022

Algebraic Bethe Circuits

The Algebraic Bethe Ansatz (ABA) is a highly successful analytical method used to exactly solve several physical models in both statistical mechanics and condensed-matter physics. Here we bring the ABA into unitary form, for its direct implementation on a quantum computer. This is achieved by distilling the non-unitary R matrices that make up the ABA into unitaries using the QR decomposition. Our algorithm is deterministic and works for both real and complex roots of the Bethe equations. We illustrate our method on the spin-$\frac{1}{2}$ XX and XXZ models. We show that using this approach one can efficiently prepare eigenstates of the XX model on a quantum computer with quantum resources that match previous state-of-the-art approaches. We run small-scale error mitigated implementations on the IBM quantum computers, including the preparation of the ground state for the XX and XXZ models on 4 sites. Finally, we derive a new form of the Yang-Baxter equation using unitary matrices, and also verify it on a quantum computer.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Randomized measurement protocols for lattice gauge theories

Randomized measurement protocols, including classical shadows, entanglement tomography, and randomized benchmarking are powerful techniques to estimate observables, perform state tomography, or extract the entanglement properties of quantum states. While unraveling the intricate structure of quantum states is generally difficult and resource-intensive, quantum systems in nature are often tightly constrained by symmetries. Furthermore, this can be leveraged by the symmetry-conscious randomized measurement schemes we propose, yielding clear advantages over symmetry-blind randomization such as reducing measurement costs, enabling symmetry-based error mitigation in experiments, allowing differentiated measurement of (lattice) gauge theory entanglement structure, and, potentially, the verification of topologically ordered states in existing and near-term experiments. Crucially, unlike symmetry-blind randomized measurement protocols, these latter tasks can be performed without relearning symmetries via full reconstruction of the density matrix.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗