Search NASA⌕ Search

SEARCH · Search NASA

Results for “quantum computer”

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 559 records · Page 31
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

High-fidelity remote entanglement of trapped atoms mediated by time-bin photons

Abstract Photonic interconnects between quantum processing nodes are likely the only way to achieve large-scale quantum computers and networks. The bottleneck in such an architecture is the interface between well-isolated quantum memories and flying photons. We establish high-fidelity entanglement between remotely separated trapped atomic qubit memories, mediated by photonic qubits stored in the timing of their pulses. Such time-bin encoding removes sensitivity to polarization errors, enables long-distance quantum communication, and is extensible to quantum memories with more than two states. Using a measurement-based error detection process and suppressing a fundamental source of error due to atomic recoil, we achieve an entanglement fidelity of 97% and show that fundamental limits due to atomic recoil still allow fidelities in excess of 99.9%.

Science & Technology - Other Topics↗
DOE OSTI2026

Sparse non-Markovian Noise Modeling of Transmon-Based Multi-Qubit Operations

The influence of noise on quantum dynamics is one of the main factors preventing current quantum processors from performing accurate quantum computations. Sufficient noise characterization and modeling can provide key insights into the effect of noise on quantum algorithms and inform the design of targeted error protection protocols. However, constructing effective noise models that are sparse in model parameters, yet predictive can be challenging. In this work, we present an approach for effective noise modeling of multi-qubit operations on transmon-based devices. Through a comprehensive characterization of seven devices offered by the IBM Quantum Platform, we show that the model can capture and predict a wide range of single- and two-qubit behaviors, including non-Markovian effects resulting from spatiotemporally correlated noise sources. The model’s predictive power is further highlighted through multi-qubit dynamical decoupling demonstrations and an implementation of the variational quantum eigensolver. As a training proxy for the hardware, we show that the model can predict expectation values within a relative error of 0.5%; this is a sevenfold improvement over default hardware noise models. Through these demonstrations, we highlight key error sources in superconducting qubits and illustrate the utility of reduced noise models for predicting hardware dynamics.

open quantum systems & decoherence↗
DOE OSTI2024

Robust Iterative Method for Symmetric Quantum Signal Processing in All Parameter Regimes

Here, this paper addresses the problem of solving nonlinear systems in the context of symmetric quantum signal processing (QSP), a powerful technique for implementing matrix functions on quantum computers. Symmetric QSP focuses on representing target polynomials as products of matrices in SU(2) that possess symmetry properties. We present a novel Newton’s method tailored for efficiently solving the nonlinear system involved in determining the phase factors within the symmetric QSP framework. Our method demonstrates rapid and robust convergence in all parameter regimes, including the challenging scenario with ill-conditioned Jacobian matrices, using standard double precision arithmetic operations. For instance, solving symmetric QSP for a highly oscillatory target function α cos(1000x) (polynomial degree ≈ 1433) takes 6 iterations to converge to machine precision when α = 0.9, and the number of iterations only increases to 18 iterations when α = 1 – 10 -9 with a highly ill-conditioned Jacobian matrix. Leveraging the matrix product state structure of symmetric QSP, the computation of the Jacobian matrix incurs a computational cost comparable to a single function evaluation. Moreover, we introduce a reformulation of symmetric QSP using real-number arithmetics, further enhancing the method’s efficiency. Extensive numerical tests validate the effectiveness and robustness of our approach, which has been implemented in the QSPPACK software package.

97 MATHEMATICS AND COMPUTING↗
NASA NTRSDate not supplied

High dimensional similarity search with quantum assisted variational autoencoder

Recent progress in quantum algorithms and hardware is indicator of the potential importance of quantum computing in the next future. However, finding suitable application areas remains an active area of research. Quantum machine learning [1] is touted as a potential approach to demonstrate quantum advantage within both the gate-model [2,3] and the adiabatic [4,5] schemes. For instance, the Quantum-assisted Variational Autoencoder (QVAE) [6] has been proposed as a quantum enhancement to the discrete VAE [7]. We extend on previous work and study the real-world applicability of a QVAE, specifically, for similarity search in large-scale high dimensional datasets. While similarity search algorithms are available for low dimensional datasets, scaling to billion-scale datasets with thousands of dimensions is non-trivial. We show how the latent-space representation of a QVAE can be used to construct a space-efficient search index. We back up our claims by experimental results which show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the Moderate Resolution Imaging Spectroradiometer (MODIS) dataset. Further, we show real-world speedups compared to linear search and demonstrate memory efficient scaling to large-scale datasets.

Nicholas D Gao↗
NASA NTRSDate not supplied

High-Dimensional Similarity Search with Quantum-Assisted Variational Autoencoder

Recent progress in quantum algorithms and hardware indicates the potential importance of quantum computing in the near future. However, finding suitable application areas remains an active area of research. Quantum machine learning is touted as a potential approach to demonstrate quantum advantage within both the gate-model and the adiabatic schemes. For instance, the QVAE has been proposed as a quantum enhancement to the discrete VAE. We extend on previous work and study the real-world applicability of a QVAE by presenting a proof-of-concept for similarity search in large-scale high-dimensional datasets. While exact and fast similarity search algorithms are available for low dimensional datasets, scaling to high-dimensional data is non-trivial. We show how to construct a space-efficient search index based on the latent space representation of a QVAE. Our experiments show a correlation between the Hamming distance in the embedded space and the Euclidean distance in the original space on the MODIS dataset. Further, we find real-world speedups compared to linear search and demonstrate memory-efficient scaling to half a billion data points.

Data mining, similarity search, quantum machine le↗
DOE OSTI2024

Growth of Native Oxides of Niobium Thin Films for Superconducting Qubits with Etching Chemistry

Niobium thin films have been broadly applied in building superconducting qubits for quantum computing hardware. While improvements have been made by device engineering efforts, scaling the energy-sensitive quantum system requires materials study for further improvements. In this study, we performed XPS and ToF-SIMS analysis for Nb thin films across samples with different manufacturing techniques. By varying the air exposure time of the samples, this research comparatively investigates the chemical and depth profile of native oxides before and after the etching process. We observe a rapid logarithmic growth of oxide thickness across all samples and the dominant presence and growth of Niobium pentoxide in atomic percentage concentration on the surface. This comparative study provides insight into oxides mitigation strategies and correlation with qubits performance.

Lei, Zhicheng↗
DOE OSTI2026

Multi-Agent Control Planes for Quantum Networks: A Scalable Architecture for Autonomous Quantum Internet Management

Quantum networks are expected to enable distributed quantum computing, secure communication, and global entanglement distribution. However, operating such networks presents significant challenges, including stochastic quantum processes, fragile entanglement resources, dynamic topology, and cross-layer control requirements. Current quantum network control architectures largely rely on centralized or hierarchical controllers inspired by classical software-defined networking (SDN). While effective for small testbeds, these approaches face scalability, latency, and reliability limitations as quantum networks grow. This paper proposes a multi-agent control plane architecture for quantum networks. In this design, intelligent software agents operate at quantum nodes, repeaters, and orchestration layers, collectively managing entanglement generation, routing, purification, and scheduling. The distributed intelligence of the agent system allows the network to adapt dynamically to quantum hardware variability and environmental noise. We argue that multi-agent systems provide significant advantages over centralized control approaches, including scalability, resilience, local autonomy, and real-time adaptation. The paper discusses architectural design principles, agent coordination mechanisms, and research challenges in deploying multi-agent control planes for the emerging quantum Internet.

Alnajjar, Anees [ORNL] (ORCID:0000000237101601)↗
DOE OSTI2024

Deriving Effective Coupling Strength With Born-Oppenheimer Approx.

Tunable couplers have been important in the development of superconducting quantum computers. The ability to maintain zero coupling between qubits during operation, a feature of high-fidelity quantum gates, has been shown to be possible with the use of tunable couplers. As an example, Sete et al., 2021 showed this was possible with a tunable coupler between transmons: the qubit-coupler and qubit-qubit couplings create a net effective coupling strength between the qubits that can be tuned to zero. However, the derivation of the effective coupling strength between the qubits is quite complex. We propose a simpler method of obtaining this effective coupling with the Born-Oppenheimer approximation.

Wichmann, Conrad↗
DOE OSTI2024

Simulating topological quantum gates in two-dimensional magnet-superconductor hybrid structures

The creation of topological quantum gates using Majorana zero modes—an outstanding problem in the field of topological quantum computing—relies on our ability to control the braiding process in time and space. Here, we propose two-dimensional magnet-superconductor hybrid structures as a new platformfor the successful implementation of topologically protected √σ z -, σ z - and σ x -quantum gates using Majorana zero modes. Employing a novel theoretical formalism to compute the full timedependent many-body wave-function and utilizing a braiding protocol motivated by recent advances in electron-spin-resonance techniques we simulate quantum gates in 2D systems up to 600 sites, on timescales from a few femto- to nanoseconds. We demonstrate that the braiding process can be visualized in time and space by computing the non-equilibrium local density of states, which is proportional to the time-dependent differential conductance measured in scanning tunneling spectroscopy experiments, allowing us to directly image Majorana world lines.

Superconducting properties and materials↗
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 OSTI2026

Translation-Invariant Quantum Algorithms for Ordered Search are Optimal

Ordered search is the task of finding an item in an ordered list using comparison queries. The best exact classical algorithm for this fundamental problem uses [log 2 n] queries for a list of length n. Quantum computers can achieve a constant-factor speedup, but the best possible coefficient of log 2 n for exact quantum algorithms is only known to lie between (ln2)/π ≈ 0.221 and 4/log 2 605 ≈ 0.4333. We consider a special class of translation-invariant algorithms with no workspace, introduced by Farhi, Goldstone, Gutmann, and Sipser, that has been used to find the best known upper bounds. First, we show that any bounded-error, k-query quantum algorithm for ordered search can be implemented by a k-query algorithm in this special class. Second, we use linear programming to show that the best exact 5-query quantum algorithm can search a list of length 7265, giving an ordered search algorithm that asymptotically uses 5 log 7265 n ≈ 0.390 log 2 n quantum queries.

Translation-invariant quantum algorithms↗
DOE OSTI2025

Quantum Zeno Monte Carlo for computing observables

The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These devices have the potential to address classically challenging problems with polynomial computational time using quantum properties. However, they remain susceptible to noise, necessitating noise resilient algorithms. We introduce Quantum Zeno Monte Carlo (QZMC), a classical-quantum hybrid algorithm that demonstrates resilience to device noise and Trotter errors while showing polynomial computational cost for a gapped system. QZMC computes static and dynamic properties without requiring initial state overlap or variational parameters, offering reduced quantum circuit depth.

Han, Mancheon [Korea Institute for Advanced Study ↗
DOE OSTI2025

Single-Photon Generation: Materials, Techniques, and the Rydberg Exciton Frontier

Due to their quantum nature, single-photon emitters (SPE) generate individual photons in bursts or streams. They are paramount in emerging quantum technologies such as quantum key distribution, quantum repeaters, and measurement-based quantum computing. Many such systems have been reported in the last three decades, from rubidium atoms coupled to cavities to semiconductor quantum dots and color centers implanted in waveguides. This review article highlights different solid-state and atomic systems with on-demand and controlled single-photon generation. We discuss and compare the performance metrics, such as purity and indistinguishability, for these sources and evaluate their potential for different applications. Finally, a new potential single-photon source, based on the Rydberg exciton in solid-state metal oxide thin films, is introduced, where we discuss its promising features and unique advantages in fabricating quantum chips for quantum photonic applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2026

Sapphire Substrate Trenching to Advance Superconducting High-Coherence Quantum Devices

Achieving longer coherence times in superconducting qubits is essential for advancing quantum information processing and enabling scalable quantum computing. This work presents an innovative fabrication strategy focused on sapphire trenching of the substrate of superconducting high-coherence quantum devices, developed by the SQMS Nanofabrication Taskforce in collaboration with the materials characterization team. In this talk, we present a method to efficiently and consistently trench into the sapphire substrate, without compromising the surface roughness or profile of the etched sapphire. In the literature, trenching in the substrate has been shown to decrease losses, unwanted coupling and thermal stress. Sapphire’s strong covalent bonds make it harder to etch compared to silicon, yet it is more favorable for high-coherence quantum devices due to its lower dielectric losses. This innovative technique opens new possibilities for superconducting qubit fabrication: we fabricated high coherence qubit chips on sapphire substrates with trenching, to demonstrate that it will help pushing towards higher coherence times. By integrating this work with ongoing junction process optimization, design innovation, materials characterization and exploration, we outline a clear pathway toward transmon coherence times reaching millisecond scales and beyond.

Garattoni, S. [Fermilab]↗
DOE OSTI2026

Sapphire Substrate Trenching to Advance Superconducting High-Coherence Quantum Devices

Achieving longer coherence times in superconducting qubits is essential for advancing quantum information processing and enabling scalable quantum computing. This work presents an innovative fabrication strategy focused on sapphire trenching of the substrate of superconducting high-coherence quantum devices, developed by the SQMS Nanofabrication Taskforce in collaboration with the materials characterization team. In this talk, we present a method to efficiently and consistently trench into the sapphire substrate, without compromising the surface roughness or profile of the etched sapphire. In the literature, trenching in the substrate has been shown to decrease losses, unwanted coupling and thermal stress. Sapphire’s strong covalent bonds make it harder to etch compared to silicon, yet it is more favorable for high-coherence quantum devices due to its lower dielectric losses. This innovative technique opens new possibilities for superconducting qubit fabrication: we fabricated high coherence qubit chips on sapphire substrates with trenching, to demonstrate that it will help pushing towards higher coherence times. By integrating this work with ongoing junction process optimization, design innovation, materials characterization and exploration, we outline a clear pathway toward transmon coherence times reaching millisecond scales and beyond.

Garattoni, S. [Fermilab]↗
DOE OSTI2025

Impact of dynamics, entanglement and Markovian noise on the fidelity of few-qubit digital quantum simulation

Quantum algorithms have been proposed to accelerate the simulation of the chaotic dynamical systems that are ubiquitous in the physics of plasmas. Quantum computers without error correction might even use noise to their advantage to calculate the Lyapunov exponent by measuring the Loschmidt echo fidelity decay rate. For the first time, digital Hamiltonian simulations of the quantum sawtooth map, performed on the IBM-Q quantum hardware platform, show that the fidelity decay rate of a digital quantum simulation increases during the transition from dynamical localization to chaotic diffusion in the map. The observed error per CNOT gate increases by $1.5{\times }$ as the dynamics varies from localized to diffusive, while only changing the phases of virtual RZ gates and keeping the overall gate count constant. A gate-based Lindblad noise model that captures the effective change in relaxation and dephasing errors during gate operation qualitatively explains the effect of dynamics on fidelity as being due to the localization and entanglement of the states created. Specifically, highly delocalized states that are entangled with random phases show an increased sensitivity to dephasing and, on average, a similar sensitivity to relaxation as localized states. In contrast, delocalized unentangled states show an increased sensitivity to dephasing but a lower sensitivity to relaxation. This gate-based Lindblad model is shown to be a useful benchmarking tool by estimating the effective Lindblad coherence times during CNOT gates and finding a consistent $2\unicode{x2013}3{\times }$ shorter $T_2$ time than reported for idle qubits. Thus, the interplay of the dynamics of a simulation with the noise processes that are active can strongly influence the overall fidelity decay rate.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Reductive quantum phase estimation

Estimating a quantum phase is a necessary task in a wide range of fields of quantum science. To accomplish this task, two well-known methods have been developed in distinct contexts, namely, Ramsey interferometry (RI) in atomic and molecular physics and quantum phase estimation (QPE) in quantum computing. We demonstrate that these canonical examples are instances of a larger class of phase estimation protocols, which we call reductive quantum phase estimation (RQPE) circuits. Here, we present an explicit algorithm that allows one to create an RQPE circuit. This circuit distinguishes an arbitrary set of phases with a smaller number of qubits and unitary applications, thereby solving a general class of quantum hypothesis testing to which RI and QPE belong. We further demonstrate a tradeoff between measurement precision and phase distinguishability, which allows one to tune the circuit to be optimal for a specific application. Published by the American Physical Society 2024

Papadopoulos, Nicholas J. C. (ORCID:00000002635700↗
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)↗