Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum optimization”

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 703 records · Page 39
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Space-Time Quantum Information from the Entangled States of Magnetic Molecule (STI Product)

This collaborative project combines synthesis, measurement, and theory by three faculty members at the Eddleman Quantum Institute of UC Irvine to effectively investigate the quantum properties of molecules in the space, time, and frequency domains. Through synthetic chemistry, molecules are tailored for their magnetic and coherent properties. By combining femtosecond (fs) terahertz (THz) light and a continuous wave (cw) THz laser with a low temperature scanning tunneling microscope (STM), quantum phenomena are probed with simultaneous femtosecond temporal and atomic-scale spatial resolution. In particular, the invention of the quantum superposition microscope (QSM) advances quantum sensing for enhanced spectroscopy and imaging capabilities. Coupling theory to the experimental efforts offers a deeper understanding and predictive power for the molecular systems. The phenomena of superposition, entanglement, and coherence is central to quantum information science and can be realized in qubit states. Many systems can be modeled by a double-well potential in which two levels are formed in the two lowest energy states interacting with the environment and external radiation. In focusing on molecules as two-level systems, the underlying expectation is that their tunable composition and structure allows an effective parameter space to optimize their use as qubits for quantum sensing and computing. The THz radiation induces the superposition between the two states, appearing as temporal oscillations that damp in amplitude. Enhanced spectroscopy and imaging in the time and frequency domains is achieved through the extreme sensitivity of the frequency and damping of coherence of two-level systems to its environment. A single hydrogen molecule trapped in the STM tunneling gap experiences a double-well potential and absorption of THz femtosecond pulses of light creates the superposition of its two levels, appearing as damped oscillations in the light induced direct current (DC). The oscillation frequency depends sensitively on the electric field distribution of the copper nitride (Cu 2 N) surface, through the Stark effect, and associated with the different charge distributions at the copper and nitrogen sites and in between. This QSM can resolve variation in the surface electric field with 0.02 nanometer resolution. In addition, the single hydrogen molecule entaes with nearby hydrogen molecules as seen in the avoided level crossings of energy (oscillation frequency) versus the voltage across the tunneling gap. Thus, the first application of the QSM senses and images the surface electric field at the atomic scale. Results from this project advance fundamental understanding of quantum phenomena, develop novel synthesis, measurement, and theory, provide the knowledge foundation for molecule-based qubits and sensing that enable the development of the QSM and emergent technologies. This project trained researchers in quantum information science, extended knowledge in classrooms, and outreached to the community.

47 OTHER INSTRUMENTATION↗
DOE OSTI2025

Analysis and Validation of PMT s Waveforms in ICARUS LArTPC Using Monte Carlo Simulations

ICARUS (Imaging Cosmic and Rare Underground Signals) serves as the Far Detector in the Short Baseline Neutrino (SBN) program at Fermilab, playing a central role in investigating the potential existence of sterile neutrinos in the eV squared mass range. The detector consists of two large Liquid Argon Time Projection Chambers (LArTPCs) with a total capacity of 760 tons of liquid Argon. A key component of the system is its array of 360 Photo-Multiplier Tubes (PMTs), which detect the scintillation light produced by charged particles in liquid Argon; the fast scintillation signal enables accurate event timing, triggering, and reconstruction. Together with the TPC and CRT systems, the PMTs ensure precise interaction time measurements, which are crucial for distinguishing neutrino interactions from cosmic-ray backgrounds. ICARUS uses Hamamatsu R5912-MOD PMTs, optimized for cryogenic temperatures, with high quantum efficiency, excellent timing resolution, low dark current (around 10 nA at 1500 V), and broad spectral sensitivity (300–650 nm). These characteristics are crucial for the efficient detection of scintillation light. Analyzing the waveforms of PMT signals allows for a detailed comparison between experimental data and Monte Carlo simulations. This analysis is fundamental for improving the accuracy of neutrino event reconstruction, enhancing detector calibration, and optimizing the detector's performance for current and future operations.

Brio, V. [Catania U.] (ORCID:0009000088807391)↗
NASA NTRSDate not supplied

QuAIL Tools for Benchmarking, Analysis and Quantum Algorithm Development

HybridQ and PySA are open-source tools developed by NASA to support benchmarking, analysis and quantum algorithm development in areas such as simulation, optimization and machine learning. These tools leverage classical hardware acceleration via high-performance computing CPU and GPU architectures and support high-performance computing. HybridQ is a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to simulate large scale quantum circuits. PySA is an extensible platform to optimize a classical cost function. We provide an outline of each of these open-source tools and highlight projects using each of these tools in contexts of simulation, optimization and machine learning.

Quantum Computing↗
DOE OSTI2022

Quantum annealing for jet clustering with thrust

Quantum computing holds the promise of substantially speeding up computationally expensive tasks, such as solving optimization problems over a large number of elements. In high-energy collider physics, quantum-assisted algorithms might accelerate the clustering of particles into jets. In this study, we benchmark quantum annealing strategies for jet clustering based on optimizing a quantity called “thrust” in electron-positron collision events. Here, we find that quantum annealing yields similar performance to exact classical approaches and classical heuristics, after tuning the annealing parameters. Without tuning, comparable performance can be obtained through a hybrid quantum/classical approach.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Lieb-Robinson Light Cone for Power-Law Interactions

The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as 1 / r α at distance r ? Here, we present a definitive answer to this question for all exponents α > 2 d and all spatial dimensions d . Schematically, information takes time at least r min { 1 , α - 2 d } to propagate a distance r . As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

Application of Quantum Annealing to Nurse Scheduling Problem

Quantum annealing is a promising heuristic method to solve combinatorial optimization problems, and efforts to quantify performance on real-world problems provide insights into how this approach may be best used in practice. We investigate the empirical performance of quantum annealing to solve the Nurse Scheduling Problem (NSP) with hard constraints using the D-Wave 2000Q quantum annealing device. NSP seeks the optimal assignment for a set of nurses to shifts under an accompanying set of constraints on schedule and personnel. After reducing NSP to a novel Ising-type Hamiltonian, we evaluate the solution quality obtained from the D-Wave 2000Q against the constraint requirements as well as the diversity of solutions. For the test problems explored here, our results indicate that quantum annealing recovers satisfying solutions for NSP and suggests the heuristic method is potentially achievable for practical use. Moreover, we observe that solution quality can be greatly improved through the use of reverse annealing, in which it is possible to refine returned results by using the annealing process a second time. We compare the performance of NSP using both forward and reverse annealing methods and describe how this approach might be used in practice.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Practical quantum computation of chemical and nuclear energy levels using quantum imaginary time evolution and Lanczos algorithms

Various methods have been developed for the quantum computation of the ground and excited states of physical and chemical systems, but many of them require either large numbers of ancilla qubits or high-dimensional optimization in the presence of noise. The quantum imaginary-time evolution (QITE) and quantum Lanczos (QLanczos) methods proposed in Motta et al. (2020) eschew the aforementioned issues. In this study, we demonstrate the practical application of these algorithms to challenging quantum computations of relevance for chemistry and nuclear physics, using the deuteron-binding energy and molecular hydrogen binding and excited state energies as examples. With the correct choice of initial and final states, we show that the number of timesteps in QITE and QLanczos can be reduced significantly, which commensurately simplifies the required quantum circuit and improves compatibility with NISQ devices. We have performed these calculations on cloud-accessible IBM Q quantum computers. With the application of readout-error mitigation and Richardson error extrapolation, we have obtained ground and excited state energies that agree well with exact results obtained from diagonalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

Imaginary Time Propagation on a Quantum Chip

We report evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter, and nuclear physics. We propose an algorithm to implement imaginary time propagation on a quantum computer. Our algorithm is devised in the context of an efficient encoding into an optimized gate, drawing on the underlying characteristics of the quantum device of a unitary operation in an extended Hilbert space. However, we prove that for simple problems it can also be successfully applied to standard digital quantum machines. This work paves the way for porting quantum many-body methods based on imaginary-time propagation to near-term quantum devices, enabling the future quantum simulation of the ground states of a broad class of microscopic systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Monotonic multi-state quantum f -divergences

We use the Tomita–Takesaki modular theory and the Kubo–Ando operator mean to write down a large class of multi-state quantum f-divergences and prove that they satisfy the data processing inequality. For two states, this class includes the (α, z)-Rényi divergences, the f-divergences of Petz, and the Rényi Belavkin-Staszewski relative entropy as special cases. The method used is the interpolation theory of non-commutative Lωp spaces, and the result applies to general von Neumann algebras, including the local algebra of quantum field theory. We conjecture that these multi-state Rényi divergences have operational interpretations in terms of the optimal error probabilities in asymmetric multi-state quantum state discrimination.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Increased Reliability for Near-Term Quantum Computers via Low-Level Control (CRADA Final Report)

This project helped narrow the gap between near-term hardware and practical applications of quantum computing through the development and implementation of optimized compilation and error mitigation techniques. These advances were enabled by low-level control available on the Advanced Quantum Testbed, and led to methods that characterized and improved the platform’s performance on quantum algorithms. Results of this work were published in the scientific literature and used to inform internal software development of partner Super.tech.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enhancing quantum annealing accuracy through replication-based error mitigation *

Abstract Quantum annealers like those manufactured by D-Wave Systems are designed to find high quality solutions to optimization problems that are typically hard for classical computers. They utilize quantum effects like tunneling to evolve toward low-energy states representing solutions to optimization problems. However, their analog nature and limited control functionalities present challenges to correcting or mitigating hardware errors. As quantum computing advances towards applications, effective error suppression is an important research goal. We propose a new approach called replication based mitigation (RBM) based on parallel quantum annealing (QA). In RBM, physical qubits representing the same logical qubit are dispersed across different copies of the problem embedded in the hardware. This mitigates hardware biases, is compatible with limited qubit connectivity in current annealers, and is well-suited for currently available noisy intermediate-scale quantum annealers. Our experimental analysis shows that RBM provides solution quality on par with previous methods while being more flexible and compatible with a wider range of hardware connectivity patterns. In comparisons against standard QA without error mitigation on larger problem instances that could not be handled by previous methods, RBM consistently gets better energies and ground state probabilities across parameterized problem sets.

Djidjev, Hristo N. (ORCID:0000000192868824)↗
DOE OSTI2020

Noise resilience of variational quantum compiling

Variational hybrid quantum-classical algorithms (VHQCAs) are near-term algorithms that leverage classical optimization to minimize a cost function, which is efficiently evaluated on a quantum computer. Recently VHQCAs have been proposed for quantum compiling, where a target unitary U is compiled into a short-depth gate sequence V. In this work, we report on a surprising form of noise resilience for these algorithms. Namely, we find one often learns the correct gate sequence V (i.e. the correct variational parameters) despite various sources of incoherent noise acting during the cost-evaluation circuit. Our main results are rigorous theorems stating that the optimal variational parameters are unaffected by a broad class of noise models, such as measurement noise, gate noise, and Pauli channel noise. Furthermore, our numerical implementations on IBM's noisy simulator demonstrate resilience when compiling the quantum Fourier transform, Toffoli gate, and W-state preparation. Hence, variational quantum compiling, due to its robustness, could be practically useful for noisy intermediate-scale quantum devices. Finally, we speculate that this noise resilience may be a general phenomenon that applies to other VHQCAs such as the variational quantum eigensolver.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Anomalous thermodynamic properties of quantum critical superconductors

Recent high-precision measurements employing different experimental techniques have unveiled an anomalous peak in the doping dependence of the London penetration depth which is accompanied by anomalies in the heat capacity in iron-pnictide superconductors at the optimal composition associated with the hidden antiferromagnetic quantum critical point. Here, we argue that finite temperature effects can be a cause of observed features. Specifically we show that quantum critical magnetic fluctuations under superconducting dome can give rise to a nodal-like temperature dependence of both specific heat and magnetic penetration depth in a fully gapped superconductor. In the presence of line nodes in the superconducting gap fluctuations can lead to the significant renormalization of the relative slope of T-linear penetration depth which is steepest at the quantum critical point. The results we obtain are general and can be applied beyond the model we use.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2022

CHESS: The future direct geometry spectrometer at the second target station

CHESS, chopper spectrometer examining small samples, is a planned direct geometry neutron chopper spectrometer designed to detect and analyze weak signals intrinsic to small cross sections (e.g., small mass, small magnetic moments, or neutron absorbing materials) in powders, liquids, and crystals. CHESS is optimized to enable transformative investigations of quantum materials, spin liquids, thermoelectrics, battery materials, and liquids. The broad dynamic range of the instrument is also well suited to study relaxation processes and excitations in soft and biological matter. The 15 Hz repetition rate of the Second Target Station at the Spallation Neutron Source enables the use of multiple incident energies within a single source pulse, greatly expanding the information gained in a single measurement. Furthermore, the high flux grants an enhanced capability for polarization analysis. This enables the separation of nuclear from magnetic scattering or coherent from incoherent scattering in hydrogenous materials over a large range of energy and momentum transfer. This paper presents optimizations and technical solutions to address the key requirements envisioned in the science case and the anticipated uses of this instrument.

47 OTHER INSTRUMENTATION↗
DOE OSTI2018

Benchmarking treewidth as a practical component of tensor network simulations

Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor ranks and the order in which they are contracted. Unfortunately, computing optimal contraction sequences (orderings) in general is known to be a computationally difficult (NP-complete) task. In 2005, Markov and Shi showed that optimal contraction sequences correspond to optimal (minimum width) tree decompositions of a tensor network’s line graph, relating the contraction sequence problem to a rich literature in structural graph theory. While treewidth-based methods have largely been ignored in favor of dataset-specific algorithms in the prior tensor networks literature, we demonstrate their practical relevance for problems arising from two distinct methods used in quantum simulation: multi-scale entanglement renormalization ansatz (MERA) datasets and quantum circuits generated by the quantum approximate optimization algorithm (QAOA). We exhibit multiple regimes where treewidth-based algorithms outperform domain-specific algorithms, while demonstrating that the optimal choice of algorithm has a complex dependence on the network density, expected contraction complexity, and user run time requirements. We further provide an open source software framework designed with an emphasis on accessibility and extendability, enabling replicable experimental evaluations and future exploration of competing methods by practitioners.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Spin-squeezed Gottesman-Kitaev-Preskill codes for quantum error correction in atomic ensembles

Gottesman-Kitaev-Preskill (GKP) codes encode a qubit in displaced phase-space combs of a continuous-variable (CV) quantum system and are useful for correcting a variety of high-weight photonic errors. Here we propose atomic ensemble analogs of the single-mode CV GKP code by using the quantum central limit theorem to pull back the phase-space structure of a CV system to the compact phase space of a quantum spin system. We study the optimal recovery performance of these codes under error channels described by stochastic relaxation and isotropic ballistic dephasing processes using the diversity combining approach for calculating channel fidelity. Additionally, we find that the spin GKP codes outperform other spin system codes such as cat codes or binomial codes. Our spin GKP codes based on the two-axis countertwisting interaction and superpositions of SU(2) coherent states are direct spin analogs of the finite-energy CV GKP codes, whereas our codes based on one-axis twisting do not yet have well-studied CV analogs. A state preparation scheme for the spin GKP codes is proposed which uses the linear-combination-of-unitaries method, applicable to both the CV and spin GKP settings. Finally, we discuss a fault-tolerant approximate gate set for quantum computing with spin-GKP-encoded qubits, obtained by translating gates from the CV GKP setting using the quantum central limit theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRSDate not supplied

A NASA Perspective on Quantum Computing: Algorithmic Opportunities and Challenges

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, however, it is currently unknown whether quantum algorithms can provide an advantage, and if so how to design quantum algorithms that realize such advantages. Today, classical heuristics are used to solve many of the most challenging computational problems arising in the practical world, algorithms that have been shown to be effective empirically but have not been mathematically proven to outperform other approaches. With the advent of quantum advantage, the ability of current quantum hardware to do certain computations beyond the ability of even that largest supercomputers, we have an unprecedented opportunity to explore heuristic quantum algorithms. The next few years will be exciting as empirical testing of quantum heuristic algorithms becomes more and more feasible. The talk will begin overview of the NASA QuAIL team’s ongoing quantum computing investigations, and then focus on both near-term and longer term algorithms for optimization, including distributed algorithms.

quantum computing↗
DOE OSTI2021

Adaptive job and resource management for the growing quantum cloud

As the popularity of quantum computing continues to grow, efficient quantum machine access over the cloud is critical to both academic and industry researchers across the globe. And as cloud quantum computing demands increase exponentially, the analysis of resource consumption and execution characteristics are key to efficient management of jobs and resources at both the vendor-end as well as the client-end. While the analysis and optimization of job / resource consumption and management are popular in the classical HPC domain, it is severely lacking for more nascent technology like quantum computing.This paper proposes optimized adaptive job scheduling to the quantum cloud taking note of primary characteristics such as queuing times and fidelity trends across machines, as well as other characteristics such as quality of service guarantees and machine calibration constraints. Key components of the proposal include a) a prediction model which predicts fidelity trends across machine based on compiled circuit features such as circuit depth and different forms of errors, as well as b) queuing time prediction for each machine based on execution time estimations. Altogether, this proposal is evaluated on simulated IBM machines across a diverse set of quantum applications and system loading scenarios, and is able to reduce wait times by over 3x and improve fidelity by over 40% on specific usecases, when compared to traditional job schedulers.

97 MATHEMATICS AND COMPUTING↗