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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

All sources NASA NTRS DOE OSTI

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 OSTI2024

Robust Measurements of n -Point Correlation Functions of Driven-Dissipative Quantum Systems on a Digital Quantum Computer

We propose and demonstrate a unified hierarchical method to measure n -point correlation functions that can be applied to driven, dissipative, or otherwise open or nonequilibrium quantum systems. In this method, the time evolution of the system is repeatedly interrupted by interacting an ancilla qubit with the system through a controlled operation, and measuring the ancilla immediately afterward. We discuss the robustness of this method as compared to other ancilla-based interferometric techniques (such as the Hadamard test), and highlight its advantages for near-term quantum simulations of open quantum systems. We implement the method on a quantum computer in order to measure single-particle Green’s functions of a driven-dissipative fermionic system. This Letter shows that dynamical correlation functions for driven-dissipative systems can be robustly measured with near-term quantum computers. Published by the American Physical Society 2024

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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.]↗

NASA NTRS2006

Exploiting Quantum Resonance to Solve Combinatorial Problems

Quantum resonance would be exploited in a proposed quantum-computing approach to the solution of combinatorial optimization problems. In quantum computing in general, one takes advantage of the fact that an algorithm cannot be decoupled from the physical effects available to implement it. Prior approaches to quantum computing have involved exploitation of only a subset of known quantum physical effects, notably including parallelism and entanglement, but not including resonance. In the proposed approach, one would utilize the combinatorial properties of tensor-product decomposability of unitary evolution of many-particle quantum systems for physically simulating solutions to NP-complete problems (a class of problems that are intractable with respect to classical methods of computation). In this approach, reinforcement and selection of a desired solution would be executed by means of quantum resonance. Classes of NP-complete problems that are important in practice and could be solved by the proposed approach include planning, scheduling, search, and optimal design.

Zak, Michail↗

DOE OSTI2024

Characterization of quantum dot-like emitters in programmable arrays of nanowrinkles of 1L-WSe2

When combined with nanostructured substrates, two-dimensional semiconductors can be engineered with strain to tailor light–matter interactions on the nanoscale. Recently, room-temperature nanoscale exciton localization with controllable wrinkling in 1L-WSe2 was achieved using arrays of gold nanocones. Here, the characterization of quantum dot-like states and single-photon emitters in the 1L-WSe2/nanocone system is reported. The nanocones induce a wide range of strains, and as a result, a diverse ensemble of narrowband, potential single-photon emitters is observed. The distribution of emitter energies reveals that most reside in two spectrally isolated bands, leaving a less populated intermediate band that is spectrally isolated from the ensembles. The spectral isolation is advantageous for high-purity quantum light emitters, and anti-bunched emission from one of these states is confirmed up to 25 K. Although the spatial distribution of strain is expected to influence the orientation of the transition dipoles of the emitters, multimodal emission polarization anisotropy and atomic force microscopy reveal that the macroscopic orientation of the wrinkles is not a good predictor of dipole orientation. Finally, the emission is found to change with thermal cycling from 4 to 290 K and back to 4 K, highlighting the need to control factors such as temperature-induced strain to enhance the robustness of this quantum emitter platform. The initial characterization here shows that controlled nanowrinkles of 1L-WSe2 generate quantum light in addition to uncovering potential challenges that need to be addressed for their adoption into quantum photonic technologies.

Physics↗

DOE OSTI2024

Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering

Abstract The SAT problem is a prototypical NP-complete problem of fundamental importance in computational complexity theory with many applications in science and engineering; as such, it has long served as an essential benchmark for classical and quantum algorithms. This study shows numerical evidence for a quadratic speedup of the Grover Quantum Approximate Optimization Algorithm (G-QAOA) over random sampling for finding all solutions to 3-SAT (All-SAT) and Max-SAT problems. G-QAOA is less resource-intensive and more adaptable for these problems than Grover’s algorithm, and it surpasses conventional QAOA in its ability to sample all solutions. We show these benefits by classical simulations of many-round G-QAOA on thousands of random 3-SAT instances. We also observe G-QAOA advantages on the IonQ Aria quantum computer for small instances, finding that current hardware suffices to determine and sample all solutions. Interestingly, a single-angle-pair constraint that uses the same pair of angles at each G-QAOA round greatly reduces the classical computational overhead of optimizing the G-QAOA angles while preserving its quadratic speedup. We also find parameter clustering of the angles. The single-angle-pair protocol and parameter clustering significantly reduce obstacles to classical optimization of the G-QAOA angles.

Zhang, Zewen (ORCID:000000032258613X)↗

NASA NTRS2015

Instantons in Quantum Annealing: Thermally Assisted Tunneling Vs Quantum Monte Carlo Simulations

Recent numerical result (arXiv:1512.02206) from Google suggested that the D-Wave quantum annealer may have an asymptotic speed-up than simulated annealing, however, the asymptotic advantage disappears when it is compared to quantum Monte Carlo (a classical algorithm despite its name). We show analytically that the asymptotic scaling of quantum tunneling is exactly the same as the escape rate in quantum Monte Carlo for a class of problems. Thus, the Google result might be explained in our framework. We also found that the transition state in quantum Monte Carlo corresponds to the instanton solution in quantum tunneling problems, which is observed in numerical simulations.

Quantum Monte Carlo↗

DOE OSTI2024

ARQUIN: Architectures for Multinode Superconducting Quantum Computers

Many proposals to scale quantum technology rely on modular or distributed designs wherein individual quantum processors, called nodes, are linked together to form one large multinode quantum computer (MNQC). One scalable method to construct an MNQC is using superconducting quantum systems with optical interconnects. However, internode gates in these systems may be two to three orders of magnitude noisier and slower than local operations. Surmounting the limitations of internode gates will require improvements in entanglement generation, use of entanglement distillation, and optimized software and compilers. Still, it remains unclear what performance is possible with current hardware and what performance algorithms require. In this article, we employ a systems analysis approach to quantify overall MNQC performance in terms of hardware models of internode links, entanglement distillation, and local architecture. We show how to navigate tradeoffs in entanglement generation and distillation in the context of algorithm performance, lay out how compilers and software should balance between local and internode gates, and discuss when noisy quantum internode links have an advantage over purely classical links. Here, we find that a factor of 10–100× better link performance is required and introduce a research roadmap for the co-design of hardware and software towards the realization of early MNQCs. While we focus on superconducting devices with optical interconnects, our approach is general across MNQC implementations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1978

Actinometric measurement of solar ultraviolet and development of a weighted solar UV integral

An actinometer has been developed to measure outdoor irradiance in the range 295-400 nm. Actinometric measurements of radiation are based on determination of photochemical reaction rates for reactions of known quantum efficiency. Actinometers have the advantage of providing irradiance data over surfaces of difficult accessibility; in addition, actinometrically determined irradiance data are wavelength weighted and therefore provide a useful means of assessing the degradation rates of polymers employed in solar energy systems.

Gupta, A.↗

DOE OSTI2025

Hybrid classical-quantum communication networks

Over the past several decades, the proliferation of global classical communication networks has transformed various facets of human society. Concurrently, quantum networking has emerged as a dynamic field of research, driven by its potential applications in distributed quantum computing, quantum sensor networks, and secure communications. This prompts a fundamental question: rather than constructing quantum networks from scratch, can we harness the widely available classical fiber-optic infrastructure to establish hybrid quantum–classical networks? This paper aims to provide a comprehensive review of ongoing research endeavors aimed at integrating quantum communication protocols, such as quantum key distribution, into existing lightwave networks. This approach offers the substantial advantage of reducing implementation costs by allowing classical and quantum communication protocols to share optical fibers, communication hardware, and other network control resources—arguably the most pragmatic solution in the near term. In the long run, classical communication will also reap the rewards of innovative quantum communication technologies, such as quantum memories and repeaters. Accordingly, our vision for the future of the Internet is that of heterogeneous communication networks thoughtfully designed for the seamless support of both classical and quantum communications.

Fiber-optic communication↗

DOE OSTI2024

Performance Analysis of an Optimization Algorithm for Metamaterial Design on the Integrated High-Performance Computing and Quantum Systems

Optimizing metamaterials with complex geometries is a big challenge. Although an active learning algorithm, combining machine learning (ML), quantum computing, and optical simulation, has emerged as an efficient optimization tool, it still faces difficulties in optimizing complex structures that have potentially high performance. In this work, we comprehensively analyze the performance of an optimization algorithm for metamaterial design on the integrated HPC and quantum systems. We demonstrate significant time advantages through message-passing interface (MPI) parallelization on the high-performance computing (HPC) system showing approximately 54% faster ML tasks and 67 times faster optical simulation against serial workloads. Furthermore, we analyze the performance of a quantum algorithm designed for optimization, which runs with various quantum simulators on a local computer or HPC-quantum system. Results showcase ~24 times speedup when executing the optimization algorithm on the HPC-quantum hybrid system. This study paves a way to optimize complex metamaterials using the integrated HPC-quantum system.

Kim, Seongmin↗

NASA NTRS1993

New technologies for UV detectors

Several technologies are currently being developed, leading to substantial improvements in the performance of UV detectors or significant reductions in power or weight. Four technologies discussed are (1) thin-film coatings to enhance the UV sensitivity of CCD's, (2) highly innovative magnet assemblies that dramatically reduce weight and result in virtually no external flux, (3) new techniques for curving microchannel plates (MCP's) so that single plates can be used to prevent ion feedback and present highly localized charge clouds to an anode structure, and (4) high-performance alternatives to glass-based MCP's. In item (2), for example, very robust magnets are made out of rare earth materials such as samarium cobalt, and cladding magnets are employed to prevent flux from escaping from the detector into the external environment. These new ultralight magnet assemblies are able to create strong, exceptionally uniform magnetic fields for image intensification and focusing of photoelectrons. The principle advantage of such detectors is the quantum efficiencies of 70-80 percent obtained throughout ultraviolet wavelengths (900-2000 A), the highest of any device. Despite the improvements achieved under item (3), high-performance alternatives to conventional glass-based MCP's potentially offer three distinct new advantages that include (1) a 30-100-fold improvement in dynamic range resulting in correspondingly higher signal-to-noise ratios, (2) the use of pure dielectric and semiconductor materials that will not outgas contaminants that eventually destroy photocathodes, and (3) channels that have constant spacing providing long-ranged order since the plates are made using photolithography techniques from the semiconductor industry. The manufacturers of these advanced-technology MCP's, however, are a couple of years away from actually producing a functioning image intensifier. In contrast to the use of CCD's for optical, ground based observations, there is no single detector technology in the ultraviolet that dominates or is as universally suitable for all applications. Thus, several technological problems, recent advances, and the impact that these new enabling technologies represent for UV applications are addressed.

Joseph, C. L.↗