Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum computing, 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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Digital quantum simulation of cavity quantum electrodynamics: insights from superconducting and trapped ion quantum testbeds

We explore the potential for hybrid development of quantum hardware where currently available quantum computers simulate open cavity quantum electrodynamical (CQED) systems for applications in optical quantum communication, simulation and computing. Our simulations make use of a recent quantum algorithm that maps the dynamics of a singly excited open Tavis–Cummings model containing N atoms coupled to a lossy cavity. We report the results of executing this algorithm on two noisy intermediate-scale quantum computers: a superconducting processor and a trapped ion processor, to simulate the population dynamics of an open CQED system featuring N = 3 atoms. By applying technology-specific transpilation and error mitigation techniques, we minimize the impact of gate errors, noise, and decoherence in each hardware platform, obtaining results which agree closely with the exact solution of the system. These results can be used as a recipe for efficient and platform-specific quantum simulation of cavity–emitter systems on contemporary and future quantum computers.

cavity QED↗
DOE OSTI2020

Systematic Crosstalk Mitigation for Superconducting Qubits via Frequency-Aware Compilation

One of the key challenges in current Noisy Intermediate-Scale Quantum (NISQ) computers is to control a quantum system with high-fidelity quantum gates. There are many reasons a quantum gate can go wrong - for superconducting transmon qubits in particular, one major source of gate error is the unwanted crosstalk between neighboring qubits due to a phenomenon called frequency crowding. We motivate a systematic approach for understanding and mitigating the crosstalk noise when executing near-term quantum programs on superconducting NISQ computers. Here, we present a general software solution to alleviate frequency crowding by systematically tuning qubit frequencies according to input programs, trading parallelism for higher gate fidelity when necessary. The net result is that our work dramatically improves the crosstalk resilience of tunable-qubit, fixed-coupler hardware, matching or surpassing other more complex architectural designs such as tunable-coupler systems. On NISQ benchmarks, we improve worst-case program success rate by 13.3x on average, compared to existing traditional serialization strategies.

Computer architecture↗
DOE OSTI2025

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight 𝑤. For sufficiently small values of 𝑤 and for circuits involving up to 58 qubits, we demonstrate an exponential speedup, albeit of a lower quality than the speedup predicted for the noiseless algorithm. The speedup exponent and the range of 𝑤 values for which an exponential speedup exists are significantly enhanced when the computation is protected by dynamical decoupling. Further enhancement is achieved with measurement error mitigation. This case constitutes a demonstration of a bona fide quantum advantage for an Abelian hidden subgroup problem.

computation↗
DOE OSTI2024

Enhancing scalability and accuracy of quantum poisson solver

The Poisson equation has many applications across the broad areas of science and engineering. Most quantum algorithms for the Poisson solver presented so far either suffer from lack of accuracy and/or are limited to very small sizes of the problem and thus have no practical usage. In this regard, our previous work showed a proof-of-concept demonstration in advancing quantum Poisson solver algorithm and validated preliminary results for a simple case of 3 x 3 problem. In this work, we delve into comprehensive research details, presenting the results on up to 15 x 15 problems that include step-by-step improvements in Poisson equation solutions, scaling performance, and experimental exploration. In particular, we demonstrate the implementation of eigenvalue amplification by a factor of up to 2 8 , achieving a significant improvement in the accuracy of our quantum Poisson solver and comparing that to the exact solution. Additionally, we present success probability results, highlighting the reliability of our quantum Poisson solver. Moreover, we explore the scaling performance of our algorithm against the circuit depth and width, demonstrating how our approach scales with larger problem sizes and thus further solidifies the practicality of easy adaptation of this algorithm in real-world applications. We also discuss a multilevel strategy for how this algorithm might be further improved to explore much larger problems with greater performance. Finally, through our experiments on the IBM quantum hardware, we conclude that though overall results on the existing NISQ hardware are dominated by the error in the CNOT gates, this work opens a path to realizing a multidimensional Poisson solver on near-term quantum hardware.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multiqubit noise deconvolution and characterization

We present a noise deconvolution technique for obtaining noiseless expectation values of noisy observables at the output of multiqubit quantum channels. For any number of qubits or in the presence of correlations, our protocol applies to any mathematically invertible noise model, even when its inverse map is not physically implementable, i.e., when it is neither completely positive nor trace preserving. For a generic observable affected by Pauli noise it provides a quadratic speedup, always producing a rescaling of its Pauli basis components. We show that it is still possible to achieve the deconvolution while experimentally estimating the noise parameters, whenever these are unknown (bypassing resource-heavy techniques such as quantum process tomography). We provide a simulation, with examples for both Pauli and non-Pauli channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Quantum computation of phase transition in the massive Schwinger model

Abstract As pointed out by Coleman, physical quantities in the Schwinger model depend on a parameter θ that determines the background electric field. There is a phase transition for θ = π only. We develop a momentum space formalism on a lattice and use it to perform a quantum computation of the critical point of this phase transition on the NISQ device IMB Q Lima. After error mitigation, our results give strong indication of the existence of a critical point at m / e ≃ 0.32, where m is the bare fermion mass and e is the coupling strength, in good agreement with the classical numerical result m / e ≃ 0.3335.

Physics↗
DOE OSTI2020

Zero-noise extrapolation for quantum-gate error mitigation with identity insertions

Quantum-gate errors are a significant challenge for achieving precision measurements on noisy intermediate-scale quantum (NISQ) computers. Here, this paper focuses on zero-noise extrapolation (ZNE), a technique that can be implemented on existing hardware, studying it in detail and proposing modifications to existing approaches. In particular, we consider identity insertion methods for amplifying noise because they are hardware agnostic. We build a mathematical formalism for studying existing ZNE techniques and show how higher order polynomial extrapolations can be used to systematically reduce depolarizing errors. Furthermore, we introduce a method for amplifying noise that uses far fewer gates than traditional methods. This approach is compared with existing methods for simulated quantum circuits. Comparable or smaller errors are possible with fewer gates, which illustrates the potential for empowering an entirely new class of moderate-depth circuits on near term hardware.

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

Realization of fermionic Laughlin state on a quantum processor

Strongly correlated topological phases of matter are central to modern condensed matter physics and quantum information technology but often challenging to probe and control in material systems. The experimental difficulty of accessing these phases has motivated the use of engineered quantum platforms for simulation and manipulation of exotic topological states. Among these, the Laughlin state stands as a cornerstone for topological matter, embodying fractionalization, anyonic excitations, and incompressibility. Although its bosonic analogs have been realized on programmable quantum simulators, a genuine fermionic Laughlin state has yet to be demonstrated on a quantum processor. Here, we realize the ν = 1/3 fermionic Laughlin state on IonQ’s trapped-ion quantum computer using an efficient and scalable Hamiltonian variational ansatz with 369 two-qubit gates on a 16-qubit circuit. Employing symmetry-verification error mitigation, we extract key observables that characterize the Laughlin state, including correlation hole, bulk-edge correspondence, and topological entanglement entropy, with strong agreement to exact diagonalization benchmarks. This work demonstrates an end-to-end workflow to simulate material-intrinsic topological orders and provides a starting point to explore its dynamics and excitations on digital quantum processors.

Shen, Lingnan [Univ. of Washington, Seattle, WA (U↗
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 OSTI2023

Quantum algorithms for geologic fracture networks

Abstract Solving large systems of equations is a challenge for modeling natural phenomena, such as simulating subsurface flow. To avoid systems that are intractable on current computers, it is often necessary to neglect information at small scales, an approach known as coarse-graining. For many practical applications, such as flow in porous, homogenous materials, coarse-graining offers a sufficiently-accurate approximation of the solution. Unfortunately, fractured systems cannot be accurately coarse-grained, as critical network topology exists at the smallest scales, including topology that can push the network across a percolation threshold. Therefore, new techniques are necessary to accurately model important fracture systems. Quantum algorithms for solving linear systems offer a theoretically-exponential improvement over their classical counterparts, and in this work we introduce two quantum algorithms for fractured flow. The first algorithm, designed for future quantum computers which operate without error, has enormous potential, but we demonstrate that current hardware is too noisy for adequate performance. The second algorithm, designed to be noise resilient, already performs well for problems of small to medium size (order 10–1000 nodes), which we demonstrate experimentally and explain theoretically. We expect further improvements by leveraging quantum error mitigation and preconditioning.

58 GEOSCIENCES↗
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 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 OSTI2025

Capturing the Page curve and entanglement dynamics of black holes in quantum computers

Quantum computers are emerging technologies expected to become important tools for exploring various aspects of fundamental physics in the future. Therefore, we pose the question of whether quantum computers can help us to study the Page curve and the black hole information dynamics, which has been a key focus in fundamental physics. In this regard, we rigorously examine the qubit transport model, a toy qubit model of black hole evaporation on IBM’s superconducting quantum computers, to shed light on this question. Specifically, we implement the quantum simulation of the scrambling dynamics in black holes using an efficient random unitary circuit. Furthermore, we employ the swap-based many-body interference protocol and the randomized measurement protocol to measure the entanglement entropy of Hawking radiation qubits in this model. Finally, by incorporating quantum error mitigation techniques into our challenging implementation of entanglement entropy measurement protocols on the IBM quantum hardware, we accurately determine the Rényi entropy in the qubit transport model, thus showcasing the utility of quantum computers for future investigations of complex quantum systems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Mitigating cosmic-ray-like correlated events with a modular quantum processor

Quantum processors based on superconducting qubits are being scaled to larger qubit numbers, enabling the implementation of small-scale quantum error-correction codes. However, catastrophic chip-scale correlated errors have been observed in these processors, attributed to, e.g., cosmic ray impacts, which challenge conventional error-correction codes such as the surface code. These events are characterized by a temporary but pronounced suppression of the qubit-energy relaxation times. Here, in this study, we explore the potential for modular quantum computing architectures to mitigate such correlated energy decay events. We measure cosmic-ray-like events in a quantum processor comprising a motherboard and two flip-chip bonded daughterboard modules, each module containing two superconducting qubits. We monitor the appearance of correlated qubit decay events within a single module and across the physically separated modules. We find that while decay events within one module are strongly correlated (over 85%), events in separate modules only display approximately 2% correlations. We also report coincident decay events in the motherboard and in either of the two daughterboard modules, providing further insight into the nature of these decay events. These results suggest that modular architectures, combined with bespoke errorcorrection codes, offer a promising approach for protecting future quantum processors from chip-scale correlated errors.

Wu, Xuntao [Univ. of Chicago, IL (United States)] ↗
DOE OSTI2024

Efficiently improving the performance of noisy quantum computers

Using near-term quantum computers to achieve a quantum advantage requires efficient strategies to improve the performance of the noisy quantum devices presently available. We develop and experimentally validate two efficient error mitigation protocols named "Noiseless Output Extrapolation" and "Pauli Error Cancellation" that can drastically enhance the performance of quantum circuits composed of noisy cycles of gates. By combining popular mitigation strategies such as probabilistic error cancellation and noise amplification with efficient noise reconstruction methods, our protocols can mitigate a wide range of noise processes that do not satisfy the assumptions underlying existing mitigation protocols, including non-local and gate-dependent processes. We test our protocols on a four-qubit superconducting processor at the Advanced Quantum Testbed. We observe significant improvements in the performance of both structured and random circuits, with up to 86 % improvement in variation distance over the unmitigated outputs. Our experiments demonstrate the effectiveness of our protocols, as well as their practicality for current hardware platforms.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Fast Z Z free entangling gates for superconducting qubits assisted by a driven resonator

Engineering high-fidelity two-qubit gates is an indispensable step toward practical quantum computing. For superconducting quantum platforms, one important setback is the stray interaction between qubits, which causes significant coherent errors. For transmon qubits, protocols for mitigating such errors usually involve fine-tuning the hardware parameters or introducing usually noisy flux-tunable couplers. In this work, we propose a simple scheme to cancel these stray interactions. The coupler used for such cancelation is a driven high-coherence resonator, where the amplitude and frequency of the drive serve as control knobs. Through the resonator-induced-phase interaction, the static Z Z coupling can be entirely neutralized. We numerically show that such a scheme can enable short and high-fidelity entangling gates, including cross-resonance controlled-not (cnot) gates within 40 ns and adiabatic controlled- Z gates within 140 ns. Our architecture is not only Z Z -free, but also contains no extra noisy components, such that it preserves the coherence times of fixed-frequency transmon qubits. With the state-of-the-art coherence times, the error of our cross-resonance cnot gate can be reduced to below 10 − 4 .

Huang, Ziwen↗