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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Uniformly decaying subspaces for error-mitigated quantum computation

Here, we present a general condition to obtain subspaces that decay uniformly in a system governed by the Lindblad master equation and use them to perform error-mitigated quantum computation. The expectation values of dynamics encoded in such subspaces are unbiased estimators of noise-free expectation values. In analogy to the decoherence free subspaces which are left invariant by the action of Lindblad operators, we show that the uniformly decaying subspaces are left invariant (up to orthogonal terms) by the action of the dissipative part of the Lindblad equation. We apply our theory to a system of qubits and qudits undergoing relaxation with varying decay rates and show that such subspaces can be used to eliminate bias up to first-order variations in the decay rates without requiring full knowledge of noise. Since such a bias cannot be corrected through standard symmetry verification, our method can improve error mitigation in dual-rail qubits and, given partial knowledge of noise, can perform better than probabilistic error cancellation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRSDate not supplied

Logical shadow tomography: Efficient estimation of error-mitigated observables

We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-efficient classical reconstruction of the noisy density matrix. Using efficient classical post-processing, one can mitigate errors by projecting into the codespace as in subspace expansion and taking powers of the density matrix as in virtual distillation. Relative to subspace expansion which requires Ω (2^((n-1)k) samples to estimate a Pauli observable with an [[n; k]] stabilizer code, our technique requires only Ө(2^k) samples. Relative to virtual distillation, our technique can compute powers of the density matrix without implementing additional copies of quantum states the quantum computer. We present numerical results using logical states encoded with up to sixty physical qubits and show fast convergence to error-free expectation values with only 10^5 samples under 1% depolarizing noise.

quantum computing↗
DOE OSTI2026

Error-mitigated nonorthogonal quantum eigensolver via shadow tomography

We present a shadow-tomography-enhanced nonorthogonal quantum eigensolver (NOQE) for more efficient and accurate electronic structure calculations on near-term quantum devices. By integrating shadow tomography into the NOQE, the measurement cost scales linearly rather than quadratically with the number of reference states, while also reducing the required qubits and circuit depth by half. This approach enables extraction of all matrix elements via randomized measurements and classical postprocessing. We analyze its sample complexity and show that, for small systems, it remains constant in the high-precision regime, while for larger systems, it scales linearly with the system size. We further apply shadow-based error mitigation to suppress noise-induced bias without increasing quantum resources. Demonstrations on the hydrogen molecule in the strongly correlated regime achieve chemical accuracy under realistic noise, showing that our method is both resource-efficient and noise-resilient for practical quantum chemistry simulations in the near term.

quantum algorithms & computation↗
NASA NTRSDate not supplied

Logical Shadow Tomography: Efficient Estimation of Error-mitigated Observables

In near-term quantum applications, reducing errors and improving device reliability is an essential task. Towards these ends, various techniques have been introduced in recent literature, collectively referred to as quantum error mitigation techniques, for reducing errors in pre-fault-tolerant devices. Here, we introduce logical shadow tomography as a versatile error mitigation method. Our technique uses a stabilizer code to encode information in a logical state. Instead of doing active error correction, quantum states will be measured at the end of computation via shadow tomography and non-logical errors are projected out in the classical post-processing. Relative to quantum subspace expansion which requires O(2(M-1)L) experiments to estimate an logical Pauli observable encoded by an [[M, L, d]] code, our technique only requires 2L experiments, an important practical reduction in resources.

Hong-Ye Hu↗
DOE OSTI2025

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

This project builds toward a comprehensive error-mitigating toolkit that makes quantum programming more robust and adaptive to the noisy, resource-limited nature of today’s quantum hardware. To that end, it integrates established error-mitigation methods — such as zero-noise extrapolation and dynamical decoupling — directly into compiler infrastructures. These techniques will be packaged as modules that can automatically adjust and combine based on performance analysis, enabling compilers to explore large design spaces and produce optimized, low-noise quantum programs with minimal manual intervention. In parallel, this project also explores new approaches to analog quantum programming or quantum simulation, and has developed the programming language SimuQ which treats quantum Hamiltonian evolution as the central object.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Noise robust detection of quantum phase transitions

Quantum computing allows for the manipulation of highly correlated states whose properties quickly go beyond the capacity of any classical method to calculate. Thus one natural problem which could lend itself to quantum advantage is the study of ground-states of condensed matter models, and the transitions between them. However, current levels of hardware noise can require extensive application of error-mitigation techniques to achieve reliable computations. In this work, we use several IBM devices to explore a finite-size spin model with multiple “phaselike” regions characterized by distinct ground-state configurations. Using preoptimized Variational Quantum Eigensolver (VQE) solutions, we demonstrate that in contrast to calculating the energy, where zero-noise extrapolation is required in order to obtain qualitatively accurate yet still unreliable results, calculations of the energy derivative, two-site spin correlation functions, and the fidelity susceptibility yield accurate behavior across multiple regions, even with minimal or no application of error-mitigation approaches. Taken together, these sets of observables could be used to identify level crossings in a simple, noise-robust manner which is agnostic to the method of ground state preparation. This work shows promising potential for near-term application to identifying quantum phase transitions, including avoided crossings and nonadiabatic conical intersections in electronic structure calculations. Published by the American Physical Society 2024

Lively, Kevin (ORCID:0000000320981494)↗
DOE OSTI2025

More buck-per-shot: Why learning trumps mitigation in noisy quantum sensing

Quantum sensing is one of the most promising applications for quantum technologies. However, reaching the ultimate sensitivities enabled by the laws of quantum mechanics can be a challenging task in realistic scenarios where noise is present. While several strategies have been proposed to deal with the detrimental effects of noise, these come at the cost of an extra shot budget. Given that shots are a precious resource for sensing – as infinite measurements could lead to infinite precision – care must be taken to truly guarantee that any shot not being used for sensing is actually leading to some metrological improvement. In this work, we study whether investing shots in error-mitigation, inference techniques, or combinations thereof, can improve the sensitivity of a noisy quantum sensor on a (shot) budget. We present a detailed bias–variance error analysis for various sensing protocols. Our results show that the costs of zero-noise extrapolation techniques outweigh their benefits. We also find that pre-characterizing a quantum sensor via inference techniques leads to the best performance, under the assumption that the sensor is sufficiently stable.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Simulating nonlinear optical processes on a superconducting quantum device

Simulating plasma physics on quantum computers is difficult because most problems of interest are nonlinear, but quantum computers are not naturally suitable for nonlinear operations. In weakly nonlinear regimes, plasma problems can be modelled as wave–wave interactions. In this paper, we develop a quantization approach to convert nonlinear wave–wave interaction problems to Hamiltonian simulation problems. We demonstrate our approach using two qubits on a superconducting device. Unlike a photonic device, a superconducting device does not naturally have the desired interactions in its native Hamiltonian. Nevertheless, Hamiltonian simulations can still be performed by decomposing required unitary operations into native gates. To improve experimental results, we employ a range of error-mitigation techniques. Apart from readout error mitigation, we use randomized compilation to transform undiagnosed coherent errors into well-behaved stochastic Pauli channels. Moreover, to compensate for stochastic noise, we rescale exponentially decaying probability amplitudes using rates measured from cycle benchmarking. We carefully consider how different choices of product-formula algorithms affect the overall error and show how a trade-off can be made to best utilize limited quantum resources. This study provides an example of how plasma problems may be solved on near-term quantum computing platforms.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Realizing string-net condensation: Fibonacci anyon braiding for universal gates and sampling chromatic polynomials

Abstract The remarkable complexity of a topologically ordered many-body quantum system is encoded in the characteristics of its anyons. Quintessential predictions emanating from this complexity employ the Fibonacci string net condensate (Fib SNC) and its anyons: sampling Fib-SNC would estimate chromatic polynomials while exchanging its anyons would implement universal quantum computation. However, physical realizations remained elusive. We introduce a scalable dynamical string net preparation (DSNP) that constructs Fib SNC and its anyons on reconfigurable graphs suitable for near-term superconducting processors. Coupling the DSNP approach with composite error-mitigation on deep circuits, we create, measure, and braids Fibonacci anyons; charge measurements show 94% accuracy, and exchanging the anyons yields the expected golden ratioϕwith 98% average accuracy. We then sample the Fib SNC to estimate chromatic polynomial atϕ + 2 for several graphs. Our results establish the proof of principle for using Fib-SNC and its anyons for fault-tolerant universal quantum computation and aim at a classically hard problem.

Science & Technology - Other Topics↗
DOE OSTI2026

Pathfinding quantum simulations of neutrinoless double- β decay

We present results from co-designed quantum simulations of the neutrinoless double- β decay of a simple nucleus in 1+1D quantum chromodynamics using IonQ’s Forte-generation trapped-ion quantum computers. Electrons, neutrinos, and up and down quarks are distributed across two lattice sites and mapped to 32 qubits, with an additional 4 qubits used for flag-based error mitigation. A four-fermion interaction is used to implement weak interactions, and lepton-number violation is induced by a neutrino Majorana mass. Quantum circuits that prepare the initial nucleus and time evolve with the Hamiltonian containing the strong and weak interactions are executed on IonQ Forte Enterprise. Enabled by tuned model parameters, lepton-number violation is observed in real time, providing a clear signal of neutrinoless double- β decay. This was made possible by co-designing the simulation to maximally utilize the all-to-all connectivity and native gate-set available on IonQ’s quantum computers. Quantum circuit compilation techniques and co-designed error-mitigation methods, informed from executing benchmarking circuits with up to 2,356 two-qubit gates, enabled observables to be extracted with high precision. We discuss the potential of future quantum simulations to provide yocto-second resolution of the reaction pathways in these, and other, nuclear processes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Group-theoretic error mitigation enabled by classical shadows and symmetries

Abstract Estimating expectation values is a key subroutine in quantum algorithms. Near-term implementations face two major challenges: a limited number of samples required to learn a large collection of observables, and the accumulation of errors in devices without quantum error correction. To address these challenges simultaneously, we develop a quantum error-mitigation strategy called symmetry-adjusted classical shadows , by adjusting classical-shadow tomography according to how symmetries are corrupted by device errors. As a concrete example, we highlight global U(1) symmetry, which manifests in fermions as particle number and in spins as total magnetization, and illustrate their group-theoretic unification with respective classical-shadow protocols. We establish rigorous sampling bounds under readout errors obeying minimal assumptions, and perform numerical experiments with a more comprehensive model of gate-level errors derived from existing quantum processors. Our results reveal symmetry-adjusted classical shadows as a low-cost strategy to mitigate errors from noisy quantum experiments in the ubiquitous presence of symmetry.

Zhao, Andrew (ORCID:0000000202990277)↗
DOE OSTI2026

Concatenated dual displacement code for continuous-variable quantum error correction

The continuous-variable (CV) Gaussian no-go theorem fundamentally limits the suppression of Gaussian displacement errors using only Gaussian gates and states. Prior studies have employed Gottesman-Kitaev-Preskill (GKP) states as ancillary qumodes to suppress small Gaussian displacement errors. However, when the displacement magnitude becomes large, inevitable lattice-crossing errors arise beyond the correctable range of the GKP state. To address this issue, we concatenate the Gaussian-noise-suppression circuit with an outer analog Steane code that corrects such occasional lattice-crossing events as well as other abrupt displacement errors. Contrary to conventional concatenation, which primarily aims to reduce logical error rates, the Steane-GKP duality in encoding provides complementary protection against displacement errors at different scales: The inner GKP layer employs non-Gaussian resources to suppress continuous Gaussian noise and reduce residual variance, while the outer analog Steane code corrects discrete lattice-crossing events that exceed the GKP correctable range. It is precisely this separation of error-mitigation roles that enables CV error correction. In contrast to prior work on concatenating GKP and repetition codes to establish error correction for discrete qubit/qudit encoding, we provide correction in the continuous encoding space. Analytical studies show that, under infinite squeezing, the concatenated code suppresses the variance of Gaussian displacement errors acting on all qumodes by up to 50%, while enabling unbiased correction of lattice-crossing errors with a success probability determined by the ratio between the residual Gaussian error standard deviation and the lattice-crossing magnitude. Even with finite squeezing, the proposed architecture still provides Gaussian-error suppression and lattice-crossing correction. Moreover, the presence of the outer analog Steane code relaxes the squeezing requirement of the inner GKP states, indicating near-term experimental feasibility. This work establishes a viable route toward fault-tolerant continuous-variable quantum computation and provides insight into the design of concatenated CV error-correcting architectures.

quantum error correction↗
DOE OSTI2025

Exponentially Reduced Circuit Depths Using Trotter Error Mitigation

Product formulas are a popular class of digital quantum simulation algorithms due to their conceptual simplicity, low overhead, and performance, which often exceeds theoretical expectations. Recently, Richardson extrapolation and polynomial interpolation have been proposed to mitigate the Trotter error incurred by the use of these formulas. This work provides a rigorous, general analysis of these techniques for computing time-evolved observables, simplifying the interpolation algorithm in the process, and shows that extrapolation generically improves the performance of product formulas for this task. We demonstrate that, to achieve error 𝜖 in a simulation of time 𝑇 using a 𝑝 ⁢th-order product formula with extrapolation, circuit depths of 𝑂⁡(𝑇 1+1/𝑝 ⁢polylog (1/𝜖)) are sufficient—an exponential improvement in the precision over product formulas alone. Furthermore, we prove that these algorithms achieve commutator scaling, and improve the 𝑇 complexity for the interpolation algorithm. By relaxing the requirement of performing exact Chebyshev interpolation, our simplified algorithm eliminates the need for fractional implementations of Trotter steps, reducing computational overhead. Finally, we show these techniques can be combined with the classical shadows method to estimate many time-evolved local observables. Taken together, our findings provide the strongest evidence yet for the utility of Trotter error-mitigation techniques in algorithmic applications.

quantum algorithms & computation↗
DOE OSTI2026

Simulating plasma wave propagation on a superconducting quantum chip

Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are important and the scale separation is large. Here, in this article, we take a first step toward efficient simulation of quantum plasmas by demonstrating linear plasma wave propagation on a superconducting quantum chip. Using high-fidelity and highly expressive device-native gates, combined with an error-mitigation technique, we simulate the scattering of laser pulses from inhomogeneous plasmas. Our approach is made feasible by the identification of a suitable local spin model whose excitations mimic plasma waves, and whose circuit implementation requires a lower gate count than other proposed approaches that would require a future fault-tolerant quantum computer. This work opens avenues to study more complicated phenomena that cannot be simulated efficiently on classical computers, such as nonlinear quantum dynamics when strongly coupled plasmas are driven out of equilibrium.

general physics↗
DOE OSTI2024

Quantum simulations of hadron dynamics in the Schwinger model using 112 qubits

Hadron wave packets are prepared and time evolved in the Schwinger model using 112 qubits of IBM’s 133-qubit Heron quantum computer ibm_torino. The initialization of the hadron wave packet is performed in two steps. First, the vacuum is prepared across the whole lattice using the recently developed SC-ADAPT-VQE algorithm and workflow. SC-ADAPT-VQE is then extended to the preparation of localized states, and used to establish a hadron wave packet on top of the vacuum. This is done by adaptively constructing low-depth circuits that maximize the overlap with an adiabatically prepared hadron wave packet. Due to the localized nature of the wavepacket, these circuits can be determined on a sequence of small lattices using classical computers, and then robustly scaled to prepare wave packets on large lattices for simulations using quantum computers. Time evolution is implemented with a second-order Trotterization. To reduce both the required qubit connectivity and circuit depth, an approximate quasilocal interaction is introduced. This approximation is made possible by the emergence of confinement at long distances, and converges exponentially with increasing distance of the interactions. Using multiple error-mitigation strategies, up to 14 Trotter steps of time evolution are performed, employing 13,858 two-qubit gates (with a CNOT depth of 370). The propagation of hadrons is clearly identified, with results that compare favorably with Matrix Product State simulations. Finally, prospects for a near-term quantum advantage in simulations of hadron scattering are discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2024

Error mitigated metasurface-based randomized measurement schemes

Estimating properties of quantum states via randomized measurements has become a significant part of quantum information science. In this paper, we design an innovative approach leveraging metasurfaces to perform randomized measurements on photonic qubits, together with error mitigation techniques that suppress realistic metasurface measurement noise. Through fidelity and purity estimation, we confirm the capability of metasurfaces to implement randomized measurements and the unbiased nature of our error-mitigated estimator. Our findings show the potential of metasurface-based randomized measurement schemes in achieving robust and resource-efficient estimation of quantum state properties. Published by the American Physical Society 2024

Ren, Hang (ORCID:0000000255448692)↗
DOE OSTI2024

Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024

Physics↗