Search NASA⌕ Search

SEARCH · Search NASA

Results for “Quantum advantage”

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

Encapsulation Enhances the Quantum Coherence of a Solid‐State Molecular Spin Qubit

Spins within molecules benefit from the atomistic control of synthetic chemistry for the realization of qubits. One advantage is that the quantum superpositions of the spin states encoding the qubit can be coherently manipulated using electromagnetic radiation. The main challenge is the fragility of these superpositions when qubits are to partake of solid-state devices. We address this issue with a supramolecular approach for protecting molecular spin qubits against decoherence. The molecular qubit [Cr(ox)3]3- has been encapsulated inside the diamagnetic triple-stranded helicate [Zn2L3]4+ (L is a bis-pyrazolylpyridine ligand). The quantum coherence of the protected qubit is then analyzed with pulsed EPR spectroscopy and compared with the unprotected qubit, both in solution and in the solid state. Crucially, the spin-spin relaxation in the solid state has been examined within diamagnetic crystal lattices of the isostructural ([Al(ox)3]@[Zn2L3])+ or [Al(ox)3]3- assemblies, respectively, doped with the Cr3+ qubit in two different (<10%) concentrations. The study unveils a surprising increase of the phase memory time of the qubit upon encapsulation only in the solid. Spin-lattice relaxation times also exhibit a significant enhancement, as established from inversion recovery pulse sequences and from slow relaxation of the magnetization of the protected qubit, not featured by the free qubit.

Swain, Abinash↗
DOE OSTI2024

Entanglement-Enhanced Neyman-Pearson Target Detection

Quantum illumination (QI) provides entanglement-enabled target-detection enhancement, despite operating in an entanglement-breaking environment. Existing experimental studies of QI have utilized a Bayesian approach, assuming that the target is equally likely to be present or absent before detection, to demonstrate an advantage over classical target detection. However, such a premise breaks down in practical operational scenarios in which the prior probability is unknown, thereby hindering QI's applicability to real-world target-detection scenarios. In this work, we adopt the Neyman-Pearson criterion in lieu of the error probability for equally likely target absence or presence as our figure of merit for QI. We demonstrate an unconditional quantum advantage over the optimal classical-illumination protocol as benchmarked by the receiver operating characteristic, which examines detection probability versus false-alarm probability without resorting to known prior probabilities. Our work represents a critical advancement in adapting quantum-enhanced sensing to practical operational settings.

Ward, William↗
DOE OSTI2025

Quantum information meets high-energy physics: input to the update of the European strategy for particle physics

Some of the most astonishing and prominent properties of Quantum Mechanics, such as entanglement and Bell nonlocality, have only been studied extensively in dedicated low-energy laboratory setups. The feasibility of these studies in the high-energy regime explored by particle colliders was only recently shown and has gathered the attention of the scientific community. For the range of particles and fundamental interactions involved, particle colliders provide a novel environment where quantum information theory can be probed, with energies exceeding by about 12 orders of magnitude those employed in dedicated laboratory setups. Furthermore, collider detectors have inherent advantages in performing certain quantum information measurements and allow for the reconstruction of the state of the system under consideration via quantum state tomography. Here, we elaborate on the potential, challenges, and goals of this innovative and rapidly evolving line of research and discuss its expected impact on both quantum information theory and high-energy physics.

Physics↗
DOE OSTI2025

Quantum heat engine based on quantum interferometry: The SU(1,1) Otto cycle

We present a quantum heat engine based on a quantum Otto cycle whose working substance reproduces the same outcomes as an SU ( 1 , 1 ) interference process at the end of each adiabatic transformation. This device takes advantage of the extraordinary quantum metrological features of the SU ( 1 , 1 ) interferometer to better discriminate the sources of uncertainty of relevant observables during each adiabatic stroke of the cycle. In particular, the SU ( 1 , 1 ) adiabatic transformations enable high-precision estimations of the energy extracted from the adiabatic stroke, despite the presence of thermal fluctuations. Applications to circuit QED platforms are also discussed. Published by the American Physical Society 2025

Ferreri, Alessandro (ORCID:0000000185459205)↗
DOE OSTI2025

Braiding for the win: Harnessing braiding statistics in topological states to play quantum games

Nonlocal quantum games provide proof of principle that quantum resources can confer an advantage at certain tasks. They also provide a compelling way to explore the computational utility of phases of matter on quantum hardware. In a recent paper [O. Hart et al., Phys. Rev. Lett. 134, 130602 (2025)], we demonstrated that a toric code resource state conferred advantage at a certain nonlocal game, which remained robust to small deformations of the resource state. In this paper we demonstrate that this robust advantage is a generic property of resource states drawn from topological or fracton ordered phases of quantum matter. To this end, we illustrate how several other states from paradigmatic topological and fracton ordered phases can function as resources for suitably defined nonlocal games, notably the three-dimensional toric-code phase, the X-cube fracton phase, and the double-semion phase. The key in every case is to design a nonlocal game that harnesses the characteristic braiding processes of a quantum phase as a source of contextuality. We unify the strategies that take advantage of mutual statistics by relating the operators to be measured to order and disorder parameters of an underlying generalized symmetry-breaking phase transition. Additionally, by connecting the win probability to twist products, we show that success at the game serves as a many-body entanglement witness. Namely, if the players implement a perfect quantum strategy on large length scales, the quantum state they share cannot be connected to a trivial product state via a constant-depth local unitary circuit. Lastly, we massively generalize the family of games that admit perfect strategies when codewords of homological quantum error-correcting codes are used as resources.

Fractons↗
DOE OSTI2025

Toward Computation-Guided Design of Tunable Organic-Inorganic CdS Quantum Dot Binary Superlattices

Combining the advantages of structural programmability in sequence-defined biomimetic molecules and the controllable packing geometry in nanoparticle superlattices, we demonstrate a self-assembled organic-inorganic superlattice whose structure can be altered with the slightest change in the sequence of the organic counterpart. Here, oleate-coated CdS quantum dots (QDs) form a square-packed superlattice with a 1:1 molar equivalence of a di-block amphiphilic peptoid (Nbrpe6Dig) in chloroform. In contrast, no apparent structure is observed in the organic solvent alone. Based on theoretical evidence, we show that the assembly is a binary superlattice where both the CdS QDs and the peptoids serve as building blocks and further predict a correlation between the superlattice structure and the peptoid sequence. The computationally guided prediction is validated by experiments where superlattice transformation is observed with modified peptoids. The mechanism identified in our work inspires new ways to control and tune organic-inorganic hybrid nanomaterial self-assembly.

Qi, Xin↗
DOE OSTI2024

Extending the computational reach of a superconducting qutrit processor

Quantum computing with qudits is an emerging approach that exploits a larger, more connected computational space, providing advantages for many applications, including quantum simulation and quantum error correction. Nonetheless, qudits are typically afflicted by more complex errors and suffer greater noise sensitivity which renders their scaling difficult. In this work, we introduce techniques to tailor arbitrary qudit Markovian noise to stochastic Weyl–Heisenberg channels and mitigate noise that commutes with our Clifford and universal two-qudit gate in generic qudit circuits. We experimentally demonstrate these methods on a superconducting transmon qutrit processor, and benchmark their effectiveness for multipartite qutrit entanglement and random circuit sampling, obtaining up to 3× improvement in our results. To the best of our knowledge, this constitutes the first-ever error mitigation experiment performed on qutrits. Our work shows that despite the intrinsic complexity of manipulating higher-dimensional quantum systems, noise tailoring and error mitigation can significantly extend the computational reach of today’s qudit processors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Probing Ultrafast Charge Transfer Dynamics in Heterostructured Nanomaterials

The increasing demand for renewable and low‐cost energy has triggered a vast amount of research aimed at developing, characterizing and optimizing materials that can efficiently convert sun light into useful chemical energy in the form of electricity or chemical fuels. So‐ called quantum dot sensitized solar cell (QDSC) materials have gained much attention in recent years based on the advantageous physicochemical properties of semiconducting quantum dots (QDs) as sensitizers, as well as their promising potential to increase the conversion efficiency beyond the Shockley‐Queisser limit of ∼33% by making use of hot‐electron transfer (HET) routes and multiple exciton generation (MEG). By finely tuning the size of the QDs, the band gap can be carefully aligned to the metal oxide (MO) conduction band such that charge transfer from the photoexcited QD is thermodynamically favorable.

14 SOLAR ENERGY↗
DOE OSTI2024

Demonstration of the rodeo algorithm on a quantum computer

The rodeo algorithm is an efficient algorithm for eigenstate preparation and eigenvalue estimation for any observable on a quantum computer. This makes it a promising tool for studying the spectrum and structure of atomic nuclei as well as other fields of quantum many-body physics. The only requirement is that the initial state has sufficient overlap probability with the desired eigenstate. While it is exponentially faster than well-known algorithms such as phase estimation and adiabatic evolution for eigenstate preparation, it has yet to be implemented on an actual quantum device. In this work, we apply the rodeo algorithm to determine the energy levels of a random one-qubit Hamiltonian, resulting in a relative error of 0.08% using mid-circuit measurements on the IBM Q device Casablanca. This surpasses the accuracy of directly-prepared eigenvector expectation values using the same quantum device. We take advantage of the high-accuracy energy determination and use the Hellmann-Feynman theorem to compute eigenvector expectation values for a different random one-qubit observable. For the Hellmann-Feynman calculations, we find a relative error of 0.7%. Here, we conclude by discussing possible future applications of the rodeo algorithm for multi-qubit Hamiltonians.

algorithm↗
DOE OSTI2026

Correlated Noise Estimation with Quantum Sensor Networks

We address the metrological problem of estimating collective stochastic properties imprinted on a network of quantum sensors. Canonical examples include center-of-mass quadrature fluctuations in a system of bosonic modes and correlated dephasing in an ensemble of qubits (e.g., spins), bosons, or fermions. We develop a theoretical framework to determine the limits of correlated (weak) noise estimation with quantum sensor networks and reveal the requirements for entanglement advantage. Notably, an advantage emerges from the synergistic interplay between quantum correlations of the sensors and “classical” correlations of the noises. Here, we determine optimal entangled probe states and identify a sensing protocol—reminiscent of a many-body echo—that achieves the fundamental limits of measurement sensitivity for a broad class of problems, unveiling a route toward entanglement-enhanced metrology of correlated many-body phenomena.

Quantum metrology↗
DOE OSTI2024

Quantum Annealing for Real-World Machine Learning Applications

Optimizing the training of a machine learning pipeline is important for reducing training costs and improving model performance. One such optimizing strategy is quantum annealing, which is an emerging computing paradigm that has shown potential in optimizing the training of a machine learning model. The implementation of a physical quantum annealer has been realized by D-Wave systems and is available to the research community for experiments. Recent experimental results on a variety of machine learning applications have shown interesting results especially under the conditions where the performance of classical machine learning techniques are limited such as limited training data and high dimensional features. This chapter explores the application of D-Wave’s quantum annealer for optimizing machine learning pipelines for real-world classification problems. We review the application domains on which a physical quantum annealer has been used to train machine learning classifiers. We discuss and analyze the experiments performed on the D-Wave quantum annealer for applications such as image recognition, remote sensing imagery, security, computational biology, biomedical sciences, and physics. We discuss the possible advantages and the problems for which quantum annealing is likely to be advantageous over classical computation.

Kumar nath, Rajdeep↗
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

How Does Metal Spin State Affect Electronic Communication in Mixed-Valence Dimers? Insights from Ultrafast Near-Infrared and Soft X-ray Transient Absorption Spectroscopy

Recent advancements in photocatalysis, photovoltaics, and quantum information science take advantage of electron spin, and determining how spin multiplicity affects electron transfer is key to understanding these phenomena. Here, in this study, we examine how metal spin state affects electronic communication in an organometallic mixed-valence dimer, ferrocenyl cobaltocenium ([Fe II Cp 2 Co III Cp 2 ] + ). This complex can be photoexcited from its low-spin singlet Fe II ground state to form intermediate-spin triplet Fe II and high-spin quintet Fe II excited states. Using femtosecond optical transient absorption (OTA) spectroscopy with visible (vis), near-infrared (NIR), and short-wave IR (SWIR) probes, supported by time-dependent density functional theory (TD-DFT) calculations, we measure Fe II Co III →Fe III Co II intervalence charge transfer (IVCT) bands in each of the Fe II spin states. Mulliken–Hush analysis of the excited-state IVCT bands was used to compute the electronic coupling between the metal centers in all three spin states, which increased as quintet < triplet < singlet. Meanwhile, the peak energy of the bands, and thus the ΔG of the IVCT transition, increased as triplet < quintet < singlet. Then, to directly probe the electronic structure at each metal center, we employed picosecond soft X-ray transient absorption (XTA) spectroscopy at the Fe and Co L 3 edges. Our results show that the low-spin and high-spin states of [Fe II Cp 2 Co III Cp 2 ] + are valence-localized, while the intermediate-spin state is partially delocalized. The differences in charge delocalization are attributed to differences in orbital occupation and geometry that affect the free energy and superexchange coupling.

Burke, John H. [Univ. of Illinois at Urbana-Champa↗
NASA NTRS2019

Quantum Gate-Model Approaches to Exact and Approximate Optimization

Many of the most challenging computational problems arising in practical applications are tackled by heuristic algorithms which have not been rigorously proven to outperform other approaches but rather have been empirically demonstrated to be effective. While quantum heuristics have been proposed since the early days of quantum computing, true empirical evaluation of the real-world performance of these algorithms is only becoming possible now as increasingly powerful quantum gate-model devices continue to come online.In this talk, I will give an overview of the NASA QuAIL team's ongoing investigation into quantum gate-model heuristic algorithms for exact and approximate optimization. In particular, we consider the performance of the Quantum Approximate Optimization Algorithm on NP-hard optimization problems, and describe algorithm parameter setting strategies for real-world quantum hardware. We then show a generalization of QAOA circuits, the Quantum Alternating Operator Ansatz, especially suitable for low-resource implementations of QAOA for problems with hard (feasibility) constraints. The talk will conclude with a discussion of research challenges, particularly for optimization and sampling applications of QAOA, and the potential of more general quantum heuristics to give advantages over classical computers.

Hadfield, Stuart↗
DOE OSTI2025

Performance evaluations of signed and unsigned noisy approximate quantum Fourier arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route toward a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted-sum optimization problems in data processing and machine learning, and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting-qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance and identify the most effective approximation depths for unsigned quantum addition and quantum multiplication within the given context. We then perform a similar analysis of signed addition and compare to the unsigned results. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges—relevant to signed, unsigned, modular and non-modular versions—that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze the performance trends in our results and speculate on possible future developments within this computational paradigm.

Computational models↗
DOE OSTI2024

Report for the ASCR Workshop on Basic Research Needs in Quantum Computing and Networking - 2023

Employing quantum mechanical resources in computing and networking opens the door to new computation and communication models and potential disruptive advantages over classical counterparts. However, quantifying and realizing such advantages face extensive scientific and engineering challenges. Investments by the Department of Energy (DOE) have driven progress toward addressing such challenges. Quantum algorithms have been recently developed, in some cases offering asymptotic exponential advantages in speed or accuracy, for fundamental scientific problems such as simulating physical systems, solving systems of linear equations, or solving differential equations. Empirical demonstrations on nascent quantum hardware suggest better performance than classical analogs on specialized computational tasks favorable to the quantum computing systems. However, demonstration of an end-to-end, substantial and rigorously quantifiable quantum performance advantage over classical analogs remains a grand challenge, especially for problems of practical value. The definition of requirements for quantum technologies to exhibit scalable, rigorous, and transformative performance advantages for practical applications also remains an outstanding open question, namely, what will be required to ultimately demonstrate practical quantum advantage?

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
DOE OSTI2026

Fidelity Comparison of Time-Bin and Fock State Encoding in Hybrid Quantum Systems Under Channel and Transduction Effects

Future quantum networks are expected to integrate a heterogeneous combination of quantum systems, owing to the diverse advantages offered by different physical platforms in terms of scalability, coherence times, and interfacing capabilities. Within the context of this emerging quantum communication paradigm, this paper presents an analytical comparison of two photonic encoding schemes—time-bin and Fock state (single rail)—in hybrid quantum systems where flying qubits are entangled with stationary matter qubits. We evaluate their resilience against fiber channel and quantum transduction effects by calculating the fidelity of the final states relative to their ideal forms. Employing the characteristic function approach, we derive analytical fidelity expressions and investigate their dependence on parameters such as transmissivity, noise levels, fiber length, and source generation success probability. Additionally, we simulate the scenario with a dedicated QuTiP software implementation to verify the validity of the theoretical models. Our findings reveal that due to its inherent single-mode structure, the Fock state encoding consistently outperforms time-bin encoding in fidelity, as this structure significantly minimizes susceptibility to losses compared to the two-mode nature of the time-bin scheme. This analysis offers valuable insights for future hybrid quantum communication and information processing applications.

Fiorini, Francesco [Pisa U.]↗