Search NASA⌕ Search

SEARCH · Search NASA

Results for “Adiabatic 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 91 records · Page 5

Adiabatic creation of atomic squeezing in dark states versus decoherences

We study the multipartite correlations of the multiatom dark states, which are characterized by the atomic squeezing beyond the pairwise entanglement. It is shown that, in the photon storage process with atomic ensemble via the electromagnetically induced transparency (EIT) mechanism, the atomic squeezing and the pairwise entanglement can be created by adiabatically manipulating the Rabi frequency of the classical light field on the atomic ensemble. We also consider the sudden death for the atomic squeezing and the pairwise entanglement under various decoherence channels. An optimal time for generating the greatest atomic squeezing and pairwise entanglement is obtained by studying in detail the competition between the adiabatic creation of quantum correlation in the atomic ensemble and the decoherence that we describe with three typical decoherence channels.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient state preparation for the Schwinger model with a theta term

We present a comparison of different quantum state preparation algorithms and their overall efficiency for the Schwinger model with a theta term. While adiabatic state preparation is proved to be effective, in practice it leads to large gate counts to prepare the ground state. The quantum approximate optimization algorithm (QAOA) provides excellent results while keeping the counts small by design, at the cost of an expensive classical minimization process. We introduce a “blocked” modification of the Schwinger Hamiltonian to be used in the QAOA that further decreases the length of the algorithms as the size of the problem is increased. The rodeo algorithm (RA) provides a powerful tool to efficiently prepare any eigenstate of the Hamiltonian, as long as its overlap with the initial guess is large enough. We obtain the best results when combining the blocked QAOA ansatz and the RA, as this provides an excellent initial state with a relatively short algorithm without the need to perform any classical steps for large problem sizes. Published by the American Physical Society 2025

Bazavov, Alexei (ORCID:0000000321411901)↗

Parallel transport dynamics for mixed quantum states with applications to time-dependent density functional theory

Direct simulation of the von Neumann dynamics for a general (pure or mixed) quantum state can often be expensive. One prominent example is the real-time time-dependent density functional theory (rt-TDDFT), a widely used framework for the first principle description of many-electron dynamics in chemical and materials systems. Practical rt-TDDFT calculations often avoid the direct simulation of the von Neumann equation, and solve instead a set of Schrödinger equations, of which the dynamics is equivalent to that of the von Neumann equation. However, the time step size employed by the Schrödinger dynamics is often much smaller. Here, in order to improve the time step size and the overall efficiency of the simulation, we generalize a recent work of the parallel transport (PT) dynamics for simulating pure states [An, Lin, Multiscale Model. Simul. 18, 612, 2020] to general quantum states. The PT dynamics provides the optimal gauge choice, and can employ a time step size comparable to that of the von Neumann dynamics. Going beyond the linear and near adiabatic regime in previous studies, we find that the error of the PT dynamics can be bounded by certain commutators between Hamiltonians, density matrices, and their derived quantities. Such a commutator structure is not present in the Schrödinger dynamics. We demonstrate that the parallel transport-implicit midpoint (PT-IM) method is a suitable method for simulating the PT dynamics, especially when the spectral radius of the Hamiltonian is large. The commutator structure of the error bound, and numerical results for model rt-TDDFT calculations in both linear and nonlinear regimes, confirm the advantage of the PT dynamics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Zeno Dragging for Quantum Control: A Shortcut to Zeno with Action-Based Scheduling Optimization

The quantum Zeno effect asserts that quantum measurements inhibit simultaneous unitary dynamics when the “collapse” events are sufficiently strong and frequent. This applies in the limit of strong continuous measurement or dissipation. It is possible to implement a dissipative control that is known as “Zeno dragging” by dynamically varying the monitored observable, and hence also the eigenstates, which are attractors under Zeno dynamics. This is similar to adiabatic processes, in that the Zeno-dragging fidelity is highest when the rate of eigenstate change is slow compared to the measurement rate. We demonstrate here two theoretical methods for using such dynamics to achieve control of quantum systems. The first, which we shall refer to as “shortcut to Zeno,” is analogous to the shortcuts to adiabaticity (counterdiabatic driving) that are frequently used to accelerate unitary adiabatic evolution. In the second approach, we apply the Chantasri-Dressel-Jordan stochastic action [PRA 88, 042110 (2013)], and demonstrate that the extremal-probability readout paths derived from this are well suited to setting up a Pontryagin-style optimization of the Zeno-dragging schedule. A fundamental contribution of the latter approach is to show that an action suitable for measurement-driven control optimization can be derived quite generally from statistical arguments. Implementing these methods on the Zeno dragging of a qubit, we find that both approaches yield the same solution, namely, that the optimal control is a unitary that matches the motion of the Zeno-monitored eigenstate. We then show that such a solution can be more robust than a unitary-only operation and we comment on solvable generalizations of our qubit example embedded in larger systems. These methods open up new pathways toward systematically developing dynamic control of Zeno subspaces to realize dissipatively stabilized quantum operations. Published by the American Physical Society 2024

Physics↗

Feedback-based quantum algorithm inspired by counterdiabatic driving

In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to iteratively construct quantum circuits. Here, we propose a substantial enhancement by implementing a protocol that uses ideas from quantum Lyapunov control and the counterdiabatic driving protocol, a key concept from quantum adiabaticity. Our approach introduces an additional control field inspired by counterdiabatic driving. We apply our algorithm to prepare ground states in one-dimensional quantum Ising spin chains. Comprehensive simulations demonstrate a remarkable acceleration in population transfer to low-energy states within a significantly reduced time frame compared to conventional feedback-based quantum algorithms. This acceleration translates to a reduced quantum circuit depth, a critical metric for potential quantum computer implementation. We validate our algorithm on the IBM cloud computer, highlighting its efficacy in expediting quantum computations for many-body systems and combinatorial optimization problems.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Quantum fluctuation theorem for error diagnostics in quantum annealers

Near term quantum hardware promises unprecedented computational advantage. Crucial in its development is the characterization and minimization of computational errors. We introduce the use of the quantum fluctuation theorem to benchmark the accuracy of quantum annealers. This versatile tool provides simple means to determine whether the quantum dynamics are unital, unitary, and adiabatic, or whether the system is prone to thermal noise. Our proposal is experimentally tested on two generations of the D-Wave machine, which illustrates the sensitivity of the fluctuation theorem to the smallest aberrations from ideal annealing. In addition, for the optimally operating D-Wave machine, our experiment provides the first experimental verification of the integral fluctuation in an interacting, many-body quantum system.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields

In this work, we introduce a new iterative quantum algorithm, called Iterative Symphonic Tunneling for Satisfiability problems (IST-SAT), which solves quantum spin glass optimization problems using high-frequency oscillating transverse fields. IST-SAT operates as a sequence of iterations, in which bitstrings returned from one iteration are used to set spin-dependent phases in oscillating transverse fields in the next iteration. Over several iterations, the novel mechanism of the algorithm steers the system toward the problem ground state. We benchmark IST-SAT on sets of hard MAX-3-XORSAT problem instances with exact state vector simulation, and report polynomial speedups over Trotterized adiabatic quantum computation and the best known semi-greedy classical algorithm. When IST-SAT is seeded with a sufficiently good initial approximation, the algorithm converges to exact solution(s) in a polynomial number of iterations. Our numerical results identify a critical Hamming radius, or quality of initial approximation, where the time-to-solution crosses from exponential to polynomial scaling in problem size. This work proposes IST-SAT a new quantum algorithm, which improves upon solutions obtained from initial classical or quantum optimization algorithms. The steering mechanism we introduce through IST-SAT presents a new path toward achieving quantum advantage in optimization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Super-heavy electron material as metallic refrigerant for adiabatic demagnetization cooling

Low-temperature refrigeration is of crucial importance in fundamental research of condensed matter physics, because the investigations of fascinating quantum phenomena, such as superconductivity, superfluidity, and quantum criticality, often require refrigeration down to very low temperatures. Currently, cryogenic refrigerators with 3 He gas are widely used for cooling below 1 Kelvin. However, usage of the gas has been increasingly difficult because of the current world-wide shortage. Therefore, it is important to consider alternative methods of refrigeration. We show that a new type of refrigerant, the super-heavy electron metal YbCo 2 Zn 20 , can be used for adiabatic demagnetization refrigeration, which does not require 3 He gas. This method has a number of advantages, including much better metallic thermal conductivity compared to the conventional insulating refrigerants. We also demonstrate that the cooling performance is optimized in Yb 1$-$x Sc x Co 2 Zn 20 by partial Sc substitution, with x ~ 0.19. The substitution induces chemical pressure that drives the materials to a zero-field quantum critical point. This leads to an additional enhancement of the magnetocaloric effect in low fields and low temperatures, enabling final temperatures well below 100 mK. This performance has, up to now, been restricted to insulators. For nearly a century, the same principle of using local magnetic moments has been applied for adiabatic demagnetization cooling. Lastly, this study opens new possibilities of using itinerant magnetic moments for cryogen-free refrigeration.

36 MATERIALS SCIENCE↗

Optimal time schedule for adiabatic evolution

We show that, provided dephasing is taken into account, there is a unique timetable which maximizes the fidelity with a target state in adiabatic evolutions. The optimum has constant tunneling rate along the path. Application to quantum search algorithms recovers the Grover result for appropriate scaling of the dephasing with the size of the database. Moreover, the Grover bound imposes constraints on the dephasing rates of systems coupled to a universal Markovian bath.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global control methods for Greenberger-Horne-Zeilinger-state generation on a one-dimensional Ising chain

We discuss how to prepare an Ising chain in a GHZ state using a single global control field only. This model does not require the spins to be individually addressable and is applicable to quantum systems such as cold atoms in optical lattices, some liquid- or solid-state NMR experiments, and many nanoscale quantum structures. We show that GHZ states can always be reached asymptotically from certain easy-to-prepare initial states using adiabatic passage, and under certain conditions finite-time reachability can be ensured. To provide a reference useful for future experimental implementations, three different control strategies to achieve the objective--adiabatic passage, Lyapunov control, and optimal control--are compared, and their advantages and disadvantages discussed, in particular in the presence of realistic imperfections such as imperfect initial state preparation, system inhomogeneity, and dephasing.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Decomposition Algorithms for Scalable Quantum Annealing

The presented python code provides wrapper functions for two decomposition algorithms: One algorithm to decompose Maximum Clique problems and one to decompose Minimum Vertex Cover problems. The functions take as input a networkx graph object, and decompose either problem on the input graph recursively into subproblems such that the optimal solution can be constructed from the optimal solutions of both subproblems. The recursion ends as soon as the subproblems reach a pre-specified size limit by the user, and they can be solved using any method provided in advance by the user as external function. This includes exact solvers or an adiabatic quantum annealer.

Pelofske, Elijah↗

Efficient photon coupling from a diamond nitrogen vacancy center by integration with silica fiber

A central goal in quantum information science is to efficiently interface photons with single optical modes for quantum networking and distributed quantum computing. Here, we introduce and experimentally demonstrate a compact and efficient method for the low-loss coupling of a solid-state qubit, the nitrogen vacancy (NV) center in diamond, with a single-mode optical fiber. In this approach, single-mode tapered diamond waveguides containing exactly one high quality NV memory are selected and integrated on tapered silica fibers. Numerical optimization of an adiabatic coupler indicates that near-unity-efficiency photon transfer is possible between the two modes. Experimentally, we find an overall collection efficiency between 16% and 37% and estimate a single photon count rate at saturation above 700 kHz. This integrated system enables robust, alignment-free, and efficient interfacing of single-mode optical fibers with single photon emitters and quantum memories in solids.

Optics↗

Theoretical investigation of charge transfer between N{sup 6+} and atomic hydrogen

Charge transfer due to collisions of ground-state N{sup 6+}(1s {sup 2} S) with atomic hydrogen has been investigated theoretically using the quantum-mechanical molecular-orbital close-coupling (QMOCC) method, in which the adiabatic potentials and nonadiabatic couplings were obtained using the multireference single- and double-excitation configuration-interaction (MRDCI) approach. Total, n-, l-, and S-resolved cross sections have been obtained for energies between 10 meV/u and 10 keV/u. The QMOCC results were compared to available experimental and theoretical data as well as to merged-beams measurements and atomic-orbital close-coupling and classical trajectory Monte Carlo calculations. The accuracy of the QMOCC charge-transfer cross sections was found to be sensitive to the accuracy of the adiabatic potentials and couplings. Consequently, we developed a method to optimize the atomic basis sets used in the MRDCI calculations for highly charged ions. Since cross sections, especially those that are state selective, are necessary input for x-ray emission simulation of heliospheric and Martian exospheric spectra arising from solar wind ion-neutral gas collisions, a recommended set of state-selective cross sections, based on our evaluation of the calculations and measurements, is provided.

74 ATOMIC AND MOLECULAR PHYSICS↗

Diabatic quantum annealing for the frustrated ring model

Abstract Quantum annealing (QA) is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare ground state and a problem Hamiltonian whose ground state encodes solutions to an optimization problem. The standard implementation relies on the evolution being adiabatic: keeping the system in the instantaneous ground state with high probability and requiring a time scale inversely related to the minimum energy gap between the instantaneous ground and excited states. However, adiabatic evolution can lead to evolution times that scale exponentially with the system size, even for computationally simple problems. Here, we study whether non-adiabatic evolutions with optimized annealing schedules can bypass this exponential slowdown for one such class of problems called the frustrated ring model. For sufficiently optimized annealing schedules and system sizes of up to 39 qubits, we provide numerical evidence that we can avoid the exponential slowdown. Our work highlights the potential of highly-controllable QA to circumvent bottlenecks associated with the standard implementation of QA.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scattering wave packets of hadrons in gauge theories: Preparation on a quantum computer

Quantum simulation holds promise of enabling a complete description of high-energy scattering processes rooted in gauge theories of the Standard Model. A first step in such simulations is preparation of interacting hadronic wave packets. To create the wave packets, one typically resorts to adiabatic evolution to bridge between wave packets in the free theory and those in the interacting theory, rendering the simulation resource intensive. In this work, we construct a wave-packet creation operator directly in the interacting theory to circumvent adiabatic evolution, taking advantage of resource-efficient schemes for ground-state preparation, such as variational quantum eigensolvers. By means of an ansatz for bound mesonic excitations in confining gauge theories, which is subsequently optimized using classical or quantum methods, we show that interacting mesonic wave packets can be created efficiently and accurately using digital quantum algorithms that we develop. Specifically, we obtain high-fidelity mesonic wave packets in the Z 2 and U(1) lattice gauge theories coupled to fermionic matter in 1+1 dimensions. Our method is applicable to both perturbative and non-perturbative regimes of couplings. The wave-packet creation circuit for the case of the Z 2 lattice gauge theory is built and implemented on the Quantinuum H1-1 trapped-ion quantum computer using 13 qubits and up to 308 entangling gates. The fidelities agree well with classical benchmark calculations after employing a simple symmetry-based noise-mitigation technique. This work serves as a step toward quantum computing scattering processes in quantum chromodynamics.

97 MATHEMATICS AND COMPUTING↗

Adiabatic two-qubit gates in capacitively coupled quantum dot hybrid qubits

Abstract The ability to tune qubits to flat points in their energy dispersions (“sweet spots”) is an important tool for mitigating the effects of charge noise and dephasing in solid-state devices. However, the number of derivatives that must be simultaneously set to zero grows exponentially with the number of coupled qubits, making the task untenable for as few as two qubits. This is a particular problem for adiabatic gates, due to their slower speeds. Here, we propose an adiabatic two-qubit gate for quantum dot hybrid qubits, based on the tunable, electrostatic coupling between distinct charge configurations. We confirm the absence of a conventional sweet spot, but show that controlled-Z (CZ) gates can nonetheless be optimized to have fidelities of ~99% for a typical level of quasistatic charge noise ( σ ε ≃ 1 μeV). We then develop the concept of a dynamical sweet spot (DSS), for which the time-averaged energy derivatives are set to zero, and identify a simple pulse sequence that achieves an approximate DSS for a CZ gate, with a 5× improvement in the fidelity. We observe that the results depend on the number of tunable parameters in the pulse sequence, and speculate that a more elaborate sequence could potentially attain a true DSS.

Frees, Adam (ORCID:0000000324711096)↗

Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing

We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state |x⟩ that is proportional to the solution of the system of linear equations $A\overrightarrow{x} = \overrightarrow{b}$. The time complexities of our algorithms are O(κ 2 log(κ)/ε) and O(κ log(κ)/ε), where κ is the condition number of A and ε is the precision. Both algorithms are constructed using families of Hamiltonians that are linear combinations of products of A, the projector onto the initial state |b⟩, and single-qubit Pauli operators. The algorithms are conceptually simple and easy to implement. They are not obtained from equivalences between the gate model and adiabatic quantum computing. They do not use phase estimation or variable-time amplitude amplification, and do not require large ancillary systems. We discuss a gate-based implementation via Hamiltonian simulation and prove that our second algorithm is almost optimal in terms of κ. Like previous methods, our techniques yield an exponential quantum speed-up under some assumptions. Our results emphasize the role of Hamiltonian-based models of quantum computing for the discovery of important algorithms.

97 MATHEMATICS AND COMPUTING↗

Assessment of approximate computational methods for conical intersections and branching plane vectors in organic molecules

Quantum-chemical computational methods are benchmarked for their ability to describe conical intersections in a series of organic molecules and models of biological chromophores. Reference results for the geometries, relative energies, and branching planes of conical intersections are obtained using ab initio multireference configuration interaction with single and double excitations (MRCISD). They are compared with the results from more approximate methods, namely, the state-interaction state-averaged restricted ensemble-referenced Kohn-Sham method, spin-flip time-dependent density functional theory, and a semiempirical MRCISD approach using an orthogonalization-corrected model. It is demonstrated that these approximate methods reproduce the ab initio reference data very well, with root-mean-square deviations in the optimized geometries of the order of 0.1 Å or less and with reasonable agreement in the computed relative energies. A detailed analysis of the branching plane vectors shows that all currently applied methods yield similar nuclear displacements for escaping the strong non-adiabatic coupling region near the conical intersections. Our comparisons support the use of the tested quantum-chemical methods for modeling the photochemistry of large organic and biological systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗