Search NASA⌕ Search

SEARCH · Search NASA

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Fast ground-state-to-ground-state separation of small ion crystals

Rapid separation of linear crystals of trapped ions into different subsets is critical for realizing trapped ion quantum computing architectures where ions are rearranged in trap arrays to achieve all-to-all connectivity between qubits. Here we introduce a general theoretical framework that can be used to describe the separation of same-species and mixed-species crystals into smaller subsets. The framework relies on an efficient description of the evolution of Gaussian motional states under quadratic Hamiltonians that only requires a special solution of the classical equations of motion of the ions to describe their quantum evolution under the influence of a time-dependent applied potential and the ions' mutual Coulomb repulsion. We provide time-dependent applied potentials suitable for separation of a mixed-species three-ion crystal on timescales similar to that of free expansion driven by Coulomb repulsion, with all modes along the crystal axis starting and ending close to their ground states. Three separately confined mixed-species ions can be combined into a crystal held in a single well without energy gain by time-reversal of this separation process.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Quasifragmentation functions in the massive Schwinger model

We introduce the concept of the quark quasifragmentation function (qFF) using an equal-time and spatially boosted form of the Collins-Soper fragmentation function where the out-meson fragment is replaced by the current asymptotic condition. We derive the qFF for a fermion in two-dimensional quantum electrodynamics (QED2) using the Kogut-Susskind Hamiltonian after a mapping onto spin qubits in a spatial lattice with open boundary conditions. This form is suitable for quantum computations. We compute the qFF by exact diagonalization of the spin Hamiltonian. The results are compared to the qFF following from the Drell-Levy-Yan result for QED2, both at strong and weak coupling, and to two-dimensional quantum chromodynamics in the lowest Fock approximation.

Fragmentation functions↗
NASA NTRSDate not supplied

A Quantum Volume Metric for Qudit Quantum Computers

Qudit-based quantum computers, such as the high-Q superconducting radio frequency resonator cavities being pursued by the SQMS Center hosted at Fermilab, may provide computational advantages relative to qubit-based machines for some problems. However, the novel system’s hardware and software will present different errors that must be understood and mitigated, along with other unforeseen inefficiencies across the entire stack. It is essential to benchmark these qudit platforms against existing systems. We propose such a benchmark by generalizing the qubit-based quantum volume metric to qudit devices. In particular, we show that the performance depends on the available gateset used to compile unitary operations, as well as realistic noise sources.

Quantum Computing↗
DOE OSTI2026

The role of quantum computing in advancing scientific high-performance computing: A perspective from the ADAC institute

Quantum computing (QC) has gained significant attention over the past two decades due to its potential for speeding up classically demanding tasks. This transition from an academic focus to a thriving commercial sector is reflected in substantial global investments. While advancements in qubit counts and functionalities continue at a rapid pace, current quantum systems still lack the scalability for practical applications, facing challenges such as too high error rates and limited coherence times. Here, this perspective paper examines the relationship between QC and high-performance computing (HPC), highlighting their complementary roles in enhancing computational efficiency. It is widely acknowledged that even fully error-corrected QC will not be suited for all computational tasks. Rather, future compute infrastructures are anticipated to employ quantum acceleration within hybrid systems that integrate HPC and QC. While QC can enhance classical computing, traditional HPC remains essential for maximizing quantum acceleration. This integration is a priority for supercomputing centers and companies, sparking innovation to address the challenges of merging these technologies. The novelty of this work lies in its unique perspective, reflecting the collective insights of the Accelerated Data Analytics and Computing (ADAC) Institute, a global consortium of over 20 leading HPC centers. Recognizing the growing importance of QC, ADAC established a Quantum Computing Working Group in 2023 to foster collaboration and knowledge-sharing among its members. This paper synthesizes insights from the group’s collaborative efforts and incorporates findings from a member survey that captures shared experiences, ongoing projects, and strategic directions. By outlining the current landscape and challenges of QC integration into HPC ecosystems, this work offers HPC specialists practical and forward-looking guidance on the opportunities and implications of QC in computationally intensive endeavors.

Accelerated Data Analytics and↗
DOE OSTI2025

Computationally guided experimental validation of divacancy defect formation in 4H-SiC

Recent research into solid-state qubits for quantum information science has focused on optically addressable spin defects such as the negatively charged nitrogen-vacancy center in diamond and the neutrally charged divacancy (VV) in 4H-SiC as scalable quantum sensors and networking qubits. Within this context, direct investigations of the structural origin and defect formation dynamics of a sub-set of the VV center in 4H-SiC remain lacking. Here, we take a systematic experimental approach guided by predictions from first-principles simulations to gain a thorough mechanistic understanding of the VV defect formation and control in 4H-SiC. We study the effect of annealing time and temperature on VV formation in high-purity semi-insulating 4H-SiC samples following electron irradiation. Three different temperatures (1123, 1273, and 1473 K) and annealing duration (from 0.5 to 72 h) are chosen to explore VV formation in different regions. We find that samples annealed at 1273 K give the highest VV-related photoluminescence (PL) intensities, in agreement with the prediction from first-principles calculations. Furthermore, the logarithmic dependence of VV-related PL intensities on the annealing duration at 1273 K indicates that 1273 K provides sufficient thermal energy for silicon vacancy migration but not for VV migration. Together, these results suggest that efficient VV formation occurs above the V Si migration temperature and below the VV migration threshold.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2024

Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation

Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRSDate not supplied

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^8 determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

J Wayne Mullinax↗
NASA NTRSDate not supplied

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗
NASA NTRSDate not supplied

Efficient Implementation for Unitary Coupled Cluster State Preparation for Near-Term Quantum Computers

Unitary coupled cluster theory (UCC) is a common wave function ansatz for quantum simulation of molecular electronic structure using the variational quantum eigenvalue solver (VQE). Even for small molecules using a double-ζ basis, the number of variational parameters required to minimize the electronic energy (i.e., optimize the circuit) is large and beyond the reach of current quantum computers. For example, a circuit simulating C2 using the UCCSD ansatz and the cc-pVDZ basis set with frozen-core will require over 10,000 variational parameters and a Hilbert space of over 10^(8) determinants. To make progress on simulating such molecular systems on near-term quantum computers, we explore how much of the optimization can be approximately prepared with classical simulation while reducing the number of optimization steps performed on a quantum device. Recently, Chen, Cheng, and Freericks [J. Chem. Theory Comput. 2021, 17, 841-847] presented an algorithm for the factorized form of the UCC ansatz that allows for efficient UCC optimizations on classical hardware. We flip the algorithm around and use it to prepare approximate quantum circuits for systems that require a large number of qubits to represent. We will present results from our implementation and discuss strategies for incorporating this implementation for algorithms involving near-term quantum computers.

Quantum Computing↗
DOE OSTI2026

Carbon-Based Quantum Information Science with Symmetry Protected Topological States (Final Report, DOE-BES award DE-SC0023105)

This research program established the scientific foundation for the rational, bottom-up design, synthesis, isolation, and investigation of symmetry-protected topological (SPT) electron spin qubits embedded in graphene nanoribbons (GNRs). The work focused on integrating atomically precise low-dimensional carbon nanostructures with emerging quantum logic architectures, providing a pathway toward scalable quantum materials for next-generation computing and sensing technologies. A central component of the program was the elucidation of fundamental relationships between real-space molecular architecture, local spin density distributions, electronic band dispersion, and energy level alignment in atomically precise GNR systems. These correlations define key operational parameters of SPT qubits and were systematically investigated to establish quantitative benchmarks against established molecular and solid-state spin qubit platforms. Attention was given to properties critical for quantum device performance, e.g. decoherence times, spectral sharpness of energy transitions, and tunable exchange interactions between spin states. The research demonstrated that these parameters can be engineered with atomic precision through scalable bottom-up synthetic strategies. Theory-guided design played a central role in identifying candidate structures hosting topologically protected spin states. Experimental validation was performed using both ensemble measurements and single-molecule characterization. In addition to advances in quantum materials synthesis, the program developed and applied spin-sensitive scanning probe microscopy techniques capable of directly probing quantum states and dynamic processes with atomic-scale spatial resolution. These capabilities enabled direct observation and characterization of quantum structures at the single-atom level. While the research activities were primarily hypothesis-driven fundamental investigations, the program adopted a comprehensive materials-by-design framework aimed at translating scientific discoveries into technological concepts compatible with scalable and intelligent manufacturing approaches.

36 MATERIALS SCIENCE↗
DOE OSTI2025

Increasing the hardness of posiform planting using random QUBOs for programmable quantum annealer benchmarking

Posiform planting is a method for constructing QUBO instances with a unique planted solution that can be tailored to arbitrary connectivity graphs. In this study we investigate making posiform planted QUBOs computationally harder by fusing many smaller random Ising models, whose global minimum is computed classically, with posiform planted QUBOs. The unique ground state of the resulting QUBO is the concatenation of (exactly one of) the ground states of each smaller problem. Our method generates QUBO instances that have a unique solution, are native to the hardware graph, and have tunable computational hardness. We use our QUBOs to benchmark three D-Wave quantum annealing processors (with 563–5627 qubits), and compare them against simulated annealing and Gurobi. Surprisingly, we find that the D-Wave ground state sampling success rate is not dependent on the glued random QUBO size, and that some QUBO classes are solved at high success rates at short annealing times on the Zephyr processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

Dynamically generated decoherence-free subspaces and subsystems on superconducting qubits

Abstract Decoherence-free subspaces and subsystems (DFS) preserve quantum information by encoding it into symmetry-protected states unaffected by decoherence. An inherent DFS of a given experimental system may not exist; however, through the use of dynamical decoupling (DD), one can induce symmetries that support DFSs. Here, we provide the first experimental demonstration of DD-generated decoherence-free subsystem logical qubits. Utilizing IBM Quantum superconducting processors, we investigate two and three-qubit DFS codes comprising up to six and seven noninteracting logical qubits, respectively. Through a combination of DD and error detection, we show that DFS logical qubits can achieve up to a 23% improvement in state preservation fidelity over physical qubits subject to DD alone. This constitutes a beyond-breakeven fidelity improvement for DFS-encoded qubits. Our results showcase the potential utility of DFS codes as a pathway toward enhanced computational accuracy via logical encoding on quantum processors.

Physics↗
DOE OSTI2026

Promise of Graph Sparsification and Decomposition for Noise Reduction in QAOA: Analysis for Trapped-Ion Compilations

We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators using Pauli-X operations and all-to-all Ising Hamiltonian HIsing evolution generated by Molmer-Sorensen or optical dipole force interactions, though some of our results also apply to standard gate-based compilations. Our results are based on principles of graph sparsification and decomposition; the former reduces the number of edges in a graph while maintaining its cut structure, while the latter breaks a weighted graph into a small number of unweighted graphs. Though these techniques have been used as heuristics in various hybrid quantum algorithms, there have been no guarantees on their performance, to the best of our knowledge. This work provides the first provable guarantees using sparsification and decomposition to improve quantum noise resilience and reduce quantum circuit complexity. For quantum hardware that uses edge-by-edge QAOA compilations, sparsification leads to a direct reduction in circuit complexity. For trapped-ion quantum simulators implementing all-to-all HIsing pulses, we show that for a (1−ϵ) factor loss in the Max-Cut approximation (ϵ>0), our compilations improve the (worst-case) number of HIsing pulses from O(n2) to O(nlog(n/ϵ)) and the (worst-case) number of Pauli-X bit flips from O(n2) to O(nlog(n/ϵ)ϵ2) for n-node graphs. This is an asymptotic improvement for any constant ϵ>0. We demonstrate that significant improvements to the approximation ratio are obtained using decomposition in simulated trapped-ion experiments with dephasing noise. We further present a generic argument showing that sparsification results in an exponentially improved circuit fidelity lower bound in digital computing schemes based on one- and two-qubit gates, which are relevant to a wide variety of hardwares such as superconducting qubits and certain neutral atom or trapped ion setups, and more sophisticated noise models. We anticipate these approximate compilation techniques will be useful tools in a variety of future quantum computing experiments.

Moondra, Jai [Georgia Institute of Technology]↗
DOE OSTI2025

Quantum Sensing Experiments at SQMS

The Superconducting Quantum Materials and Systems (SQMS) Center, led by Fermi National Accelerator Laboratory, is one of five U.S. Department of Energy-funded research centers dedicated to advancing quantum computing and quantum sensing. SQMS leverages its expertise in superconducting radio-frequency (SRF) cavities and transmon qubits to develop sensitive quantum sensors to probe fundamental physics. This presentation will highlight the progress and innovations in SQMS’s quantum sensing thrust, with a particular focus on searches for particles beyond the Standard Model, dark matter candidates, and gravitational waves. Recent developments include the search for dark photon dark matter using transmon qubits and widely tunable superconducting cavities (4 GHz–7 GHz), a quantum-enhanced axion dark matter search employing an itinerant single microwave photon counter, and efforts to detect low-mass axions and high-frequency gravitational waves using multimode superconducting cavities.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2026

Braiding of Majorana zero modes in vortex cores

Here, we demonstrate the successful simulation of $\sqrt{𝑍-}$, $\sqrt{𝑋-}$, and 𝑋-quantum gates using Majorana zero modes (MZMs) that emerge in magnetic vortices located in topological superconductors. We compute the transition probabilities and geometric phase differences accounting for the full many-body dynamics and show that qubit states can be read out by fusing the vortex core MZMs and measuring the resulting charge density. We visualize the gate processes using the time- and energy-dependent nonequilibrium local density of states. Our results demonstrate the feasibility of employing vortex core MZMs for the realization of fault-tolerant topological quantum computing.

Majorana bound states↗
DOE OSTI2025

Mitigation of birefringence in cavity-based quantum networks using frequency-encoded photons

Atom-cavity systems offer unique advantages for building large-scale distributed quantum computers by providing strong atom-photon coupling while allowing for high-fidelity local operations of atomic qubits. However, in prevalent schemes where the photonic state is encoded in polarization, cavity birefringence introduces an energy splitting of the cavity eigenmodes and alters the polarization states, thus limiting the fidelity of remote entanglement generation. To address this challenge, we propose a scheme that encodes the photonic qubit in the frequency degree-of-freedom. The scheme relies on resonant coupling of multiple transverse cavity modes to different atomic transitions that are well-separated in frequency. We numerically investigate the temporal properties of the photonic wavepacket, two-photon interference visibility, and atom-atom entanglement fidelity under various cavity polarization-mode splittings and find that our scheme is less affected by cavity birefringence. Finally, we propose practical implementations in two trapped ion systems, using the fine structure splitting in the metastable D state of 40 Ca + , and the hyperfine splitting in the ground state of 225 Ra + . Furthermore, our study presents an alternative approach for cavity-based quantum networks that is less sensitive to birefringent effects, and is applicable to a variety of atomic and solid-state emitter-cavity interfaces.

Cavity quantum electrodynamics↗
DOE OSTI2026

Quantum computing approach for building surface sunlit in urban-scale energy modeling

Solar shadow calculations are needed in building energy modeling and performance simulation of PV systems installed on roofs or facades of buildings. We present a quantum computing approach for calculation of building surface sunlit fractions by recasting solar visibility as a binary optimization problem solved by quantum annealing. Each triangulated surface centroid is encoded as a binary qubit indicating sunlit or shaded status. Geometric visibility constraints are derived from the Möller-Trumbore intersection algorithm and converted into a constrained quadratic binary model compatible with contemporary quantum annealers. The coefficients were embedded to D-Wave quantum computer. To demonstrate feasibility, we conducted a case study in San Francisco for a target building with 52 triangles and roughly 2700 nearby triangles within 50 m evaluated at representative winter and summer solar positions. The results demonstrated that quantum annealing can reliably calculate and distinguish sunlit from shaded surfaces. Quantum samples achieved average accuracy exceeding 92.4 %, with the aggregate surface-level agreement approaching 99.9 %. The outputs of quantum computers agreed closely with classical algorithms, indicating practical feasibility and promising scalability. Finally, the hourly sunlit fractions of building surfaces can be obtained for urban energy modelling. This is the first study to apply quantum computing to the solar shadow and building surface sunlit calculation. It introduces a new paradigm that differs fundamentally from traditional approaches.

Deng, Zhipeng↗