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

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.

97 MATHEMATICS AND COMPUTING↗

Asynchronous Ballistic Reversible Fluxon Logic

In a previous study, we described a new abstract circuit model for reversible computation called Asynchronous Ballistic Reversible Computing (ABRC), in which localized information bearing pulses propagate ballistically along signal paths between stateful abstract devices, and elastically scatter off those devices serially, while updating the device state in a logically-reversible and deterministic fashion. The ABRC model has been shown to be capable of universal computation. In the research reported here, we begin exploring how the ABRC model might be realized in practice using single flux quantum (SFQ) solitons (fluxons) in superconducting Josephson junction (JJ) circuits. One natural family of realizations could utilize fluxon polarity to represent binary data in individual pulses propagating near-ballistically along discrete or continuous long Josephson junctions (LJJs) or microstrip passive transmission lines (PTLs), and utilize the flux charge (-1, 0, +1) of a JJ-containing superconducting loop with Φ 0 < I c L < 2Φ 0 to encode a ternary state variable internal to a device. A natural question then arises as to which of the definable abstract ABRC device functionalities using this data representation might be implementable using a JJ circuit that dissipates only a small fraction of the input fluxon energy. We discuss conservation rules and symmetries considered as constraints to be obeyed in these circuits, and begin the process of classifying the possible ABRC devices in this family having up to 3 bidirectional I/O terminals, and up to 3 internal states.

97 MATHEMATICS AND COMPUTING↗

Time-reversal of an unknown quantum state

For decades, researchers have sought to understand how the irreversibility of the surrounding world emerges from the seemingly time-symmetric, fundamental laws of physics. Quantum mechanics conjectured a clue that final irreversibility is set by the measurement procedure and that the time-reversal requires complex conjugation of the wave function, which is overly complex to spontaneously appear in nature. Building on this Landau-Wigner conjecture, it became possible to demonstrate that time-reversal is exponentially improbable in a virgin nature and to design an algorithm artificially reversing a time arrow for a given quantum state on the IBM quantum computer. However, the implemented arrow-of-time reversal embraced only the known states initially disentangled from the thermodynamic reservoir. Here we develop a procedure for reversing the temporal evolution of an arbitrary unknown quantum state. This opens the route for general universal algorithms sending temporal evolution of an arbitrary system backward in time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Numerically exact configuration interaction at quadrillion-determinant scale

The combinatorial growth of configuration interaction (CI) has long limited this formally exact quantum chemistry method to only the smallest molecules. Here, we report a numerically exact CI calculation exceeding one quadrillion (10 15 ) determinants, made possible by a lossless categorical compression strategy within the small-tensor-product distributed active space (STP-DAS) framework. This approach overcomes the traditional memory bottlenecks of CI by a numerically exact compression of the wavefunction representation and reformulating the most computationally demanding matrix–vector operations. Using this method, we performed a fully relativistic CI calculation of the ground state of HBrTe with over 10 15 complex-valued determinants in just 34.5 h on 1000 computing nodes—the largest CI calculation ever reported. We further achieved fast computation for systems with hundreds of billions of determinants on only a few compute nodes. Extensive benchmarks confirm that the method retains full numerical exactness while cutting memory and computational cost by orders of magnitude. Compared to previous state-of-the-art CI calculations, this work achieves a 1000 times increase in CI space, a 10 6 -fold increase in floating-point operations performed, and a 10 6 -fold improvement in computational speed.

Computational chemistry↗

Wormhole calculus, replicas, and entropies

We investigate contributions of spacetime wormholes, describing baby universe emission and absorption, to calculations of entropies and correlation functions, for example those based on the replica method. We find that the rules of the “wormhole calculus”, developed in the 1980s, together with standard quantum mechanical prescriptions for computing entropies and correlators, imply definite rules for limited patterns of connection between replica factors in simple calculations. These results stand in contrast with assumptions that all topologies connecting replicas should be summed over, and call into question the explanation for the latter. In a “free” approximation baby universes introduce probability distributions for coupling constants, and we review and extend arguments that successive experiments in a “parent” universe increasingly precisely fix such couplings, resulting in ultimately pure evolution. Once this has happened, the nontrivial question remains of how topology-changing effects can modify the standard description of black hole information loss.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

De Sitter space is sometimes not empty

Multiple lines of evidence suggest that the Hilbert space of an isolated de Sitter universe is one dimensional but can appear larger when probed by a gravitating observer. To test this idea, we compute the von Neumann entropy of a field theory in a two-dimensional de Sitter universe which is entangled in a thermal-like state with the same field theory on a disjoint, asymptotically anti-de Sitter (AdS) black hole. Previously, it was shown that the replica trick for computing the entropy of such entangled gravitating systems requires the inclusion of a non-perturbative effect in quantum gravity — novel wormholes connecting the two spaces. Here we show that: (a) the expected wormholes connecting de Sitter and AdS universes exist, avoiding a no-go theorem via the presence of sources on the AdS boundary; (b) the entanglement entropy vanishes if the nominal entropy of the de Sitter cosmological horizon (S ds = $A^{dS}_{horizon}$/4G N ) is less than the entropy of the AdS black hole horizon (S BH = $A^{AdS}_{horizon}$/4G N ), i.e., S dS < S BH ; (c) the entanglement entropy is finite when S dS > S BH . Thus, the de Sitter Hilbert space is effectively nontrivial only when S dS > S BH . The AdS black hole we introduce can be regarded as an “observer” for de Sitter space. In this sense, our result is a non-perturbative generalization of the recent perturbative argument that the algebra of observables on the de Sitter static patch becomes nontrivial in the presence of an observer.

2D gravity↗

Characterizing Defect Dynamics in Silicon Carbide Using Symmetry-Adapted Collective Variables and Machine Learning Interatomic Potentials

Silicon carbide (SiC) divacancies are attractive candidates for spin-defect qubits possessing long coherence times and optical addressability. The high activation barriers associated with SiC defect formation and motion pose challenges for their study by first-principles molecular dynamics. In this work, we develop and deploy machine learning interatomic potentials (MLIPs) to accelerate defect dynamics simulations while retaining ab initio accuracy. We employ an active learning strategy comprising symmetry-adapted collective variable discovery and enhanced sampling to compile configurationally diverse training data, calculation of energies and forces using density functional theory (DFT), and training of an E(3)-equivariant MLIP based on the Allegro model. Here, the trained MLIP reproduces DFT-level accuracy in defect transition activation free energy barriers, enables the efficient and stable simulation of multidefect 216-atom supercells, and permits an analysis of the temperature dependence of defect thermodynamic stability and formation/annihilation kinetics to propose an optimal annealing temperature to maximally stabilize VV divacancies.

Computer simulations↗

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↗

Quantum Mechanical Study of Atoms and Molecules

This paper, following a brief introduction, is divided into five parts. Part I outlines the theory of the molecular orbital method for the ground, ionized and excited states of molecules. Part II gives a brief summary of the interaction integrals and their tabulation. Part III outlines an automatic program designed for the computation of various states of molecules. Part IV gives examples of the study of ground, ionized and excited states of CO, BH and N2 where the program of automatic computation and molecular integrals have been utilized. Part V enlists some special problems of Molecular Quantum Mechanics are being tackled at New York University.

QUANTUM MECHANICS↗

Pigs in cyberspace

Exploration and colonization of the universe awaits, but Earth-adapted biological humans are ill-equipped to respond to the challenge. Machines have gone farther and seen more, limited though they presently are by insect-like behavior inflexibility. As they become smarter over the coming decades, space will be theirs. Organizations of robots of ever increasing intelligence and sensory and motor ability will expand and transform what they occupy, working with matter, space and time. As they grow, a smaller and smaller fraction of their territory will be undeveloped frontier. Competitive success will depend more and more on using already available matter and space in ever more refined and useful forms. The process, analogous to the miniaturization that makes today's computers a trillion times more powerful than the mechanical calculators of the past, will gradually transform all activity from grossly physical homesteading of raw nature, to minimum-energy quantum transactions of computation. The final frontier will be urbanized, ultimately into an arena where every bit of activity is a meaningful computation: the inhabited portion of the universe will be transformed into a cyberspace. Because it will use resources more efficiently, a mature cyberspace of the distant future will be effectively much bigger than the present physical universe. While only an infinitesimal fraction of existing matter and space is doing interesting work, in a well developed cyberspace every bit will be part of a relevant computation or storing a useful datum. Over time, more compact and faster ways of using space and matter will be invented, and used to restructure the cyberspace, effectively increasing the amount of computational spacetime per unit of physical spacetime. Computational speed-ups will affect the subjective experience of entities in the cyberspace in a paradoxical way. At first glimpse, there is no subjective effect, because everything, inside and outside the individual, speeds up equally. But, more subtly, speed-up produces an expansion of the cyber universe, because, as thought accelerates, more subjective time passes during the fixed (probably lightspeed) physical transit time of a message between a given pair of locations - so those fixed locations seem to grow farther apart. Also, as information storage is made continually more efficient through both denser utilization of matter and more efficient encodings, there will be increasingly more cyber-stuff between any two points. The effect may somewhat resemble the continuous-creation process in the old steady-state theory of the physical universe of Hoyle, Bondi and Gold, where hydrogen atoms appear just fast enough throughout the expanding cosmos to maintain a constant density.

Moravec, Hans↗

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↗

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↗