Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum Computing Qubit”

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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
NASA NTRS2018

A Blueprint for Demonstrating Quantum Supremacy with Superconducting Qubits

Long coherence times and high fidelity control recently achieved in scalable superconducting circuits paved the way for the growing number of experimental studies of many-qubit quantum coherent phenomena in these devices. Albeit full implementation of quantum error correction and fault tolerant quantum computation remains a challenge the near term pre-error correction devices could allow new fundamental experiments despite inevitable accumulation of errors. One such open question foundational for quantum computing is achieving the so called quantum supremacy, an experimental demonstration of a computational task that takes polynomial time on the quantum computer whereas the best classical algorithm would require exponential time and/or resources. It is possible to formulate such a task for a quantum computer consisting of less than a 100 qubits. The computational task we consider is to provide approximate samples from a non-trivial quantum distribution. This is a generalization for the case of superconducting circuits of ideas behind boson sampling protocol for quantum optics introduced by Arkhipov and Aaronson. In this presentation we discuss a proof-of-principle demonstration of such a sampling task on a 9-qubit chain of superconducting gmon qubits developed by Google. We discuss theoretical analysis of the driven evolution of the device resulting in output approximating samples from a uniform distribution in the Hilbert space, a quantum chaotic state. We analyze quantum chaotic characteristics of the output of the circuit and the time required to generate a sufficiently complex quantum distribution. We demonstrate that the classical simulation of the sampling output requires exponential resources by connecting the task of calculating the output amplitudes to the sign problem of the Quantum Monte Carlo method. We also discuss the detailed theoretical modeling required to achieve high fidelity control and calibration of the multi-qubit unitary evolution in the device. We use a novel cross-entropy statistical metric as a figure of merit to verify the output and calibrate the device controls. Finally, we demonstrate the statistics of the wave function amplitudes generated on the 9-gmon chain and verify the quantum chaotic nature of the generated quantum distribution. This verifies the implementation of the quantum supremacy protocol.

Kechedzhi, Kostyantyn↗
DOE OSTI2025

QUCODE: End-to-End Qubit Co-Design

The design of a quantum computer can be broken down into different steps, e.g., the material science aspect of designing qubits and devices, considerations of controlling the state of the qubits and their environment, the computer science aspects of mapping algorithms to the available primitives of the quantum computer, and the programming of an application in terms of the available algorithms. Research in these areas is currently fairly isolated, and there is framework for an end-to-end design approach where a desired application informs the choice of materials for the qubits and their environment, and vice versa.We identify knowledge gaps and opportunities for research that builds on existing PNNL capabilities.

36 MATERIALS SCIENCE↗
DOE OSTI2026

Superconducting qubits for particle detection and fundamental tests of quantum mechanics

Many fundamental questions at the interface of quantum mechanics, gravity, and measurement remain relatively unexplored in the laboratory. These include whether spatial superpositions experience gravitational redshift, how the quantum Zeno effect propagates through entangled systems, and whether quantum information is globally conserved or fundamentally lost during measurement-induced wavefunction collapse. In this colloquium, I will discuss how superconducting qubits—developed primarily for quantum computing—can be repurposed as ultra sensitive detectors to probe these questions and to search for low-energy particle interactions. I will describe my work at Fermilab on stabilizing these devices to the level required for next-generation qubit-based sensors. This includes mitigating decoherence from infrared radiation and cosmic rays, using machine-learning techniques to accelerate superconducting qubit design, and leveraging the quantum Zeno effect to improve coherence times and suppress qubit frequency fluctuations. Together, these advances point toward a new class of quantum sensors capable of testing fundamental physics.

Seidel, Olivia [Fermilab]↗
NASA NTRS2008

Scheme for Quantum Computing Immune to Decoherence

A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report that the derivation provides explicit constructions for finding the exchange couplings in the physical basis needed to implement any arbitrary 1-qubit gate. These constructions lead to spintronic encodings of quantum logic that are more efficient than those of a previously published scheme that utilizes a universal but fixed set of gates.

Williams, Colin↗
DOE OSTI2025

Understanding and Mitigating Coherence and Frequency Fluctuations in Superconducting Transmon Qubits

Transmon qubits are a cornerstone of superconducting quantum computing platforms. However‚ their frequency and coherence properties exhibit temporal fluctuations‚ leading to performance degradation in quantum processors over time. A common mitigation approach involves frequent recalibration‚ which‚ while effective‚ results in increased system downtime. Enhancing the long-term stability of transmon qubits is therefore critical for scalable and reliable quantum computing. In this study‚ we develop novel techniques for understanding the underlying mechanisms driving frequency and coherence fluctuations in fixed-frequency transmon qubits. We further explore strategies to mitigate these instabilities‚ aiming to improve overall system robustness. Our findings provide insights into optimizing superconducting quantum hardware for practical applications.

Roy, Tanay [Fermilab]↗
DOE OSTI2026

Quantum utility in simulating the real-time dynamics of the Fermi–Hubbard model using superconducting quantum computers

The Fermi–Hubbard model is a fundamental model in condensed matter physics that describes strongly correlated electrons. On the other hand, quantum computers are emerging as powerful tools for exploring the complex dynamics of these quantum many-body systems. In this work, we demonstrate the quantum simulation of the one-dimensional Fermi–Hubbard model using IBM's superconducting quantum computers, employing over 100 qubits. We introduce a first-order Trotterization scheme and extend it to an optimized second-order Trotterization for the time evolution in the Fermi–Hubbard model, specifically tailored for the limited qubit connectivity of quantum architectures, such as IBM's platforms. Notably, both Trotterization approaches are scalable and maintain a constant circuit depth at each Trotter step, regardless of the qubit count, enabling us to precisely investigate the relaxation dynamics in the Fermi–Hubbard model by measuring the expectation value of the Néel observable (staggered magnetization) for time-evolved quantum states. Lastly, our successful measurement of expectation values in such large-scale quantum many-body systems, especially at longer time scales with larger entanglement, highlights the quantum utility of superconducting quantum platforms over conventional classical approximation methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Harnessing the Quantum Zeno Effect in superconducting qubits for particle detection

Superconducting qubits, originally developed for quantum computing, are emerging as a potentially powerful tool for detecting low-energy particle interactions, such as dark matter and neutrinos. These devices can register energy deposits as small as a few meV, dramatically lowering the detection threshold compared to conventional sensors. However, their deployment in rare-event searches is hampered by a critical and unresolved background: Two-Level Systems (TLSes). TLSes are material defects that can scramble qubit frequencies and coherence times in a way that resembles particle energy deposits. Such false signals can critically limit the sensitivity and extend experimental runtimes for qubit-based sensors by years. This talk introduces a novel method to eliminate TLSes as a background source in superconducting qubit-based detectors. By harnessing the Quantum Zeno Effect (QZE), a well-established quantum phenomenon where frequent observation inhibits system evolution, I will discuss the possibility of “freezing” these TLS defects in place. This effectively suppresses their interference, stabilizes qubit behavior, and opens the door to using TLSes themselves as auxiliary sensors. I have already identified target TLSes and observed early signs of QZE-like dynamics in Fermilab-fabricated devices. The method builds on my existing collaborations at Fermilab’s Quantum Information Testbed (QUIET), with access to low muon flux cryogenic facilities 100 meters underground, control electronics, and expert mentors across multiple institutions. By removing a key bottleneck to superconducting sensor deployment, this research targets advancing the development of a general-purpose technique to enhance sensitivity, reduce false positives, and accelerate discovery in searches for dark matter, neutrinos, and other rare phenomena.

Seidel, Olivia [Texas U., Arlington]↗
DOE OSTI2026

Unitary Qubit Lattice Algorithms for Plasma Physics

This final technical report summarizes research conducted under DOE Award DE-SC0021653 to develop unitary Quantum Lattice Algorithms for modeling electromagnetic wave propagation and scattering in complex media, including plasmas. The project developed and validated quantum-inspired formulations of Maxwell's equations that preserve unitary evolution and can be evaluated on classical high-performance computing systems while providing a foundation for future quantum-computing implementations. Major accomplishments include the development of two- and three-dimensional algorithms for electromagnetic scattering; scalable, distributed-memory implementations demonstrated on the Perlmutter supercomputer; formulations for nonlinear lossless fluid dynamics and cold, lossless, inhomogeneous magnetized plasmas; and an explicit quantum algorithm for a time-discretized Lorenz model. Simulations reproduced a range of characteristic wave phenomena, including transient effects that are not readily apparent in conventional frequency-domain studies, demonstrating the effectiveness of the proposed approach for modeling complex electromagnetic and plasma systems. The work establishes a unified theoretical and computational framework for quantum and quantum-inspired simulation and provides a foundation for future implementation on fault-tolerant quantum systems.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Cost of emulating a small quantum annealing problem in the circuit model

Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.

Quantum algorithms & computation↗
DOE OSTI2025

Quantum dynamics simulation of the advection-diffusion equation

The advection-diffusion equation is simulated via several quantum algorithms. Three formulations are considered: (1) Trotterization, (2) variational quantum time evolution (VarQTE), and (3) adaptive variational quantum dynamics simulation (AVQDS). These schemes were originally developed for the Hamiltonian simulation of many-body quantum systems. The finite-difference discretized operator of the transport equation is formulated as a Hamiltonian and solved without the need for ancillary qubits. Computations are conducted on a quantum simulator (IBM Qiskit Aer) and a superconducting quantum hardware (IBM Fez). The former emulates the latter without the noise. The actual hardware implementation experiences significant noise. The results of the quantum simulator are compared with data from direct numerical simulation (DNS) with infidelities of the order 10 −5 . In the quantum simulator, Trotterization is observed to have the lowest infidelity and is suitable for fault-tolerant computation. The AVQDS algorithm requires the lowest gate count and circuit depth. The VarQTE algorithm is the next best in terms of gate counts, but the number of its optimization variables is directly proportional to the number of qubits. Due to current hardware limitations, Trotterization cannot be implemented, as it has an overwhelmingly large number of operations. Meanwhile, AVQDS and VarQTE can be executed at the hardware level. These algorithms present a new paradigm for computational transport phenomena on quantum computers.

Alipanah, Hirad [Univ. of Pittsburgh, PA (United S↗
DOE OSTI2025

A Typology of Quantum-Classical Faults

This paper introduces an extended taxonomy of faults specific to hybrid quantum-classical systems, addressing the unique challenges that arise from integrating quantum accelerators into high-performance computing (HPC) infrastructures. Building on the foundational fault classification by Avizienis et al., we incorporate fault types unique to quantum computing-such as qubit decoherence, spontaneous gate errors, and photon loss-alongside traditional and human-induced faults including development errors, operational mistakes, and malicious attacks. Our taxonomy classifies faults by their origin (natural vs. human-made), intent (accidental, deliberate non-malicious, or malicious), system boundaries (internal vs. external), and persistence (transient to permanent). We also explore how different architectural integration patterns-ranging from tight coupling to loose on-premise and cloud-based configurations-shape the manifestation and propagation of faults. These scenarios are analyzed in terms of timing mismatches, interface inconsistencies, and security threats such as data tampering and denial-of-service attacks. Through this fault-centric lens, we aim to support the co-design of dependable quantum-classical systems and highlight the critical role that integration strategies play in ensuring reproducibility, resilience, and security across hybrid computing platforms.

Giusto, Edorado [University of Naples Federico II,↗
DOE OSTI2025

Optimizing qubit control pulses for state preparation

In the burgeoning field of quantum computing, the precise design and optimization of quantum pulses are essential for enhancing qubit operation fidelity. This study focuses on refining the pulse engineering techniques for superconducting qubits, employing a detailed analysis of square and Gaussian pulse envelopes under various approximation schemes. We evaluated the effects of coherent errors induced by naive pulse designs. Furthermore, we identified the sources of these errors in the Hamiltonian model’s approximation level. We mitigated these errors through adjustments to the external driving frequency and pulse durations, thus implementing a pulse scheme with stroboscopic error reduction. Our results demonstrate that these refined pulse strategies improve performance and reduce coherent errors. Moreover, the techniques developed herein are applicable across different quantum architectures, such as ion-trap, atomic, and photonic systems.

Chirp modulation↗
DOE OSTI2025

Non-Markovian dynamics of a superconducting qubit in a phononic bandgap

Reducing decoherence in quantum computers rapidly decreases the overhead needed to construct a logical qubit from physical qubits. In solid-state systems, a class of defects known as two-level systems is a major source of decoherence. Currently, superconducting qubit experiments reduce dissipation due to the two-level systems by using large device dimensions. However, this approach only provides partial protection and results in a trade-off between qubit size and dissipation. In this work, we instead engineer the interactions between a qubit and the surrounding two-level systems using phononics. We fabricate a superconducting qubit on a phononic-bandgap metamaterial that suppresses phonon emission mediated by the two-level systems. The phonon-engineered bath of two-level systems shows increased lifetime and affects the thermalization dynamics of the qubit. Within the phononic bandgap, we observe the emergence of a non-Markovian qubit behaviour. Further, combined with qubit miniaturization, our approach could substantially extend the qubit relaxation times.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Low-overhead transversal fault tolerance for universal quantum computation

Fast, reliable logical operations are essential for realizing useful quantum computers. By redundantly encoding logical qubits into many physical qubits and using syndrome measurements to detect and correct errors, we can achieve low logical error rates. However, for many practical quantum error correction codes such as the surface code, owing to syndrome measurement errors, standard constructions require multiple extraction rounds—of the order of the code distance d—for fault-tolerant computation, particularly considering fault-tolerant state preparation. Here we show that logical operations can be performed fault-tolerantly with only a constant number of extraction rounds for a broad class of quantum error correction codes, including the surface code with magic state inputs and feedforward, to achieve ‘transversal algorithmic fault tolerance’. Through the combination of transversal operations7 and new strategies for correlated decoding, despite only having access to partial syndrome information, we prove that the deviation from the ideal logical measurement distribution can be made exponentially small in the distance, even if the instantaneous quantum state cannot be made close to a logical codeword because of measurement errors. We supplement this proof with circuit-level simulations in a range of relevant settings, demonstrating the fault tolerance and competitive performance of our approach. Furthermore, our work sheds new light on the theory of quantum fault tolerance and has the potential to reduce the space–time cost of practical fault-tolerant quantum computation by over an order of magnitude.

Zhou, Hengyun [QuEra Computing, Boston, MA (United↗
DOE OSTI2026

Two-Level System Spectroscopy from Correlated Multilevel Relaxation in Superconducting Qubits

Transmon qubits are a cornerstone of modern superconducting quantum computing platforms. Temporal fluctuations of energy relaxation in these qubits are widely attributed to microscopic two-level systems (TLSs) in device dielectrics and interfaces, yet isolating individual defects typically relies on tuning the qubit or the TLS into resonance. We demonstrate a novel spectroscopy method for fixed-frequency transmons based on multilevel relaxation: repeated preparation of the second excited state and simultaneous $T_1$ extraction of the first and second excited states reveals characteristic correlations in the decay rates of adjacent transitions. From these correlations we identify one or more dominant TLSs and reconstruct their frequency drift over time. Remarkably, we find that TLSs detuned by $\gtrsim 100\,\mathrm{MHz}$ from the qubit transition can still significantly influence relaxation. The proposed method provides a powerful tool for TLS spectroscopy without the need to tune the transmon frequency, either via a flux-tunable inductor or AC-Stark shifts.

Roy, Tanay [Fermilab] (ORCID:000000019442862X)↗
DOE OSTI2026

Real-Time Detection of Charge Jumps in Superconducting Qubits with a Convolutional Neural Network

Ionizing radiation from cosmic rays and gammas can induce discontinuous jumps in the environmental charge of superconducting qubits (charge jumps), causing correlated errors that challenge fault-tolerant quantum computing while simultaneously providing a detection signature for quantum sensing applications. Current detection methods operate offline, introducing latency incompatible with in-the-loop qubit control. In this paper, an online detector of charge jumps for superconducting qubits, based on a dilated causal convolutional neural network (DCCNN) designed for in-the-loop deployment on the Quantum Instrumentation Control Kit (QICK) platform, is presented. The network is trained on synthetic Ramsey tomography scans generated from qubit templates measured at the Northwestern Experimental Underground Site (NEXUS) at Fermilab, and translated to FPGA firmware via hls4ml with ap_fixed$\langle 16,6 \rangle$ quantization, reaching a per-inference latency of $6.19 μ$s on the Zynq UltraScale+ RFSoC ZCU216. At this operating point the DCCNN matches the detection efficiency of the established offline $χ^2$ algorithm ($0.843 \pm 0.022$ vs. $0.866 \pm 0.020$ on $|Δq| \in [0.1, 0.5] e$ at matched false-positive rate), while requiring no per-qubit hyperparameter tuning. This shifts charge-jump detection from a post-hoc diagnostic to a control-loop primitive, enabling adaptive protocols that respond to radiation-induced events in situ, with applications to quantum-computing error mitigation and to the use of superconducting qubits as particle detectors.

Gaytan-Villarreal, Daniel [Carnegie Mellon U.]↗
DOE OSTI2025

A tweezer array with 6,100 highly coherent atomic qubits

Optical tweezer arrays have transformed atomic and molecular physics, now forming the backbone for a range of leading experiments in quantum computing, simulation and metrology. Typical experiments trap tens to hundreds of atomic qubits and, recently, systems with around 1,000 atoms were realized without defining qubits or demonstrating coherent control. However, scaling to thousands of atomic qubits with long coherence times and low-loss and high-fidelity imaging is an outstanding challenge and critical for progress in quantum science, particularly towards quantum error correction (QEC). Here we experimentally realize an array of optical tweezers trapping more than 6,100 neutral atoms in around 12,000 sites, simultaneously surpassing state-of-the-art performance for several metrics that underpin the success of the platform. Specifically, while scaling to such a large number of atoms, we demonstrate a coherence time of 12.6(1) s, a record for hyperfine qubits in an optical tweezer array. We show room-temperature trapping lifetimes of about 23 min, enabling record-high imaging survival of 99.98952(1)% with an imaging fidelity of more than 99.99%. We present a plan for zone-based quantum computing and demonstrate necessary coherence-preserving qubit transport and pick-up/drop-off operations on large spatial scales, characterized through interleaved randomized benchmarking. Our results, along with recent developments, indicate that universal quantum computing and QEC with thousands to tens of thousands of physical qubits could be a near-term prospect.

atomic and molecular physics↗