Search NASA⌕ Search

SEARCH · Search NASA

Results for “universal 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 199 records · Page 11

Characterizing Ultrafast Intersystem Crossing Pathways in Molecular Pt Dimers Using Time-Resolved Wide-Angle X-ray Scattering

Vibronic coupling between transition metal charge transfer states is a potential mechanism for enhancing the intersystem crossing (ISC) rate. Vibronic coupling-driven ISC has been observed in Pt­(II) dimer complexes, where the trajectory across excited-state pathways is tuned by atomic displacements via Pt–Pt stretching vibrations. Time-resolved wide-angle X-ray scattering (TR-WAXS) was utilized to quantify the Pt–Pt contraction following metal–metal-to-ligand charge transfer (MMLCT) excitation in Pt dimers with different bridging ligands. Both complexes exhibit Pt–Pt bond formation with a decrease in Pt–Pt distance of ∼ 0.25 Å and coherent vibrational wavepackets (CVWPs) encoded in the Pt–Pt contraction of both dimers. However, the complexes exhibit different time-dependent evolution of their CVWPs. Analysis of interference patterns between different CVWPs is used to track the trajectory across the excited-state surfaces. Furthermore, this work demonstrates that the interference between CVWPs in ultrafast TR-WAXS encodes indirect information regarding electronic excited-states to reveal the Pt dimer bridge-dependent ISC mechanism.

Computational chemistry↗

Faster Randomized Dynamical Decoupling

We present a randomized dynamical decoupling (DD) protocol that can substantially improve the performance of any given deterministic DD scheme for suppressing coherent noise by using no more than two additional pulses. Our construction is implemented by probabilistically applying sequences of pulses, which, when combined, effectively eliminate the error terms that scale linearly with the system-environment coupling strength. As a result, we show that a randomized protocol using a few pulses can outperform deterministic DD protocols that require considerably more pulses. Furthermore, we prove that the randomized protocol provides an improvement compared to deterministic DD sequences that aim to reduce the error in the system’s Hilbert space, such as Uhrig DD, which had been previously regarded to be optimal. To rigorously evaluate the performance, we introduce new analytical methods suitable for analyzing higher-order DD protocols that might be of independent interest. Here, we also present numerical simulations confirming the significant advantage of using randomized protocols compared to widely used deterministic protocols.

Quantum algorithms & computation↗

Qutrit Circuits and Algebraic Relations: A Pathway to Efficient Spin-1 Hamiltonian Simulation

Quantum information processing has witnessed significant advancements through the application of qubit- based techniques within universal gate sets. Recently, exploration beyond the qubit paradigm to d-dimensional quantum units or qudits has opened new avenues for improving computational efficiency. This paper delves into the qudit-based approach, particularly addressing the challenges presented in the high-fidelity implementation of qudit-based circuits due to increased complexity. As an innovative approach towards enhancing qudit circuit fidelity, we explore algebraic relations, such as the Yang-Baxter-like turnover equation, which may enable circuit compression and optimization. The paper introduces the turnover relation for the three-qutrit time propagator and its potential use in reducing circuit depth. We further investigate whether this relation can be generalized for higher-dimensional quantum circuits, including a focused study on the one-dimensional spin-1 Heisenberg model. Our paper outlines both rigorous and numerically efficient approaches to potentially achieve this generalization, providing a foundation for further explorations in the field of qudit-based quantum computing.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Particle Accelerator Spin-Transparent Storage Rings for Beyond State-of-the-Art Science

We will describe spin-transparent storage rings that exhibit spin-coherence times of several hours and store a large number of particles and their use in novel applications. For example, these rings can be used to directly measure the electric dipole moment of the electron, relevant to CP violation and matter-antimatter asymmetry in the universe, and to search for dark energy and ultra-light dark matter*. These rings can also serve as a compelling platform for quantum computing. In this presentation, we will describe how spin-transparent rings can be used in conjunction with ion traps to enhance scalability and increase quantum coherence times of ion quantum computing.

Suleiman, R.↗

Hidden Rotation Symmetry of the Jordan–Wigner Transformation and Its Application to Measurement in Quantum Computation

Using a global rotation by 𝜃 about the z-axis in the spin sector of the Jordan–Wigner transformation rotates Pauli matrices 𝑋̂ and 𝑌̂ in the 𝑥−𝑦 -plane, while it adds a global complex phase to fermionic quantum states that have a fixed number of particles. With the right choice of angles, this relates expectation values of Pauli strings containing products of 𝑋̂ and 𝑌̂ to different products, which can be employed to reduce the number of measurements needed when simulating fermionic systems on a quantum computer. Here, we derive this symmetry and show how it can be applied to systems in Physics and Chemistry that involve Hamiltonians with only single-particle (hopping) and two-particle (interaction) terms. We also discuss the consequences of this for finding efficient measurement circuits in variational ground state preparation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Statistical approach to tunneling time in attosecond experiments

Tunneling, transport of particles through classically forbidden regions, is a pure quantum phenomenon. It governs numerous phenomena ranging from single-molecule electronics to donor–acceptor transition reactions. The main problem is the absence of a universal method to compute tunneling time. This problem has been attacked in various ways in the literature. Here, in the present work, we show that a statistical approach to the problem, motivated by the imaginary nature of time in the forbidden regions, lead to a novel tunneling time formula which is real and subluminal (in contrast to various known time definitions implying superluminal tunneling). In addition to this, we show explicitly that the entropic time formula is in good agreement with the tunneling time measurements in laser-driven He ionization. Moreover, it sets an accurate range for long-range electron transfer reactions. The entropic time formula is general enough to extend to the photon and phonon tunneling phenomena.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High Quantum Efficiency Uni-Traveling-Carrier Photodiode for Optical to Microwave Transduction

Modern Quantum Information Systems (QIS) employ optical photons for long distance communication, operating at ambient temperature, between microwave cavities, which house microwave photons used in quantum computing and microwave detection. These optical photons, carried by fiber-optic or free-space links, offer a low-cost, uncooled alternative to bulky, expensive microwave coaxial cables, which are lossy, susceptible to EMI, and a significant thermal conductor to the outside ambient environment. To convert between these two types of photons and implement these optical interconnects, it is necessary to develop a high-performance photodetector for optical to microwave transduction. Freedom Photonics and the University of Virginia have a well-established partnership in developing high-performance photodiodes. In this Phase I effort, we collaborated in designing, fabricating, and testing an advanced, high-speed, high quantum efficiency prototype photodiode for transduction from optical to microwave frequencies. These devices have applications not only in quantum computing and axion detection, but also in other optical-cryogenic interconnect applications, in fields such as radio astronomy and quantum cryptography, as well as in quantum metrology and plasmonics. During this Phase I DOE program, we designed, fabricated, and tested prototype PIN GaAs photodiodes which targeted the performance parameters defined by the program. This process involved identifying a new target wavelength, different from that proposed initially, based on conversations with the Oak Ridge National Lab customer. We designed an epitaxial stack, optimized in theory for ≥95% quantum efficiency at 795 nm, ≥5 GHz, per the target objectives of the program. Additionally, we designed a fabrication process and associated mask plates for top-illuminated, AR-coated devices with device diameters ranging from 50 µm to 800 µm. Using these, we fabricated two 3” wafer quarters of devices, and characterized the devices’ dark current, quantum efficiency, and bandwidth for various device diameters. The prototype devices achieved a quantum efficiency of 89% at the target 795 nm detection wavelength. The bandwidth of the devices proved tricky to characterize, but a 50 µm diameter device shows a 3-dB bandwidth of at least 1.6 GHz, possibly a full 5 GHz, depending on the measurement setup. In the future, we plan to characterize the bandwidth of these devices using an impulse response measurement. All tasks for the Phase I were successfully completed, and sample prototype devices were provided to Oak Ridge National Lab Quantum Information Science researchers. The work performed in Phase I has established a strong foundation for future design and fabrication cycles in Phase II, if granted. The early tests at Oak Ridge National Labs will provide guidance for the required photodiode performance in devices to be supplied in Phase II.

42 ENGINEERING↗

Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning

Quantum compiling, where a parameterized quantum circuit is trained to learn a target unitary, is an important primitive for quantum computing that can be used as a subroutine to obtain optimal circuits or as a tomographic tool to study the dynamics of an experimental system. While much attention has been paid to quantum compiling on discrete-variable hardware, less has been paid to compiling in the continuous-variable paradigm. Here we motivate several, closely related, short-depth continuous-variable algorithms for quantum compilation. We analyze the trainability of our proposed cost functions and numerically demonstrate our algorithms by learning arbitrary Gaussian operations and Kerr nonlinearities. We further make connections between this framework and quantum learning theory in the continuous-variable setting by deriving no-free-lunch theorems. These generalization bounds demonstrate a linear resource reduction for learning Gaussian unitaries using entangled coherent-Fock states and an exponential resource reduction for learning arbitrary unitaries using two-mode-squeezed states.

97 MATHEMATICS AND COMPUTING↗

S-QGPU: Shared quantum gate processing unit for distributed quantum computing

We propose a distributed quantum computing (DQC) architecture in which individual small-sized quantum computers are connected to a shared quantum gate processing unit (S-QGPU). The S-QGPU comprises a collection of hybrid two-qubit gate modules for remote gate operations. In contrast to conventional DQC systems, where each quantum computer is equipped with dedicated communication qubits, S-QGPU effectively pools the resources (e.g., the communication qubits) together for remote gate operations, and, thus, significantly reduces the cost of not only the local quantum computers but also the overall distributed system. Our preliminary analysis and simulation show that S-QGPU's shared resources for remote gate operations enable efficient resource utilization. When not all computing qubits (also called data qubits) in the system require simultaneous remote gate operations, S-QGPU-based DQC architecture demands fewer communication qubits, further decreasing the overall cost. Alternatively, with the same number of communication qubits, it can support a larger number of simultaneous remote gate operations more efficiently, especially when these operations occur in a burst mode.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices cannot solve large problems due to hardware constraints. In this work, we develop an algorithm that decomposes the QAOA input problem graph into a smaller problem and solves MaxCut using QAOA on the reduced graph. The algorithm requires a subroutine that can be classical or quantum—in this work, we implement the algorithm twice on each graph. One implementation uses the classical solver Gurobi in the subroutine and the other uses QAOA. We solve these reduced problems with QAOA. On average, the reduced problems require only approximately 1/10 of the number of vertices than the original MaxCut instances. Furthermore, the average approximation ratio of the original MaxCut problems is 0.75, while the approximation ratios of the decomposed graphs are on average of 0.96 for both Gurobi and QAOA. With this decomposition, we are able to measure optimal solutions for ten 100-vertex graphs by running single-layer QAOA circuits on the Quantinuum trapped-ion quantum computer H1-1, sampling each circuit only 500 times. This approach is best suited for sparse, particularly k-regular graphs, as k-regular graphs on n vertices can be decomposed into a graph with at most $\frac{nk}{k+1}$ vertices in polynomial time. Further reductions can be obtained with a potential trade-off in computational time. In conclusion, while this paper applies the decomposition method to the MaxCut problem, it can be applied to more general classes of combinatorial optimization problems.

97 MATHEMATICS AND COMPUTING↗

Cheaper and more noise-resilient quantum state preparation using eigenvector continuation

Subspace methods are powerful, noise-resilient methods that can effectively prepare ground states on quantum computers. The challenge is to get a subspace with a small condition number that spans the states of interest using minimal quantum resources. In this work, we will use eigenvector continuation to build a subspace from the low-lying states of a set of Hamiltonians. The basis vectors are prepared using truncated versions of standard state preparation methods such as imaginary-time evolution (ITE), adiabatic state preparation (ASP), and variational quantum eigensolver. By using these truncated methods combined with eigenvector continuation, we can directly improve upon them, obtaining more accurate ground-state energies at a reduced cost. We use several spin systems to demonstrate convergence even when methods like ITE and ASP fail, such as ASP in the presence of level crossings and ITE with vanishing energy gaps. We also showcase the noise resilience of this approach beyond the gains already made by having shallower quantum circuits. Furthermore, our findings suggest that eigenvector continuation can be used to improve existing state preparation methods in the near term.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Extending quantum-mechanical benchmark accuracy to biological ligand-pocket interactions

Predicting the binding affinity of ligands to protein pockets is key in the drug design pipeline. The flexibility of ligand-pocket motifs arises from a range of attractive and repulsive electronic interactions during binding. Accurately accounting for all interactions requires robust quantum-mechanical (QM) benchmarks, which are scarce for ligand-pocket systems. Additionally, disagreement between “gold standard” Coupled Cluster (CC) and Quantum Monte Carlo (QMC) methods casts doubt on many benchmarks for larger non-covalent systems. We introduce the “QUantum Interacting Dimer” (QUID) benchmark framework containing 170 non-covalent (non-)equilibrium systems modeling chemically and structurally diverse ligand-pocket motifs. Symmetry-adapted perturbation theory shows that QUID broadly covers non-covalent binding motifs and energetic contributions. Robust binding energies are obtained using complementary CC and QMC methods, achieving agreement of 0.5 kcal/mol. The benchmark data analysis reveals that several dispersion-inclusive density functional approximations provide accurate energy predictions, though their atomic van der Waals forces differ in magnitude and orientation. Contrarily, semiempirical methods and empirical force fields require improvements in capturing non-covalent interactions (NCIs) for out-of-equilibrium geometries. The wide span of NCIs, highly accurate interaction energies, and analysis of molecular properties take QUID beyond the “gold standard” for QM benchmarks of ligand-protein systems.

Puleva, Mirela [University of Luxembourg, Luxembou↗

Final Report: Nuclear Computational Low Energy Initiative (NUCLEI) SCIDAC Project for Indiana University

This is the final report for Indiana University for the NUCLEI SciDAC-3 project. The NUCLEI project developed implemented and ran codes for large-scale computations of many topics in low-energy nuclear physics. At Indiana University, we performed large-scale semiclassical molecular dynamics simulations and large-scale quantum mechanical mean field calculations of the nonuniform nuclear pasta phases expected in neutron star crust.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Exact closed-form unitary transformations of fermionic operators

Unitary transformations play a fundamental role in many-body physics, and except for special cases, they are not expressible in closed form. We present closed-form expressions for unitary transformations generated by a single fermionic operator for Hermitian and anti-Hermitian generators. We demonstrate the usefulness of these expressions in formal analyses of unitary transformations and numerical applications to Hamiltonian downfolding in quantum computing and Heisenberg dynamics. Furthermore, this work paves the way for new analytical treatments of unitary transformations and numerical many-body methods for fermions.

74 ATOMIC AND MOLECULAR PHYSICS↗

Digital quantum magnetism on a trapped-ion quantum computer

Digital quantum matter—realized when discrete quantum gates approximate continuous time evolution—is susceptible to heating into chaotic, structureless states. If digitization errors are adequately suppressed, a long-lived transient regime of approximately energy-conserving dynamics can be observed on gate-based quantum computers. Conservation of energy, in turn, enables the exploration of a wide variety of complex behaviours observed in equilibrium systems, ranging from the non-trivial microscopic origins of thermalization itself to the stabilization of effective models hosting exotic emergent properties. Here we use Quantinuum’s H2 quantum computer to simulate digitized dynamics of the quantum Ising model, suppressing digitization errors well enough to observe thermalization on timescales that severely challenge classical simulation methods. Relaxation of an inhomogeneous state reveals an emergent hydrodynamics owing to approximate energy conservation and we compute the associated diffusion constant. By reprogramming our simulations to take place on a triangular lattice with periodic boundary conditions, we observe thermalization consistent with emergent gauge and topological constraints resulting from lattice frustration. Furthermore, our results were enabled by continued advances in two-qubit gate quality (native partial entangler fidelities of 99.94(1)%) and establish digital quantum computers as powerful tools for studying (effectively) continuous-time dynamics.

Information theory and computation↗

Lyapunov controlled counterdiabatic quantum optimization

We introduce a quantum algorithm that integrates counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to address combinatorial optimization problems. This approach offers versatility, allowing implementation as either a digital-analog or purely digital algorithm based on selected control strategies. By examining spin-glass Hamiltonians, we illustrate how the algorithm can explore alternative paths to enhance solution outcomes compared to conventional CD techniques. This method reduces dependence on extensive higher-order CD terms and on classical optimization techniques, making it more suitable for existing quantum computing platforms. The combination of digital compression via CD protocols and the adaptable nature of QLC methods positions this approach as a promising candidate for near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum criticality using a superconducting quantum processor

Quantum criticality emerges from the collective behavior of many interacting quantum particles, often at the transition between different phases of matter. It is one of the cornerstones of condensed matter physics, which we access on noisy intermediate-scale (NISQ) quantum devices by leveraging a dynamically driven phenomenon. Here we probe the critical properties of the one-dimensional quantum Ising model on a programmable superconducting quantum chip via a Kibble-Zurek process, obtain scaling laws, and estimate critical exponents despite inherent sources of errors on the hardware. In addition, we investigate how the improvement of NISQ computers (more qubits, less noise) will consolidate the computation of those universal physical properties. A one-parameter noise model captures the effect of imperfections and reproduces the experimental data. Its systematic study reveals that the noise, analogously to temperature, induces a new length scale in the system. We introduce and successfully verify modified scaling laws, directly accounting for the noise without any prior knowledge. It makes data analyses for extracting physical properties transparent to noise. By understanding how imperfect quantum hardware modifies the genuine properties of quantum states of matter, we enhance the power of NISQ processors considerably for addressing quantum criticality and potentially other phenomena and algorithms.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗