Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adiabatic quantum computing”

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 109 records · Page 6

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

Adiabatically implementing quantum gates

We show that, through the approach of quantum adiabatic evolution, all of the usual quantum gates can be implemented efficiently, yielding running time of order O(1). This may be considered as a useful alternative to the standard quantum computing approach, which involves quantum gates transforming quantum states during the computing process.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Mathematical foundation of quantum annealing

Quantum annealing is a generic name of quantum algorithms that use quantum-mechanical fluctuations to search for the solution of an optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum computation. The present paper reviews the mathematical and theoretical foundations of quantum annealing. In particular, theorems are presented for convergence conditions of quantum annealing to the target optimal state after an infinite-time evolution following the Schroedinger or stochastic (Monte Carlo) dynamics. It is proved that the same asymptotic behavior of the control parameter guarantees convergence for both the Schroedinger dynamics and the stochastic dynamics in spite of the essential difference of these two types of dynamics. Also described are the prescriptions to reduce errors in the final approximate solution obtained after a long but finite dynamical evolution of quantum annealing. It is shown there that we can reduce errors significantly by an ingenious choice of annealing schedule (time dependence of the control parameter) without compromising computational complexity qualitatively. A review is given on the derivation of the convergence condition for classical simulated annealing from the view point of quantum adiabaticity using a classical-quantum mapping.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adiabatic state preparation study of methylene

Quantum computers attract much attention as they promise to outperform their classical counterparts in solving certain type of problems. One of them with practical applications in quantum chemistry is simulation of complex quantum systems. An essential ingredient of efficient quantum simulation algorithms are initial guesses of the exact wave functions with high enough fidelity. As was proposed in Aspuru-Guzik et al. [Science 309, 1704 (2005)], the exact ground states can in principle be prepared by the adiabatic state preparation method. Here, we apply this approach to preparation of the lowest lying multireference singlet electronic state of methylene and numerically investigate preparation of this state at different molecular geometries. We then propose modifications that lead to speeding up the preparation process. Finally, we decompose the minimal adiabatic state preparation employing the direct mapping in terms of two-qubit interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Adiabatic Quantum Programming: Minor Embedding With Hard Faults

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

graph theory↗

Non-adiabatic quantum interference and complex formation in ultracold collisions of Rb with KRb

Ultracold elastic collisions of 87 Rb with 40 K 87 Rb in its ground vibrational and rotational state are investigated using a first principles based theoretical methodology. Full-dimensional ab initio computed potential energy surfaces are reported that include the two lowest-lying electronic states, their conical intersection, non-adiabatic couplings and an accurate long-range behavior. A numerically exact time-independent quantum dynamics method in hyperspherical coordinates is used to compute the elastic scattering cross sections, rate coefficients and collision lifetime spectrum. The quantum scattering calculations include all degrees of freedom and treat both electronic states and their non-adiabatic couplings using a two-state diabatic representation. The theoretically computed elastic rate coefficient is in good agreement with the recently reported experimental value. Significant non-adiabatic quantum interference effects are shown to originate from the unique properties of ultracold collisions and the geometric phase associated with the conical intersection. A high-resolution collision energy grid is used to investigate the origin of the experimentally reported long-lived 3-body collision complexes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Classical-Quantum Hybrid Approach for Unsupervised Probabilistic Machine Learning

For training unsupervised probabilistic machine learning models, matrix computation and sample generation are the two key steps. While GPUs excel at matrix computation, they use pseudo-random numbers to generate samples. Contrarily, Adiabatic Quantum Processors (AQP) use quantum mechanical systems to generate samples accurately and quickly, but are not suited for matrix computation. We present a Classical-Quantum Hybrid Approach for training unsupervised probabilistic machine learning models, leveraging GPUs for matrix computations and the D-Wave quantum sampling library for sample generation. We compare this approach to classical and quantum approaches across four performance metrics. Our results indicate that while the hybrid approach–which uses one AQP and one GPU–outperforms quantum and one of the classical approaches, it performs comparably to the GPU approach, and is outperformed by the CPU approach, which uses 56 high-end CPUs. Lastly, we compare sampling on AQP versus sampling library and show that AQP performs better.

Date, Prasanna↗

Biased degenerate ground-state sampling of small Ising models with converged quantum approximate optimization algorithm

The quantum alternating operator ansatz, a generalization of the quantum approximate optimization algorithm (QAOA), is a quantum algorithm used for approximately solving combinatorial optimization problems. QAOA typically uses the transverse field mixer as the driving Hamiltonian. One of the interesting properties of the transverse field driving Hamiltonian is that it results in nonuniform sampling of degenerate ground states of optimization problems. In this study, we numerically examine the fair sampling properties of the transverse field mixer QAOA, and Grover mixer QAOA (GM-QAOA), which provides theoretical guarantees of fair sampling of degenerate optimal solutions, up to a large enough p such that the mean expectation value converges to an optimal approximation ratio of 1. This comparison is performed with high-quality heuristically computed, but not necessarily optimal, QAOA angles, which give strictly monotonically improving solution quality as p increases. These angles are computed using the Julia based numerical simulation software JuliQAOA. Fair sampling of degenerate ground states is quantified using the Shannon entropy of the ground-state amplitudes distribution. The fair sampling properties are reported on several quantum signature Hamiltonians from previous quantum annealing fair sampling studies. Small random fully connected spin glasses are shown, which exhibit exponential suppression of some degenerate ground states with transverse field mixer QAOA. The transverse field mixer QAOA simulations show that some problem instances clearly saturate the Shannon entropy of 0 with a maximally biased distribution that occurs when the learning converges to an approximation ratio of 1 while other problem instances never deviate from a maximum Shannon entropy (uniform distribution) at any p step. Published by the American Physical Society 2025

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast, low-power manipulation of spin ensembles in superconducting microresonators

We demonstrate the use of high-Q superconducting coplanar waveguide (CPW) microresonators to perform rapid manipulations on a randomly distributed spin ensemble using very low microwave power (400 nW). This power is compatible with dilution refrigerators, making microwave manipulation of spin ensembles feasible for quantum computing applications. We also describe the use of adiabatic microwave pulses to overcome microwave magnetic field (B{sub 1}) inhomogeneities inherent to CPW resonators. This allows for uniform control over a randomly distributed spin ensemble. Sensitivity data are reported showing a single shot (no signal averaging) sensitivity to 10{sup 7} spins or 3×10{sup 4}spins/√(Hz) with averaging.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Compressed quantum simulation

Here, I summarize the results presented in B. Kraus, Phys. Rev. Lett. 107, 250503 (2011). Recently, it has been shown that certain circuits, the so-called match gate circuits, can be compressed to an exponentially smaller universal quantum computation. We use this result to demonstrate that the simulation of a 1-D Ising chain consisting of n qubits can be performed on a universal quantum computer running on only log(n) qubits. We show how the adiabatic evolution can be simulated on this exponentially smaller system and how the magnetization can be measured. Since the Ising model displays a quantum phase transition, this result implies that a quantum phase transition of a very large system can be observed with current technology.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Incoherent nonadiabatic to coherent adiabatic transition of electron transfer in colloidal quantum dot molecules

Electron transfer is a fundamental process in chemistry, biology, and physics. One of the most intriguing questions concerns the realization of the transitions between nonadiabatic and adiabatic regimes of electron transfer. Using colloidal quantum dot molecules, we computationally demonstrate how the hybridization energy (electronic coupling) can be tuned by changing the neck dimensions and/or the quantum dot sizes. This provides a handle to tune the electron transfer from the incoherent nonadiabatic regime to the coherent adiabatic regime in a single system. We develop an atomistic model to account for several states and couplings to the lattice vibrations and utilize the mean-field mixed quantum-classical method to describe the charge transfer dynamics. Here, we show that charge transfer rates increase by several orders of magnitude as the system is driven to the coherent, adiabatic limit, even at elevated temperatures, and delineate the inter-dot and torsional acoustic modes that couple most strongly to the charge transfer dynamics.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Universal quantum operation of spin-3/2 Blume-Capel chains

We propose a logical qubit based on the Blume-Capel model: A higher-spin generalization of the Ising chain which allows for an on-site anisotropy-preserving rotational invariance around the Ising axis. We show that such a spin-3/2 Blume-Capel model can also support localized Majorana zero modes at the ends of the chain. Inspired by known braiding protocols of these Majorana zero modes, upon appropriate manipulation of the system parameters, we demonstrate a set of universal gate operations which act on qubits encoded in the doubly degenerate ground states of the chain.

1-dimensional spin chains↗

Lower Bounds on Quantum Annealing Times

The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Herein, our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Cost of emulating a small quantum annealing problem in the circuit model

Demonstrations of quantum advantage for certain sampling problems have generated considerable excitement for quantum computing and have further spurred the development of circuit-model quantum computers, which represent quantum programs as a sequence of quantum gates acting on a finite number of qubits. Amongst this excitement, analog quantum computation has become less prominent, with the expectation that circuit-model quantum computers will eventually be sufficient for emulating analog quantum computation and thus rendering analog quantum computation obsolete. In this work we explore the basic requirements for emulating a specific analog quantum computation in the circuit model: the preparation of a biased superposition of degenerate ground states of an Ising Hamiltonian using an adiabatic evolution. We show that the overhead of emulation is substantial even for this simple problem. This supports using analog quantum computation for solving time-dependent Hamiltonian dynamics in the short term and midterm, assuming analog errors can be made low enough and coherence times long enough to solve problems of practical interest.

Quantum algorithms & computation↗

Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations

We introduce the Sequency Hierarchy Truncation (SeqHT) scheme for reducing the resources required for state preparation and time evolution in quantum simulations, based upon a truncation in sequency. For the λϕ 4 interaction in scalar field theory, or any interaction with a polynomial expansion, upper bounds on the contributions of operators of a given sequency are derived. For the systems we have examined, observables computed in sequency-truncated wavefunctions, including quantum correlations as measured by magic, are found to step-wise converge to their exact values with increasing cutoff sequency. The utility of SeqHT is demonstrated in the adiabatic state preparation of the λϕ 4 anharmonic oscillator ground state using IBM's quantum computer ibm_sherbrooke. Using SeqHT, the depth of the required quantum circuits is reduced by ∼ 30 % , leading to significantly improved determinations of observables in the quantum simulations. More generally, SeqHT is expected to lead to a reduction in required resources for quantum simulations of systems with a hierarchy of length scales.

Li, Zhiyao [Univ. of Washington, Seattle, WA (Unit↗