Search NASA⌕ Search

SEARCH · Search NASA

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 955 records · Page 53

Coherent versus incoherent sequential quantum measurements

We compare a trade-off between knowledge and decoherence for the incoherent and coherent partial sequential compatible measurements on single-qubit systems. The individual partial measurement nondestructively monitors basis states of the system by single-qubit meter. For the same decoherence caused by this unbiased measurement, the individual coherent measurement gives more knowledge than the incoherent one. For identical sequential coherent measurements, knowledge accumulated not additively increases more slowly than for the incoherent measurements. The overall knowledge can be accumulated using an adaptive measurement strategy on the meters if the single-qubit coherence of meters is kept. On the other hand, preservation of the mutual qubit coherence between the meters necessary for the collective measurement strategy is not required. A loss of single-qubit coherence degrades the coherent measurements back to the incoherent ones. Since the decoherence caused by the measurement process is a quadratic function of knowledge extracted by the individual measurement, Zeno-like behavior can be observed for repetitive weak compatible measurements. This unconditional universal effect does not depend on any dynamics of the qubit and it is a direct consequence of optimally controlled sequential evolution of quantum information.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Mitigating the Sign Problem through Basis Rotations

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. Herein, we show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β ≳ 100, this accelerates such simulation by many orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Long Wavelength Quantum Well Infrared Photodetector (QWIP) Research at Jet Propulsion Laboratory

One of the simplest device realizations of the classic particle-in-the-box problem of basic quantum mechanics is the Quantum Well Infrared Photodetector (QWIP). Optimization of the detector design and material growth and processing has culminated in the realization of a 15 ??utoff 128x128 focal plane array camera and a camera with large (256x256 pixel) focal plane array of QWIPs which can see at 8.5 ??holding forth great promise for a variety of applications in the 6-25 ??avelength range. This paper discusses the physics of the QWIP and QWIP technology development at Jet Propulsion Laboratory

QWIP↗

Amplifying the Red-Emission of Upconverting Nanoparticles for Biocompatible Clinically Used Prodrug-Induced Photodynamic Therapy

A class of biocompatible upconverting nanoparticles (UCNPs) with largely amplified red-emissions was developed. The optimal UCNP shows a high absolute upconversion quantum yield of 3.2% in red-emission, which is 15-fold stronger than the known optimal β-phase core/shell UCNPs. When conjugated to aminolevulinic acid, a clinically used photodynamic therapy (PDT) prodrug, significant PDT effect in tumor was demonstrated in a deep-tissue (>1.2 cm) setting in vivo at a biocompatible laser power density. Furthermore, we show that our UCNP–PDT system with NIR irradiation outperforms clinically used red light irradiation in a deep tumor setting in vivo. This study marks a major step forward in photodynamic therapy utilizing UCNPs to effectively access deep-set tumors.Lastly, it also provides an opportunity for the wide application of upconverting red radiation in photonics and biophotonics.

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum exitation gap, gmin = O(n2(sup -n/2)), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, Vadius↗

Dynamics of Quantum Adiabatic Evolution Algorithm for Number Partitioning

We have developed a general technique to study the dynamics of the quantum adiabatic evolution algorithm applied to random combinatorial optimization problems in the asymptotic limit of large problem size n. We use as an example the NP-complete Number Partitioning problem and map the algorithm dynamics to that of an auxiliary quantum spin glass system with the slowly varying Hamiltonian. We use a Green function method to obtain the adiabatic eigenstates and the minimum excitation gap. g min, = O(n 2(exp -n/2), corresponding to the exponential complexity of the algorithm for Number Partitioning. The key element of the analysis is the conditional energy distribution computed for the set of all spin configurations generated from a given (ancestor) configuration by simultaneous flipping of a fixed number of spins. For the problem in question this distribution is shown to depend on the ancestor spin configuration only via a certain parameter related to 'the energy of the configuration. As the result, the algorithm dynamics can be described in terms of one-dimensional quantum diffusion in the energy space. This effect provides a general limitation of a quantum adiabatic computation in random optimization problems. Analytical results are in agreement with the numerical simulation of the algorithm.

Smelyanskiy, V. N.↗

Correlation between thickness dependent nanoscale structural chemistry and superconducting properties of ultrathin epitaxial NbN films

NbN-based superconductors have attracted interest for superconducting circuits, quantum computation and high frequency devices. The superconducting properties of NbN films are predominately reliant on the microstructure, therefore, an atomic-level understanding of the structure-chemistry is required to achieve high quality epitaxial NbN films. Here, in this study, the thickness-dependent superconducting properties of NbN films (5, 10, and 50 nm) within NbN/AlN/Al 2 O 3 heterostructures are investigated. NbN and AlN were epitaxially grown by an industrial scale physical vapor deposition technique. The role of nanoscale chemistry on the ultrathin NbN superconducting film is investigated at the atomic level for the first time via atom probe tomography, providing three-dimensional atomic distribution, chemical homogeneity, effect of impurities, specially, in secondary phase formations and interfacial abruptness. The NbN film with 5 nm of thickness demonstrates a superconducting transition temperature of 11.2 K as compared to 50 nm NbN films with a transition temperature of 15.3 K. These thickness dependent variation of superconducting properties are associated with the chemical inhomogeneity in terms of in-plane N:Nb distribution, secondary phase formations and NbN/AlN interfacial abruptness as a function of the NbN films thicknesses. The analysis depicts the interplay between the surface/interface and the superconducting properties of ultrathin NbN films. These results provide insights on material design and growth that will enable the development of optimized superconducting NbN films for quantum devices.

36 MATERIALS SCIENCE↗

Ising Processing Units: Potential and Challenges for Discrete Optimization

The recent emergence of novel computational devices, such as adiabatic quantum computers, CMOS annealers, and optical parametric oscillators, presents new opportunities for hybrid-optimization algorithms that leverage these kinds of specialized hardware. In this work, we propose the idea of an Ising processing unit as a computational abstraction for these emerging tools. Challenges involved in using and bench- marking these devices are presented, and open-source software tools are proposed to address some of these challenges. The proposed benchmarking tools and methodology are demonstrated by conducting a baseline study of established solution methods to a D-Wave 2X adiabatic quantum computer, one example of a commercially available Ising processing unit.

97 MATHEMATICS AND COMPUTING↗

Quantum communications work at SQMS

The Superconducting Quantum Materials and Systems (SQMS) Center is focused on advancing low-loss interconnectivity between quantum processing units (QPUs) to enable scalable quantum computing. In the short term, our goals include the development and optimization of 2D and 3D platforms with remotely entangled modules, refinement in microwave design and control schemes, and the achievement of high-fidelity quantum state transfer between superconducting quantum modules. Looking ahead, we aim to realize modular quantum computing with low-loss interconnects, maximize remote entanglement fidelity and implement robust quantum operations with error correction. We will leverage advanced microwave engineering and material science to optimize the performance of quantum interconnects and the coupling interfaces between the interconnects and the QPUs.

Vallières, André↗

Uncertainty relations as Hilbert space geometry

Precision measurements involve the accurate determination of parameters through repeated measurements of identically prepared experimental setups. For many parameters there is a 'natural' choice for the quantum observable which is expected to give optimal information; and from this observable one can construct an Heinsenberg uncertainty principle (HUP) bound on the precision attainable for the parameter. However, the classical statistics of multiple sampling directly gives us tools to construct bounds for the precision available for the parameters of interest (even when no obvious natural quantum observable exists, such as for phase, or time); it is found that these direct bounds are more restrictive than those of the HUP. The implication is that the natural quantum observables typically do not encode the optimal information (even for observables such as position, and momentum); we show how this can be understood simply in terms of the Hilbert space geometry. Another striking feature of these bounds to parameter uncertainty is that for a large enough number of repetitions of the measurements all V quantum states are 'minimum uncertainty' states - not just Gaussian wave-packets. Thus, these bounds tell us what precision is achievable as well as merely what is allowed.

Braunstein, Samuel L.↗

Quantum computing for a profusion of postman problem variants

In this paper we study the viability of solving the Chinese Postman Problem, a graph routing optimization problem, and many of its variants on a quantum annealing device. Routing problem variants considered include graph type, directionally varying weights, number of parties involved in routing, among others. We put emphasis on the explanation of how to convert such problems into quadratic unconstrained binary optimization (QUBO) problems. QUBO is one of two equivalent natural paradigms for quantum annealing devices, the other being the Ising Model. We also expand upon a previously discovered algorithm for solving the Chinese Postman Problem on a closed undirected graph to decrease the number of constraints and variables used in the problem. Optimal annealing parameter settings and constraint weight values are discussed based on results from implementation on the D-Wave 2000Q and Advantage. Results from classical, purely quantum, and hybrid algorithms are compared.

97 MATHEMATICS AND COMPUTING↗

Posiform planting: generating QUBO instances for benchmarking

We are interested in benchmarking both quantum annealing and classical algorithms for minimizing quadratic unconstrained binary optimization (QUBO) problems. Such problems are NP-hard in general, implying that the exact minima of randomly generated instances are hard to find and thus typically unknown. While brute forcing smaller instances is possible, such instances are typically not interesting due to being too easy for both quantum and classical algorithms. In this contribution, we propose a novel method, called posiform planting , for generating random QUBO instances of arbitrary size with known optimal solutions, and use those instances to benchmark the sampling quality of four D-Wave quantum annealers utilizing different interconnection structures (Chimera, Pegasus, and Zephyr hardware graphs) and the simulated annealing algorithm. Posiform planting differs from many existing methods in two key ways. It ensures the uniqueness of the planted optimal solution, thus avoiding groundstate degeneracy, and it enables the generation of QUBOs that are tailored to a given hardware connectivity structure, provided that the connectivity is not too sparse. Posiform planted QUBOs are a type of 2-SAT boolean satisfiability combinatorial optimization problems. Our experiments demonstrate the capability of the D-Wave quantum annealers to sample the optimal planted solution of combinatorial optimization problems with up to 5, 627 qubits.

97 MATHEMATICS AND COMPUTING↗

Basic Research Needs in Quantum Computing and Networking

Employing quantum mechanical resources in computing, information processing, and networking opens the door to potential exponential advantages over classical counterparts. However, quantifying and realizing such advantages poses extensive scientific and engineering challenges. Department of Energy (DOE) investments have driven steady progress in addressing such challenges. Recently developed quantum algorithms offer asymptotic exponential advantages in speed or accuracy for fundamental scientific problems. These problems include simulating physical systems, solving systems of linear equations, differential equations, and optimization problems. Empirical demonstrations on nascent quantum hardware suggest better performance on contrived computational tasks than classical analogs. However, the requirements for a quantum computer or network to demonstrate an end-to-end rigorously quantifiable performance improvement over classical analogs remains a grand challenge, especially for problems of practical value. In particular, what will be required for quantum technology to ultimately exhibit scalable, rigorous, and transformative performance advantages for practical applications? In July 2023, DOE’s Advanced Scientific Computing Research program in the Office of Science convened the Workshop on Basic Research Needs in Quantum Computing and Networking, where major opportunities and grand challenges were identified. The following five priority research directions (PRDs) were identified as a result of the workshop.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Opportunities in full-stack design of low-overhead fault-tolerant quantum computation

Quantum error correction provides a route to realizing large-scale quantum computation but incurs substantial resource overheads. Here, in this work, we highlight recent advances that reduce these overheads by co-designing different levels of the computational stack, including algorithms, quantum-error-correction strategies and hardware architecture. We then discuss opportunities for further optimization such as leveraging flexible qubit connectivity and quantum low-density parity check codes. These strategies can bring useful quantum computation closer to reality as experiments advance in the coming years.

quantum information↗

Quantum Monte Carlo determination of the principal Hugoniot of deuterium

Here, we present coupled electron-ion Monte Carlo results for the principal Hugoniot of deuterium together with an accurate study of the initial reference state of shock-wave experiments. We discuss the influence of nuclear quantum effects, thermal electronic excitations, and the convergence of the potential energy surface by wave-function optimization within variational Monte Carlo and projection quantum Monte Carlo methods. Compared to a previous study, our calculations also include low pressure-temperature (P,T) conditions resulting in close agreement with experimental data, while our revised results at higher (P,T) conditions still predict a more compressible Hugoniot than experimentally observed.

36 MATERIALS SCIENCE↗

Representation Learning via Quantum Neural Tangent Kernels

Variational quantum circuits are used in quantum machine learning and variational quantum simulation tasks. Designing good variational circuits or predicting how well they perform for given learning or optimization tasks is still unclear. Here we discuss these problems, analyzing variational quantum circuits using the theory of neural tangent kernels. We define quantum neural tangent kernels, and derive dynamical equations for their associated loss function in optimization and learning tasks. We analytically solve the dynamics in the frozen limit, or lazy training regime, where variational angles change slowly and a linear perturbation is good enough. We extend the analysis to a dynamical setting, including quadratic corrections in the variational angles. We then consider a hybrid quantum classical architecture and define a large-width limit for hybrid kernels, showing that a hybrid quantum classical neural network can be approximately Gaussian. The results presented here show limits for which analytical understandings of the training dynamics for variational quantum circuits, used for quantum machine learning and optimization problems, are possible. These analytical results are supported by numerical simulations of quantum machine-learning experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal block-tridiagonalization of matrices for coherent charge transport

Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms require the tight-binding Hamiltonian to be in the form of a block-tridiagonal matrix. Here, we develop a matrix reordering algorithm based on graph partitioning techniques that yields the optimal block-tridiagonal form for quantum transport. The reordered Hamiltonian can lead to significant performance gains in transport calculations, and allows to apply conventional two-terminal algorithms to arbitrarily complex geometries, including multi-terminal structures. The block-tridiagonalization algorithm can thus be the foundation for a generic quantum transport code, applicable to arbitrary tight-binding systems. We demonstrate the power of this approach by applying the block-tridiagonalization algorithm together with the recursive Green's function algorithm to various examples of mesoscopic transport in two-dimensional electron gases in semiconductors and graphene.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

In situ formation of pseudohalide anions induced by humid air and light passivates formamidinium‐based halide perovskites

Abstract Metal halide perovskites based on formamidinium (FA), or FA‐rich compositions have shown great promise for high‐performance photovoltaics. A deeper understanding of the impact of ambient conditions (e.g., moisture, oxygen, and illumination) on the possible reactions of FA‐based perovskite films and their processing sensitivities has become critical for further advances toward commercialization. Herein, we investigate reactions that take place on the surface of the FA 0.7 Cs 0.3 , mixed Br/I wide bandgap perovskite thin films in the presence of humid air and ambient illumination. The treatment forms a surface layer containing O, OH, and N‐based anions. We propose the latter originates from formamidine trapped at the perovskite/oxide interface reacting further to cyanide and/or formamidinate—an understudied class of pseudohalides that bind to Pb. Optimized treatment conditions improve photoluminescence quantum yield owing to both reduced surface recombination velocity and increased bulk carrier lifetime. The corresponding perovskite solar cells also exhibit improved performance. Identifying these reactions opens possibilities for better utilizing cyanide and amidinate ligands, species that may be expected during vapor processing of FA‐based perovskites. Our work also provides new insights into the self‐healing or self‐passivating of MA‐free perovskite compositions where FA and iodide damage could be partially offset by advantageous reaction byproducts. image

14 SOLAR ENERGY↗